Add to ORKGA new reduced-complexity iterative decoding algorithm is introduced. The algorithm approximates a posteriori probabilities by using a set of highly sequences, found in a limited bi-directional search. To assess the performance, numerical results for serially concatenated convolutional codes, transmitted over an intersymbol interference channel, disturbed by additive white Gaussian noise are presented. A substantial reduction in complexity is achieved with a performance degradation around 0.25 dB, as demonstrated by bit error rate performance and convergence behaviour
We propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorit...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
Abstract. In this paper we present a new method to decode convolutional codes. The method is based o...
A new algorithm to reduce the computational complexity of iterative decoding is proposed. The algori...
A new algorithm to reduce the computational complexity of iterative decoding is presented. The algor...
A new algorithm to reduce the computational complexityof iterative decoding is presented. The algori...
We propose a new reduced-complexity iterative decoding algorithm. The main concept is to approximate...
A code-division multiple-access system with channel coding may be viewed as a serially-concatenated ...
Conference PaperAn iterative detection and decoding algorithm is explored for a convolutionally code...
Abstract — It is well known that convolutional codes can be optimally decoded by using the Viterbi A...
Abstract — This paper gives an overview of three different classes of convolutional codes that are s...
Conference paperWe describe an iterative detection and decoding scheme for the uplink in a convoluti...
To communicate reliably over noisy wireline or wireless channels, algorithms that add redundancy are...
In this thesis, we consider iterative multiuser detection for coded code-division multipleaccess (CD...
Abstract—This paper presents a low-complexity multiuser decoding technique that can be implemented i...
We propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorit...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
Abstract. In this paper we present a new method to decode convolutional codes. The method is based o...
A new algorithm to reduce the computational complexity of iterative decoding is proposed. The algori...
A new algorithm to reduce the computational complexity of iterative decoding is presented. The algor...
A new algorithm to reduce the computational complexityof iterative decoding is presented. The algori...
We propose a new reduced-complexity iterative decoding algorithm. The main concept is to approximate...
A code-division multiple-access system with channel coding may be viewed as a serially-concatenated ...
Conference PaperAn iterative detection and decoding algorithm is explored for a convolutionally code...
Abstract — It is well known that convolutional codes can be optimally decoded by using the Viterbi A...
Abstract — This paper gives an overview of three different classes of convolutional codes that are s...
Conference paperWe describe an iterative detection and decoding scheme for the uplink in a convoluti...
To communicate reliably over noisy wireline or wireless channels, algorithms that add redundancy are...
In this thesis, we consider iterative multiuser detection for coded code-division multipleaccess (CD...
Abstract—This paper presents a low-complexity multiuser decoding technique that can be implemented i...
We propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorit...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
Abstract. In this paper we present a new method to decode convolutional codes. The method is based o...