• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1045-1050
• /
• 2010

This paper proposes a new $2{\times}2$ spatial-multiplexing(SM) scheme which is constructed by serially concatenating an orthogonal precoder with a conventional SM. Compared to the conventional SM, the proposed scheme achieves improved performance under erasure fading channels without any performance loss under non-erasure fading channels. Particularly the performance gain is more larger as a correlation value between two receive antennas increases.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.384-395
• /
• 2008

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.748-766
• /
• 2013

In this paper, we consider an infrastructure-vehicle-vehicle (I2V2V) based Vehicle Ad-hoc Networks (VANETs), where one base station multicasts data to d vehicular users with the assistance of r vehicular users. A Distributed Luby Transform (DLT) codes based transmission scheme is proposed over lossy VANETs to reduce transmission latency. Furthermore, focusing on the degree distribution of DLT codes, a Modified Deconvolved Soliton Distribution (MDSD) is designed to further reduce the transmission latency and improve the transmission reliability. We investigate the network behavior of the transmission scheme with MDSD, called MDLT based scheme. Closed-form expressions of the transmission latency of the proposed schemes are derived. Performance simulation results show that DLT based scheme can reduce transmission latency significantly compared with traditional Automatic Repeat Request (ARQ) and Luby Transform (LT) codes based schemes. In contrast to DLT based scheme, the MDLT based scheme can further reduce transmission latency and improve FER performance substantially, when both the source-to-relay and relay-to-sink channels are erasure channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1073-1077
• /
• 2010

This paper proposes a new 4-dimensional(4D) constellation-rotation(CR) method which obtains diversity gain of 4 under Rayleigh fading channels. The proposed scheme uses two consecutive CR operations for the constellation of QAM signals unlike a conventional 2-dimensional(2D) CR method using only one CR operation. The computer simulation results show that the new method outperforms the conventional one even more as both the channel code rate and the erasure ratio increase. In a point of system flexibility, the proposed scheme has a great advantage since the conventional 2D CR scheme can be simply implemented by only changing rotation angle values used in the proposed scheme.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.5
• /
• pp.733-739
• /
• 1987

In this paper, variable threshold detection with weighted pulse code modulation-encoded signals transmitted over Gaussian channels has been investigated. Each bit in the \ulcornerlaw PCM word is weighted according to its significance in the transmitter. It the output falls into the erasure zone, the regenerated sample replaced by interpolation or prediction. To overall system signal to noise ratio for BPSK/PCM speech signals of this technique has been found. When the input signal level was -17 db, the gains in overall signal s/n compared to weighted PCM and variable threshold detection were 5 db and 3 db, respectively. Computer simulation was performed generating signals by computer. The simulation was in resonable agreement with our theoretical prediction.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2439-2450
• /
• 1997

As recording densities increase in digital magnetic recording channels, the performances of digital detection techniques such as PRML and DFE degrade significantly due to nonlinear distortion in recording channels. The primary impediments for hgih-density recording are generally classified as nonlinear transition shift, which can be reduced substantially by the precompensation technique, and partial erasure which usually requires sophisticated nonlinear equalization techniques. In order to acheieve the highest density recording, accurate estimation of the parameters associated with these two noninear distortions is crucial. In this paper, a new estimation technique to distinguish these two different nonlinear effect using a proposed adaptive algorithm in time domain is presented. The effectiveness of the proposed adaptive approach to identify uniquely the nonlinear parameter with bias is demonstrated by computer simulation.

• 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 Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.961-967
• /
• 2014

Raptor codes are a class of rateless codes originally designed for binary erasure channels. This paper presents a compact set of mathematical expressions for iterative soft decoding of raptor codes. In addition, an early termination scheme is employed, and it is embedded in a single algorithm with the formula. In the proposed algorithm, the performance is enhanced by adopting iterative decoding, both in each inner and outer code and in the concatenated code itself between the inner and outer codes. At the same time, the complexity is reduced by applying an efficient early termination scheme. Simulation results show that our proposed method can achieve better performance with reduced decoding complexity compared to the conventional schemes.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.