• 한국전자파학회지:전자파기술
• /
• 제4권3호
• /
• pp.54-62
• /
• 1993

이 논문에서는 다중 TCM (Multiple Trellis-Coded Modulation, MTCM)을 적용하여 변조 시스템의 성능 을 향상 시컨 트렐리스 부호화된 8DPSK를 구성하고 그 성능을 분석한다. 또한 BER(Bit Error Rate)의 향상 을 위해 다중 심볼 차동 검파 방식을 적용한다. 모탤링한 채덜은 디지틀 위성 이동 통신 채널인 라이시안 페이 딩(Rician fading) 채널이다. 디코딩 방볍은 비터비 알고리듬을 사용하며, 연집 에러에의한 비터비 디코더의 에러 전파를 막기위해 인터리빙을 사용한다. 컴퓨터 시율레이션올 통하여 다중 TCM파 다중 심벌 차동 겁파를 적용한 트렐리스 부호화된 8DPSK는 동일한 대역폭 효율을 갖는 부호화되지 않은 차동 변조 방식보다 향상된 성능을 보임을 알 수 있다. 또한 페이딩 환경에서는 인터리빙 방법이 성능 향상에 중요함을 알 수 있다.

• Journal of Communications and Networks
• /
• 제9권1호
• /
• pp.50-55
• /
• 2007

We propose to apply chip interleaving and iterative detection to self-encoded multiple access (SEMA) communications. In SEMA, the spreading code is obtained from user bit information itself without using a pseudo noise code generator. The proposed scheme exploits the inherent diversity in self encoded spread spectrum signals. Chip interleaving not only increases the diversity gain, but also enhances the performance of iterative detection. We employ user-mask and interference cancellation to decouple self-encoded multiuser signals. This paper describes the proposed scheme and analyzes its performance. The analytical and simulation results show that the proposed system can achieve a 3 dB power gain and possess a diversity gain that can yield a significant performance improvement in both Rayleigh and multipath fading channels.

• ETRI Journal
• /
• 제26권5호
• /
• pp.375-383
• /
• 2004

This paper proposes a common interleaving method associated with independent channel-encoding among transmitter antenna branches in orthogonal frequency and code division multiplexing based on multiple-input multiple-output (MIMO) multiplexing to achieve an extremely high throughput such as 1 Gbps using a 100 MHz bandwidth. This paper also investigates the average packet error rate performance as a function of the average received signal energy per bit-to-background noise power spectrum density ratio $(E_b/N_0)$. We found that the loss in the required average received $E_b/N_0$ of the proposed method is only within approximately 0.3 dB in up to a 12-path Rayleigh fading channel, using 16QAM and Turbo coding with a coding rate of 5/6. We also clarify that even for a large fading correlation among antenna branches, 1 Gbps is still possible by increasing the transmission power. Therefore, the proposed method reduces the processing rate to 1/4 in the turbo decoder with only a slight loss in the required average received $E_b/N_0$.

• 정보처리학회논문지C
• /
• 제10C권2호
• /
• pp.233-240
• /
• 2003

본 논문에서는 IMT-2000용 터보코덱의 개선된 아키텍쳐를 제안하였다. 이는 on-the-fly 인터리빙 쉬프트 레지스터를 이용하여 외부 RAM을 사용하지 않는 인터리버에 의한 부호기와 필요한 메모리의 양을 줄이기 위한 복호기로 구성되었다. 제안된 구조는 C/VHDL 언어를 이용하여 시뮬레이션을 수행하여 반복횟수, 인터리버 블록크기, 부호율에 따른 비트오류율 성능이 이전 데이터와 비교적 일치함을 확인하였다.

• 전자공학회논문지A
• /
• 제32A권4호
• /
• pp.24-31
• /
• 1995

In this paper, the dual-mode burst-error-correcting decoding algorithm is adapted to the multiple trellis-coded .pi./4 shift QPSK in order to achieve the improvement of bit error rate (BER) performance over fading channels. The dual-mode adaptive decoder which combines maximum likelihood decoding with a burst detection scheme usually operates as a Viterbi decoder and switches to time diversity error recovery whenever an uncorrectable error pattern is identified. Rayleigh fading channels and Rician fading channels having the Rician parameter K=5dB are used in computer simulation, and the simulation results are compared with those of interleaving techniques. It is shown that under the constraint of the fixed overall memory quantity, the dual-mode adaptive decoding scheme gains an advantage in the BER performance with respect to interleaving strategies.

• 한국통신학회논문지
• /
• 제26권11A호
• /
• pp.1803-1811
• /
• 2001

