On the performance of turbo codes and convolutional codes of low rate
(1999) IEEE VTS 50th Vehicular Technology Conference, VTC 1999 - Fall. 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:
https://lup.lub.lu.se/record/1036028
- author
- Leanderson, Carl Fredrik LU ; Edfors, Ove LU ; Maseng, Torleiv LU and Ottosson, Tony
- organization
- publishing date
- 1999
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- 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.
- conference location
- Amsterdam, Netherlands
- conference dates
- 1999-09-19 - 1999-09-22
- 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
- 2016-04-04 10:20:40
- date last changed
- 2024-01-12 19:53:20
@inproceedings{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}}, booktitle = {{Proc. IEEE Vehicular Technology Conference}}, isbn = {{0-7803-5435-4}}, language = {{eng}}, pages = {{1560--1564}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{On the performance of turbo codes and convolutional codes of low rate}}, url = {{https://lup.lub.lu.se/search/files/5516763/5385619.pdf}}, doi = {{10.1109/VETECF.1999.801556}}, volume = {{3}}, year = {{1999}}, }