• Title/Summary/Keyword: 패리티비트

Search Result 79, Processing Time 0.024 seconds

A New Parity Preserving Run-length Limited Code for Optical Recording System (광 기록 저장 장치를 위한 새로운 패리티 보존형 런-길이 제한 코드)

  • Hong, Hyun-Sun;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1C
    • /
    • pp.59-64
    • /
    • 2004
  • We propose a new RLL(run length limited) (2,7) PP(parity preserving) code with 4 RMTR(repeated minimum transition run) for optical recording. The proposed code has better characteristics in terms of density ratio, RMTR, DC(direct current) component suppression, BER(bit error rate) and system complexity than (2,1O) code that currently applied in storage systems and (1,7) PP code that highly recommended as the next generation optical recording system. Some characteristics of the code are described with several simulations. And the proposed code's superiorites in performance is illustrated as compared with the other codes.

Learning method of a Neural Network using Genetic Algorithm for 3 Bit Parity Discrimination (패리티 판별을 위한 유전자 알고리즘을 사용한 신경회로망의 학습법)

  • Choi, Jae-Seung;Kim, Chung-Hwa
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.2 s.314
    • /
    • pp.11-18
    • /
    • 2007
  • Back propagation algorithm based on a gradient-decent method has been widely used to the training of a neural network. However, this algorithm have some problems such as dropping the minimum value in a local area according to an initial value and setting the number of units in a hidden layer when training the neural network. Accordingly, to solve the above-mentioned problems, this paper proposes a genetic algorithm using the training method of the neural network. Thus, the improved genetic algorithm using a new crossover and mutation method is proposed to discriminate 3 bit parity. Experiments confirm that the proposed system is effective for training speed after demonstrating for generation gap, the number of units in the hidden layer, and the number of individuals.

Multiple UART Communications Using CAN Bus (CAN 버스를 이용한 다중 UART 통신)

  • Kang, Tae-Wook;Lee, Seongsoo
    • Journal of IKEEE
    • /
    • v.24 no.4
    • /
    • pp.1184-1187
    • /
    • 2020
  • This paper proposes an in-vehicle network controller fully exploiting the advantages of UART (Universal Asynchronous Receiver/Transmitter) and CAN (Controller Area Network). UART is used in 1-to-1 communication and it exploits parity bit for data integrity check. The proposed in-vehicle network controller converts UART into CAN, which enables multiple communications along with 1-to-1 communication. Also, the proposed in-vehicle network controller exploits CRC (cyclic redundancy check) for data integrity check, which increases communication reliability. CAN is controlled by microprocessor, but the proposed in-vehicle network controller can be controlled by any devices compliant with RS-232, RS-422, and RS-485.

A Balancing Method of Stereo Pairs for Stereo Coding (스테레오 코딩을 위한 스테레오 영상의 밸런싱 방법)

  • Kim, Jong-Su;Choi, Jong-Ho;Kim, Tae-Yong;Choi, Jong-Soo
    • KSCI Review
    • /
    • v.15 no.1
    • /
    • pp.173-177
    • /
    • 2007
  • 3D 디스플레이 기술이 발전함에 따라 스테레오 영상의 전송시 요구되는 비트레이트의 감소가 절실히 필요하다. 하지만, 스테레오 영상은 서로 다른 카메라에 의해 취득되기 때문에 잠재적으로 서로 차이가 있고, 이것은 디스패리티 추정시 큰 오차를 유발할 수 있으며 전송될 비트레이트에 영향을 줄 수 있다. 따라서 스테레오 영상들 사이의 밸런싱이 필요하다. 스테레오 영상의 밸런싱을 위해, 본 논문에서는 히스토그램 Specification 방법과 타깃 영상의 국부정보, 스테레오 영상간의 오차 분포를 이용한다. 히스토그램 Specification 방법은 그레이레벨의 맵핑관계를 정의한다. 따라서 이를 통해 맵핑될 레벨의 맵핑 구간을 구할 수 있다. 그 구간에서, 맵핑될 기준영상의 히스토그램 분포와 스테레오 오차값의 분포는 서로 모양이 유사할 것이다. 그러나, 폐색된 영역이나 노이즈에 의해 그 모양이 변하므로 우리는 맵핑될 픽셀들을 오차영상에서 그 픽셀들의 근방에서 구한 평균들과 오른쪽 영상(타깃 영상)에서 맵핑될 픽셀의 근방에서 구한 평균이 최소 값을 갖는 위치 값으로 맵핑한다. 제안된 방법은 실험에서 기존 방법보다 향상된 결과를 나타내는 것을 보여 준다.

  • PDF

Analysis of Performance according to LDPC Decoding Algorithms (저밀도 패리티 검사부호의 복호 알고리즘에 따른 성능 비교 분석)

  • Yoon, Tae Hyun;Park, Jin Tae;Joo, Eon Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.972-978
    • /
    • 2012
  • LDPC (low density parity check) code shows near Shannon limit performance by iterative decoding based on sum-product algorithm (SPA). Message updating procedure between variable and check nodes in SPA is done by a scheduling method. LDPC code shows different performance according to scheduling schemes. The conventional researches have been shown that the shuffled BP (belief propagation) algorithm shows better performance than the standard BP algorithm although it needs less number of iterations. However the reason is not analyzed clearly. Therefore the reason of difference in performance according to LDPC decoding algorithms is analyzed in this paper. 4 cases according to satisfaction of parity check condition are considered and compared. As results, the difference in the updating procedure in a cycle in the parity check matrix is considered to be the main reason of performance difference.

