• DocumentCode
    1768254
  • Title

    Energy efficient SQRD processor for LTE-A using a group-sort update scheme

  • Author

    Chenxin Zhang ; Prabhu, Hemanth ; Liang Liu ; Edfors, Ove ; Owall, Viktor

  • Author_Institution
    Dept. of Electr. & Inf. Technol., Lund Univ., Lund, Sweden
  • fYear
    2014
  • fDate
    1-5 June 2014
  • Firstpage
    193
  • Lastpage
    196
  • Abstract
    This paper presents an energy-efficient sorted QR-decomposition (SQRD) processor for 3GPP LTE-Advanced (LTE-A) systems. The processor adopts a hybrid decomposition scheme to reduce computational complexity and provides a wide-range of performance-complexity trade-offs. Based on the energy distribution of spatial channels, it switches between the brute-force SQRD and a low-complexity group-sort QR-update strategy, which is proposed in this work to effectively utilize the LTE-A pilot pattern. As a proof of concept, a run-time reconfigurable vector processor is developed to efficiently implement this adaptive-switching QR decomposition algorithm. In a 65 nm CMOS technology, the proposed SQRD processor occupies 0.71mm2 core area and has a throughput of up to 100MQRD/s. Compared to the brute-force approach, an energy reduction of 5 ~ 33% is achieved.
  • Keywords
    3G mobile communication; CMOS integrated circuits; Long Term Evolution; computational complexity; microprocessor chips; power aware computing; 3GPP LTE advanced; CMOS technology; LTE-A pilot pattern; LTE-A systems; QR decomposition algorithm; SQRD processor; computational complexity; energy distribution; energy efficient SQRD processor; group sort update scheme; hybrid decomposition scheme; run-time reconfigurable vector processor; sorted QR decomposition; spatial channels; Antennas; Complexity theory; MIMO; Ports (Computers); Sorting; Vector processors; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems (ISCAS), 2014 IEEE International Symposium on
  • Conference_Location
    Melbourne VIC
  • Print_ISBN
    978-1-4799-3431-7
  • Type

    conf

  • DOI
    10.1109/ISCAS.2014.6865098
  • Filename
    6865098