• 제목/요약/키워드: Viterbi algorithm.

검색결과 195건 처리시간 0.023초

고속 전력선통신 시스템의 터보 부호화 (Turbo Coded OFDM Scheme for a High-Speed Power Line Communication)

  • 이재선;김요철;김정휘;김진영
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 한국정보통신설비학회 2009년도 정보통신설비 학술대회
    • /
    • pp.190-196
    • /
    • 2009
  • In this paper, performance of a turbo-coded OFDM system is analyzed and simulated in a power line communication channel. Since the power line communication system typically operates in a hostile environment, turbo code has been employed to enhance reliability of transmitted data. The performance is evaluated in terms of bit error probability. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision Viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is substantially improved by increasing the number of iterations and interleaver length of a turbo encoder. The results in this paper can be applied to OFDM-based high-speed power line communication systems.

  • PDF

A Implementation of Simple Convolution Decoder Using a Temporal Neural Networks

  • Chung, Hee-Tae;Kim, Kyung-Hun
    • Journal of information and communication convergence engineering
    • /
    • 제1권4호
    • /
    • pp.177-182
    • /
    • 2003
  • Conventional multilayer feedforward artificial neural networks are very effective in dealing with spatial problems. To deal with problems with time dependency, some kinds of memory have to be built in the processing algorithm. In this paper we show how the newly proposed Serial Input Neuron (SIN) convolutional decoders can be derived. As an example, we derive the SIN decoder for rate code with constraint length 3. The SIN is tested in Gaussian channel and the results are compared to the results of the optimal Viterbi decoder. A SIN approach to decode convolutional codes is presented. No supervision is required. The decoder lends itself to pleasing implementations in hardware and processing codes with high speed in a time. However, the speed of the current circuits may set limits to the codes used. With increasing speeds of the circuits in the future, the proposed technique may become a tempting choice for decoding convolutional coding with long constraint lengths.

Error-Correcting 7/9 Modulation Codes For Holographic Data Storage

  • Lee, Kyoungoh;Kim, Byungsun;Lee, Jaejin
    • 한국통신학회논문지
    • /
    • 제39A권2호
    • /
    • pp.86-91
    • /
    • 2014
  • Holographic data storage (HDS) has a number of advantages, including a high transmission rate through the use of a charge coupled device array for reading two-dimensional (2D) pixel image data, and a high density capacity. HDS also has disadvantages, including 2d intersymbol interference by neighboring pixels and interpage interference by multiple pages stored in the same holographic volume. These problems can be eliminated by modulation codes. We propose a 7/9 error-correcting modulation code that exploits a Viterbi-trellis algorithm and has a code rate larger (about 0.778) than that of the conventional 6/8 balanced modulation code. We show improved performance of the bit error rate with the proposed scheme compared to that of the simple 7/9 code without the trellis scheme and the 6/8 balanced modulation code.

A Convolutional Decoder using a Serial Input Neuron

  • Kim, Kyunghun;Lee, Chang-Wook;Jeon, Gi-Joon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.89.1-89
    • /
    • 2002
  • Conventional multilayer feedforward artificial neural networks are very effective in dealing with spatial problems. To deal with problems with time dependency, some kinds of memory have to be built in the processing algorithm. In this paper we show how the newly proposed Serial Input Neuron (SIN) convolutional decoders can be derived. As an example, we derive the SIN decoder for \ulcornerrate code with constraint length 3. The SIN is tested in Gaussian channel and the results are compared to the results of the optimal Viterbi decoder. A SIN approach to decode convolutional codes is presented. No supervision is required. The decoder lends itself to pleasing implementations in hardware and processing...

  • PDF

이동 통신 채널에서 다중 트렐리스 부호화된 $\pi$/4 shift QPSK의 연집 에러 정정 복호 방식 (A burst-error-correcting decoding scheme of multiple trellis-coded $\pi$/4 shift QPSK for mobile communication channels)

  • 이정규;송왕철;홍대식;강창언
    • 전자공학회논문지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.

  • PDF

2차원 성상도를 이용한 다차원 무직류 격자형부호 (Multi-dimensional DC-free trellis codes based on tow-dimensional constellation)

  • 정창기;황성준;주언경
    • 전자공학회논문지S
    • /
    • 제35S권3호
    • /
    • pp.47-53
    • /
    • 1998
  • Multi-dimensional DC-free trellis codes based on two-dimensional constellation which can be omplemented more easily than conventional codes are proposed and their performances are analyzed in this paper. 2N-dimensional constellation of the proposed codes is constructed by concatenating N 2-dimensional constellation. Thus, for the proposed codes, information bits can be assigned easily to each signal point of the 2-dimensional consteellation and DC-free characteristic can be simply obtained by the symmetric structure of the constellation. In addition, since Viterbi decoder can calculate multi-dimensional Euchlidean distance between signals by simple sum of each 2-dimensional Euclidean distanc, decoding complexity can be reduced. The performance analysis shows that the proposed codes have almost same spectral characteristic and error performance as compared with conventional codes. However, the complexity is shown to be reduced further due to the construction method of contellation and the simple decoding algorithm of the proposed codes.

  • PDF

