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

Summary, in English

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: Carl Fredrik Leanderson; Ove Edfors; Torleiv Maseng; Tony Ottosson
• Department/s: Department of Electrical and Information Technology
• Publishing year: 1999
• Language: English
• Pages: 1560-1564
• Publication/Series: Proc. IEEE Vehicular Technology Conference
• Volume: 3
• Full text: - 3 MB; Download statistics
• Links: http://dx.doi.org/10.1109/VETECF.1999.801556
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: IEEE VTS 50th Vehicular Technology Conference, VTC 1999 - Fall.
• Conference date: 1999-09-19 - 1999-09-22
• Conference place: Amsterdam, Netherlands
• Status: Published
• Research group: Radio Systems
• ISBN/ISSN/Other: ISBN: 0-7803-5435-4