✦ LIBER ✦

A parallel Viterbi decoding algorithm

✍ Scribed by J. S. Reeve

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 237 KB
Volume: 13
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.539

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A modified Viterbi decoding algorithm fo

A modified Viterbi decoding algorithm for high-rate convolutional codes

✍ Amat, Alexandre Graell i ;Benedetto, Sergio ;Siegel, Paul H. 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

Realtime implementation of the Viterbi d

Realtime implementation of the Viterbi decoding algorithm on a high-performance microprocessor

✍ SM Said; KR Dimond 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 570 KB

A modified and parallelized Viterbi algo

A modified and parallelized Viterbi algorithm on hypercube machines

✍ Chongguang Tao; Min-You Wu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 626 KB

A coding and decoding method of track ad

A coding and decoding method of track address with viterbi decoding

✍ Nobuhiro Hayashi 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 731 KB

A parallel decoding algorithm for LZ2 da

A parallel decoding algorithm for LZ2 data compression

✍ Sergio De Agostino 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 314 KB

A space-efficient Huffman decoding algor

A space-efficient Huffman decoding algorithm and its parallelism

✍ Yih-Kai Lin; Kuo-Liang Chung 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 178 KB

This paper ÿrst transforms the Hu man tree into a single-side growing Hu man tree, then presents a memory-e cient data structure to represent the single-side growing Hu man tree, which requires (n + d) log 2 n -bits memory space, where n is the number of source symbols and d is the depth of the Hu m