Error correcting codes are used in a multitude of applications, including wireless communications (e.g. cell phones), computer hard disks, deep-space and satellite communications. Discovered in 2009, polar codes are a major breakthrough in coding theory, the only family of codes known to have an explicit construction and efficient encoding and decoding algorithms, while also being “capacity achieving” over binary input symmetric memoryless channels.
A limitation of polar codes to date is that their performance at short to moderate block lengths is disappointing. There are two possible culprits: the codes themselves are inherently weak at these lengths, or the successive cancellation decoder employed to decode them is significantly degraded with respect to maximum likelihood decoding performance. These two possibilities are complementary, and so both may occur.
Engineers from UC San Diego have developed “PolarList”, a new implementation of polar codes with greatly improved error-correcting performance. The software (C++ implementation) incorporates a new decoding method for polar codes as well as a modification of the codes themselves. The resulting performance is better than the current state-of-the-art in error-correction coding.
This software greatly improves the error-correcting performance of polar codes, with only a moderate increase in complexity. This is achieved by virtue of a new decoding method for polar codes as well as a modification of the codes themselves. The resulting performance is often better than the current state-of-the-art in error-correction coding.
Country | Type | Number | Dated | Case |
United States Of America | Issued Patent | 9,503,126 | 11/22/2016 | 2012-415 |
United States Of America | Issued Patent | 9,176,927 | 11/03/2015 | 2011-127 |
Polar codes, successive cancellation decoding, hardware implementation, C++ implementation