• Title/Summary/Keyword: Bit Error

Search Result 2,257, Processing Time 0.025 seconds

A Low-Complexity Turbo coded BICM-ID System (Turbo coded BICM-ID의 복잡도 개선 기법)

  • Kang, Donghoon;Lee, Yongwook;Oh, Wangrok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.21-27
    • /
    • 2013
  • In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.

Cognitive Relay Networks with Underlay Spectrum Sharing and Channel Estimation Error: Interference Probability and BER Analysis

  • Ho-Van, Khuong
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.301-304
    • /
    • 2014
  • This paper proposes accurate interference probability and bit error rate formulas for cognitive relay networks with underlay spectrum sharing and channel estimation error (CEE). Numerous results reveal that the CEE not only degrades the performance of secondary systems (SSs) but also increases interference power caused by SSs to primary systems (PSs), eventually unfavorable to both systems. A solution to further protect PSs from this effect through reducing the power of secondary transmitters is investigated and analyzed.

Channel Error Detwction and Concealment Technqiues for the MPEG-2 Video Standard (MPEG-2 동영상 표준방식에 대한 채널 오차의 검출 및 은폐 기법)

  • 김종원;박종욱;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.10
    • /
    • pp.2563-2578
    • /
    • 1996
  • In this paper, channel error characteristics are investigated to alleviate the channel error propagation problem of the digital TV transmission systems. First, error propagation problems, which are mainly caused by the inter-frame dependancy and variable length coding of the MPEG-2 baseline encoder, are intensively analyzed. Next, existing channel resilient schemes are systematically classified into two kinds of schemes; one for the encoder and the other for the decoder. By comparing the performance and implementation cost, the encoder side schemes, such as error localization, layered coding, error resilience bit stream generation techniques, are described in this paper. Also, in an effort to consider the parcticality of the real transmission situation, an efficient error detection scheme for a decoder system is proposed by employing a priori information of the bit stream syntas, checking the encoding conditions at the encoder stage, and exploiting the statistics of the image itself. Finally, subsequent error concealment technique based on the DCT coefficient recovery algorithm is adopted to evaluate the performance of the proposed error resilience technique. The computer simulation results show that the quality of the received image is significantly improved when the bit error rate is as high as 10$^{-5}$ .

  • PDF

Learning of multi-layer perceptrons with 8-bit data precision (8비트 데이타 정밀도를 가지는 다층퍼셉트론의 역전파 학습 알고리즘)

  • 오상훈;송윤선
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.4
    • /
    • pp.209-216
    • /
    • 1996
  • In this paper, we propose a learning method of multi-layer perceptrons (MLPs) with 8-bit data precision. The suggested method uses the cross-entropy cost function to remove the slope term of error signal in output layer. To decrease the possibility of overflows, we use 16-bit weighted sum results into the 8-bit data with appropriate range. In the forwared propagation, the range for bit-conversion is determined using the saturation property of sigmoid function. In the backwared propagation, the range for bit-conversion is derived using the probability density function of back-propagated signal. In a simulation study to classify hadwritten digits in the CEDAR database, our method shows similar generalization performance to the error back-propagation learning with 16-bit precision.

  • PDF

Generalized SCAN Bit-Flipping Decoding Algorithm for Polar Code

  • Lou Chen;Guo Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1296-1309
    • /
    • 2023
  • In this paper, based on the soft cancellation (SCAN) bit-flipping (SCAN-BF) algorithm, a generalized SCAN bit-flipping (GSCAN-BF-Ω) decoding algorithm is carried out, where Ω represents the number of bits flipped or corrected at the same time. GSCAN-BF-Ω algorithm corrects the prior information of the code bits and flips the prior information of the unreliable information bits simultaneously to improve the block error rate (BLER) performance. Then, a joint threshold scheme for the GSCAN-BF-2 decoding algorithm is proposed to reduce the average decoding complexity by considering both the bit channel quality and the reliability of the coded bits. Simulation results show that the GSCAN-BF-Ω decoding algorithm reduces the average decoding latency while getting performance gains compared to the common multiple SCAN bit-flipping decoding algorithm. And the GSCAN-BF-2 decoding algorithm with the joint threshold reduces the average decoding latency further by approximately 50% with only a slight performance loss compared to the GSCAN-BF-2 decoding algorithm.

