• 한국통신학회논문지
• /
• 제27권3B호
• /
• pp.251-258
• /
• 2002

이 논문에서는 여러 반송파 직접수열 부호분할 다중접속 시스템에서 적응 부호율 길쌈부호화 방법을 살펴본다. 여러 가지 부호율을 쉽게 다를 수 있고 부호기와 복호기 얼개가 간단하도록 부호율 호환 구멍 뚫은 길쌈부호를(rate compatible punctured convolutional code: RCPC code) 쓴다. 데이터 처리량이 가장 많아지도록, 신호 대간섭과 잡음비 추정을 바탕으로 하는 적응 부호율 시스템을 제안한다. 제안한 적응 부호율 여러 반송파 직접수열부호분할 다중접속 시스템을 쓰면 주파수 대역 효율을 높이고 주파수 다양성을 얻을 수 있음을 보인다.

• 대한전자공학회논문지
• /
• 제23권5호
• /
• pp.591-596
• /
• 1986

A binary continuous phase frequency shift keying (CPFSK), whose phase is a continuous function of time and instantaneous frequency is constant, is a bandwidth efficient constant envelope signalling scheme. A transmitting signal is formed by combined coding of a convolutional encoder and a binary CPFSK modulator. The signal is transmitted throuth additive white Gaussian noise(AWGN) channel. If the received signal is detected by a coherent maximum likelihood(ML) receiver, error probability can be expressed approximately in terms of minimum Euclidean distance. We propose rate 2/4 codes for the improvement of error performance without increating the data rate per bandwidth and the receiver complexity. Its minimum Euclidean distances are compared with those of rate \ulcornercodes as a function of modulation index and observation interval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권4호
• /
• pp.1689-1703
• /
• 2020

When data is transmitted over an unreliable channel, the error of the data packet may result in serious degradation. The multiple description coding (MDC) can solve this problem and save transmission costs. In this paper, we propose a deep multiple description coding network (MDCN) to realize efficient image compression. Firstly, our network framework is based on convolutional auto-encoder (CAE), which include multiple description encoder network (MDEN) and multiple description decoder network (MDDN). Secondly, in order to obtain high-quality reconstructed images at low bit rates, the encoding network and decoding network are integrated into an end-to-end compression framework. Thirdly, the multiple description decoder network includes side decoder network and central decoder network. When the decoder receives only one of the two multiple description code streams, side decoder network is used to obtain side reconstructed image of acceptable quality. When two descriptions are received, the high quality reconstructed image is obtained. In addition, instead of quantization with additive uniform noise, and SSIM loss and distance loss combine to train multiple description encoder networks to ensure that they can share structural information. Experimental results show that the proposed framework performs better than traditional multiple description coding methods.

• 대한전자공학회논문지
• /
• 제26권11호
• /
• pp.1743-1751
• /
• 1989

In this paper, we consider trellis-coding techniques with the convolutional encoder R=k/(k+1) for improving the reliability of digital transimission over bandlimited noisy PRS and 49-QPRS channels. Employing the R=k/(k+1) convolutional code for the PRS channel results in over 3 dB of coding gain comparing with the baseline system. The trellis-coded 49-QPRS system can be realized by combining the 9-QPRS system with the R=1/2 convolutiona code, which can be improved by over 2dB coding gain comparing with the 9-QPRS system. In additin, we study a method of avoiding the occurance of unlimited runs of identical output to prevent operation of timing error.

• Journal of Multimedia Information System
• /
• 제8권3호
• /
• pp.147-158
• /
• 2021

Versatile Video Coding (VVC) is the latest video coding standard developed by Joint Video Exploration Team (JVET). In VVC, the quadtree plus multi-type tree (QT+MTT) structure of coding unit (CU) partition is adopted, and its computational complexity is considerably high due to the brute-force search for recursive rate-distortion (RD) optimization. In this paper, we aim to reduce the time complexity of inter-picture prediction mode since the inter prediction accounts for a large portion of the total encoding time. The problem can be defined as classifying the split mode of each CU. To classify the split mode effectively, a novel convolutional neural network (CNN) called multi-level tree (MLT-CNN) architecture is introduced. For boosting classification performance, we utilize additional information including inter-picture information while training the CNN. The overall algorithm including the MLT-CNN inference process is implemented on VVC Test Model (VTM) 11.0. The CUs of size 128×128 can be the inputs of the CNN. The sequences are encoded at the random access (RA) configuration with five QP values {22, 27, 32, 37, 42}. The experimental results show that the proposed algorithm can reduce the computational complexity by 11.53% on average, and 26.14% for the maximum with an average 1.01% of the increase in Bjøntegaard delta bit rate (BDBR). Especially, the proposed method shows higher performance on the sequences of the A and B classes, reducing 9.81%~26.14% of encoding time with 0.95%~3.28% of the BDBR increase.

