Time Complexity Analysis for Decoding VOP Content in MPEG-4 Presentations

MPEG-4 is recent multimedia standard used for uni-casting or multicasting of multimedia data. Coding and decoding are major steps involved while presenting the content. Variable length codes (VLC) are stored in video object plane (VOP). Coded VOP are structured elements embedded with position objects along with blocks of video data stored using T-coefficient VLCs. VOP are decoded while composing the presentation. This paper focuses on the VOP search complexity issues associated with reading the MPEG-4 content. P-VOP´s with 4:2:0 video data simple profiles are considers for the research purpose. The objects such as CBPC, DQUANT, MVD, MVD2-4 may or may not present in VOP, which induces time complexity issues. Also all VLCs are bit tested till matches with one of the VLC. This also leads to search of static tables associated with respective object. This paper presents algorithm to improve VOP search time complexity