Complexity reduction of turbo decoding

Akira Shibutani, Hirohito Suda, Fumiyuki Adachi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

This paper addresses two complexity reduction techniques for turbo decoding. The first is turbo-CRC encoding where CRC is incorporated into the turbo decoding iteration processes to reduce the average number of iterations needed. Simulations show that the W-CDMA reverse link suffers no performance degradation even if the average number of iterations is reduced by more than 75% at BER=10-6 under frequency selective Rayleigh fading. The second is a new low-complexity turbo internal interleaver called the prime interleaver. Turbo coding with the proposed interleaver can generate codewords having good Hamming weight for a wide range of interleaving lengths (257-8192 bits).

Original languageEnglish
Title of host publicationIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall
Pages1570-1574
Number of pages5
Edition3
DOIs
Publication statusPublished - 1999 Dec 1
Externally publishedYes
EventIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall - Amsterdam, Netherlands
Duration: 1999 Sep 191999 Sep 22

Publication series

NameIEEE Vehicular Technology Conference
Number3
Volume50
ISSN (Print)1550-2252

Other

OtherIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall
Country/TerritoryNetherlands
CityAmsterdam
Period99/9/1999/9/22

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Complexity reduction of turbo decoding'. Together they form a unique fingerprint.

Cite this