• 한국통신학회논문지
• /
• 제21권8호
• /
• pp.2063-2076
• /
• 1996

In this thesis, in order to apply a punctured convolutional codes to the trellis coded modulation(TCM), an efficient punctured trellis coded modulation(PTCM) based on the decomposition of the metric into orthogonal components is presented. Also, a simulation is performed in an additive white Gaussian noise(AWGN) and a rician fading channel modeling the mobile satellite channel. The PTCM combines punctured convolutional coding with MPSK modulation to provide a large coding gain in a power-limited or bandwidth-limited channel. However, in general the use of the punctured convolutional code structure in the decoder results in a performance loss in comparison to trellis codes, due to difficulties in assigning metrics. But, the study shows no loss in performance for punctured trellis coded MPSK in comparison to TCM, and what is more, the punctured convolutional codes results in some savings in the complexity of Viterbi decoders, compared to TCM of the same rate. Also, the results shows that the punctured trellis coded .pi./8 shift 8PSK is an attractive scheme for power-limited and band-limited systems and especially, the Viterbi decoder with first and Lth phase difference metrics improves BER performance by the mobile satellite channel.

• 정보와 통신
• /
• 제12권6호
• /
• pp.88-100
• /
• 1995

본 고에서는 디지털 위성방송 시스템의 구성요소중 channel부의 구조 및 기능분석을 국내 디지털 DBS를 기준으로 설명하였다. channel부는 channel coding과 modulation 기능을 수행한다. Channel coding은 Reed Solomon code, interleaving, convolutional code를 연집하여 사용하고, modulation은 QPSK와 raised cosine pulse shaping을 한다. 수신기의 channel부는 antenna, LNB, tuner, QPSK 복조기, Viterbi, deinterleaver, RS decoder로 구성되어있다.

• Journal of Communications and Networks
• /
• 제7권3호
• /
• pp.243-247
• /
• 2005

We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.187-196
• /
• 2003

We consider the use of error control coding in direct sequence-code-division multiple access (OS-COMA) systems that employ multiuser detection (MUO) and space diversity. The relative performance gain between Reed-Solomon (RS) code and convolutional code (CC) is well known in [1] for the single user, additive white Gaussian noise (AWGN) channel. In this case, RS codes outperform CC's at high signal-to-noise ratios. We find that this is not the case for the multiuser interference channel mentioned above. For useful error rates, we find that soft-decision CC's to be uniformly better than RS codes when used with DS-COMA modulation in multiuser space-time channels. In our development, we use the Gaussian approximation on the interference to determine performance error bounds for systems with low number of users. Then, we check their accuracy in error rate estimation via system's simulation. These performance bounds will in turn allow us to consider a large number of users where we can estimate the gain in user-capacity due to channel coding. Lastly, the use of turbo codes is considered where it is shown that they offer a coding gain of 2.5 dB relative to soft-decision CC.

• Journal of Information Processing Systems
• /
• 제19권2호
• /
• pp.232-239
• /
• 2023

Aiming at the poor compression quality of traditional image compression coding (ICC) algorithm, a multi-description ICC algorithm based on depth learning is put forward in this study. In this study, first an image compression algorithm was designed based on multi-description coding theory. Image compression samples were collected, and the measurement matrix was calculated. Then, it processed the multi-description ICC sample set by using the convolutional self-coding neural system in depth learning. Compressing the wavelet coefficients after coding and synthesizing the multi-description image band sparse matrix obtained the multi-description ICC sequence. Averaging the multi-description image coding data in accordance with the effective single point's position could finally realize the compression coding of multi-description images. According to experimental results, the designed algorithm consumes less time for image compression, and exhibits better image compression quality and better image reconstruction effect.