Reduced complexity VLC sequence decoder

Hang Nguyen; Pierre Duhamel

Reduced complexity VLC sequence decoder

Hang Nguyen
, Pierre Duhamel

Alcatel Research and Innovation
L2S, CNRS, Univ Paris-Sud

Résultats de recherche: Contribution à un journal › Article de conférence › Revue par des pairs

3 Citations (Scopus)

Résumé

The proposed reduced complexity decoder using the VLC structure projection and intrinsic image properties was evaluated. The decoding algorithm benefits from all the constraints that could be expressed on the whole sequence. The two difficulties with the application of Viterbi algorithm (VA) were the variable length structure of the code and the additional sequence constraints. It was observed that the proposed reduced-complexity decoding algorithm was theoretically sub-optimal and the hard-output sequence met all constraints.

langue originale	Anglais
Pages (de - à)	554
Nombre de pages	1
journal	Data Compression Conference Proceedings
état	Publié - 1 janv. 2004
Modification externe	Oui
Evénement	14th Data Compression Conference, DCC 2004 - Snowbird, UT., États-Unis Durée: 23 mars 2004 → 25 mars 2004

Contient cette citation

@article{d6ca3d41c0cd4f4eaf41d53dd0154500,

title = "Reduced complexity VLC sequence decoder",

abstract = "The proposed reduced complexity decoder using the VLC structure projection and intrinsic image properties was evaluated. The decoding algorithm benefits from all the constraints that could be expressed on the whole sequence. The two difficulties with the application of Viterbi algorithm (VA) were the variable length structure of the code and the additional sequence constraints. It was observed that the proposed reduced-complexity decoding algorithm was theoretically sub-optimal and the hard-output sequence met all constraints.",

author = "Hang Nguyen and Pierre Duhamel",

year = "2004",

month = jan,

day = "1",

language = "English",

pages = "554",

journal = "Data Compression Conference Proceedings",

issn = "1068-0314",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "14th Data Compression Conference, DCC 2004 ; Conference date: 23-03-2004 Through 25-03-2004",

}

TY - JOUR

T1 - Reduced complexity VLC sequence decoder

AU - Nguyen, Hang

AU - Duhamel, Pierre

PY - 2004/1/1

Y1 - 2004/1/1

N2 - The proposed reduced complexity decoder using the VLC structure projection and intrinsic image properties was evaluated. The decoding algorithm benefits from all the constraints that could be expressed on the whole sequence. The two difficulties with the application of Viterbi algorithm (VA) were the variable length structure of the code and the additional sequence constraints. It was observed that the proposed reduced-complexity decoding algorithm was theoretically sub-optimal and the hard-output sequence met all constraints.

AB - The proposed reduced complexity decoder using the VLC structure projection and intrinsic image properties was evaluated. The decoding algorithm benefits from all the constraints that could be expressed on the whole sequence. The two difficulties with the application of Viterbi algorithm (VA) were the variable length structure of the code and the additional sequence constraints. It was observed that the proposed reduced-complexity decoding algorithm was theoretically sub-optimal and the hard-output sequence met all constraints.

M3 - Conference article

AN - SCOPUS:2642522304

SN - 1068-0314

SP - 554

JO - Data Compression Conference Proceedings

JF - Data Compression Conference Proceedings

T2 - 14th Data Compression Conference, DCC 2004

Y2 - 23 March 2004 through 25 March 2004

ER -

Reduced complexity VLC sequence decoder

Résumé

Empreinte digitale

Contient cette citation