An Improved Algorithm of RS Codes Blind Recognition

2014 ◽  
Vol 602-605 ◽  
pp. 2308-2312
Author(s):  
Tong Li ◽  
Cheng Lin Miao ◽  
Jun Lv
Keyword(s):  
Channel Coding ◽  
Information Acquisition ◽  
Communication Systems ◽  
Cyclic Codes ◽  
Block Codes ◽  
Error Rates ◽  
Coding Sequences ◽  
Linear Block Codes ◽  
Rs Codes ◽  
Blind Recognition

The acquisition of information about channel coding sequences is the research emphasis and difficulties at present, and recognizing the channel coding parameters is the prerequisite for information acquisition. RS Codes are a class of linear block codes as well as a special class of BCH Codes and cyclic codes. It regards a group of symbols with a length of n as a unit to process with, and the n symbols are generated by k transmitting information symbols under some proper associated rules. RS Codes are widely used in various communication systems. In this paper, an algorithm of RS Codes blind recognition is researched. And a blind recognition model is established on MATLAB. At last, the paper presents the recognition rates of situations with different error rates.

STOCHASTIC DECODING OF LINEAR BLOCK CODES USING CHECK MATRIX

2021 ◽  
pp. 79-84
Author(s):  
А.В. Башкиров ◽  
И.В. Свиридова ◽  
М.В. Хорошайлова ◽  
О.В. Свиридова
Keyword(s):  
Turbo Code ◽  
Stochastic Approach ◽  
Block Codes ◽  
Parity Check ◽  
Trust Propagation ◽  
Linear Block Codes ◽  
Rs Codes ◽  
Propagation Algorithm ◽  
Stochastic Decoding ◽  
Linear Block

Для итеративного декодирования на графах используется новый альтернативный подход - это стохастическое декодирование. Возможность стохастического декодирования была недавно предложена для декодирования LDPC-кодов. Эта статья расширяет применение стохастического подхода для декодирования линейных блочных кодов с помощью проверочных матриц (PCM), таких как коды Боуза - Чоудхури - Хоквингема (BCH), коды Рида - Соломона (RS) и блочные турбокоды на основе компонентов кодов BCH. Показано, как стохастический подход способен генерировать информацию мягкого выхода для итеративного декодирования с мягким входом и мягким выходом Soft - Input Soft - Output (SISO). Описывается структура стохастических переменных узлов высокой степени, используемых в кодах с помощью проверочных матриц PCM. Результаты моделирования для кода BCH (128, 120), кода RS (31, 25) и RS (63, 55) и турбокода блока BCH (256, 121) и (1024, 676) демонстрируют эффективность декодирования при закрытии к итеративному декодеру SISO с реализацией с плавающей запятой. Эти результаты показывают производительность декодирования, близкую к адаптивному алгоритму распространения доверия и/или турбо-ориентированному адаптированному алгоритму распространения доверия Stochastic decoding capability has recently been proposed for decoding LDPC codes. This paper expands on the application of the stochastic approach to decoding linear block codes using parity check matrices (PCMs) such as Bose-Chowdhury-Hawkingham (BCH) codes, Reed-Solomon (RS) codes, and BCH component-based block turbo codes. We show how the stochastic approach is able to generate soft-output information for iterative decoding with soft-input and soft-output Soft-Input Soft-Output (SISO). We describe the structure of high degree stochastic node variables used in codes using PCM parity check matrices. Simulation results for BCH code (128, 120), RS code (31, 25) and RS (63, 55), and BCH block turbo code (256, 121) and (1024, 676) demonstrate the decoding efficiency on close to SISO iterative decoder with floating point implementation. These results show decoding performance close to the adaptive trust propagation algorithm and / or turbo-oriented adapted trust propagation algorithm

scholarly journals Secure image transmission over wireless network

2018 ◽  
Vol 7 (4) ◽  
pp. 2758
Author(s):  
Salah A. Aliesawi ◽  
Dena S. Alani ◽  
Abdullah M. Awad
Keyword(s):  
Turbo Codes ◽  
Channel Coding ◽  
Communication Systems ◽  
Wireless Channels ◽  
Image Transmission ◽  
Signal Propagation ◽  
Data Encryption ◽  
Error Rates ◽  
Delay Spread ◽  
High Level

