• DocumentCode
    3455945
  • Title

    A flexible state-metric recursion unit for a multi-standard BCJR decoder

  • Author

    Rovini, Massimo ; Gentile, Giuseppe ; Fanucci, Luca

  • Author_Institution
    Dept. of Inf. Eng., Univ. of Pisa, Pisa, Italy
  • fYear
    2009
  • fDate
    6-8 Nov. 2009
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    This paper describes the architecture of a flexible and reconfigurable processor for the computation of the state-metric recursion in a multi-standard BCJR decoder. The unit can serve binary as well as duo-binary codes with any number of states. The architecture is arranged into a cluster of state-metric processors plus two multiplexing networks for feedback and normalization, configured on-the-fly for the code in use. An optimized solution is presented allowing the support of every code among 8-state duo-binary, 8-state binary and 2-state binary codes, i.e., of every Turbo and LDPC code defined by the modern communication standards. The logical synthesis on different CMOS technologies shows that the architecture attains a maximum clock frequency of 450 MHz. Finally, the complexity overhead of such a flexible design is only about 18% w.r.t. optimized single-standard solutions.
  • Keywords
    CMOS integrated circuits; error correction codes; microprocessor chips; optimisation; CMOS technologies; LDPC code; duo binary codes; flexible processor; flexible state metric recursion unit; logical synthesis; maximum clock frequency; multistandard BCJR decoder; optimized solution; reconfigurable processor; state metric processors; Binary codes; CMOS technology; Clocks; Communication standards; Computer architecture; Decoding; Frequency synthesizers; Network synthesis; Parity check codes; State feedback; BCJR; Flexibility; LDPC codes; Multi-Standard; Turbo codes; VLSI Architecture;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Circuits and Systems (SCS), 2009 3rd International Conference on
  • Conference_Location
    Medenine
  • Print_ISBN
    978-1-4244-4397-0
  • Electronic_ISBN
    978-1-4244-4398-7
  • Type

    conf

  • DOI
    10.1109/ICSCS.2009.5412319
  • Filename
    5412319