본 논문에서는 미국의 유선 케이블 모뎀 규격인 MCNS(Multimedia Cable Network System) DOCSIS(Data Over Cable Service Interface Specification)를 만즉하는 하향 채널의 64/256-QAM 수신부 FEC(Forward Error Correction)를 분석하였다. FEC는 기본적으로 RS(Reed-Solomon) 계층과 TCM(Trellis Coded Modulation) 계층으로 구분되며, 여기에 추가적으로 interleaving과 randomizer 계층들이 결합되어 있다. AWGN(Additive White Gaussian Noise) 환경에서의 BER(Bit Error Rate) 성능평가를 통해 수신부 연판정 비터비 복호기(soft Viterbi decoder)의 추적 깊이(trace-back depth)와 양자화 레벨(quantization level)의 크기에 따라 부호화 이득이 변함을 확인하였다.

• 한국통신학회논문지
• /
• 제35권6B호
• /
• pp.948-953
• /
• 2010

본 논문에서는 슈퍼스칼라 구조를 가진 시스템의 명령어 캐시에서 효율적으로 소프트오류를 검출할 수 있는 기법을 제안한다. 명령어 캐시로 주로 사용되는 고속 정적 RAM(Random Access Memory)에 적용할 수 있으며 1D 패리티와 인터리빙을 통해 기존 기법들과 비교하여 더 적은 메모리 오버헤드로 연집오류를 검출할 수 있다. 정적 RAM에서는 소프트오류의 발생만을 확인하고 검출된 소프트오류의 정정은 명령어 캐시의 캐시 미스와 같이 처리하여 하위 메모리로부터 명령어들을 다시 인출하는 방식이다. 이를 통해 명령어 캐시의 성능에 영향을 주지 않으면서 연집오류를 검출하고 정정할 수 있으며 최대 4$\times$4의 윈도우 내에서 발생된 연집오류를 검출 할 수 있다. 제안된 방식을 이용하면 256비트 $\times$ 256비트 크기의 메모리에서 기존의 4-way 인터리빙 기법에서 검출에 필요한 패리티 크기의 25%만으로도 동일한 4비트의 연집오류를 검출 할 수 있다.

• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.1-8
• /
• 2004

In this paper, we investigate the properties and performance of space-time bit-interleaved coded modulation (STBICM) systems in fast Rayleigh fading channels. We first show that ST-BICM with QPSK signaling in fast fading channels possesses the uniform distance property, which makes performance analysis tractable. We also derive the probability distribution of the squared Euclidean distance between space-time symbols assuming uniform bit-interleaving. Based on the distribution, we show that the diversity order for each codeword pair becomes maximized as the frame length becomes sufficiently long. This maximum diversity order property implies that the bit-interleaver transforms an ST-BICM system over transmit diversity channels into an equivalent coded BPSK system over independent fading channels. We analyze the performance of ST-BICM in fast fading channels by deriving an FER upper bound. The derived bound turns out very accurate, requiring only the distance spectrum of the binary channel codes of ST-BICM. Numerical results demonstrate that the bound is tight enough to render an accurate estimate of performance of ST-BICM systems.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.132-135
• /
• 2000

In this paper, we propose to exploit a multi-code CDMA scheme for power line communication (PLC) systems, and its performance on non-Gaussian impulse and harmonic noises is presented. The proposed multi-code CDMA scheme utilizes convolutional coding and block interleaving to combat with the non-Gaussian noises, and simulation results indicate effective alleviation of these noises, and thus significant bit error rate improvement by the proposed scheme even under strict restriction of frequency band allowed in PLC systems.

• 정보보호학회논문지
• /
• 제6권4호
• /
• pp.3-38
• /
• 1996

The mobile station shall convolutionally encode the data transmitted on the reverse traffic channel and the access channel prior to interleaving. Code symbols output from the convolutional encoder are repeated before being interleaved except the 9600 bps data rate. All the symbols are then interleaved, 64-ary orthogonal modulation, direct-sequence spreading, quadrature spreading, baseband filtering and QPSK transmission. The sync, paging, and forward traffic channel except the pilot channel in the forward CDMA channel are convolutionally encoded, block interleaved, spread with Walsh function at a fixed chip rate of 1.2288 Mcps to provide orthogonal channelization among all code channels. Following the spreading operation, the I and Q impulses are applied to respective baseband filters. After that, these impulses shall be transmitted by QPSK. Authentication in the CDMA system is the process for confirming the identity of the mobile station by exchanging information between a mobile station and the base station. The authentication scheme is to generate a 18-bit hash code from the 152-bit message length appended with 24-bit or 40-bit padding. Several techniques are proposed for the authentication data computation in this paper. To protect sensitive subscriber information, it shall be required enciphering ceratin fields of selected traffic channel signaling messages. The message encryption can be accomplished in two ways, i.e., external encryption and internal encryption.