• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2713-2717
• /
• 2011

To transmit data from straggling sensors in water-processing basic industries etc., used Binary-CDMA system has safety voluntarily. But Binary-CDMA is necessity that react very sensitively in environment change as defense about hacking and cracking of various way that change suddenly. Therefore, this paper is that see added cryptographic algorithm for safety and easy update on correlator that a bottle-neck phenomenon is happened in Binary-CDMA to solve problem that is such. Added cryptographic algorithm does to communicate safe information in channel that is not safe as that achieve 1:1 confrontation for sensors by symmetric cryptographic algorithm.

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

We demonstrate a fashion of quantum channel combining and splitting, called polar quantum channel coding, to generate a quantum bit (qubit) sequence that achieves the symmetric capacity for any given binary input discrete quantum channels. The present capacity is achievable subject to input of arbitrary qubits with equal probability. The polarizing quantum channels can be well-conditioned for quantum error-correction coding, which transmits partially quantum data through some channels at rate one with the symmetric capacity near one but at rate zero through others.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.110-113
• /
• 2014

In this paper, we address a problem of finding the optimum inner and outer code rates for a concatenated code in Gaussian binary symmetric channels. Clearly, as the inner code rate decreases, the error detection capability of the inner code increases. However, decreasing the inner code rate implies a decrease in error-correction capability of the outer code when overall code rate is fixed. With this notion in mind, we examine the optimum distribution of redundancy on the outer and inner codes to achieve a maximum performance gain in the concatenated coding scheme. Our analysis shows that the maximum coding gain can be obtained when the inner code rate is maximized and the outer code rate is minimized under the constraint of total code rate is fixed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.24-36
• /
• 2011

In this paper, we verify the channel synthesis and decomposition of polar codes using successive cancellation decoding algorithm over binary discrete memoryless symmetric channel by modifying Arikan's algebraic formular on encoding and decoding of polar codes. In addition, we found that information bits are sent by efficiently consisting of polar codes with their size $2^n$ through polarizing matrix ${G_2}^{{\otimes}n}$ over binary discrete memoryless symmetric channel W. Expecially, if $N{\geq}2$, the complexity of Arikan's encoding and decoding for polar codes is O($Nlog_2N$). Furthermore, we found that polar codes are one of the solution to the challenging problems for the multipoint communication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.127-139
• /
• 2014

In this paper, we present two signal processing techniques for designing binary error correction codes for Multi-Level Cell(MLC) NAND flash memory. MLC NAND flash memory saves the non-binary symbol at each cell and shows asymmetric channel LLR l-density which makes it difficult to design soft-decision binary error correction codes such as LDPC codes and Polar codes. Therefore, we apply density mirroring and EM algorithm for approximating the MLC NAND flash memory channel to the binary-input memoryless channel. The density mirroring processes channel LLRs to satisfy roughly all-zero codeword assumption, and then EM algorithm is applied to l-density after density mirroring for approximating it to mixture of symmetric Gaussian densities. These two signal processing techniques make it possible to use conventional code design algorithms, such as density evolution and EXIT chart, for MLC NAND flash memory channel.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.10
• /
• pp.14-27
• /
• 2009

Polar Code was proposed by Turkish professor Erdal Arikan in 2006 as an idea that splitted input channel is increasing the cutoff rate. The channel polarization consisted of code sequences with symmetric high rate capacity in a given B-DMC(Binary-input Discrete Memoryless Channel) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. The channel polarization is said to a set of given N independent outputs of B-DMC W. In other word, N increases when N is a set of binary-input channels {$W^{(i)}_N\;:\;1{\leq}\;i\;{\leq}\;N$}, in I{WN(i)} as the fraction of indices is near to 1, which is approaching to I(W), and it is near to 0, then to 1-I(W), where I(W) presents high rates in reliable wireless communication channel as inputs of W with equal frequences. After all, {WN(i)} is shown to be a state of channel coding. On the based on this Polar codes, this paper analyzes Polar coding and decoding of Arikan and propose Radix4 Polar coding newly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.219-228
• /
• 2010

In this paper, performance of RS (Reed-Solomon), turbo and LDPC (low density parity check) code in the binary symmetric erasure channel is investigated. When the average erasure length is reduced, the frequency of short erasures is increased. The RS code shows serious performance degradation in such an environment since decoding is carried out symbol-by-symbol. As the erasure length is increased, however, the RS code shows much improved en-or performance. On the other hand, the message and corresponding parity symbols of the turbo code can be erased at the same time for the long erasures. Accordingly, iterative decoding of the turbo code can not improve error performance any more for such a long erasure. The LDPC code shows little difference in error performance with respect to the variation of the average erasure length due to the virtual interleaving effect. As a result, the LDPC code has much better erasure decoding performance than the RS and turbo code.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.91-103
• /
• 2015

This paper presents "The 3-User NOR switching channel based on interference decoding with receiver cooperation" in succession to "Jeju Jong Nang channel code I, II". The Jeju Jong Nang code is considered as one of the earliest human binary coded communication (HBCC) in the world with a definite "1" or "0" binary symbolic analysis of switching circuits. In this paper, we introduce a practical example of interference decoding with receiver cooperation based on the three user Jong Nang NOR switching channel. The proposed system models are the three user Jong Nang (TUJN) NOR logic switching on-off, three-user injective deterministic NOR switching channel and Gaussian interference channel (GIC) with receiver cooperation. Therefore, this model is well matched to Shannon binary symmetric and erasure channel capacity. We show the applications of three-user Gaussian interference decoding to obtain deterministic channels which means each receiver cooperation helps to adjacent others in order to increase degree of freedom. Thus, the optimal sum rate of interference mitigation through adjacent receiver cooperation achieves 7 bits.

• Journal of Korea Society of Industrial Information Systems
• /
• v.2 no.2
• /
• pp.219-228
• /
• 1997

The Fano metric is the maximum likelihood decoding choice for convlutional code for binary symmetric channel. The Fano metric assumes that it has previous knowledge of channel error probability. However, the bit errors in real channel occur in bursts and the channel error probability can not be known exactly. Thus, the Fano metric is not the maximum likelihood choice for bursty-noise channel. In this paper universal metri which dose not require the previous knowlege of the channel transition probability is used for sequential decoding. It is shown that the complexity of the universal is much less than that of the Fano metric bursty-noise channel, since it is estimated on a branch by branch basis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5361-5374
• /
• 2016

Combining channel coding and network coding in a physical layer in a fading channel, generalized joint channel-network coding (G-JCNC) is proved to highly perform in a two-way relay channel (TWRC). However, most relevant discussions are restricted to symmetric networks. This paper investigates the G-JCNC protocols in an asymmetric TWRC (A-TWRC). A newly designed encoder used by source nodes that is dedicated to correlate codewords with different orders is presented. Moreover, the capability of a simple common non-binary decoder at a relay node is verified. The effects of a power match under various numbers of iteration and code lengths are also analyzed. The simulation results give the optimum power match ratio and demonstrate that the designed scheme based on G-JCNC in an A-TWRC has excellent bit error rate performance under an appropriate power match ratio.