• Title/Summary/Keyword: cyclic redundancy check

Search Result 38, Processing Time 0.028 seconds

An Evaluation of Error Performance Estimation Schemes for DS1 Transmission Systems Carrying Live Traffic

  • Eu, J.H.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.1
    • /
    • pp.1-15
    • /
    • 1988
  • DS1 transmission systems use framing bit errors, bipolar violations and code-detected errors to estimate the bit error rate when determining errored and severely errored seconds. Using the coefficient of variation under the memoryless binary symmetric channel assumption, a basic framework to evaluate these estimation schemes is proposed to provide a practical guideline in determining errored and severely errored seconds which are fundamental in monitoring the real-ime error performance of DS1 transmission systems carrying live traffic. To evaluate the performance of the cyclic redundancy check code (CRC), a computer simulation model is used. Several drawbacks of the superframe format in association with real time error performance monitoring are discussed. A few recommendations are suggested in measuring errored and severely errored seconds, and determining service limit alarms through the use of the superframe format. Furthermore, we propose a new robust scheme for determining service limit alarms which take into consideration the limitations of some estimation schemes for the time interval of one second.

  • PDF

HDL Codes Generator for Cyclic Redundancy Check Codes (순환중복검사 부호용 하드웨어 HDL 코드 생성기)

  • Kim, Hyeon-kyu;Yoo, Ho-young
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.896-900
    • /
    • 2018
  • Traditionally, Linear Shift Feedback Register (LFSR) has been widely employed to implement Cyclic Redundant Check (CRC) codes for a serial input. Since many applications including network and storage systems demand as high throughput as ever, various efforts have been made to implement CRC hardware to support parallel inputs. Among various parallel schemes, the look-ahead scheme is one of the most widely used schemes due to its short critical path. However, it is very cumbersome to design HDL codes for parallel CRC codes since the look-ahead scheme is inevitable to consider how register and input values move in the next cycles. Thus, this paper proposes a novel CRC hardware generator, which automatically produces HDL codes given a CRC polynomial and parallel factor. The experimental results verify the applicability to use the proposed generator by analyzing the synthesis results from the generated HDL code.

A New Upper Layer Decoding Algorithm for a Hybrid Satellite and Terrestrial Delivery System (혼합된 위성 및 지상 전송 시스템에서 새로운 상위 계층 복호 알고리즘)

  • Kim, Min-Hyuk;Park, Tae-Doo;Kim, Nam-Soo;Kim, Chul-Seung;Jung, Ji-Won;Chun, Seung-Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.9
    • /
    • pp.835-842
    • /
    • 2009
  • DVB-SSP is a new broadcasting system for hybrid satellite communications, which supports mobile handheld systems and fixed terrestrial systems. However, a critical factor must be considered in upper layer decoding which including erasure Reed-Solomon error correction combined with cyclic redundancy check. If there is only one bit error in an IP packet, the entire IP packet is considered as unreliable bytes, even if it contains correct bytes. IF, for example, there is one real byte error, in an If packet of 512 bytes, 511 correct bytes are erased from the frame. Therefore, this paper proposed two kinds of upper layer decoding methods; LLR-based decoding and hybrid decoding. By means of simulation we show that the performance of the proposed decoding algorithm is superior to that of the conventional one.

A Custom Code Generation Technique for ASIPs from High-level Language (고급 언어에서 ASIP을 위한 전용 부호 생성 기술 연구)

  • Alam, S.M. Shamsul;Choi, Goangseog
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.3
    • /
    • pp.31-43
    • /
    • 2015
  • In this paper, we discuss a code generation technique for custom transport triggered architecture (TTA) from a high-level language structure. This methodology is implemented by using TTA-based Co-design Environment (TCE) tool. The results show how the scheduler exploits instruction level parallelism in the custom target architecture and source program. Thus, the scheduler generates parallel TTA instructions using lower cycle counts than the sequential scheduling algorithm. Moreover, we take Tensilica tool to make a comparison with TCE. Because of the efficiency of TTA, TCE takes less execution cycles compared to Tensilica configurations. Finally, this paper shows that it requires only 7 cycles to generate the parallel TTA instruction set for implementing Cyclic Redundancy Check (CRC) applications as an input design, and presents the code generation technique to move complexity from the processor software to hardware architecture. This method can be applicable lots of channel Codecs like CRC and source Codecs like High Efficiency Video Coding (HEVC).

