File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Generalized parallelization methodology for video coding

TitleGeneralized parallelization methodology for video coding
Authors
KeywordsParallel coding
Petri-net
H.261
H.263
Speedup
Issue Date1999
PublisherS P I E - International Society for Optical Engineering. The Journal's web site is located at http://spie.org/x1848.xml
Citation
Proceedings Of Spie - The International Society For Optical Engineering, 1999, v. 3653 I, p. 736-747 How to Cite?
AbstractThis paper describes a generalized parallelization methodology for mapping video coding algorithms onto a multiprocessing architecture, through systematic task decomposition, scheduling and performance analysis. It exploits data parallelism inherent in the coding process and performs task scheduling base on task data size and access locality with the aim to hide as much communication overhead as possible. Utilizing Petri-nets and task graphs for representation and analysis, the method enables parallel video frame capturing, buffering and encoding without extra communication overhead. The theoretical speedup analysis indicates that this method offers excellent communication hiding, resulting in system efficiency well above 90%. A H.261 video encoder has been implemented on a TMS320C80 system using this method, and its performance was measured. The theoretical and measured performances are similar in that the measured speedup of the H.261 is 3.67 and 3.76 on four PP for QCIF and 352×240 video, respectively. They correspond to frame rates of 30.7 frame per second (fps) and 9.25 fps, and system efficiency of 91.8% and 94% respectively. As it is, this method is particularly efficient for platforms with small number of parallel processors.
Persistent Identifierhttp://hdl.handle.net/10722/46153
ISSN
2023 SCImago Journal Rankings: 0.152

 

DC FieldValueLanguage
dc.contributor.authorLeung, KKen_HK
dc.contributor.authorYung, NHCen_HK
dc.date.accessioned2007-10-30T06:43:38Z-
dc.date.available2007-10-30T06:43:38Z-
dc.date.issued1999en_HK
dc.identifier.citationProceedings Of Spie - The International Society For Optical Engineering, 1999, v. 3653 I, p. 736-747en_HK
dc.identifier.issn0277-786Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/46153-
dc.description.abstractThis paper describes a generalized parallelization methodology for mapping video coding algorithms onto a multiprocessing architecture, through systematic task decomposition, scheduling and performance analysis. It exploits data parallelism inherent in the coding process and performs task scheduling base on task data size and access locality with the aim to hide as much communication overhead as possible. Utilizing Petri-nets and task graphs for representation and analysis, the method enables parallel video frame capturing, buffering and encoding without extra communication overhead. The theoretical speedup analysis indicates that this method offers excellent communication hiding, resulting in system efficiency well above 90%. A H.261 video encoder has been implemented on a TMS320C80 system using this method, and its performance was measured. The theoretical and measured performances are similar in that the measured speedup of the H.261 is 3.67 and 3.76 on four PP for QCIF and 352×240 video, respectively. They correspond to frame rates of 30.7 frame per second (fps) and 9.25 fps, and system efficiency of 91.8% and 94% respectively. As it is, this method is particularly efficient for platforms with small number of parallel processors.en_HK
dc.format.extent1231734 bytes-
dc.format.extent10863 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherS P I E - International Society for Optical Engineering. The Journal's web site is located at http://spie.org/x1848.xmlen_HK
dc.relation.ispartofProceedings of SPIE - The International Society for Optical Engineeringen_HK
dc.rightsCopyright 1998 Society of Photo‑Optical Instrumentation Engineers (SPIE). One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this publication for a fee or for commercial purposes, and modification of the contents of the publication are prohibited. This article is available online at https://doi.org/10.1117/12.334725-
dc.subjectParallel codingen_HK
dc.subjectPetri-neten_HK
dc.subjectH.261en_HK
dc.subjectH.263en_HK
dc.subjectSpeedupen_HK
dc.titleGeneralized parallelization methodology for video codingen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0277-786X&volume=3653&spage=736&epage=747&date=1998&atitle=Generalized+parallelization+methodology+for+video+codingen_HK
dc.identifier.emailYung, NHC:nyung@eee.hku.hken_HK
dc.identifier.authorityYung, NHC=rp00226en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1117/12.334725en_HK
dc.identifier.scopuseid_2-s2.0-0032671601en_HK
dc.identifier.hkuros45922-
dc.identifier.volume3653en_HK
dc.identifier.issueIen_HK
dc.identifier.spage736en_HK
dc.identifier.epage747en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLeung, KK=35779695300en_HK
dc.identifier.scopusauthoridYung, NHC=7003473369en_HK
dc.identifier.issnl0277-786X-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats