A New Method for BCH Codes of Blind Recognition

2013 ◽  
Vol 631-632 ◽  
pp. 1403-1408
Author(s):  
Lan Xun Wang ◽  
Dan Fang Li
Keyword(s):  
Degree Distribution ◽  
Common Factor ◽  
Bch Code ◽  
Invariance Property ◽  
Code Length ◽  
Distribution Probability ◽  
Recognition Probability ◽  
Code Group ◽  
Simulation Results ◽  
Blind Recognition

According to the invariance property of the BCH code and Euclidean algorithm to calculate the greatest common factor (GCF) between code group and its cyclic shift code group. There is a method by using the degree distribution probability sum function of the greatest common factor to recognize the code length of BCH code. On this basis, the GCF can be extracted of the greatest degree distribution probability from the sum function, with the generator polynomial obtained by decomposing the GCF. The simulation results show that this method can achieve the recognition probability above 95% with BER of 4×10-3，and the high BER is much better to recognize the short codes.

scholarly journals Models And Mining Of On-Line Social Networks

2021 ◽  
Author(s):  
Yanhua Tian
Keyword(s):  
Social Networks ◽  
Power Law ◽  
Degree Distribution ◽  
Small World ◽  
Spectral Expansion ◽  
On Line ◽  
Simulation Results ◽  
Small World Property ◽  
P Type ◽  
Law Degree

Power law degree distribution, the small world property, and bad spectral expansion are three of the most important properties of On-line Social Networks (OSNs). We sampled YouTube and Wikipedia to investigate OSNs. Our simulation and computational results support the conclusion that OSNs follow a power law degree distribution, have the small world property, and bad spectral expansion. We calculated the diameters and spectral gaps of OSNs samples, and compared these to graphs generated by the GEO-P model. Our simulation results support the Logarithmic Dimension Hypothesis, which conjectures that the dimension of OSNs is m = [log N]. We introduced six GEO-P type models. We ran simulations of these GEO-P-type models, and compared the simulated graphs with real OSN data. Our simulation results suggest that, except for the GEO-P (GnpDeg) model, all our models generate graphs with power law degree distributions, the small world property, and bad spectral expansion.

DFCWs Design Based on Improved DPSO

2013 ◽  
Vol 333-335 ◽  
pp. 623-627
Author(s):  
Jing Jun Li ◽  
Yong Hua Jiang ◽  
Bo Dan ◽  
Wei Wei Gao
Keyword(s):  
Theoretical Analysis ◽  
Cross Correlation ◽  
Correlation Energy ◽  
Code Length ◽  
Discrete Particle ◽  
Frequency Coding ◽  
Simulation Results ◽  
The Cross ◽  
The Cost ◽  
Correlation Level

Orthogonal discrete frequency coding waveforms(DFCWs) is an ideal quasi-orthogonal waveform. This paper analyses the ambiguity function of DFCWs and the results indicate that the correlation characteristics of DFCWs have only relationship with the code length and coding order. Based on the theoretical analysis, we defined the cross-correlation energy as the cost function, and used the improved discrete particle swarmoptimization(DPSO) to optimize the order of DFCWs. The new signal can effectively restrain the cross-correlation level between the two DFCWs. Simulation results verify the effectiveness of the designed DFCWs.

The Design of Low Complexity Decoder Based on DVB-S2 LDPC

2012 ◽  
Vol 239-240 ◽  
pp. 911-914
Author(s):  
Zhong Xun Wang ◽  
Shuang Shuang Yin
Keyword(s):  
Hardware Implementation ◽  
Ldpc Code ◽  
Low Complexity ◽  
Bch Code ◽  
Digital Video Broadcasting ◽  
Video Broadcasting ◽  
Uniform Quantization ◽  
Point Representation ◽  
Simulation Results ◽  
Decoder Complexity

An improved codeword construction method was used to encode the BCH code and LDPC code in this paper according to the latest standard defined by digital video broadcasting standard(DVB), and moreover the data overflow problem was solved. The LDPC code was decoded by the reduced complexity Min-Sum decoding algorithm, in which the coefficient was studied. Fixed-point representation and decoder quantization were proposed and simulation results show that 6-bits and 16-bits uniform quantization can make close to the performance of unquantized decoder, which reduces the decoder complexity for hardware implementation.

COOPERATION AND COMPETITION IN HISTORY-DEPENDENT PARRONDO'S GAME ON NETWORKS

2011 ◽  
Vol 10 (03) ◽  
pp. 323-336 ◽  
Author(s):  
YE YE ◽  
NENG-GANG XIE ◽  
LIN-GANG WANG ◽  
LU WANG ◽  
YU-WAN CEN
Keyword(s):  
Degree Distribution ◽  
Positive Impact ◽  
Behavioral Adaptation ◽  
Cooperation And Competition ◽  
History Of ◽  
Multi Agent ◽  
Simulation Results ◽  
Zero Sum ◽  
The Impact ◽  
Average Fitness

The paper studies a multi-agent Parrondo's game with history dependence. With the complex networks as the spatial carrier, the adaptation of cooperation and competition (coopetition for short) behaviors is analyzed and the impact of the degree distribution of the heterogeneity on the behavioral adaptation is investigated. The multi-agent Parrondo's game consists of a zero-sum game between individuals and a negative-sum game between individuals and environment based on the history of the game. In terms of relations of the zero-sum game, two behavioral patterns are determined: cooperation and competition. The simulation results show that: (1) Cooperation and competition in any forms are the adaptive behaviors. The coopetition behavior results in the variety of winning and losing states of the history, which makes the population develop toward the beneficial direction where nature affects. The positive average fitness of the population represents the paradoxical feature that the Parrondo's game is counterintuitive, (2) for the cooperation pattern, the average fitness of the population is the largest under Barabási–Albert (BA) network which is conducive to cooperation, (3) the heterogeneity has a positive impact on cooperation.