Turbo Coded MIMO System with Adaptive Turbo Space- Time Processing for High-Speed Wireless Communications (고속 무선 통신을 위한 적응형 터보 시공간 처리를 갖는 터보 부호화된 다중 입출력 시스템)

  • 조동균;김상준;박주남;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9C
    • /
    • pp.843-850
    • /
    • 2003
  • Turbo coding and turbo processing have been known as methods close to Shannon limit in the aspect of wireless MIMO communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but turbo coding has not been used for turbo processing because of the inherent decoding process delay. This paper proposes a turbo coded MIMO system with adaptive turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and a enhanced cyclic redundancy check (E-CRC) scheme as an efficient and simple priori stopping criterion. Simulation results show that the Turbo-PAST outperforms conventional system with 1.3dB and the proposed E-CRC scheme effectively reduces the amount of turbo processing iterations from the point of average number of iterations.

A New Upper Layer Decoding Algorithm for MPE-FEC based on LLR (LLR 기반의 MPE-FEC 상위계층 복호 방식)

  • Kim, Chul-Seung;Kim, Min-Hyuk;Park, Tae-Doo;Kim, Nam-Soo;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2227-2234
    • /
    • 2009
  • DVB-SSP is a new broadcasting system for hybrid satellite communications, which supports mobile handheld systems and fixed terrestrial systems. An upper layer, including erasure Reed-Solomon error correction combined with cyclic redundancy check. However, a critical factor must be considered in upper layer decoding. If there is only one bit error in an IP packet, the entire IP packet is considered as unreliable bytes, even if it contains correct bytes. If, for example, there is one real byte error, in an IP packet of 512 bytes, 511 correct bytes are erased from the frame. Therefore, this paper proposed upper layer decoding methods; LLR-based decoding. By means of simulation we show that the performance of the proposed decoding algorithm is superior to that of the conventional one.

A Cooperative Communication System using Cross-Layer Coding Method base on Hybrid-ARQ (Cross-Layer 부호기법을 이용한 Hybrid-ARQ 기반의 협력통신 시스템 연구)

  • Park, Tae-Doo;Kim, Min-Hyuk;Kim, Chul-Seung;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11C
    • /
    • pp.889-895
    • /
    • 2010
  • MIMO system generally requires more than one antenna at the communication device. However, many wireless devices are limited by size, cost or hardware complexity to one antenna. To overcome such restrictions, we used a new technique, called cooperative communication. We propose a new cooperative transmission strategy system using cross-layer coding method base on H-ARQ for optimal communication. Proposed cooperative H-ARQ system that can improve the above problems and can get the better performance. In proposed cooperative system with H-ARQ method, if the received signal from source node is satisfied by the destination preferentially, the destination transmit ACK message to both relay node and source node, and then recovers the received signal. In addition, if ARQ message indicates NACK message, relay node operates selective retransmission. Based on the simulation results in aspect to BER performance and throughput, the proposed method which combined cooperative system with H-ARQ based on cross-layer coding can improve spectral efficiency reliability of system compared with that of general one by one system.

Multiple Node Flip Fast-SSC Decoding Algorithm for Polar Codes Based on Node Reliability

  • Rui, Guo;Pei, Yang;Na, Ying;Lixin, Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.2
    • /
    • pp.658-675
    • /
    • 2022
  • This paper presents a fast-simplified successive cancellation (SC) flipping (Fast-SSC-Flip) decoding algorithm for polar code. Firstly, by researching the probability distribution of the number of error bits in a node caused by channel noise in simplified-SC (SSC) decoder, a measurement criterion of node reliability is proposed. Under the guidance of the criterion, the most unreliable nodes are firstly located, then the unreliable bits are selected for flipping, so as to realize Fast-SSC-Flip decoding algorithm based on node reliability (NR-Fast-SSC-Flip). Secondly, we extended the proposed NR-Fast-SSC-Flip to multiple node (NR-Fast-SSC-Flip-ω) by considering dynamic update to measure node reliability, where ω is the order of flip-nodes set. The extended algorithm can correct the error bits in multiple nodes, and get good performance at medium and high signal-to-noise (SNR) region. Simulation results show that the proposed NR-Fast-SSC-Flip decoder can obtain 0.27dB and 0.17dB gains, respectively, compared with the traditional Fast-SSC-Flip [14] and the newly proposed two-bit-flipping Fast-SSC (Fast-SSC-2Flip-E2) [18] under the same conditions. Compared with the newly proposed partitioned Fast-SSC-Flip (PA-Fast-SSC-Flip) (s=4) [18], the proposed NR-Fast-SSC-Flip-ω (ω=2) decoder can obtain about 0.21dB gain, and the FER performance exceeds the cyclic-redundancy-check (CRC) aided SC-list (CRC-SCL) decoder (L=4).