Results 161 to 170 of about 62,799 (214)
Some of the next articles are maybe not open access.
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
A parallel Viterbi decoding algorithm
Concurrency and Computation: Practice and Experience, 2001AbstractIn this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array.
openaire +4 more sources
Array Processors for Viterbi Decoder
2005 2nd International Symposium on Wireless Communication Systems, 2005Wireless receivers are often characterized as portable and battery operated. As such, they are bound by a tight set of constraints such as power consumption, area usage, and throughput speed. Parallel implementation of operations increases the speed of computation without an undue increase in lock frequency.
Appaya Devaraj Devaraj, Nastooh Avessta
openaire +2 more sources
On the Viterbi decoding algorithm
IEEE Transactions on Information Theory, 1969A new interpretation of the Viterbi decoding algorithm based on the state-space approach to dyamical systems is presented. In this interpretation the optimum decoder solves a generalized regulator control problem by dynamic programming techniques.
openaire +2 more sources
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.
Gerhard P. Fettweis, Heinrich Meyr
openaire +2 more sources
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.
Farhad Hemmati, Daniel J. Costello Jr.
openaire +2 more sources
2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, 2012
An all optical Viterbi decoder on a silicon chip was designed. The device is composed of an optical memory cell and two interfering input arms that use QPSK modulation to encode the incoming bits. The device has a shape of a ring resonator with a size of just a few micrometers and relies on the coupling of modes. Data processing of a few picoseconds is
Ted Frumkin, Amihai Meiri, Zeev Zalevsky
openaire +1 more source
An all optical Viterbi decoder on a silicon chip was designed. The device is composed of an optical memory cell and two interfering input arms that use QPSK modulation to encode the incoming bits. The device has a shape of a ring resonator with a size of just a few micrometers and relies on the coupling of modes. Data processing of a few picoseconds is
Ted Frumkin, Amihai Meiri, Zeev Zalevsky
openaire +1 more source
Memory Management in a Viterbi Decoder
IEEE Transactions on Communications, 1981Management of the memory contents in a Viterbi decoder is a major design problem for both hardware and software realizations. In a naive implementation, every bit in the memory must be changed (read, modified, and rewritten) for each message bit decoded, and, in addition, some double buffering is required.
openaire +2 more sources
Truncation length for Viterbi decoding
IEEE Transactions on Communications, 1991A bound is derived and analyzed for the bit error rate (BER) of a Viterbi decoder with survivor truncation. Estimates of the SNR (signal-to-noise ratio) loss on the AWGN (additive white Gaussian noise) channel due to truncation are obtained for convolutional codes. Larger truncation lengths are required than the smallest value that does not effectively
openaire +2 more sources