Meny

Du är här

Asymptotic analysis of superorthogonal turbo codes

Publiceringsår: 2003
Språk: Engelska
Sidor: 253-258
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 49
Nummer: 1
Dokumenttyp: Artikel
Förlag: IEEE

Sammanfattning

In this correspondence, we examine a low-rate turbo coding. scheme based on superorthogonal convolutional encoders (SOCEs). The low-rate coding is suitable for code-division multiple-access (CDMA) applications. We use the property that the component encoders are equivalent to conventional convolutional encoders to analyze the asymptotic performance. We analyze the iterative decoding performance that can be achieved when both the code length and the number of iterations tend to infinity and present a bound on the iterative limit of the code construction. It is shown by asymptotic analysis, that the rate 1 / 7, 1 / 15, and I / 3 1 codes with component encoders of memory 3, 4, and 5 have iterative limits below -0.65, -0.88, and -0.95 dB, respectively. Simulations for codes with large permutors (interleavers) confirm these asymptotic results. The construction is general and can be done for codes of lower rates as well.

Disputation

Nyckelord

  • Technology and Engineering
  • superorthogonal turbo codes
  • superorthogonal convolutional codes
  • codes
  • low-rate turbo
  • iterative decoding
  • low-density convolutional codes

Övriga

Published
Yes
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen