miun.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Unary Prefixed Huffman Coding for a Group of Quantized Generalized Gaussian Sources
Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Technology and Media.
Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Technology and Media. (STC)
2006 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 54, no 7, 1164-1169 p.Article in journal (Refereed) Published
Abstract [en]

We propose a coding algorithm called unary prefixed Huffman (UPH) coding for a family of infinite sources called quantized generalized Gaussian (GG) sources. Compared with the existing codes for these GG sources, the UPH algorithm provides a more adaptive approach, and its coding efficiency is upper bounded by entropy +2.

Place, publisher, year, edition, pages
2006. Vol. 54, no 7, 1164-1169 p.
Keyword [en]
VLC coding, Entropy coding, Generalized Gaussian (GG) sources, Huffman code, Prefix codes
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:miun:diva-2865DOI: 10.1109/TCOMM.2006.876825ISI: 000239406200004Scopus ID: 2-s2.0-33746352065Local ID: 2469OAI: oai:DiVA.org:miun-2865DiVA: diva2:27897
Projects
STC - Sensible Things that Communicate
Note

VR-Computer Science

Available from: 2008-09-30 Created: 2008-09-30 Last updated: 2016-09-29Bibliographically approved
In thesis
1. Alternating Coding and its Decoder Architectures for Unary-Prefixed Codes
Open this publication in new window or tab >>Alternating Coding and its Decoder Architectures for Unary-Prefixed Codes
2005 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The entropy coding of high peak, heavy-tailed probability distributions such as the Laplacian, Cauchy, and generalized Gaussian have been a topic of interest because they are able to provide good models for data in many coding systems, especially in image and video coding systems. This thesis studies the entropy coding of such high peak, heavy-tailed probability distributions. By summarizing the encoding of such distributions under the concept “Unary Prefixed Codes” (UPC), the thesis depicts the encoding via a different approach. By extending the concept of UPC, the thesis proposes a universally applicable coding algorithm “Unary Prefixed Huffman” (UPH) that could be applied to both finite and infinite sources. The code set resulting from the UPH algorithm has a coding efficiency which is upper-bounded by entropy + 2 given that the entropy is finite, and is able to provide sub-optimal encoding of the sources studied in the thesis. The thesis also proposes several different variations of UPCs that are simple in structure yet efficient for use for several variations of the high peak, heavy-tailed distributions that are commonly found in image and video coding systems. By applying the concept of the UPC, the thesis further proposes a coding method named the “Alternating Coding” (ALT) method. The ALT coding provides a coding pattern that is different from the conventional method which enables the extraction of special properties of the UPCs. Using the extraction of the special property of the UPCs, decoding could be greatly simplified and parallel decoding could be a possibility. Moreover, for the highly structured UPCs that are widely used in image and video coding systems, the ALT coding enables an error resiliency mechanism to be applied, which helps to improve the error tolerance of these UPC packets to a significant extent. Simulations and actual application results of the ALT coding are discussed in the thesis. By applying the ALT coding, the hardware architecture of the decoder changes accordingly. The ALT decoder is different to the conventional variable length decoders that have been applied in the decoding of UPCs, as it is able to utilize the special properties of the UPCs and thus simplify the decoder architecture. As shown in the thesis, the ALT decoders are smaller in size, faster in speed and consume much less power compared to the conventional decoders. This is particularly true for those highly structured UPCs that are commonly used in image and video coding systems. Actual realizations of several ALT decoders are discussed in the thesis, and comparisons are made to the conventional decoders. The improvements are shown to be very evident.

Place, publisher, year, edition, pages
Sundsvall: Mittuniversitetet, 2005. 132 p.
Series
Mid Sweden University doctoral thesis, ISSN 1652-893X ; 1
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:miun:diva-8854 (URN)91-85317-08-X (ISBN)
Public defence
2005-06-08, O111, Åkroken, Sundsvall, 13:15 (English)
Opponent
Supervisors
Available from: 2009-05-06 Created: 2009-05-06 Last updated: 2011-04-19Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Xue, ShangOelmann, Bengt
By organisation
Department of Information Technology and Media
In the same journal
IEEE Transactions on Communications
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 497 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf