• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.337-342
• /
• 2011

In 2009, polar codes, proposed by Arikan, are theoretically proven codes to achieve capacity with acceptable encoding and decoding complexity. Currently, polar codes using channel polarization phenomenon are studied in security and data compression fields etc. In this paper, we consider the practical communication system and propose the construction method of polar codes with finite length and fixed code rate. Also, we show the outstanding performance and corresponding construction method of polar codes found by heuristic simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.44-50
• /
• 2007

In typical MC-CDMA systems, different frequency-domain scrambling codes are randomly chosen from a given code set and then assigned to different subscriber stations using the same subcarrier set. When orthogonal codes are employed for the frequency-domain scrambling, the choice of the scrambling code does not affect the detection performance if the timing and frequency synchronizations are perfect and the channel characteristic is flat. However, in practical cases, inter-code interference often appears due to the broken code orthogonality. In this paper, the optimal order of allocating the orthogonal frequency-domain scrambling codes to new subscriber stations is derived under non-negligible timing offsets in MC-CDMA system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.133-138
• /
• 2003

가변길이 부호는 정보원(source)의 통계적인 특성을 이용하여 부호화 효율을 높이지만. 잡음이 심한 전송환경에선 비트에 대한 오류가 발생하면 심각하게 손상되는 단점을 가진다. 이러한 가변길이 부호의 문제를 해결하기 위해 양방향 가변길이 부호가 제안되었다. 양방향 가변길이 부호는 순방향과 역방향으로 복호가 가능하여 전송 오류로 인해 손상된 비디오 비트열에서 데이터를 복구할 수 있다. 부호의 자유거리(free distance)는 부호자체가 전송 오류에 얼마나 강인한지를 보여주는 척도로 사용된다. 양방향 가변길이 부호의 자유거리(free distance)의 최소 값은 1이므로 비디오 비트열 손상 자체를 방지할 수는 없다 본 논문에서는 자유거리(free distancs)의 최소 값을 증가시켜 전송오류에 더욱 강인한 새로운 양방향 가변길이 부호의 선계 기법을 제안한다. 제안된 알고리즘은 주어진 Huffman 부호와 평균부호길이 함수의 특성을 이용하여 자유거리의 조건을 만족하면서 동시에 부호화 효율을 높여 기존의 알고리즘보다 향상된 성능을 보여준다.

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

Luby transform (LT) codes are a class of ratelss codes, and they have capability of generating infinite length of parities with a given information length. These rateless codes can be effectively utilized to provide broadcasting and multicasting services where each user is in a different channel condition. For this reason, there have been a number of researches on the application of rateless codes for satellite systems. In this paper, by considering the current research status on rateless codes, we present VHLD implementation results of LT codes, for future hardware implementation for satellite systems. The results demonstrated in this paper can be utilized as a basic information on efficient utilization of rateless codes in the future satellite systems.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.11
• /
• pp.12-20
• /
• 2002

Serially concatenated multilevel coded modulation (SCMCM) is proposed in this paper. It is a combined scheme of the outer convolutional code and inner multilevel coded modulation (MCM) which is bandwidth-efficient coded modulation. And the performance of three schemes for decoding of the proposed SCMCM is compared and analyzed. As results of simulations, global iterative decoding with inner and outer code should be performed to improve the error performance as the number of iterations is increased. And the scheme which uses both local iterative multistage decoding in MCM and global iterative decoding with inner and outer code, called Scheme 3 in this paper, shows the best error performance among the three schemes considered in this paper. In addition, performance difference between this scheme and the others is increased as the signal to noise ratio (SNR) is increased. Therefore, Scheme 3 is considered to be the proper decoding scheme of SCMCM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.109-117
• /
• 2013

Polar codes are the first provable error correcting code achieving the symmetric channel capacity in a wide case of binary input discrete memoryless channel(BI-DMC). However, finite length polar codes have an error floor problem with successive-cancellation list(SCL) decoder. From previous works, we can solve this problem by concatenating CRC(Cyclic Redundancy Check) codes. In this paper we propose to make polar codes having extended-minimum distance from original polar codes without outer codes using correlation with generate matrix of polar codes and that of RM(Reed-Muller) codes. And we compare performance of proposed polar codes with that of polar codes concatenating CRC codes.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.9
• /
• pp.235-244
• /
• 2016

Automotive symbols are more widely needed for new, convenient driving devices in automobiles. Good automotive symbols should be detectable, identifiable at first glance, easily learned, recognizable, and produce quick responses after practice. In this paper, a methodology for developing and evaluating automotive symbols is suggested. It includes multiple tests, such as comprehension, perceptual quality, appropriateness, and integrated evaluation. 28 symbols were tested and evaluated by the suggested methodology for convenient driving systems, such as a lane departure warning system (LDWS), cruise control (CCS), and a collision warning system (CWS). Most of the KS R ISO 2575 symbols had higher scores of comprehension, perceptual quality, and appropriateness, but the sunroof and camera symbols had lower scores. Standard symbols with several new functions should be developed. This methodology could be useful for developing and evaluating automotive symbols.

• The Magazine of the IEIE
• /
• v.11 no.1
• /
• pp.11-18
• /
• 1984

부호이론(coding theory)은 그 내용이 매우 광범위할 뿐 아니라 군론, 환론, 본론 등 축예대수학과 확율론 및 수리통계학을 배경으로 발전된 학문이기 때문에 일반 속자를 상대로 논술하기에는 적지 않은 난점이 있다. 그렇다고 단순히 용어나열에만 그칠 수도 없고, 이론에 치중한 논문식으로 쓸수도 없으므로 대학 4년생을 위한 강의수준으로 소개하겠으며 3회에 걸쳐 선형부호(linear code), 순회부호(cyclic code), 길쌈부호(convolutional code)의 순으로 연재하기로 하겠다.

• Information and Communications Magazine
• /
• v.31 no.9
• /
• pp.65-69
• /
• 2014

연속 변수 양자 오류 정정 부호는 전자의 스핀, 광자의 편광 등으로 나타내는 불연속 변수와는 다르게 빛의 진폭 및 위상처럼 연속적인 값을 가지는 양자 정보의 오류를 수정하는 기법이다. 본 논문에서는 안정 부호 형태를 기반으로 한 연속 변수 양자 오류 정정 부호의 구성을 살펴보고, 불연속 양자 오류 정정 부호와의 차이점을 알아본다.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.7
• /
• pp.395-401
• /
• 2005

In this paper, the high-band codec for bandwidth scalable wideband speech codec is proposed. The wideband input speech signal is separated into low-band signal and high-band signal, and the low-band signal is encoded by the standard narrow-band speech codec and the high-band signal is encoded by the proposed codec. In the high-band codec. the signal is transformed into frequency domain by MLT on a subframe basis, and MLT coefficients are splitted into magnitude and sign for quantization. The magnitudes of MLT coefficients are arranged into several time-frequency bands and each band is quantized in 2D-DCT domain, where the low-band information is utilized for better performance. The sign of MLT coefficient is quantized based on a priority selection process with the weighting measurement. The objective and subjective performance of wideband speech codec including the proposed high-band codec is measured, and it is confirmed that the proposed codec has better performance than 32kbps G.722.1.