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

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

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

Details

Authors
  • Carl Fredrik Leanderson
  • Ove Edfors
  • Torleiv Maseng
  • Tony Ottosson
Organisations
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Electrical Engineering, Electronic Engineering, Information Engineering
Original languageEnglish
Title of host publicationProc. IEEE Vehicular Technology Conference
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Pages1560-1564
Number of pages5
Volume3
ISBN (Print)0-7803-5435-4
Publication statusPublished - 1999
Publication categoryResearch
Peer-reviewedYes
EventIEEE VTS 50th Vehicular Technology Conference, VTC 1999 - Fall. - Amsterdam, The Netherlands, Amsterdam, Netherlands
Duration: 1999 Sep 191999 Sep 22

Publication series

Name
Volume3

Conference

ConferenceIEEE VTS 50th Vehicular Technology Conference, VTC 1999 - Fall.
CountryNetherlands
CityAmsterdam
Period1999/09/191999/09/22

Total downloads

No data available