Optimizing the Circuit for Finding 2 Error Positions of 2 Error Correcting Reed Solomon Decoder (리드솔로몬 복호기에서 2개의 오류시, 오류위치를 찾는 최적화 방법)

  • An, Hyeong-Keon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1C
    • /
    • pp.8-13
    • /
    • 2011
  • In this paper, we show new method to find error locations of 2 eight bit symbol errors for 2 error correcting Reed-Solomon decoder. New design is much faster and has much simpler logic circuit than the former design method. This optimization was possible by partitioning the 8 bit operations into 4 bit arithgmatic and logic operations. This Reed Solomon decoder can be used for data protection of almost all digital communication and consumer electronic devices.

An analysis of bit error probability of RS/trellis concatenated coded-modulation systems for mobile radio channel (이동통신 채널에서의 RS/trellis 연접 부호변조 시스템의 비트오율 해석)

  • 김왕길;이상곤;문상재
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.6
    • /
    • pp.1546-1553
    • /
    • 1996
  • The bit error probability of RS/trellis concatenated coded-modualtion system in the mobile radio channel is analyzed. A new upper bound to the symbol error probability of the inner TCM in the mobile radio channel is obtained by exploiting the unequal symbol error probability of the TCM. This bound is applied to the derivation of the upper bound to the bit error probability of the concatenated coded-modulation system. An efficient way of searching distance spectrum of the TCM in mobile radio channel is devised. Our new bounds are tighter than the earlier studied other bounds.

  • PDF

Enhancements of T-REFWA to Mitigate Link Error-Related Degradations in Hybrid Wired/Wireless Networks

  • Nishiyama, Hiraki;Taleb, Tarik;Nemoto, Yoshiaki;Jamalipour, Abbas;Kato, Nei
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.391-400
    • /
    • 2006
  • With the on-going wireless access technologies, the Internet has become accessible anytime anywhere. In wireless networks, link errors significantly degrade the performance of the transmission control protocol (TCP). To cope with this issue, this paper improves the recently-proposed terrestrial REFWA (T-REFWA) scheme by adding a new error recovery mechanism to its original design. In the T-REFWA scheme, senders are acknowledged with appropriate sending rates at which an efficient and fair utilization of network resources can be achieved. As the feedback values are computed independently of link errors, senders can keep transmitting data at high rates even in case of link error occurrences. Using this feature, the proposed error recovery mechanism can achieve high throughput in environments with high bit error rates. The throughput is further improved by disabling the exponential back-off algorithm of TCP so that long idle times are avoided in case of link errors. We show through simulations that the proposed method improves TCP performance in high bit error rates. Compared with several TCP variants, the proposed error recovery scheme exhibits higher link utilization and guarantees system fairness for different bit error rates.

Analysis for the Bit Error Probability in the PCM-NRZ/FM Telemetry System (PCM-NRZ/FM Telemetry 시스템에서 Bit 오차확률에 관한 분석)

  • 강정수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.8 no.2
    • /
    • pp.76-81
    • /
    • 1983
  • PCM-NRZ/FM Telemetry system is constructed on the basis of RF link with FM modulatedand NRZ-L binary coded PCM data are assumed to transmit through 5th-order Bessel filter. Upon demodulated by the limiter-discriminator at the receiver, the probability of bit error, which is important for performance estimation of digital system, is analyzed against SNR. The analysis based on the following parameters, that is bit rate 140kHz, frequency of pre-modulation filter f-100kHz, maximum frequency deviation of transmitter 2f=300kHz, was performed. As a result, when the telemetry system with the parameters above is designed, the probability of bit error is obtained as 10 along with fT=0.7 and h=2, T=2.

  • PDF

Bit-selective Forward Error Correction for Digital Mobile Communications (디지털 이동통신을 위한 비트 선택적 에러정정부호)

  • Yang, Kyeong-Cheol;Lee, Jae-Hong
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.198-202
    • /
    • 1988
  • In digital mobile communications received speech data are affected by burst errors as well as random errors. To overcome these errors we propose a bit-selective forward error correction scheme for the speech data which is sub-band coded at 13 kbps and transmitted over a 16 kbps channel. For a few error correcting codes the signal-to-noise ratio of error-corrected speech is obtained and compared through the simulation of mobile communication channels.

  • PDF