This paper outlines a novel iterative decoding technique for a rate K/N convolutional code based on recurrent neural network (RNN) with stopping criterion. The algorithm is introduced by describing the theoretical models of the encoder and decoder. In particular this paper focuses on the investigation of a stopping criterion on the iterating procedure in order to minimize the decoding time yet still obtain an optimal BER performance. The simulation results of a rate 1/2 and 2/3 encoders respectively in comparison with the conventional Viterbi decoder are also presented
Channel codes in combination with iterative decoding techniques are a both powerful and efficient me...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
Abstract. In this paper we present a new method to decode convolutional codes. The method is based o...
This paper outlines a novel iterative decoding technique for a rate K/N convolutional code based on ...
A silicon efficient real-time approach to decode convolutional codes is presented. The algorithm is ...
Due to the curse of dimensionality, the training complexity of the neural network based channel-code...
This paper presents a parallel computing approach that is employed to reconstruct original informati...
Convolutional Codes are used in a variety of areas from computers to communications. Ideally one sim...
A Viterbi algorithm (VA) is the optimal decoding strategy for the convolutional code. The Viterbi al...
Abstract — This paper gives an overview of three different classes of convolutional codes that are s...
Sequential decoding can achieve a very low computational complexity and short decoding delay when th...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and...
This tutorial paper gives an overview of thei mplementation aspects related to turbo decoders, where...
A new algorithm to reduce the computational complexity of iterative decoding is presented. The algor...
We propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel con...
Channel codes in combination with iterative decoding techniques are a both powerful and efficient me...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
Abstract. In this paper we present a new method to decode convolutional codes. The method is based o...
This paper outlines a novel iterative decoding technique for a rate K/N convolutional code based on ...
A silicon efficient real-time approach to decode convolutional codes is presented. The algorithm is ...
Due to the curse of dimensionality, the training complexity of the neural network based channel-code...
This paper presents a parallel computing approach that is employed to reconstruct original informati...
Convolutional Codes are used in a variety of areas from computers to communications. Ideally one sim...
A Viterbi algorithm (VA) is the optimal decoding strategy for the convolutional code. The Viterbi al...
Abstract — This paper gives an overview of three different classes of convolutional codes that are s...
Sequential decoding can achieve a very low computational complexity and short decoding delay when th...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and...
This tutorial paper gives an overview of thei mplementation aspects related to turbo decoders, where...
A new algorithm to reduce the computational complexity of iterative decoding is presented. The algor...
We propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel con...
Channel codes in combination with iterative decoding techniques are a both powerful and efficient me...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
Abstract. In this paper we present a new method to decode convolutional codes. The method is based o...