• DocumentCode
    775598
  • Title

    VLSI implementation for low-complexity full-search motion estimation

  • Author

    Hsia, Shih-Chang

  • Author_Institution
    Dept. of Comput. & Commun. Eng., Nat. Kaohsiung First Univ. of Sci. & Technol., Taiwan
  • Volume
    12
  • Issue
    7
  • fYear
    2002
  • fDate
    7/1/2002 12:00:00 AM
  • Firstpage
    613
  • Lastpage
    619
  • Abstract
    Although many ASICs for motion estimation have been developed, either the chip complexity is too high or the optimal accuracy was not achieved. In this study, an adaptive full-search algorithm is presented to reduce the searching complexity with a temporal correlation approach. The efficiency of the proposed full search can be promoted about 5-10 times in comparison with the conventional full search while the searching accuracy remains intact. Based on the adaptive full-search algorithm, a real-time VLSI chip is regularly designed by using the module base. For MPEG-2 applications, the computational kernel only uses eight processing elements to meet the speed requirement. The processing rate of the proposed chip can achieve 53 K blocks/s to search from -127 to +127 vectors, using only 8 K gates
  • Keywords
    VLSI; computational complexity; correlation methods; logic design; motion compensation; motion estimation; search problems; video coding; VLSI; adaptive full-search algorithm; coding bit rate; low-complexity algorithm; motion compensation; motion estimation; processing elements; temporal correlation; video sequences; Adders; Algorithm design and analysis; Bit rate; Computer applications; Kernel; Motion compensation; Motion estimation; Very large scale integration; Video coding; Video sequences;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems for Video Technology, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1051-8215
  • Type

    jour

  • DOI
    10.1109/TCSVT.2002.800514
  • Filename
    1015673