위상 지터 채널하에서 트렐리스 부호화된 CPFSK의 동기 검파 (Cherent Detection of the Trellis Coded CPFSK on Phase Jitter Channels)

  • 김대중;김한종;정호영;강창언
    • 전자공학회논문지A
    • /
    • 제31A권9호
    • /
    • pp.26-33
    • /
    • 1994
  • In this paper, the performance of the trellis coded CPFSK with the coherent detection over mobile communication channels is calculated. The characteristics of channels, including phase jitter effects and fading effects, are examined and modeled. The phase jitter channel is modeled to have a nonzero mean and a gaussian distribution. The fading channel has a Rayleigh distribution in the multipath. For the optimal decoding method(MLSE), the Viterbi algorithm is used for the trellis structure of trellis coded CPFSK. The results indicate that the trellis coded CPFSK with a small moulation indes gets more sensitive, as the index gets smaller, to the phase noise under the phase jitter channel. Using the interleaving method. It gives considerable improvements in the error rate under the fading channel.

  • PDF

비터비 복호기 출력을 이용한 OFDM 주파수 추적 알고리듬 (Viterbi Decoder-Aided Frequency Offset Tracking Algorithm for OFDM)

  • 윤대중;한동석
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2004년도 정기총회 및 학술대회
    • /
    • pp.165-168
    • /
    • 2004
  • 본 논문에서는 OFDM(orthogonal frequency division modulation) 시스템의 비터비 복호기 출력을 이용한 주파수 동기추적알고리듬을 제안한다 OFDM 시스템은 직교성이 보장된 부반송파에 데이터를 실어 전송함으로, 부반송파간 직교성 유지가 매우 중요하다. 부반송파간 직교성을 해치는 가장 큰 원인으로써 주파수 옵셋을 들 수 있다. OFDM 시스템의 안정적인 신호 수신을 위해서는 잔존 주파수까지 제거할 수 있는 고성능 주파수 동기 알고리듬이 필수적으로 요구된다. 본 논문에서는 다중변조 OFDM 시스템에서, 주파수 옵셋을 블라인드 모드로 추적하여 보상 할 수 있는 알고 리듬을 제안한다 전산실험을 통해 주파수 선택적 채널에서 제안한 알고리듬의 우수성을 보인다.

  • PDF

수직 자기기록 채널에서 연집에러에 따른 LDPC 부호의 성능 (Burst Error Performance of LDPC codes on Perpendicular Magnetic Recording Channel)

  • 김상인;이재진
    • 한국통신학회논문지
    • /
    • 제33권11C호
    • /
    • pp.868-873
    • /
    • 2008
  • 본 논문에서는 수직 자기기록 채널에서 연집에러에 따른 LDPC(low density parity check) 부호의 성능을 분석한다. 수직 자기기록 채널에서 연집에러가 발생하면 수신부에서는 채널상태정보(channel state information)를 통하여 연집에러 부분을 알아낸 후 채널검출기의 연판정(Log Likelihood Ratio) 값을 0으로 초기화하는 방법을 사용한다. 패리티 검사 행렬은 부호율이 0.94인 (4336,4096)와 (8672,8192)를 사용한다. 그리고 채널 검출기는 연산량이 적은 SOVA(soft output Viterbi algorithm)를 사용한다.

HMM을 이용한 HDFS 기반 동적 데이터 복제본 삭제 전략 (A Dynamic Data Replica Deletion Strategy on HDFS using HMM)

  • 서영호;윤희용
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2014년도 제50차 하계학술대회논문집 22권2호
    • /
    • pp.241-244
    • /
    • 2014
  • 본 논문에서는 HDFS(Hadoop Distributed File System)에서 문제되고 있는 복제정책의 개선을 위해 HMM(Hidden Markov Model)을 이용한 동적 데이터 복제본 삭제 전략을 제안한다. HDFS는 대용량 데이터를 효과적으로 처리할 수 있는 분산 파일 시스템으로 높은 Fault-Tolerance를 제공하며, 데이터의 접근에 높은 처리량을 제공하여 대용량 데이터 집합을 갖는 응용 프로그램에 최적화 되어있는 장점을 가지고 있다. 하지만 HDFS 에서의 복제 메커니즘은 시스템의 안정성과 성능을 향상시키지만, 추가 블록 복제본이 많은 디스크 공간을 차지하여 유지보수 비용 또한 증가하게 된다. 본 논문에서는 HMM과 최상의 상태 순서를 찾는 알고리즘인 Viterbi Algorithm을 이용하여 불필요한 데이터 복제본을 탐색하고, 탐색된 복제본의 삭제를 통하여 HDFS의 디스크 공간과 유지보수 비용을 절약 할 수 있는 전략을 제안한다.

  • PDF