• 한국통신학회논문지
• /
• 제35권11A호
• /
• pp.1045-1050
• /
• 2010

본 논문에서는 기존의 공간 다중화(Spatial-Multiplexing, SM) 기법과 직교 선부호기를 직렬 연접한 새로운 $2{\times}2$ SM 기법을 제안한다. 실험 결과 제안된 기법은 기존의 SM과 비교하여 erasure가 발생하지 않는 채널 환경에서는 기존의 SM과 동일한 성능을 가지면서 erasure 채널 환경에서는 큰 성능 향상이 발생한다. 특히 수신 안테나들 사이에 상관 값이 커질 경우 더 큰 성능 향상이 발생한다.

• Journal of Communications and Networks
• /
• 제10권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)
• /
• 제7권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.

• 한국통신학회논문지
• /
• 제35권11A호
• /
• pp.1073-1077
• /
• 2010

본 논문은 Reyleigh 페이딩 채널 환경에서 다이버시티 이득 4를 얻는 새로운 4차원 성상회전(constellation rotation, CR) 기법을 제안한다. 제안된 기법은 기존의 한 변의 CR을 이용한 2차원 CR 기법과 달리 연속된 두 QAM 신호들에 대하여 두 번의 CR을 수행함으로써 동작한다. 전산 실험 결과 새로운 기법은 기존의 기법에 비해 채널 부호화의 전송률과 페이딩 채널 내 erasure 확률 값이 증가할수록 더욱 큰 성능 향상을 보인다. 또한 새로운 기법은 사용되는 각도 값들을 바꾸어 기존의 기법으로 쉽게 전환 가능하며 따라서 송신 시스템 구현 측면에서 큰 장점을 갖는다.

• 대한전자공학회논문지
• /
• 제24권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
• /
• 제15권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.

• 한국통신학회논문지
• /
• 제22권11호
• /
• pp.2439-2450
• /
• 1997

디지털 자기 기록 채널의 기록 밀도가 증가하면 기록 채널의 비선형 왜곡이 발생하고, 이로 인해 PRML이나 DFE와 같은 디지털 검출 방식의 성능이 급격히 저하된다. 고밀도 기록을 저해하는 요소는 비선형 천이 이동과 부분 삭제로 분류되는데, 이 중 비선형 천이 이동은 사전 보상 기법에 의해 보상 가능하고, 부분 삭제 현상의 보상을 위해서는 정교한 비선형 동화 기법이 필요하다. 고밀도 기록을 달성하기 위해서는 이러한 비선형 왜곡과 관련된 파라메타의 정확한 추정이 매우 중요하다. 본 논문에서는 시간 영역에서 제안된 적응 알고리듬을 사용하여 위의 두 비선형 왜곡 영향을 분리할 수 있는 새로운 추정 기법을 논하고, 제안된 적응 방식으로 비선형 파라메타를 바이어스 없이 추정할 수 있음을 컴퓨터의 실험을 통해 확인하였다.

• 전자공학회논문지
• /
• 제50권8호
• /
• pp.3-14
• /
• 2013

본 논문에서는 어떠한 이진 입력 이산 퀀텀채널(quantum channel)이 주어지더라도 대칭 용량을 달성할 수 있는 qubit(quantum bit)를 생성하기 위해, 극(polar) 퀀텀 채널 코딩이라 부르는 퀀텀 채널의 결합과 분리 형태를 제시한다. 현재의 용량은 동등 확률을 갖는 임의의 qubit 입력에 따라서 결정된다. 퀀텀채널의 분극은 대칭채널이 1에 근접하면 rate 1로 아니면 rate 0으로 전송하는 채널을 통해 퀀텀 데이터를 부분적으로 전송하는 퀀텀 오류정정 부호화에 아주 적합하다.

• 한국멀티미디어학회논문지
• /
• 제17권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
• /
• 제11권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.