• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.131-133
• /
• 2005

In this paper, we proposed the program module that expand output points when increased of the output machine for the design of process control system with PLC. In order to incense output points we need the decoding. There is a hardware decoding and a software decoding. In this paper, we proposed the decoding program module which is a software decoding and confirmed feasibility through a simulation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.21-27
• /
• 2013

In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.

• Communications of Mathematical Education
• /
• v.6
• /
• pp.371-381
• /
• 1997

Let p be an odd prime number. We introduce simple and useful decoding algorithm for orthogonal Latin square codes of order p. Let H be the parity check matrix of orthogonal Latin square code. For any x ${\in}$ GF(p)$^{n}$, we call xH$^{T}$ the syndrome of x. This method is based on the syndrome decoding for linear codes. In L$_{p}$, we need to find the first and the second coordinates of codeword in order to correct the errored received vector.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.657-660
• /
• 2011

Differential detection algorithm for DBO-CSS based on maximum signal energy detection (MSED) using viterbi algorithm is proposed. In order to mitigate SNR degradation caused by differential decoding, a modified viterbi algorithm with so called correlation metric (CM) in every state is proposed. It is shown that the performance gain of the proposed algorithm when compared with that of the conventional differential detection with the block decoding algorithm is about 2.5dB at BER = $10^{-5}$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1736-1738
• /
• 2016

In modern digital communication systems adapting high-order modulation and high performance channel code, log-likelihood ratios involving the repeated calculations of the logarithm of sum of exponential functions are necessary for demodulation and decoding. In this paper, the approximation methods called Min and MinC are applied to demodulation and decoding together and their complexity and joint performance are analyzed.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.736-742
• /
• 2015

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

• Current Optics and Photonics
• /
• v.2 no.5
• /
• pp.422-430
• /
• 2018

Rolling shutter operation of CMOS cameras can be utilized in optical camera communications in order to transmit data from an LED to mobile devices such as smart-phones. From temporally modulated light, a spatial flicker pattern is obtained in the captured image, and this is used for signal recovery. Due to the degradation of rolling shutter images caused by light smear, motion blur, and focus blur, the conventional decoding schemes for rolling shutter cameras based on the pattern width for 'OFF' and 'ON' cannot guarantee robust communications performance for practical uses. Aside from conventional techniques, such as polynomial fitting, histogram equalization can be used for blurry light mitigation, but it requires additional computation abilities resulting in burdens on mobile devices. This paper proposes a transition-based decoding scheme for rolling shutter cameras in order to offer simple and robust data decoding in the presence of image degradation. Based on the designed synchronization pulse and modulated data symbols according to the LED dimming level, the decoding process is conducted by observing the transition patterns of two sequential symbol pulses. For this, the extended symbol pulse caused by consecutive symbol pulses with the same level determines whether the second pulse should be included for the next bit decoding or not. The proposed method simply identifies the transition patterns of sequential symbol pulses other than the pattern width of 'OFF' and 'ON' for data decoding, and thus, it is simpler and more accurate. Experimental results ensured that the transition-based decoding scheme is robust even in the presence of blurry lights in the captured image at various dimming levels

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1452-1457
• /
• 2005

In the QR Decomposition-based (QRD) decoding class, the system performance is sensitive to the error propagation. Thus, it is critical to correctly decode the previous layers. One apprach to desensitize the error propagation is to propose the optimal decoding order of layers. In this wort we propose a new extended-list Soled QRD-based (SQRD) decoding approach. In the proposed decoding scheme, the solution of the few first layers is extended as the list of promising possible solutions. By doing so, the diversity of the lowest layer is increased. As a result, the system performance is less sensitive to the error propagation than its counterparts. The proposed approach is verified by the computer simulation results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.84-93
• /
• 2000

The conventional fractal decoding was implemented to IFS(iterated function system) for every range regions But a part of the range regions can be decoded without the iteration and there is a data dependence regions In order to decode $R{\times}R$ range blocks, It needs $2R{\times}2R$ domain blocks This decoding can be analyzed to the dependence graph The vertex of the graph represents the range blocks, and the vertex is classified into the vertex of the range and domain The edge indicates that the vertex is referred to the other vertices The in-degree and the out-degree are defined to the number of the edge that is entered and exited, respectively The proposed method is analyzed by a dependence graph to the fractal code, and the decoding order is recomposed by the information of the out-degree That is, If the out-degree of the vertex is zero, then this vertex can be used to the vertex with data dependence Thus, the proposed method can extend the data dependence regions by the recomposition of the decoding order As a result, the Iterated regions are minimized without loss of the image quality or PSNR(peak signal-to-noise ratio), Therefore, it can be a fast decoding by the reducing to the computational complexity for IFS in the fractal Image decoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.402-406
• /
• 2005

A multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) system using low-density parity-check (LDPC) code and iterative decoding is presented. The iterative decoding is performed by combining the zero-forcing technique and LDPC decoding through the use of the 'turbo principle.' The proposed system is shown to be effective with high order modulation and outperforms the space frequency block code (SFBC) method with iterative decoding.