• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.310-317
• /
• 2006

In this paper, we propose a new sequential message-passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This new decoding algorithm shows better bit error rate(BER) performance than that of the conventional message-passing decoding algorithm, especially for small number of iterations. Analytical results tell us that as the number of partitioned subsets of check nodes increases, the BER performance becomes better. We also derive the recursive equations for mean values of messages at variable nodes by using density evolution with Gaussian approximation. Simulation results also confirm the analytical results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.442-449
• /
• 2005

In this paper, we introduce three kinds of simplified high-speed decoding algorithms for turbo product decoder. First, A parallel decoder structure, the row and column decoders operate in parallel, is proposed. Second, HAD(Hard Decision Aided) algorithm is used for early-stopping algorithm. Lastly, P-Parallel TPC decoder is a parallel decoding scheme, processing P rows and P columns in parallel instead of decoding one by one as that in the original scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.227-234
• /
• 1989

In this paper, a new receiver for a frequency-hopped multilevel FSK system for mobile Communications is presented. This new receiver provides an implementation advantage by eliminating unecessary energy detection of all the frequency channels. A performace analysis of the proposed system is carried out by using the union bound. We show that an optimim number of message bits that minimize the word error probability exists for a given number of simultaneous users. This scheme is a generalization of the MFSK system that allows the message bits to be uaried, making it possible for designers to increase the flexibility of implementation. Error probabilities are calculated in the case of fixed bandwidth and fixed tone repetition number. The effect of using error-correcting coding is considered.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3C
• /
• pp.287-294
• /
• 2010

MB-OFDM UWB system will adopt LDPC codes to enhance the decoding performance with higher data rates. In this paper, we will consider algorithm and architecture of the LDPC codes in MB-OFDM UWB system. To suggest the hardware efficient LDPC decoder architecture, LLR(log-likelihood-ration) calculation algorithms and check node update algorithms are analyzed. And we proposed the architecture of LDPC decoder for the high throughput application of Wimedia UWB. We estimated the feasibility of the proposed architecture by implementation in a FPGA. The implementation results show our architecture attains higher throughput than other result of QC-LDPC case. Using this architecture, we can implement LDPC decoder for high throughput transmission, but it is 0.2dB inferior to the BP algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.423-431
• /
• 2010

In this paper, a modified sum-product algorithm to correct bit errors captured within the trapping sets, which are produced in decoding of low-density parity-check (LDPC) codes, is proposed. Unlike the original sum-product algorithm, the proposed decoding method consists of two stages. Whether the main cause of decoding failure is the trapping sets or not is determined at the first stage. And the bit errors within the trapping sets are corrected at the second stage. In the modified algorithm, the set of failed check nodes and the transition patterns of hard-decision bits are exploited to search variable nodes in the trapping sets. After inverting information of the variable nodes, the sum-product algorithm is carried out to correct the bit errors. As a result of simulation, the proposed algorithm shows continuously improved error performance with increase in the signal-to-noise ratio. It is, therefore, considered that the modified sum-product algorithm significantly reduces or possibly eliminates the error floor in LDPC codes.

• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.342-348
• /
• 2015

High speed implementation of digital filters is required in high data rate applications such as hard-wired wide band modem and high resolution video codec. Since the critical path of the digital filter is the MAC (multiplication and accumulation) circuit, the filter coefficient with sparse non-zero bits enables high speed implementation with adders of low hardware cost. Compressive sensing has been reported to be very successful in sparse representation and sparse signal recovery. In this paper a filter design method for digital FIR filters with CSD (canonic signed digit) coefficients using compressive sensing technique is proposed. The sparse non-zero signed bits are selected in the greedy fashion while pruning the mistakenly selected digits. A few design examples show that the proposed method can be utilized for designing sparse CSD coefficient digital FIR filters approximating the desired frequency response.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.11
• /
• pp.999-1011
• /
• 2015

In modern electronic warfare, RADAR is under constant threat of ECM(Electronic Counter Measures) signals from nearby jammers. The conventional linear frequency modulated(Linear-FM) waveform is easy to be intercepted to estimate its signal parameters due to its periodical phase transition. Recently, APCN(Advanced Pulse Compression Noise) waveform using random amplitude and phase transition was proposed for LPI(Low probability of Intercept). But random phase code signals such as APCN waveform tend to be sensitive to Doppler frequency shift and result in performance degradation during moving target detection. In this paper, random phase and code rate transition based radar waveform(RPCR) is proposed for Doppler tolerance improvement. Time frequency analysis is carried out through ambiguity analysis to validate the improved Doppler tolerance of RPCR waveform. As a means to measure the vulnerability of the proposed RPCR waveform against LPI, WHT(Wigner-Hough Transform) is adopted to analyze and estimate signal parameters for ECCM(Electronic Counter Counter Measures) application.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.768-775
• /
• 2011

Since error compensation schemes guaranteeing high reliability are required in wireless communication systems for the transmission of the large amount of data, as an efficient error compensation scheme the turbo HARQ scheme combining automatic repeat request and turbo coding has been studied in many places in the literature. In the case of conventional turbo HARQ schemes, the transmitter recognizing NAK signals repetitively sends the whole unit packet to the receiver although the received packet can be partially correctable. Through two successive processes, selection of uncorrectable error data and retransmission of only the relevant parts of the information data, transmission efficiency can be improved. In this paper, we present an error data selection criterion for retransmission using the sign transitions of A Posteriori values and propose a tubo HARQ scheme based on the partial retransmission technique. Through a computer simulation, we show and analyze the performance of the proposed scheme with transmission efficiency.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.36-47
• /
• 2020

The improved belief-propagation-based algorithms, such as normalized min-sum algorithm (NMSA) or offset min-sum algorithm (OMSA), are widely used to decode LDPC(Low-Density Parity-Check) codes because they are less computationally complex and work well even at low SNR(Signal-to-Noise Ratio). However, these algorithms work well only when an appropriate normalization factor or offset value is used. A new method that uses a CMD(Check Node Message Distribution) chart and least-square method, which has been recently proposed, has advantages on computational complexity over other approaches to get optimal coefficients. Furthermore, this method can be used to derive coefficients for each iteration. In this paper, we apply this method and propose an algorithm to derive a combination of normalization factor and offset value for a combined normalized and offset min-sum algorithm to further improve the decoding of LDPC codes. Simulations on the next-generation broadcasting standards, ATSC 3.0 LDPC codes, prove that a combined normalized and offset min-sum algorithm which takes the proposed coefficients as correction coefficients shows the best BER performance among other decoding algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.1
• /
• pp.141-150
• /
• 2010

In this paper, performance of a turbo-coded OFDM system is analyzed and simulated in a power line communication channel. Since the power line communication system typically operates in a hostile environment, turbo code has been employed to enhance reliability of transmitted data. The performance is evaluated in terms of bit error probability. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is improved 3dB by increasing the number of iterations, 2 to 8, and interleaver length of a turbo encoder, 100 to 5000. The results in this paper can be applied to OFDM-based high-speed power line communication systems.