• DocumentCode
    2670981
  • Title

    A high-speed MAP architecture with optimized memory size and power consumption

  • Author

    Worm, Alexander ; Lamm, Holger ; Wehn, Norbert

  • Author_Institution
    Inst. of Microelectron. Syst., Kaiserslautern Univ., Germany
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    265
  • Lastpage
    274
  • Abstract
    This paper presents a novel high-speed maximum a posteriori (MAP) decoder architecture with optimized memory size and power consumption. Area and power consumption are both reduced significantly, compared to the state-of-the-art. The architecture is also capable of decoding recursive systematic convolutional codes which are the constituent codes of the revolutionary turbo-codes and related concatenation schemes. The architecture is highly scalable with respect to throughput, expanding its applicability over a wide range of throughput requirements (300 Mbit/s-45 Gbit/s and above)
  • Keywords
    concatenated codes; convolutional codes; maximum likelihood decoding; optimisation; pipeline processing; turbo codes; 300 Mbit/s; 300 Mbit/s to 45 Gbit/s; VHDL model; area reduction; concatenation schemes; data-dependency graph structure; decoding; high-speed MAP architecture; maximum a posteriori decoder architecture; optimized memory size; optimized power consumption; pipeline architecture; recursive systematic convolutional codes; scalable architecture; throughput; turbo codes; Bit error rate; Convolution; Convolutional codes; Costs; Energy consumption; Maximum likelihood decoding; Memory architecture; Signal processing algorithms; Throughput; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Systems, 2000. SiPS 2000. 2000 IEEE Workshop on
  • Conference_Location
    Lafayette, LA
  • ISSN
    1520-6130
  • Print_ISBN
    0-7803-6488-0
  • Type

    conf

  • DOI
    10.1109/SIPS.2000.886725
  • Filename
    886725