• Title/Summary/Keyword: 역방향 상태천이

Search Result 6, Processing Time 0.02 seconds

Radix-4 Trellis Parallel Architecture and Trace Back Viterbi Decoder with Backward State Transition Control (Radix-4 트렐리스 병렬구조 및 역방향 상태천이의 제어에 의한 역추적 비터비 디코더)

  • 정차근
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.397-409
    • /
    • 2003
  • This paper describes an implementation of radix-4 trellis parallel architecture and backward state transition control trace back Viterbi decoder, and presents the application results to high speed wireless LAN. The radix-4 parallelized architecture Vietrbi decoder can not only improve the throughput with simple structure, but also have small processing delay time and overhead circuit compared to M-step trellis architecture one. Based on these features, this paper addresses a novel Viterbi decoder which is composed of branch metric computation, architecture of ACS and trace back decoding by sequential control of backward state transition for the implementation of radix-4 trellis parallelized structure. With the proposed architecture, the decoding of variable code rate due to puncturing the base code can easily be implemented by the unified Viterbi decoder. Moreover, any additional circuit and/or peripheral control logic are not required in the proposed decoder architecture. The trace back decoding scheme with backward state transition control can carry out the sequential decoding according to ACS cycle clock without additional circuit for survivor memory control. In order to evaluate the usefulness, the proposed method is applied to channel CODEC of the IEEE 802.11a high speed wireless LAN, and HDL coding simulation results are presented.

Trace-Back Viterbi Decoder with Sequential State Transition Control (순서적 역방향 상태천이 제어에 의한 역추적 비터비 디코더)

  • 정차근
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.11
    • /
    • pp.51-62
    • /
    • 2003
  • This paper presents a novel survivor memeory management and decoding techniques with sequential backward state transition control in the trace back Viterbi decoder. The Viterbi algorithm is an maximum likelihood decoding scheme to estimate the likelihood of encoder state for channel error detection and correction. This scheme is applied to a broad range of digital communication such as intersymbol interference removing and channel equalization. In order to achieve the area-efficiency VLSI chip design with high throughput in the Viterbi decoder in which recursive operation is implied, more research is required to obtain a simple systematic parallel ACS architecture and surviver memory management. As a method of solution to the problem, this paper addresses a progressive decoding algorithm with sequential backward state transition control in the trace back Viterbi decoder. Compared to the conventional trace back decoding techniques, the required total memory can be greatly reduced in the proposed method. Furthermore, the proposed method can be implemented with a simple pipelined structure with systolic array type architecture. The implementation of the peripheral logic circuit for the control of memory access is not required, and memory access bandwidth can be reduced Therefore, the proposed method has characteristics of high area-efficiency and low power consumption with high throughput. Finally, the examples of decoding results for the received data with channel noise and application result are provided to evaluate the efficiency of the proposed method.

A Modelling of magnetization reversal characteristics in magneto-optic memory system (광자기 기억장치에서의 자화반전 특성 모델링)

  • 한은실;이광형;조순철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.10
    • /
    • pp.1849-1860
    • /
    • 1994
  • Domain wall dynamics in thin film of amorphous Rare Earth-Transistion Metal alloys were investigated using numerical integration of the Landau-Lifshitz-Gilbert equation. The thin film was divided into a two-dimensional square lattice ($30\times30$) of dipoles. Nearest-neighbor exchange interaction magnetic anisotropy, applied magnetic field, and demagnetiing field of interacting anisotropy, applied magnetic field, and demagnetizing field of interacting dipoles were considered. It was assumed that the film had perfect uniaxial anisotropy in the perpendicular direction and the magnetization reversal existed in the film. The time of domain wall creation and the thickness of the wall were investigated. Also the motion of domain walls under an applied field was considered. Simulation results showed that the time of domain wall creation was decreased significantly and the average velocity of domain wall was increased somewhat when the demagnetizing field was considered.

  • PDF

An Experimental Study on the Thermal Performance of Air Filled Thermal Diode (공기를 작동 유체로 하는 열다이오드의 열성능에 관한 실험적 연구)

  • Pak, Ee-Tong;Jang, Young-Geun;Hwang, In-Ju
    • Solar Energy
    • /
    • v.17 no.2
    • /
    • pp.35-42
    • /
    • 1997
  • Thermal diode is a device which allows heat to be transferred in one direction by convection due to difference of density of fluid, and blocks heat flow in the opposite direction. Vertical plate for heat collection and radiation are of utility for design of thermal diode. It was considered the transient and steady state of air filled thermal diode with guide vane which combined rectangular and parallelogrammic shape enclosures. $Gr^*$ was kept constantly on $1.11{\times}10^{10}{\sim}1.4{\times}10^{10}$ and error range was ${\pm}3%$ during the experiment. Nu was examined when inclined angle are $15^{\cir\c}\;and\;45^{\circ}$ and, also the experiments was carried out with and without guide vane as well. Specially, Nu was linearly increased due to increase of $Gr^*$, and the effect of guide vane and dimensionless channel depth was sensitive. Developed state of temperature began at dimensionless time $0.5{\sim}0.6$ due to variation of inclined angle, which is characteristic of system.

  • PDF

Multicast Coverage Prediction in OFDM-Based SFN (OFDM 기반의 SFN 환경에서의 멀티캐스트 커버리지 예측)

  • Jung, Kyung-Goo;Park, Seung-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3A
    • /
    • pp.205-214
    • /
    • 2011
  • In 3rd generation project partnership long term evolution, wireless multicast techniques which send the same data to multiple users under single frequency networks have attracted much attention. In the multicast system, the transmission mode needs to be selected for efficient data transfer while satisfying the multicast coverage requirement. To achieve this, users' channel state information (CSI) should be available at the transmitter. However, it requires too much uplink feedback resource if all the users are allowed to transmit their CSI at all the time. To solve this problem, in this paper, the multicast coverage prediction is suggested. In the proposed algorithm, each user measures its transition probabilities between the success and the fail state of the decoding. Then, it periodically transmits its CSI to the basestation. Using these feedbacks, the basestation can predict the multicast coverage. From the simulation results, we demonstrate that the proposed scheme can predict the multicast system coverage.

Performance Analysis of MAP Algorithm by Robust Equalization Techniques in Nongaussian Noise Channel (비가우시안 잡음 채널에서 Robust 등화기법을 이용한 터보 부호의 MAP 알고리즘 성능분석)

  • 소성열
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1290-1298
    • /
    • 2000
  • Turbo Code decoder is an iterate decoding technology, which extracts extrinsic information from the bit to be decoded by calculating both forward and backward metrics, and uses the information to the next decoding step Turbo Code shows excellent performance, approaching Shannon Limit at the view of BER, when the size of Interleaver is big and iterate decoding is run enough. But it has the problems which are increased complexity and delay and difficulty of real-time processing due to Interleaver and iterate decoding. In this paper, it is analyzed that MAP(maximum a posteriori) algorithm which is used as one of Turbo Code decoding, and the factor which determines its performance. MAP algorithm proceeds iterate decoding by determining soft decision value through the environment and transition probability between all adjacent bits and received symbols. Therefore, to improve the performance of MAP algorithm, the trust between adjacent received symbols must be ensured. However, MAP algorithm itself, can not do any action for ensuring so the conclusion is that it is needed more algorithm, so to decrease iterate decoding. Consequently, MAP algorithm and Turbo Code performance are analyzed in the nongaussian channel applying Robust equalization technique in order to input more trusted information into MAP algorithm for the received symbols.

  • PDF