Serial concatenated convolutional codes: Difference between revisions

Revision as of 14:13, 25 June 2014

Latest revision as of 02:17, 13 June 2024

(14 intermediate revisions by 13 users not shown)

Line 1:

'''Serial concatenated convolutional codes''' ('''SCCC)''') are a class of [[forward error correction]] (FEC) codes highly suitable for [[Turbo code|turbo]] (iterative) decoding.<ref name="Minoli2008">{{cite book|last=Minoli|first=Daniel|title=Satellite Systems Engineering in an IPv6 Environment |chapter=5 Error Correction Techniques §5.1.4 Turbo Codes |chapter-url=httphttps://books.google.com/books?id=4yJi1UQDPp8C&pg=PA152|accessdate=4 June 2014|date=2008-12-18 |publisher=CRC Press|isbn=9781420078695|pages=152–}}</ref><ref name="RyanLin2009">{{cite book|last1=Ryan|first1=William|last2=Lin|first2=Shu|title=Channel Codes: Classical and Modern |chapter=7.3 Serial-Concatenated Convolutional Codes |chapter-url=httphttps://books.google.com/books?id=0gwqxBU_t-QC&pg=PA320|accessdate=4 June 2014|date=2009-09-17 |publisher=Cambridge University Press|isbn=9781139483018|pages=320–}}</ref> Data to be transmitted over a noisy channel may first be encoded using an SCCC. Upon reception, the coding may be useused to remove any errors introduced during transmission. The decoding is performed by repeated decoding and [de]interleaving of the received symbols.

SCCCs typically include an [[inner code]], an [[outer code]], and a linking interleaver. A distinguishing feature of SCCCs is the use of a recursive [[convolutional code]] as the inner code. The recursive inner code provides the 'interleaver gain' for the SCCC, which is the source of the excellent performance of these codes.

Line 9:

Serial concatenated convolutional codes have not found widespread commercial use, although they were proposed for communications standards such as [[DVB-S2]]. Nonetheless, the analysis of SCCCs has provided insight into the performance and bounds of all types of iterative decodable codes including [[turbo codes]] and [[LDPC]] codes.{{Citation needed|date = June 2014}}

US patent 6,023,783 covers some forms of SCCCs. ThisThe patent will expireexpired on May 15, 2016.<ref>{{cite webpatent |url=https://www.google.com/patents/US6023783 |titlecountry=PatentUS US6023783|number=6023783 -|invent1=Dariush Divsalar |invent2=Fabrizio Pollara |status=Expired |title=Hybrid concatenated codes and iterative decoding - Google Patents |publisher=Google.com |date= |accessdategdate=20142000-0602-0408}}</ref>

== History ==

Serial concatenated convolutional codes were first analyzed with a view 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>{{Cite web |url=http://www.systems.caltech.edu/EE/Courses/EE127/EE127C/handout/serial.pdf |id=TDA Progress Report 42-126 |date=August 15, 1996
|title=Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding |first1=S. |last1=Benedetto |first2=D. |last2=Divsalar |first3=G. |last3=Montorsi |first4=F. |last4=Pollara |access-date=2014-04-02 |archive-date=2017-08-13 |archive-url=https://web.archive.org/web/20170813054421/http://www.systems.caltech.edu/EE/Courses/EE127/EE127C/handout/serial.pdf |url-status=dead }}</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 use of a recursive convolutional inner encoder always yields an interleaver gain."{{Clarify|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>{{cite web|url=http://www.mif.vu.lt/~skersys/vsd/turbo/Allerton98.pdf |title=Allerton98Coding Theorems for "Turbo-Like" Codes
|first1=Dariush |last1=Divsalar |first2=Hui |last2=Jin |first3=Robert J.tex |formatlast3=PDFMcEliece |publisher=Jet Propulsion Laboratory, California Institute of Technology |date=1998 |accessdate=2014-06-04}}</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.

SCCC codes were further analyzed in "Serial Turbo Trellis Coded Modulation with Rate-1 Inner Code".<ref>{{cite conference |url=http://trs-new.jpl.nasa.gov/dspace/bitstream/2014/18647/1/99-2030.pdf |title=Serial Turbo Trellis Coded Modulation with Rate-1 Inner Code |first1=D. |last1=Divsalar |first2=S. |last2=Dolinar |first3=E |last3=Pollara |book-title=Globecom '00 - IEEE. Global Telecommunications Conference |date=2000 |doi=10.1109/GLOCOM.2000.891245 |isbn=0-7803-6451-1 |archive-url=https://web.archive.org/web/20100529020555/http://trs-new.jpl.nasa.gov/dspace/bitstream/2014/18647/1/99-2030.pdf |archive-date=2010-05-29 }}</ref> In this paper SCCCs were designed for use with higher order modulation schemes. Excellent performing codes with inner and outer constituent convolutional codes of only two or four states were presented.

== Example Encoder ==

Line 25 ⟶ 27:

[[File:SCCC Encoder.png|thumb|none|500px|Fig. 1. SCCC Encoder]]

The example encoder is composed of a 16-state outer convolutional code and a 2-state inner convolutional code linked by an interleaver. The natural code rate of the configuration shown is 1/4, however, the inner and/or outer codes may be punctured to achieve higher codescode rates as needed. For example, an overall code rate of 1/2 may be achieved by puncturing the outer convolutional code to rate 3/4 and the inner convolutional code to rate 2/3.

A recursive inner convolutional code is preferable for turbo decoding of the SCCC. The inner code may be punctured to a rate as high as 1/1 with reasonable performance.

Line 31 ⟶ 33:

== Example Decoder ==

An example of an interativeiterative SCCC decoder.

[[File:SCCC Decoder.png|thumb|none|500px|Fig. 2. SCCC Decoder]]

Line 57 ⟶ 59:

== External links ==

*{{cite journal |first=Dave |last=Forney |date=2009 |journal=Scholarpedia |volume=4 |issue=2 |page=8374 |title=Concatenated codes|doi=10.4249/scholarpedia.8374 |bibcode=2009SchpJ...4.8374F |doi-access=free }}

*[http://www.scholarpedia.org/article/Concatenated_codes "Concatenated codes", Scholarpedia]

*[{{cite web |url=http://www.mif.vu.lt/~skersys/vsd/turbo/ryan_chapter.pdf "|title=Concatenated Convolutional Codes and Iterative Decoding", |first=Willian E. |last=Ryan] |publisher=Department of Electrical & Computer Engineering, University of Arizona |date=2001}}

[[Category:Data]]