Results 131 to 140 of about 409 (184)
Some of the next articles are maybe not open access.
IEEE Transactions on Circuits and Systems II: Express Briefs, 2005
The problem of survival memory management of a Viterbi decoder (VD) was solved by introducing a novel pointer implementation for the register exchange method, where a pointer is assigned to each row of memory in the survivor memory unit (SMU). The content of the pointer which points to one row of memory is altered to point to another row of memory ...
D.A. El-Dib, M.I. Elmasry
openaire +1 more source
The problem of survival memory management of a Viterbi decoder (VD) was solved by introducing a novel pointer implementation for the register exchange method, where a pointer is assigned to each row of memory in the survivor memory unit (SMU). The content of the pointer which points to one row of memory is altered to point to another row of memory ...
D.A. El-Dib, M.I. Elmasry
openaire +1 more source
Fast decoding viterbi algorithm
Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004., 2004The fast decoding Viterbi algorithm is proposed in this paper, which depends on majority principle for decision. The proposed algorithm is compared with conventional decoding algorithm. The comparison is done by means of decoder initialization with the metric tableset and the possible states of the encoder calculated.
M. Wainakh, I. Abboud, M. Morhej
openaire +1 more source
Reconfigurable systolic Viterbi decoder
Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324), 2003This paper introduces a new algorithm which saves the power consumption of the systolic Viterbi decoder. The new algorithm dynamically changes the truncated path length of a Viterbi decoder according to the channel condition, resulting in reduction of power consumption.
K. Takahashi +3 more
openaire +1 more source
Feedforward Architectures for Parallel Viterbi Decoding
Journal of VLSI signal processing systems for signal, image and video technology, 1991The Viterbi-Algorithm (VA) is a common application of dynamic programming. The algorithm contains a nonlinear feedback loop (ACS-feedback, ACS: add-compare-select) which is the bottleneck in high data rate implementations. In this paper we show that, asymptotically, the ACS-feedback no longer has to be processed recursively, i.e., there is no feedback.
G. Fettweis, H. Meyr
openaire +1 more source
Truncation Error Probability in Viterbi Decoding
IEEE Transactions on Communications, 1977An upper bound on the bit error probability due to truncation of the path length in Viterbi decoding is obtained for any given convolutional code. This bound is then used to determine the path length at which the additional error probability due to truncation becomes negligible compared to the maximum likelihood decoding error probability.
Hemmati, Farhad +1 more
openaire +2 more sources
An artificial neural net Viterbi decoder
IEEE Transactions on Communications, 1996The Viterbi algorithm is a maximum likelihood means for decoding convolutional codes and has thus played an important role in applications ranging from satellite communications to cellular telephony. In the past, Viterbi decoders have usually been implemented using digital circuits.
Wang, Xiaoan, Wicker, Stephen B.
openaire +2 more sources
2008 Fourth International Conference on Natural Computation, 2008
Convolutional codes are widely used in many communication systems due to their excellent error-control performance. High-speed Viterbi decoders for convolutional codes are of great interest in high-speed applications. A high-speed (2, 1, 6) Viterbi decoder is presented in this paper, which is based on parallel Radix-4 architecture and bit-level carry ...
Qing Li +3 more
openaire +1 more source
Convolutional codes are widely used in many communication systems due to their excellent error-control performance. High-speed Viterbi decoders for convolutional codes are of great interest in high-speed applications. A high-speed (2, 1, 6) Viterbi decoder is presented in this paper, which is based on parallel Radix-4 architecture and bit-level carry ...
Qing Li +3 more
openaire +1 more source
20OMbps Viterbi decoder for UWB
The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005., 2005UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 400 Mbps in full specification mode and 200 Mbps in mandatory mode.
null Sung-Woo Choi, null Sang-Sung Choi
openaire +1 more source
Low Complexity SST Viterbi Decoder
IEEE Vehicular Technology Conference, 2006Reducing the complexity and power consumption of the Viterbi decoder is one of the important design goals for high throughput wireless systems. Recently, a low complexity decoding algorithm was proposed to reduce the average number of ACS (Add Compare Select) operation of the Viterbi algorithm (VA) using the information of syndrome.
Jin Jie, Chi-ying Tsui
openaire +1 more source
2021
The Viterbi algorithm is the most well-known trellis-based maximum likelihood decoding algorithm. Trellis decoding is used to recover encoded information that was corrupted during transmission over a noisy channel. The Viterbi algorithm is implemented with a Viterbi decoder. High-speed applications require high-speed Viterbi decoders.
openaire +1 more source
The Viterbi algorithm is the most well-known trellis-based maximum likelihood decoding algorithm. Trellis decoding is used to recover encoded information that was corrupted during transmission over a noisy channel. The Viterbi algorithm is implemented with a Viterbi decoder. High-speed applications require high-speed Viterbi decoders.
openaire +1 more source