• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1144-1158
• /
• 2016

In this paper, delay-constrained data transmission is considered over error-prone networks. Network coding is deployed for efficient information exchange, and an approximate decoding approach is deployed to overcome potential all-or-nothing problems. Our focus is on determining the cluster size and its impact on approximate decoding performance. Decoding performance is quantified, and we show that performance is determined only by the number of packets. Moreover, the fundamental tradeoff between approximate decoding performance and data transfer rate improvement is analyzed; as the cluster size increases, the data transfer rate improves and decoding performance is degraded. This tradeoff can lead to an optimal cluster size of network coding-based networks that achieves the target decoding performance of applications. A set of experiment results confirms the analysis.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.117-121
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

• Journal of information and communication convergence engineering
• /
• 제3권2호
• /
• pp.72-75
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

• 전자공학회논문지
• /
• 제53권6호
• /
• pp.46-52
• /
• 2016

3개 이상의 송신안테나를 사용하고, 개루프 상황 하에서 준직교 시공간 블록 코드(Quasi-Orthogonal STBC, QO-STBC)는 완전한 전송률 및 최대의 다중화 이득에 근접한 효과를 얻을 수 있는 코드로 기존에 제안되어 왔다. 그러나, 기존의 QO-STBC는 검출행렬의 간섭성분으로 인한 성능 열화 및 높은 복호 복잡도를 요구하는 단점이 있다. 이에 따라 최근에 이러한 QO-STBC에 특정 로테이션 행렬을 곱해주는 간단한 복호를 통해 복호 복잡도를 줄이면서 간섭 성분을 제거하는 방법이 제안되었고, 본 논문에서는 이를 좀 더 일반화하여 EVD(Eigenvalue Decompostion) 기법을 이용하여 간섭성분을 제거하는 방법을 제안한다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권4호
• /
• pp.39-47
• /
• 2021

Lempel-Ziv coding is one of the most famous source coding schemes. The output of this source coding is usually a non-uniform code, which requires additional source coding, such as arithmetic coding, to reduce a redundancy. However, this additional source code increases complexity and decoding latency. Thus, this paper proposes the optimal maximum a-posteriori (MAP) receiver for non-uniform source non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC). First, we derive an analytical expression of the bit-error rate (BER) for non-uniform source NOMA with SSC. Then, Monte Carlo simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform source. Moreover, we also show that the BER of an approximate analytical expression is in a good agreement with the BER of Monte Carlo simulation. As a result, the proposed optimal MAP receiver for non-uniform source could be a promising scheme for NOMA with SSC, to reduce complexity and decoding latency due to additional source coding.

• 한국통신학회논문지
• /
• 제31권4C호
• /
• pp.303-309
• /
• 2006

By combining the space-time diversity technique and iterative turbo codes, space-time turbo codes(STTCS) are able to provide powerful error correction capability. However, the multi-path transmission and iterative decoding structure of STTCS make the decoder very complex. In this paper, we propose a low complexity decoder, which can be used to decode STTCS as well as general iterative codes such as turbo codes. The efficient implementation of the backward recursion and the log-likelihood ratio(LLR) update in the proposed algorithm improves the computational efficiency. In addition, if we approximate the calculation of the joint LLR by using the approximate ratio(AR) algorithm, the computational complexity can be reduced even further. A complexity analysis and computer simulations over the Rayleigh fading channel show that the proposed algorithm necessitates less than 40% of the additions required by the conventional Max-Log-MAP algorithm, while providing the same overall performance.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• 전자통신동향분석
• /
• 제33권5호
• /
• pp.13-23
• /
• 2018

Deep learning is a promising solution to a number of complex problems based on its inherent capability to approximate almost all types of functions without the demand for handcrafted feature extraction. New wireless transmission and access schemes based on deep learning are being increasingly proposed as substitutes for existing approaches, providing a lower complexity and better performance gain. Among such schemes, a communications system is viewed as an end-to-end autoencoder. The learning process applied in autoencoders can automatically deal with some nonlinear or unknown properties in communications systems. Deep learning can also be used to optimize each processing block for required tasks such as channel decoding, signal detection, and multiple access. On top of recent related research trends, we suggest appropriate research approaches for communications systems to adopt deep learning.

• 한국통신학회논문지
• /
• 제36권6A호
• /
• pp.577-586
• /
• 2011

현대 디지털 통신 시스템에서는 여러 가지 열화 조건을 극복하기 위하여 거의 모든 시스템에서 오류정정 부호를 사용하며, 최근에는 반복적인 복호 기법으로 우수한 복호 성능 도출이 가능한 터보부호나 저밀도 패리티 검사부호 등을 사용하는 시스템이 늘고 있는 추세이다. 특히 반복적인 복호 방법으로 성능을 향상 시키는 부호를 다중안테나 시스템에서 사용하기 위해서는 수신단에서 송선 신호를 검출할 때 연판정된 채널 이득값의 계산이 필수적으로 요구된다. 본 논문에서는 반복 복호 기법을 사용하는 다중안테나 시스템에서 효과적으로 연판정 값을 검출하는 방법에 대해 살펴보고, 여러 가지 MIMO 검출 방법에 대하여 그 유도 과정을 제시한다. 또한, 유도된 연판정 검출 방법에 대한 시뮬레이션 결과를 제시하여, 제안된 방식이 적은 복잡도로 우수한 성능을 얻을 수 있음을 보인다.

• 한국정보처리학회논문지
• /
• 제7권11호
• /
• pp.3566-3575
• /
• 2000

본 논문에서는 MPEG2 비디오 스트림에서 완전한 복호화 과정없이 직접 얻을 수 있는 압축 정보들을 이용하고 간단하고 효과적인 카메라 움직임(Camera Operation) 정보 추출방법을 제안하였다. 제안된 방법은 순서적이지 못한 움직임 벡터를 갖는 MPEG2 비디오 스트림에서, 선지식으로 알고있는 예측 프레임들의 속성을 이용하여 움직임 벡터(motion Vector)로부터 광 플로우(optical flow)를 추출하였으며, 일반화된 Hough 변환기법 이용하여 카메라 움직임 모델의 기본 요소인 팬(Pan), 틸트(Tilt), 줌(Zoom) 등을 근사적으로 추정하였다. 제안된 방법은 농구경기 및 축구경기 비디오에 대해 적응하여 기존의 최소자승방법(Least Mean Square) 방법보다 양호한 실험결과를 얻을 수 있었다. 제안된 카메라 움직 추정은 비디오 스트림에서 직접 정보를 얻음으로써 계산속도의 향상은 물론, 카메라의 움직임을 활용하는 내용기반의 비디오 검색 및 분석에서 유용한 요소 기술이 되리라고 기대된다. 또한 MPEG2 비디오 스트림에서 이러한 개발 기술들은 압축영상을 복호화 하지않고 객체들의 움직임만을 탐색하거나 추적하는데 활용될 것으로 예상된다.