Adaptive Hard Decision Aided Fast Decoding Method using Parity Request Estimation in Distributed Video Coding (패리티 요구량 예측을 이용한 적응적 경판정 출력 기반 고속 분산 비디오 복호화 기술)

  • Shim, Hiuk-Jae;Oh, Ryang-Geun;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.4
    • /
    • pp.635-646
    • /
    • 2011
  • In distributed video coding, low complexity encoder can be realized by shifting encoder-side complex processes to decoder-side. However, not only motion estimation/compensation processes but also complex LDPC decoding process are imposed to the Wyner-Ziv decoder, therefore decoder-side complexity has been one important issue to improve. LDPC decoding process consists of numerous iterative decoding processes, therefore complexity increases as the number of iteration increases. This iterative LDPC decoding process accounts for more than 60% of whole WZ decoding complexity, therefore it can be said to be a main target for complexity reduction. Previously, HDA (Hard Decision Aided) method is introduced for fast LDPC decoding process. For currently received parity bits, HDA method certainly reduces the complexity of decoding process, however, LDPC decoding process is still performed even with insufficient amount of parity request which cannot lead to successful LDPC decoding. Therefore, we can further reduce complexity by avoiding the decoding process for insufficient parity bits. In this paper, therefore, a parity request estimation method is proposed using bit plane-wise correlation and temporal correlation. Joint usage of HDA method and the proposed method achieves about 72% of complexity reduction in LDPC decoding process, while rate distortion performance is degraded only by -0.0275 dB in BDPSNR.

Adaptive Bit-Reliability Mapping for LDPC-Coded High-Order Modulation Systems (LDPC 부호화 고차 변조 시스템을 위한 신뢰성 기반의 적응적 비트 매핑 기법)

  • Joo, Hyeong-Gun;Hong, Song-Nam;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12C
    • /
    • pp.1135-1141
    • /
    • 2007
  • In this paper, an adaptive bit-reliability mapping is proposed for the bit-level Chase combining in LDPC-coded high-order modulation systems. Contrary to the previously known bit-reliability mapping that assigns the information (or parity) bits to more (or less) reliable bit positions, the proposed mapping adaptively assigns codeword bits to the bit positions of various reliabilities by considering the characteristics of code and protection levels of bits in high-order modulation symbol. Compared with the symbol-level Chase combining and the constellation rearrangement bit mapping, the proposed mapping gives $0.7{\sim}1.3$ dB and $0.1{\sim}1.0$ dB performance gain at $FER=10^{-3}$ with no additional complexity, respectively. Adaptive bit-reliability mappings are derived for various environments and the validity of them is confirmed through simulation.

Efficient Correlation Noise Modeling and Performance Analysis for Distributed Video Coding System (분산 동영상 부호화 시스템을 위한 효과적인 상관 잡음 모델링 및 성능평가)

  • Moon, Hak-Soo;Lee, Chang-Woo;Lee, Seong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6C
    • /
    • pp.368-375
    • /
    • 2011
  • In the distributed video coding system, the parity bits, which are generated in encoders, are used to reconstruct Wyner-Ziv frames. Since the original Wyner-Ziv frames are not known in decoders, the efficient correlation noise modeling for turbo or LDPC code is necessary. In this paper, an efficient correlation noise modeling method is proposed and the performance is analyzed. The method to estimate the quantization parameters for key frames, which are encoded using H.264 intraframe coding technique, is also proposed. The performance of the proposed system is evaluated by extensive computer simulations.

Rate-Distortion Control Method for Distributed Video Coding System (분산 동영상 부호화 시스템을 위한 전송률 및 왜곡 제어 방법)

  • Moon, Hak-Soo;Lee, Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.952-960
    • /
    • 2012
  • In the distributed video coding (DVC) system, the difference between the side information and the original Wyner-Ziv frame is corrected using channel codes and the additional parity bits are requested through feedback channel if the error is not corrected. The efficient bit rate control is important to use the DVC system in the band-limited channel, such as mobile communication environments. In this paper, the constant bit rate control method in the encoder of the DVC system is proposed. The coding performance as well as the bit rate is efficiently controlled by the proposed method.

Incremental Redundancy Hybrid ARQ (IR-HARQ) Scheme Using Block LDPC Codes (블록 LDPC의 Incremental Redundancy Hybrid ARQ (IR-HARQ) 기법)

  • Kim, Dong Ho;Lee, Ye Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.662-668
    • /
    • 2013
  • Mobile communication systems have been adopting link adaptive transmission schemes such as adaptive modulation and coding (AMC) and hybrid-ARQ (HARQ). Incremental redundancy (IR) HARQ scheme is known to be highly efficient in terms of throughput and power consumption and can be a good solution for mobile communication systems. In this paper, we propose an IR-HARQ scheme based on dual-diagonal parity-type block LDPC codes in which we define a transmission priority of coded bits and propose the sub-packet construction rule. We present the throughput performance of IR-HARQ with various modulation and coding and multi-antenna modes. Consequently, the proposed scheme provides the improvement of system throughput by elaborate link adaptation with CQI information.