Generalized crossover product accumulate codes
Jiandong Li
Abstract
Jiandong Li
Abstract
To design channel codes with linear encoding/decoding complexity and performance approaching the Shannon limit,a kind of serial concatenated codes,termed generalized crossover product accumulate(GCPA) codes,is proposed.The outer code of GCPA codes is constructed by introducing a crossover structure into parallel-concatenated single parity-check codes and an accumulator is used as the inner code.Extrinsic information transfer(EXIT) charts are used to design GCPA codes and a design example of GCPA codes is given.Simulations show that the example has linear encoding/decoding complexity and a convergence threshold about 0.32 dB from the Shannon limit.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To design channel codes with linear encoding/decoding complexity and performance approaching the Shannon limit,a kind of serial concatenated codes,termed generalized crossover product accumulate(GCPA) codes,is proposed.The outer code of GCPA codes is constructed by introducing a crossover structure into parallel-concatenated single parity-check codes and an accumulator is used as the inner code.Extrinsic information transfer(EXIT) charts are used to design GCPA codes and a design example of GCPA codes is given.Simulations show that the example has linear encoding/decoding complexity and a convergence threshold about 0.32 dB from the Shannon limit.
Key concepts: Concatenated error correction code, Linear code, Serial concatenated convolutional codes, Crossover, Turbo code, Noisy-channel coding theorem, Decoding methods, Block code