Complexity analysis of spatially scalable MPEG-4 encoder

Author

Lehtoranta, Olli ; Hämäläinen, Timo D.

Author_Institution

Inst. of Digital & Comput. Syst., Tampere Univ. of Technol., Finland

fYear

2003

fDate

19-21 Nov. 2003

Firstpage

57

Lastpage

60

Abstract

Computational complexity of MPEG-4 encoder supporting spatial scalability is presented. The encoder is partitioned into atomic functions whose complexities are estimated in terms of millions of RISC like operations per second (MOPS). A detailed listing of arithmetic, logic and control flow operations is given. The complexity estimates are used to identify computationally the most demanding encoding tasks. The results indicate that approximately 6600 RISC MOPS is required to encode CIF/4CIF-sized video layers while using frame rate of 30 frames/s and a low-complexity motion estimation algorithm. Furthermore, encoding both spatial layers with the new H.264/AVC causes computational load of 27000 RISC MOPS.

Keywords

computational complexity; encoding; reduced instruction set computing; CIF/4CIF-sized video layers; H.264/AVC; MOPS; MPEG-4 encoder; arithmetic operations; atomic functions; complexity analysis; complexity estimates; computational complexity; control flow operations; logic operations; millions of RISC like operations per second; motion estimation algorithm; spatial scalability; Decoding; Digital signal processing; Encoding; Hardware; MPEG 4 Standard; Reduced instruction set computing; Scalability; Signal processing algorithms; Streaming media; Video compression;

fLanguage

English

Publisher

ieee

Conference_Titel

System-on-Chip, 2003. Proceedings. International Symposium on

Print_ISBN

0-7803-8160-2

Type

conf

DOI

10.1109/ISSOC.2003.1267717

Filename

1267717