• DocumentCode
    623071
  • Title

    LTE-Advanced channel coding generic procedures A high-level model to guide low-level implementations

  • Author

    de Figueiredo, Felipe A. P. ; Lenzi, Karlo G. ; Filho, Jose Arnaldo B. ; Figueiredo, Fabricio L.

  • Author_Institution
    DRC (Convergent Networks Dept.), CPqD R&D Center, Campinas, Brazil
  • fYear
    2013
  • fDate
    17-19 April 2013
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    This paper presents a high-level functional model for the 3GPP LTE-Advanced channel coding generic procedures. Due to the complexity of modern wireless communication systems, it is fundamental to have a well-defined high-level model to guide low-level implementations, like C/C++ or HDL. Highlevel modeling not only serves the purpose of proving the correctness of a given system, but also to present measures of its optimal performance, since we are not yet restricted by any technology. The LTE-Advanced channel coding is composed by five generic procedures: CRC calculation, code block segmentation and CRC attachment, channel coding, rate matching and code block concatenation. The aggregation of these procedures creates the great majority of the downlink and uplink transport channels. In this paper, we present a very simple way of modeling the channel coding, offering a reference for future LTE channel coding developments.
  • Keywords
    Long Term Evolution; channel coding; cyclic redundancy check codes; radio links; 3GPP LTE-advanced channel coding generic procedure; CRC attachment; CRC calculation; code block concatenation; code block segmentation; downlink transport channel; high-level functional model; modern wireless communication system; rate matching; uplink transport channel; Convolutional codes; Downlink; Polynomials; Turbo codes; Uplink; LTE; channel coding; generic procedures; high-level model;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Telecommunications Symposium (WTS), 2013
  • Conference_Location
    Phoenix, AZ
  • ISSN
    1934-5070
  • Print_ISBN
    978-1-4673-5011-2
  • Type

    conf

  • DOI
    10.1109/WTS.2013.6566238
  • Filename
    6566238