• Title/Summary/Keyword: channel decoder

Search Result 343, Processing Time 0.02 seconds

Trellis Coded Spread Spectrum with the multiple symbol detection (다중 심벌 검파를 이용한 트렐리스 부호화된 대역 확산 통신 시스템)

  • 김상태;김종일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.3
    • /
    • pp.517-526
    • /
    • 2000
  • In this paper, we propose the trellis coded spread spectrum communication system with one channel signal selection of the subset by the PN code. This paper proposes the Viterbi decoder that have the squared Euclidean distance of the order phase difference as well as 1st order phase difference as the branch metrics by using the multiple symbol detection method. TCM method was developed to overcome limited power and bandwidth efficiently in digital communication. we multiply one of convolution code's output data to PN code for applying TCM to the spread spectrum. We investigated the performance of the direct sequence/spread spectrum communication system with trellis coded modulation. In this system, we could improved the coding gain in the spread spectrum.

  • PDF

Improvement of the Sphere Decoding Complexity through an Adaptive OSIC-SD System (Adaptive OSIC-SD 시스템을 통한 SD 복호기 복잡도 개선)

  • Portugal, Sherlie;Yoon, Gil-Sang;Seo, Chang-Woo;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.13-18
    • /
    • 2011
  • Sphere Decoding (SD) is a decoding technique able to achieve the Maximum Likelihood (ML) performance in fading environments; nevertheless, the main disadvantage of this technique is its high complexity, especially in poor channel conditions. In this paper, we present an adaptive hybrid algorithm which reduces the conventional Sphere Decoder's complexity and keeps the ML performance. The system called Adaptive OSIC-SD modifies its operation based on Signal to Noise Ratio (SNR) information and achieves an optimal performance in terms of Bit Error Rate (BER) and complexity. Through simulations, we probe that the proposed system maintains almost the same bit error rate performance of the conventional SD, and exhibits a lower, quasi-constant complexity.

Performance of Turbo Coded OFDM Systems in W-CDMA Wireless Communication Channel (W-CDMA 무선통신 채널에서 터보 부호를 적용한 OFDM 시스템의 성능 분석)

  • Shin, Myung-Sik;Yang, Hae-Sool
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.4
    • /
    • pp.183-191
    • /
    • 2010
  • In the recent digital communication systems, the performance of Turbo Code used as the error correction coding method depends on the interleaver size influencing the free distance determination and the iterative decoding algorithms of the turbo decoder. However, some iterations are needed to get a better performance, but these processes require a large time delay. Recently methods of reducing the number of iteration have been studied without degrading original performance. In this paper, the new method of combining ME (Mean Estimate) stopping criterion with SDR (sign difference ratio) stopping criterion among previous stopping criteria is proposed, and the fact of compensating each method's missed detection is verified. Faster decoding is realized that about 1~2 time iterations to reduced through adopting this method into serially concatenated both decoders. System Environments were assumed W-CDMA forward link system with intense MAI (multiple access interference).

A New Semi-Random Imterleaver Algorithm for the Noise Removal in Image Communication (영상통신에서 잡음 제거를 위한 새로운 세미 랜덤 인터리버 알고리즘)

  • Hong, Sung-Won;Park, Jin-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2473-2483
    • /
    • 2000
  • In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

  • PDF

Minimum Energy-per-Bit Wireless Multi-Hop Networks with Spatial Reuse

  • Bae, Chang-Hun;Stark, Wayne E.
    • Journal of Communications and Networks
    • /
    • v.12 no.2
    • /
    • pp.103-113
    • /
    • 2010
  • In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

Performance Evaluation of Turbo Codes by Soft Detection Metrics of STBC over an IEEE 802.16e Link (IEEE 802.16e 링크에서 시공간 블록 부호의 연판정 검출에 따른 터보 부호의 성능평가)

  • Kim, Young-Min;Kim, Soo-Young;Lim, Kwang-Jae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.2
    • /
    • pp.1-8
    • /
    • 2010
  • Multi antenna techniques using space-time codes can achieve diversity gains in a multi-path environment without additional bandwidth requirement. Most of the 4G candidate standards including the IEEE 802.16e adopt multi-input multi-output (MIMO) schemes to achieve either high throughput performance or diversity gains. In these 4G candidate standards, turbo codes using an iterative decoder with soft input soft output are used to overcome serious channel fading. For this reason, the estimated signal values from MIMO detectors should be soft decision detection values. In this paper, we propose efficient methods to estimate soft decision detection values for various space time coding schemes, and provide the simulation results of turbo coded space time coding scheme over an IEEE 802.16e link.