scholarly journals Highly Accurate Multi-Invariance ESPRIT for DOA Estimation with a Sparse Array

2019 ◽  
Vol 2019 ◽  
pp. 1-7
Author(s):  
Chen Gu ◽  
Hong Hong ◽  
Yusheng Li ◽  
Xiaohua Zhu ◽  
Jin He
Keyword(s):  
Doa Estimation ◽  
Invariance Property ◽  
Two Dimensional ◽  
Sparse Array ◽  
Half Wavelength ◽  
Vector Sensors ◽  
Matrix Blocks ◽  
Simulation Results ◽  
Non Gaussian ◽  
Array Geometry

This paper proposes a multi-invariance ESPRIT-based method for estimation of 2D direction (MIMED) of multiple non-Gaussian monochromatic signals using cumulants. In the MIMED, we consider an array geometry containing sparse L-shaped diversely polarized vector sensors plus an arbitrarily-placed single polarized scalar sensor. Firstly, we define a set of cumulant matrices to construct two matrix blocks with multi-invariance property. Then, we develop a multi-invariance ESPRIT-based algorithm with aperture extension using the defined matrix blocks to estimate two-dimensional directions of the signals. The MIMED can provide highly accurate and unambiguous direction estimates by extending the array element spacing beyond a half-wavelength. Finally, we present several simulation results to demonstrate the superiority of the MIMED.

Study on LDPC Coded SFH System with Multi-Tone Interference

2013 ◽  
Vol 659 ◽  
pp. 83-88
Author(s):  
Lu Liang Jia ◽  
Ai Jun Liu ◽  
Dao Xing Guo ◽  
Gong Chao
Keyword(s):  
Additive White Gaussian Noise ◽  
Code Rate ◽  
Modulation Scheme ◽  
Parity Check ◽  
Code Length ◽  
Soft Decision ◽  
Rate Code ◽  
Low Density Parity Check ◽  
Simulation Results ◽  
Slow Frequency

Low-Density Parity-Check code, for its admiring performance which is close to the Shannon limit, has attracted large attention in anti-jamming systems. In this paper, we studied the LDPC coded slow frequency-hopping (SFH) system and analyzed its performance with Multi-tone Interference (MTI). Three modulation schemes (BPSK, QPSK and 8PSK) are adopted in the system. Especially for 8PSK, we compared the performance of two different soft-decision demodulation schemes over additive white Gaussian noise (AWGN) channel. Also, the influences of code rate, code length, modulation scheme and jamming mode are analyzed and examined, respectively. Finally, some valuable guidelines for designing LDPC coded SFH system are proposed. Simulation results demonstrate that a desirable performance can be achieved with the appropriately designed LDPC in SFH system.

The Design and Analysis of Distributed Fountain Codes in Three-Source Single-Relay Networks

2014 ◽  
Vol 556-562 ◽  
pp. 6042-6045
Author(s):  
Han Qin Shao ◽  
Da Zhuan Xu ◽  
Xiao Fei Zhang
Keyword(s):  
Degree Distribution ◽  
Relay Networks ◽  
Fountain Codes ◽  
Asymptotic Performance ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Fountain Coding ◽  
Simulation Results ◽  
Single Relay ◽  
Ber Performance

A novel distributed fountain coding scheme for three-source single-relay networks is proposed. First, the robust Soliton distribution (RSD) is threefoldly deconvolved to get the degree distribution for each source performing encoding. Then the single relay performs re-encoding using certain degree distribution. The asymptotic performance of distributed fountain codes with three sources (DFC-3) is analyzed by the And-Or tree technique. Simulations of the proposed DFC-3 are evaluated and compared with other fountain coding schemes. Simulation results show that the overall degree distribution of DFC-3 is consistent with RSD, and the BER performance agrees with the results of asymptotic analysis. It also reveals that DFC-3 have good performance on lossless channels.

Blind Recognition of Recursive System Convolutional Codes

2014 ◽  
Vol 631-632 ◽  
pp. 816-819
Author(s):  
Jie Liu ◽  
Li Min Zhang ◽  
Zhao Gen Zhong
Keyword(s):  
Mathematical Model ◽  
Turbo Codes ◽  
Convolutional Codes ◽  
Recursive System ◽  
Novel Method ◽  
Simulation Results ◽  
Specific Implementation ◽  
The Mathematical Model ◽  
Blind Recognition ◽  
Implementation Steps

Recursive system convolutional codes (RSC codes) are the commonly used coding form for Turbo sub-encoders. For blind recognition problem of RSC codes, a novel method is proposed to recognize code parameters and generator polynomials. Firstly, code parameters are estimated by analyzing matrix constructed from the received codeword. Then, the mathematical model for recognition of generator polynomials is derived according to RSC codes’ characteristics, and the specific implementation steps are introduced. Finally, simulation results from Matlab show that the performance of the method is obviously more excellent than other methods, which indicates great significance to further research on Turbo codes.

Sign in / Sign up

Export Citation Format

Share Document