Abstract:
The present disclosure relates generally to the field of data encoding and decoding, and particularly to automorphism-based polar encoding and decoding apparatuses and methods, as well as computer program products embodying the method steps in the form of computer codes. More specifically, it is proposed to design polar codes such that their frozen bits support automorphisms described by a binary upper triangular matrix having a diagonal including at least one of zeros and units. Codewords generated using these polar codes may be subsequently subjected to automorphism-based polar decoding in an efficient manner and with a lower decoding latency compared to the conventional Successive Cancellation List decoding algorithms. Furthermore, the efficiency of the automorphism-based polar decoding may be increased even more if the automorphisms are based on matrix elements arranged above the diagonal in a vicinity of a bottom right corner of the binary upper triangular matrix.
Abstract:
A channel encoding method and a channel encoder are disclosed. In an example, a method of data encoding includes dividing payload data to be transmitted into a set of information vectors and multiplying each of information vectors by a kxn binary precoding matrix to obtain a corresponding input vector. The information vector includes k bits, and n is a power of 2. Additionally, n is greater than k and the kxn binary precoding matrix is configured to minimize successive cancellation decoding error probability under a constraint on a minimum distance d. The method also includes multiplying each input vector including n bits by an nxn polarization transformation matrix to obtain a corresponding codeword that has a Hamming weight of 0 or at least d. The method minimizes both successive cancellation (SC) and maximum-likelihood (ML) decoding error probabilities.
Abstract:
A method comprises generating a PON frame comprising a plurality of FEC codewords, the FEC codewords comprise a first codeword, and the first codeword comprises a PSB; and transmitting the PON frame. A method comprises receiving a PON frame comprising a plurality of FEC codewords, the FEC codewords comprise a first codeword, and the first codeword comprises a PSB; and processing the PON frame.
Abstract:
The present invention provides a code generator (400) for generating a {N', K'} code (102) for encoding and/or decoding data transmitted in a communication channel (101) from a {N, K} code (103), wherein N and N' are code lengths, K and K' are code dimensions. The code generator (400) is configured to shorten the {N, K} code (103) to obtain an intermediate code (401), and to extend the intermediate code (401) to obtain the {N', K'} code (102). The present invention provides also a corresponding code construction method (600). Further, the present invention provides a device (100) for encoding and/or decoding data transmitted in a communication channel (101), the device (100) being configured to encode and/or decode the data based on an {N', K'} code (102) generated from the {N, K} code (103).
Abstract:
This invention presents a method and apparatus for vertical layered finite alphabet iterative decoding of low-density parity-check codes (LDPC) which operate on parity check matrices that consist of blocks of sub-matrices. The iterative decoding involves passing messages between variable nodes and check nodes of the Tanner graph that associated with one or more sub-matrices constitute decoding blocks, and the messages belong to a finite alphabet. Various embodiments for the method and apparatus of the invention are presented that can achieve very high throughputs with low hardware resource usage and power.
Abstract:
Provided is an encoder, a decoder, a computer-readable medium and methods of forward error correction channel encoding/decoding within a HARQ scheme, based on a generalized quasi-cyclic low-density parity-check code comprising a Cordaro-Wagner component code.
Abstract:
Aspects of the present disclosure relate to low density parity check (LDPC) coding utilizing LDPC base graphs. Two or more LDPC base graphs may be maintained that are associated with different ranges of overlapping information block lengths. A particular LDPC base graph may be selected for an information block based on the information block length of the information block. Additional metrics that may be considered when selecting the LDPC base graph may include the code rate utilized to encode the information block and/or the lift size applied to each LDPC base graph to produce the information block length of the information block.
Abstract:
One or more codewords are generated by encoding input bits at input bit positions onto sub-channels that are provided by a code. Each of the sub-channels has an associated reliability of correct decoding of an input bit at an input bit position. Each codeword is transmitted to a decoder, and a word based on each transmitted codeword is received at the decoder. Each received word is decoded, and the reliabilities of the sub-channels are determined based on decoded bits and known input bits from which each codeword was generated. An indication that is based on the determined reliabilities of the sub-channels, such as an indication of the determined reliabilities, is transmitted to the encoder, and may be used by the encoder in selecting the sub-channels for encoding subsequent input bits, for example.
Abstract:
Encoding/decoding method comprising the derivation of the elements of base matrices for Quasi-Cyclic LDPC, codes using different lifting sizes to obtain variable code lengths. The cyclic shift values of smaller lifting sizes Z are derived from stored elements a base matrix corresponding to a maximal lifting sizes Zmax by applying right shifting (ceil(log2Z/Zmax) times) to a binary vector representation of all non- negative stored elements of the base matrix corresponding to Zmax. The right shifting operation may be applied only when the stored cyclic shift value corresponding to Zmax is larger than the smaller lifting size Z. Application to an encoder/decoder within a wireless communications network, a magnetic storage system or a solid-state drive system.
Abstract:
Provided is an encoder, a decoder and corresponding methods of forward error correction channel encoding based on a generalized low-density parity-check convolutional code.