scholarly journals Blind Identification of Block Interleaved Convolution Code Parameters

2019 ◽  
Vol 69 (3) ◽  
pp. 274-279
Author(s):  
Jimmy B. Tamakuwala
Keyword(s):  
Forward Error Correction ◽  
Code Rate ◽  
Probability Of Detection ◽  
Blind Identification ◽  
Noisy Channel ◽  
Matrix Rank ◽  
Integer Multiple ◽  
Codeword Length ◽  
Digital Communication System ◽  
Forward Error

Most of the digital communication system uses forward error correction (FEC) in addition with interleaver to achieve reliable communication over a noisy channel. To get useful information from intercepted data, in non-cooperative context, it is necessary to have algoritihms for blind identification of FEC code and interleaver parameters. In this paper, a matrix rank-based algebraic algorithm for the joint and blind identification of block interleaved convolution code parameters for cases, where interleaving length is not necessarily an integer multiple of codeword length is presented. From simulations, it is observed that the code rate and block interleaver length are identified correctly with probability of detection equal to 1 for bit error rate values of less than or equal to 10-4.

scholarly journals ROBUST CHANNEL ENCODING FOR MMTC NODE IN 5G (NR)

2020 ◽  
Vol 8 (10) ◽  
pp. 234-239
Author(s):  
Vipin Sharma ◽  
◽  
Krishna Pandey ◽  
Rachit Patel ◽  
Kamal Kumar Gaur ◽  
...  
Keyword(s):  
Forward Error Correction ◽  
Code Rate ◽  
Channel Condition ◽  
Forward Error Correction Code ◽  
New Radio ◽  
Machine Type Communication ◽  
Rate Selection ◽  
Optimum Solution ◽  
Forward Error ◽  
Adaptive Code

The paper is focused on robust channel encoding for Massive machine type communication (mMTC) communication in 5G (NR). The performance evaluation of channel encoding is obtained at 5G New Radio (NR) PHY. The results show that reliable bit error rate (BER) against the poor channel condition or random fluctuated channel applied. Channel encoding algorithm as a forward error correction code (FEC) is applied on packet to packet basis to improve the BER performance against inter symbol interference. The concept of adaptation of code rate is valuable to reduce the payload effect and provide optimum solution between BER and throughput. Adaptive code rate selection is based on impact of earlier transmitted packet bit using feedback indicator.

1.2 Tbit/s (30 × 42.7 Gbit/s ETDM channel) WDM transmission over 3 × 125 km with forward error correction

2000 ◽  
Vol 36 (9) ◽  
pp. 812 ◽  
Author(s):  
Y. Miyamoto ◽  
K. Yonenaga ◽  
S. Kuwahara ◽  
M. Tomizawa ◽  
A. Hirano ◽  
...  
Keyword(s):  
Error Correction ◽  
Forward Error Correction ◽  
Forward Error ◽  
Wdm Transmission

Forward error correction with Raptor GF(2) and GF(256) codes on GPU

2013 ◽  
Vol 59 (1) ◽  
pp. 273-280 ◽  
Author(s):  
Linjia Hu ◽  
Saeid Nooshabadi ◽  
Todor Mladenov
Keyword(s):  
Error Correction ◽  
Forward Error Correction ◽  
Forward Error

scholarly journals Source Symbol Purging-Based Distributed Conditional Arithmetic Coding

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 983
Author(s):  
Jingjian Li ◽  
Wei Wang ◽  
Hong Mo ◽  
Mengting Zhao ◽  
Jianhua Chen
Keyword(s):  
Posterior Probability ◽  
Side Information ◽  
Code Rate ◽  
Arithmetic Coding ◽  
Distributed Arithmetic ◽  
Context Model ◽  
Error Performance ◽  
Codeword Length ◽  
Simulation Results ◽  
Correlation Strength

A distributed arithmetic coding algorithm based on source symbol purging and using the context model is proposed to solve the asymmetric Slepian–Wolf problem. The proposed scheme is to make better use of both the correlation between adjacent symbols in the source sequence and the correlation between the corresponding symbols of the source and the side information sequences to improve the coding performance of the source. Since the encoder purges a part of symbols from the source sequence, a shorter codeword length can be obtained. Those purged symbols are still used as the context of the subsequent symbols to be encoded. An improved calculation method for the posterior probability is also proposed based on the purging feature, such that the decoder can utilize the correlation within the source sequence to improve the decoding performance. In addition, this scheme achieves better error performance at the decoder by adding a forbidden symbol in the encoding process. The simulation results show that the encoding complexity and the minimum code rate required for lossless decoding are lower than that of the traditional distributed arithmetic coding. When the internal correlation strength of the source is strong, compared with other DSC schemes, the proposed scheme exhibits a better decoding performance under the same code rate.

Sign in / Sign up

Export Citation Format

Share Document