On Parallelizing H.264/AVC Rate-Distortion Optimization Baseline Profile Encoder.
Saved in:
| Title: | On Parallelizing H.264/AVC Rate-Distortion Optimization Baseline Profile Encoder. |
|---|---|
| Authors: | JING-XIN WANG1, YUNG-CHANG CHIU2, SU, ALVIN W. Y.1, CE-KUEN SHIEH2 |
| Source: | Journal of Information Science & Engineering. Mar2010, Vol. 26 Issue 2, p409-426. 18p. 4 Diagrams, 17 Charts, 3 Graphs. |
| Subjects: | Distributed shared memory, Computer memory management, Encoding, Mathematical optimization, Computer systems |
| Abstract: | A H.264/AVC encoder can incorporate many coding schemes, such as rate-distortion optimization (RDO), into its design to improve its compression performance, dramatically raising computational complexity. With the H.264/AVC RDO encoder, computation time is primarily spent calculating the rate-distortion cost in choosing the optimal coding mode for both inter and intra coding modes. Parallel computation is one of the ways to speed up the encoder. However, calculating rate-distortion costs requires a great amount of reference data obtained from coded adjacent macroblocks in order to maintain the coding efficiency established by the JM encoder. This is an undesirable property for any parallel computing strategy. The transmission of such a large amount of reference data, as well as the frequency of transmission between processing nodes, reduces the speed of the entire encoding process. Thus, it may become necessary to drop part of the reference data and decrease the frequency of transmission in order to reduce the traffic. In the investigation of this problem, this study uses three different parallel schemes for the implementation of the H.264/AVC RDO encoder. These schemes are each run over a software DSM-based (distributed shared memory) PC cluster system consisting of 1 to 5 PC computers (one master node, with or without one to several slave processing nodes). The amount of data to be exchanged among processing nodes is analyzed for each scheme. In addition, the PSNR performance and the number of speedup results are provided for each scheme. Experiments show that considerable reduction in coding gain is expected, as more information is dropped. In lower bit rate cases, performance is reduced to the level of a regular H.264 encoder. Nevertheless, this paper provides a good reference for implementing such an encoder utilizing a cluster computing system. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Information Science & Engineering is the property of Institute of Information Science, Academia Sinica and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 48461449 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On Parallelizing H.264/AVC Rate-Distortion Optimization Baseline Profile Encoder. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22JING-XIN+WANG%22">JING-XIN WANG</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22YUNG-CHANG+CHIU%22">YUNG-CHANG CHIU</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22SU%2C+ALVIN+W%2E+Y%2E%22">SU, ALVIN W. Y.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22CE-KUEN+SHIEH%22">CE-KUEN SHIEH</searchLink><relatesTo>2</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Information+Science+%26+Engineering%22">Journal of Information Science & Engineering</searchLink>. Mar2010, Vol. 26 Issue 2, p409-426. 18p. 4 Diagrams, 17 Charts, 3 Graphs. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Distributed+shared+memory%22">Distributed shared memory</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22Encoding%22">Encoding</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: A H.264/AVC encoder can incorporate many coding schemes, such as rate-distortion optimization (RDO), into its design to improve its compression performance, dramatically raising computational complexity. With the H.264/AVC RDO encoder, computation time is primarily spent calculating the rate-distortion cost in choosing the optimal coding mode for both inter and intra coding modes. Parallel computation is one of the ways to speed up the encoder. However, calculating rate-distortion costs requires a great amount of reference data obtained from coded adjacent macroblocks in order to maintain the coding efficiency established by the JM encoder. This is an undesirable property for any parallel computing strategy. The transmission of such a large amount of reference data, as well as the frequency of transmission between processing nodes, reduces the speed of the entire encoding process. Thus, it may become necessary to drop part of the reference data and decrease the frequency of transmission in order to reduce the traffic. In the investigation of this problem, this study uses three different parallel schemes for the implementation of the H.264/AVC RDO encoder. These schemes are each run over a software DSM-based (distributed shared memory) PC cluster system consisting of 1 to 5 PC computers (one master node, with or without one to several slave processing nodes). The amount of data to be exchanged among processing nodes is analyzed for each scheme. In addition, the PSNR performance and the number of speedup results are provided for each scheme. Experiments show that considerable reduction in coding gain is expected, as more information is dropped. In lower bit rate cases, performance is reduced to the level of a regular H.264 encoder. Nevertheless, this paper provides a good reference for implementing such an encoder utilizing a cluster computing system. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Information Science & Engineering is the property of Institute of Information Science, Academia Sinica and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=48461449 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 18 StartPage: 409 Subjects: – SubjectFull: Distributed shared memory Type: general – SubjectFull: Computer memory management Type: general – SubjectFull: Encoding Type: general – SubjectFull: Mathematical optimization Type: general – SubjectFull: Computer systems Type: general Titles: – TitleFull: On Parallelizing H.264/AVC Rate-Distortion Optimization Baseline Profile Encoder. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: JING-XIN WANG – PersonEntity: Name: NameFull: YUNG-CHANG CHIU – PersonEntity: Name: NameFull: SU, ALVIN W. Y. – PersonEntity: Name: NameFull: CE-KUEN SHIEH IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2010 Type: published Y: 2010 Identifiers: – Type: issn-print Value: 10162364 Numbering: – Type: volume Value: 26 – Type: issue Value: 2 Titles: – TitleFull: Journal of Information Science & Engineering Type: main |
| ResultId | 1 |
