• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.637-642
• /
• 2014

In this paper, we propose a efficient shift index searching algorithm for design of the block LDPC codes. It is combined with the message-passing based cycle search algorithm and ACE algorithm. We can determine the shift indices by ordering of priority factors which are effect on the LDPC code performance. Using this algorithm, we can construct the LDPC codes with low complexity compare to trellis-based search algorithm and save the memory for storing the parity check matrix.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.700-707
• /
• 2014

In this paper, we propose the noise reduction method by using the eigenfilter in cyclic prefix system based on SNR. To obtain the signal eigenvectors for the eigenfiltering, we propose a method of obtaining the autocorrelation matrix by exploiting the circulant property of the received block which results from the cyclic extension of the OFDM symbol. Since the structures of the transmitter and the receiver are not changed, the proposed method is easy to apply to the conventional OFDM system. To verify the proposed method, we evaluate the persistency of excitation (POE) criterion for the input and demonstrate the effectiveness of the proposed method in the simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.846-852
• /
• 2006

The ${\kappa}$-error linear complexity is a ky measure of the stability of the sequences used in the areas of communication systems, stream ciphers in cryptology and so on. This paper introduces an efficient algorithm to determine the ${\kappa}$-error linear complexity and the corresponding error vectors of $p^m$-periodic binary sequences, where : is a prime and 2 is a primitive root modulo $p^2$. We also give a new sense about the ${\kappa}$-error linear complexity in viewpoint of coding theory instead of cryptographic results. We present an efficient algorithm for decoding binary cyclic codes of length $p^m$ and derive key properties of the minimum distance of these codes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.317-325
• /
• 2012

In this paper, we consider the encoding scheme of Low Density Parity Check codes. In particular, using the Jacket Pattern and circulant permutation matrices, we propose the simple encoding scheme of Richardson's lower triangular matrix. These encoding scheme can be extended to a flexible code rate. Based on the simple matrix process, also we can design low complex and simple encoders for the flexible code rates.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.63-69
• /
• 2008

In this paper, our goal is to find a power-effective protocol that improves the accuracy of transmission in sensor networks. Therefore we propose a cooperative communication protocol based on MRC(Maximal Ratio Combining) and cyclic code. In our proposal, one sensor node assists two others to communicate with a clusterhead that can get diversity effect and MRC can improve diversity effect also. The proposed protocol with cyclic code can correct error up to 3-bit and reduce decoding complexity compared with convolutional code. Simulation results reveal proposed protocol can save the network energy up to 6dB over single-hop protocol at BER(Bit Error Rate) of $10^{-2}$.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.6
• /
• pp.42-48
• /
• 2010

Joint Tactical Information Distribution System (JTIDS) uses cyclic code shift keying (CCSK) for baseband symbol modulation, in which 5-bit information is mapped to one of thirty two 32-chip sequences. It is a kind of direct sequence based spread spectrum communication. In this paper, the performance of non-coherent detection of CCSK using non-orthogonal 32-chip sequence is evaluated. And a 32-chip sequence with better performance is also proposed and compared with the conventional one.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.8 s.338
• /
• pp.1-10
• /
• 2005

In this paper, the explicit low density codes construction from the generalized permutation matrices related to algebra theory is investigated, and we design several Jacket inverse block matrices on the recursive formula and permutation matrices. The results show that the proposed scheme is a simple and fast way to obtain the low density codes, and we also Proved that the structured low density parity check (LDPC) codes, such as the $\pi-rotation$ LDPC codes are the low density Jacket inverse block matrices too.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.1-8
• /
• 2005

In this paper, we present a novel LDPC code construction called as semi-algebra low density parity check(LDPC) codes which is one kind of deterministic LDPC code based on dual-diagonal sub-matrix. The constructing method results in a class of high rate LDPC codes. Codes in this class have a large girth and good minimum distances. Furthermore, they can be implemented by simple parallel array architecture using cyclic shift register and perform well with the iterative decoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7A
• /
• pp.627-634
• /
• 2011

In this paper, a new frequency offset estimation method in OFDM system is suggested. To measure fractional part of frequency offset, the repetition feature of cyclic prefix and that of training sequence is adopted. Both method shows relatively large frequency offset estimation error under low SNR circumstances, but this error can be greatly reduced by joint measurement of cyclic prefix and inversely repeated training symbol such as primary advanced preamble (PA-preamble) of IEEE 802.16m IMT-Advanced WiMax system. In this paper, the performance of suggested frequency offset estimation method is verified in IEEE 802.16m IMT Advanced WiMax system, using its PA-preamble and cyclic prefixes of A-preambles.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.180-187
• /
• 2002

The decoding method using covering polynomials is an extended form of error-trapping decoding, and is a simple and effective means to implement decoders for cyclic codes. Covering polynomials can be used for soft-decision decoding as well as for decoding beyond the bounded distance of the code. The implementation complexity is proportional to the number of covering polynomials employed. In this paper, the soft-decision decoding procedure using covering polynomials is described, and the procedure is applied to the [23,12] Golay code. A new set of covering polynomials is derived for the procedure, which is presented as a generalized closed-form solution. The set can be efficiently utilized for decoding a class of cyclic codes including the Golay code. Computer simulation of the described procedure is performed to show the trade-offs between the decoder performance and complexity. It is demonstrated that soft-decision decoding of the Golay code using the derived set of covering polynomials has less than 0.2dB deviation from the optimal performance of maximum-likelihood decoding, with a reduced complexity when compared to the Chase Algorithm 2 combined with hard-decision decoding that has nearly identical performance.