On reducing the average complexity of Turbo decoding with application to W-CDMA

Zheng Ma*, Wai Ho Mow, Pingzhi Fan

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

Abstract

A simple but effective method for reducing the average complexity (and power consumption) of turbo decoding with negligible performance degradation in a W-CDMA environment is introduced. It modifies the conventional turbo-CRC decoding scheme by performing two CRC tests per iteration to detect at the earliest a correctly converged decoding process. When applied to a W-CDMA turbo code with frame length 640 bits at a BER of 10-6, it can save about 50% of the average decoding complexity, relative to the conventional scheme. Further complexity reduction can be achieved by integrating the CRC test as an intermediate step in the component SlSO decoder. In general, the proposed scheme is more attractive for short-frame and low-BER applications.

Original languageEnglish
Title of host publicationPIMRC2003 - 14th IEEE 2003 International Symposium on Personal, Indoor and Mobile Radio Communications, Proceedings
Pages297-300
Number of pages4
DOIs
Publication statusPublished - 2003
Event14th IEEE 2003 International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC2003 - Beijing, China
Duration: 7 Sept 200310 Sept 2003

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
Volume1

Conference

Conference14th IEEE 2003 International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC2003
Country/TerritoryChina
CityBeijing
Period7/09/0310/09/03

Keywords

  • CRC
  • Iteration
  • Stopping criteria
  • Turbo decoding
  • W-CDMA

Fingerprint

Dive into the research topics of 'On reducing the average complexity of Turbo decoding with application to W-CDMA'. Together they form a unique fingerprint.

Cite this