The advances recently seen in data compression, and communication systems, have made it viable to design wireless image transmission systems. For many applications such as confidential transmission, military and medical applications, data encryption techniques should be also used to protect the confidential data from intruders. For these applications, both encryption and compression need to be performed to transmit a message in a fast and secure way. Further, the wireless channels have fluctuating channel qualities and high bit error rates. In this paper, a new scheme based on encryption and channel coding has been proposed for secure image transmission over wireless channels. In the proposed scheme, the encryption process is based on keys generator and Chaotic Henon map. Turbo codes are utilized as channel coding to deal effectively with the channel errors, multipath signal propagation and delay spread. Simulation results show that the proposed system achieves a high level of robustness against wide different of attacks and channel impairments. Further, it improves image quality with acceptable data rates. 

Blind Recognition for Rate below 1/2 Binary Cyclic Codes

2014 ◽  
Vol 511-512 ◽  
pp. 1163-1166
Author(s):  
Hong Wei Wang ◽  
Lin Yang ◽  
Yi Bing Cai
Keyword(s):  
Channel Coding ◽  
Cyclic Codes ◽  
Code Word ◽  
Blind Recognition

The blind recognition of channel coding is playing more and more important roles in smart communications. The paper took rate below 1/2 binary cyclic codes to research, we established a model using counter of continuous bits 0. At the basic of studying the features of binary cyclic codes, when the condition about the rate is satisfied, we made a statistics of the continuous bits 0 in a long sequence of code words to get the length of code word n and the length of information k. In the condition of higher BER simulations, we improved the method to make it suitable for estimating the parameter.

scholarly journals A Simple Scheme for Belief Propagation Decoding of BCH and RS Codes in Multimedia Transmissions

2008 ◽  
Vol 2008 ◽  
pp. 1-12 ◽  
Author(s):  
Marco Baldi ◽  
Franco Chiaraluce
Keyword(s):  
Belief Propagation ◽  
Ldpc Codes ◽  
Block Codes ◽  
Soft Decision ◽  
Linear Block Codes ◽  
Rs Codes ◽  
Nonbinary Codes ◽  
Soft Decision Decoding ◽  
Multimedia Transmissions ◽  
A New Technique

Classic linear block codes, like Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes, are widely used in multimedia transmissions, but their soft-decision decoding still represents an open issue. Among the several approaches proposed for this purpose, an important role is played by the iterative belief propagation principle, whose application to low-density parity-check (LDPC) codes permits to approach the channel capacity. In this paper, we elaborate a new technique for decoding classic binary and nonbinary codes through the belief propagation algorithm. We focus on RS codes included in the recent CDMA2000 standard, and compare the proposed technique with the adaptive belief propagation approach, that is able to ensure very good performance but with higher complexity. Moreover, we consider the case of long BCH codes included in the DVB-S2 standard, for which we show that the usage of “pure” LDPC codes would provide better performance.

scholarly journals Genetic Algorithms for Soft-Decision Decoding of Linear Block Codes

1994 ◽  
Vol 2 (2) ◽  
pp. 145-164 ◽  
Author(s):  
Harpal Maini ◽  
Kishan Mehrotra ◽  
Chilukuri Mohan ◽  
Sanjay Ranka
Keyword(s):  
Genetic Algorithms ◽  
Communication Systems ◽  
Signal To Noise Ratio ◽  
Search Space ◽  
Block Codes ◽  
Specific Information ◽  
Soft Decision ◽  
Linear Block Codes ◽  
Soft Decision Decoding ◽  
Linear Block

Soft-decision decoding is an NP-hard problem of great interest to developers of communication systems. We show that this problem is equivalent to the problem of optimizing Walsh polynomials. We present genetic algorithms for soft-decision decoding of binary linear block codes and compare the performance with various other decoding algorithms including the currently developed A* algorithm. Simulation results show that our algorithms achieve bit-error-probabilities as low as 0.00183 for a [104,52] code with a low signal-to-noise ratio of 2.5 dB, exploring only 22,400 codewords, whereas the search space contains 4.5 × 10l5 codewords. We define a new crossover operator that exploits domain-specific information and compare it with uniform and two-point crossover.

Sign in / Sign up

Export Citation Format

Share Document