Rate-Distortion Based Selective Encoding in Distributed Video Coding (율-왜곡 기반 선택적 분산 비디오 부호화 기법)

  • Lee, Byung-Tak;Kim, Jae-Gon;Kim, Jin-Soo;Seo, Kwang-Deok
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.123-132
    • /
    • 2011
  • Recently, DVC (Distributed Video Coding) is receiving a lot of attention as one of the low complexity video encoding techniques suitable for various applications with computation-limited and/or power-limited environment, and is being actively studied for improving the coding efficiency. This paper proposes a rate-distortion based selective block encoding scheme. First, the motion information is obtained in the process of generating side information at decoder and received through the feedback channel, and then, based on this information, the proposed method performs a selective block encoding based on rate-distortion optimization. Experimental results show that the performance of the proposed scheme reaches up to 2.2 dB PSNR gain over the existing scheme. Moreover, it is shown that the complexity can be reduced by encoding parts of region considering rate-distortion cost.

Fast Distributed Video Decoding Using BER model for Applications with Motion Information Feedback (움직임 정보 피드백이 가능한 응용을 위한 BER모델을 이용한 고속 분산 비디오 복호화 기법)

  • Kim, Man-Jae;Kim, Jin-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.12
    • /
    • pp.14-24
    • /
    • 2012
  • DVC (Distributed Video Coding) techniques need feedback channel for parity bit control to achieve the good RD performances, however, this causes the DVC system to have high decoding latency. In order to implement in real time environments and to accelerate commercializations, many research works have been focusing on the development of fast video decoding algorithm. As one of the real time implementations, this paper deals with a novel DVC scheme suitable for some application areas where source statistics such as motion information can be provided to the encoder side from the decoder side. That is, this paper propose a fast distributed video decoding scheme to improve the decoding speed by using the feedback of motion information derived in SI generation. Through computer simulations, it is shown that the proposed method outperforms the conventional fast DVC decoding schemes.

Development of Pre-Processing and Bias Correction Modules for AMSU-A Satellite Data in the KIAPS Observation Processing System (KIAPS 관측자료 처리시스템에서의 AMSU-A 위성자료 초기 전처리와 편향보정 모듈 개발)

  • Lee, Sihye;Kim, Ju-Hye;Kang, Jeon-Ho;Chun, Hyoung-Wook
    • Atmosphere
    • /
    • v.23 no.4
    • /
    • pp.453-470
    • /
    • 2013
  • As a part of the KIAPS Observation Processing System (KOPS), we have developed the modules of satellite radiance data pre-processing and quality control, which include observation operators to interpolate model state variables into radiances in observation space. AMSU-A (Advanced Microwave Sounding Unit-A) level-1d radiance data have been extracted using the BUFR (Binary Universal Form for the Representation of meteorological data) decoder and a first guess has been calculated with RTTOV (Radiative Transfer for TIROS Operational Vertical Sounder) version 10.2. For initial quality checks, the pixels contaminated by large amounts of cloud liquid water, heavy precipitation, and sea ice have been removed. Channels for assimilation, rejection, or monitoring have been respectively selected for different surface types since the errors from the skin temperature are caused by inaccurate surface emissivity. Correcting the bias caused by errors in the instruments and radiative transfer model is crucial in radiance data pre-processing. We have developed bias correction modules in two steps based on 30-day innovation statistics (observed radiance minus background; O-B). The scan bias correction has been calculated individually for each channel, satellite, and scan position. Then a multiple linear regression of the scan-bias-corrected innovations with several predictors has been employed to correct the airmass bias.

A Study on the Interframe Image Coding Using Motion Compensated and Classified Vector Quantizer (Ⅱ : Hardware Implementation) (이동 보상과 분류 벡터 양자화기를 이용한 영상 부호화에 관한 연구 (Ⅱ: 하드웨어 실현))

  • Jeon, Joong-Nam;Shin, Tae-Min;Choi, Sung-Nam;Park, Kyu-Tae
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.3
    • /
    • pp.21-30
    • /
    • 1990
  • This paper describes a hardware implementation of the interframe monochrome video CODEC using a MC-CVQ(Motion Compensated and Classified Vector Quantization) algorithm. The specifications of this CODEC are (1) the resolution of image is $128{\times}128$ pixels, and (2) the transmission rates are about 10frames/sec at the 64Kbps channel. In order to design the CODEC under these conditions, it is implemented by a multiprocessor system composed of MC unit, CVQ nuit and decoder unit, which are controlled by microprogramming technique. And the 3~stage pipelined ALU(Arithmetic and Logic Unit) is adopted to calculate the minimum error distance in the MC unit and CVQ nuit. The realized system shows that the transmission rates are 6-15 frames/sec according to the relative motion of the video signal.

  • PDF