Serial concatenated convolutional codes: Difference between revisions

Revision as of 01:59, 4 June 2014

Revision as of 02:19, 4 June 2014

Line 15:

== History ==

Serial concatenated convolutional codes were first analyzed view a view{{Huh|date=June 2014}} toward turbo decoding in "Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding" by S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara.<ref>http://www.systems.caltech.edu/EE/Courses/EE127/EE127C/handout/serial.pdf</ref> This analysis yielded a set of observations for designing high performance, turbo decodable serial concatenated codes that resembled [[turbo codes]]. One of these observations was that the "the use of a recursive convolutional inner encoder always yields an interleaver gain."{{What?|date=June 2014}} This is in contrast to the use of block codes or non-recursive convolutional codes, which do not provide comparable interleaver gain.

Additional analysis of SCCCs was done in "Coding Theorems for 'Turbo-Like' Codes" by D. Divsalar, Hui Jin, and Robert J. McEliece.<ref>http://www.mif.vu.lt/~skersys/vsd/turbo/Allerton98.pdf</ref> This paper analyzed repeat-accumulate (RA) codes which are the serial concatenation of an inner two-state recursive convolutional code (also called an 'accumulator' or parity-check code) with a simple repeat code as the outer code, with both codes linked by an interleaver. The performance of the RA codes is quite good considering the simplicity of the constituent codes themselves.