An area-efficient parallel turbo decoder based on contention free algorithm

Kai Hsin Tseng*, Hsiang Tsung Chuang, Shao Yen Tseng, Wai-Chi  Fang

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Abstract

    In this paper, a contention free algorithm for solving memory collision problem of parallel Turbo decoder architecture using the simulated annealing algorithm is presented. Furthermore, we proposed two area-efficient extrinsic memory schemes based on the parallel contention free Turbo decoder. One of the proposed schemes employs only multiple single port memories with one temporary buffer instead of the original dual port or two port memories and the other scheme further employs an additional non-linear extrinsic mapping architecture. The proposed schemes lead to approximately 37% and 46% memory area reduction, respectively, for 16-parallel Turbo decoder in comparison to the conventional dual port memory scheme under the UMC 0.13-μim CMOS process.

    Original languageEnglish
    Title of host publication2009 International Symposium on VLSI Design, Automation and Test, VLSI-DAT '09
    Pages203-206
    Number of pages4
    DOIs
    StatePublished - 2009
    Event2009 International Symposium on VLSI Design, Automation and Test, VLSI-DAT '09 - Hsinchu, Taiwan
    Duration: 28 Apr 200930 Apr 2009

    Publication series

    Name2009 International Symposium on VLSI Design, Automation and Test, VLSI-DAT '09

    Conference

    Conference2009 International Symposium on VLSI Design, Automation and Test, VLSI-DAT '09
    Country/TerritoryTaiwan
    CityHsinchu
    Period28/04/0930/04/09

    Fingerprint

    Dive into the research topics of 'An area-efficient parallel turbo decoder based on contention free algorithm'. Together they form a unique fingerprint.

    Cite this