Advanced

On the performance of turbo codes and convolutional codes of low rate

Leanderson, Carl Fredrik LU ; Edfors, Ove LU ; Maseng, Torleiv LU and Ottosson, Tony (1999) IEEE VTS 50th Vehicular Technology Conference, VTC 1999 - Fall. In Proc. IEEE Vehicular Technology Conference 3. p.1560-1564
Abstract
Recently two new classes of low-rate codes have been presented. The first class is the super-orthogonal turbo codes (SOTCs) and the second is the maximum free distance (MFD) convolutional codes. In this paper we present an evaluation of the performance vs. arithmetic decoding complexity for these codes and compare them with the previously reported super-orthogonal convolutional codes (SOCCs). For all classes of codes, the arithmetic decoding complexity is estimated, and the error performance on the additive white Gaussian noise channel is simulated. The SOCCs offer performance comparable to that of the MFD codes. However, the existence of good SOCCs is restricted to a small number of rates while the MFD codes give high performance for a... (More)
Recently two new classes of low-rate codes have been presented. The first class is the super-orthogonal turbo codes (SOTCs) and the second is the maximum free distance (MFD) convolutional codes. In this paper we present an evaluation of the performance vs. arithmetic decoding complexity for these codes and compare them with the previously reported super-orthogonal convolutional codes (SOCCs). For all classes of codes, the arithmetic decoding complexity is estimated, and the error performance on the additive white Gaussian noise channel is simulated. The SOCCs offer performance comparable to that of the MFD codes. However, the existence of good SOCCs is restricted to a small number of rates while the MFD codes give high performance for a multitude of rates. For the parameters used in this investigation the SOTCs yield higher performance at lower arithmetic decoding complexity than the MFD codes (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Proc. IEEE Vehicular Technology Conference
volume
3
pages
5 pages
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE VTS 50th Vehicular Technology Conference, VTC 1999 - Fall.
external identifiers
  • Scopus:11244336260
ISBN
0-7803-5435-4
DOI
10.1109/VETECF.1999.801556
language
English
LU publication?
yes
id
11dacd26-a2a9-435d-86d3-589d8d84219f (old id 1036028)
date added to LUP
2008-02-27 10:46:14
date last changed
2016-10-13 04:39:29
@misc{11dacd26-a2a9-435d-86d3-589d8d84219f,
  abstract     = {Recently two new classes of low-rate codes have been presented. The first class is the super-orthogonal turbo codes (SOTCs) and the second is the maximum free distance (MFD) convolutional codes. In this paper we present an evaluation of the performance vs. arithmetic decoding complexity for these codes and compare them with the previously reported super-orthogonal convolutional codes (SOCCs). For all classes of codes, the arithmetic decoding complexity is estimated, and the error performance on the additive white Gaussian noise channel is simulated. The SOCCs offer performance comparable to that of the MFD codes. However, the existence of good SOCCs is restricted to a small number of rates while the MFD codes give high performance for a multitude of rates. For the parameters used in this investigation the SOTCs yield higher performance at lower arithmetic decoding complexity than the MFD codes},
  author       = {Leanderson, Carl Fredrik and Edfors, Ove and Maseng, Torleiv and Ottosson, Tony},
  isbn         = {0-7803-5435-4},
  language     = {eng},
  pages        = {1560--1564},
  publisher    = {ARRAY(0x94ae460)},
  series       = {Proc. IEEE Vehicular Technology Conference},
  title        = {On the performance of turbo codes and convolutional codes of low rate},
  url          = {http://dx.doi.org/10.1109/VETECF.1999.801556},
  volume       = {3},
  year         = {1999},
}