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.
| Original language | English |
|---|---|
| Pages (from-to) | 554 |
| Number of pages | 1 |
| Journal | Data Compression Conference Proceedings |
| Publication status | Published - 14 Jun 2004 |
| Externally published | Yes |
| Event | Proceedings - DCC 2004 Data Compression Conference - Snowbird, UT., United States Duration: 23 Mar 2004 → 25 Mar 2004 |