• Title/Summary/Keyword: 반복부호

Search Result 247, Processing Time 0.024 seconds

Design of a Low-Power LDPC Decoder by Reducing Decoding Iterations (반복 복호 횟수 감소를 통한 저전력 LDPC 복호기 설계)

  • Lee, Jun-Ho;Park, Chang-Soo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.801-809
    • /
    • 2007
  • LDPC Low Density Parity Check) code, which is an error correcting code determined to be applied to the 4th generation mobile communication systems, requires a heavy computational complexity due to iterative decodings to achieve a high BER performance. This paper proposes an algorithm to reduce the number of decoding iterations to increase performance of the decoder in decoding latency and power consumption. Measuring changes between the current decoded LLR values and previous ones, the proposed algorithm predicts directions of the value changes. Based on the prediction, the algorithm inverts the sign bits of the LLR values to speed up convergence, which means parity check equation is satisfied. Simulation results show that the number of iterations has been reduced by about 33% without BER performance degradation in the proposed decoder, and the power consumption has also been decreased in proportional to the amount of the reduced decoding iterations.

A Study on FTN Decoding Method for High Throughput Satellite Communication (고전송율 위성통신을 위한 FTN 신호 복호 기법 연구)

  • Kwon, Hae-Chan;Jung, Ji-Won
    • Journal of Navigation and Port Research
    • /
    • v.38 no.3
    • /
    • pp.211-216
    • /
    • 2014
  • In this paper, high throughput method is studied to provide floating objects with broadband service as ship by using satellite. In recent, satellite broadcastings standard is based on DVB-S3 for communication service using wireless device on navigation communication by satellite. LDPC codes are iterative coding algorithm proposed in DVB-S3. In this paper, FTN technique is applied to LDPC codes with 8-PSK modulation and then present the method to alleviate performance degradation due to FTN through BICM-ID. BICM-ID is the method to improve performance by calculating a new LLR from hard-decision value of decoder output. DVB-S2 system with 8-PSK modulation and FTN technique based on iterative decoding had a better performance than DVB-S2 with 8-PSK modulation and FTN technique over Gaussian channels.

Design of High Speed Binary Arithmetic Encoder for CABAC Encoder (CABAC 부호화기를 위한 고속 이진 산술 부호화기의 설계)

  • Park, Seungyong;Jo, Hyungu;Ryoo, Kwangki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.774-780
    • /
    • 2017
  • This paper proposes an efficient binary arithmetic encoder hardware architecture for CABAC encoding, which is an entropy coding method of HEVC. CABAC is an entropy coding method that is used in HEVC standard. Entropy coding removes statistical redundancy and supports a high compression ratio of images. However, the binary arithmetic encoder causes a delay in real time processing and parallel processing is difficult because of the high dependency between data. The operation of the proposed CABAC BAE hardware structure is to separate the renormalization and process the conventional iterative algorithm in parallel. The new scheme was designed as a four-stage pipeline structure that can reduce critical path optimally. The proposed CABAC BAE hardware architecture was designed with Verilog HDL and implemented in 65nm technology. Its gate count is 8.07K and maximum operating speed of 769MHz. It processes the four bin per clock cycle. Maximum processing speed increased by 26% from existing hardware architectures.

A New Concatenation Scheme of Serial Concatenated Convolutional Codes (직렬연접 길쌈부호의 새로운 연접방법)

  • Bae, Sang-Jae;Ju, Eon-Gyeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.3
    • /
    • pp.125-131
    • /
    • 2002
  • In this paper, a new concatenation scheme of serial concatenated convolutional codes is proposed and the performance analyzed. In the proposed scheme, each of information and parity bits of outer code is entered into inner code through interleaver and deinterleaver. Therefore, the interleaver size is same as the length of input frame. Since the interleaver size of proposed type is reduced to half of the conventional Benedetto type, the interleaver delay time required for iterative decoding is reduced. In addition the multiplexer and demultiplexer are not used in the decoder of the proposed type, the complexity of decoder can be also reduced. As results of simulation, the performance of proposed type shows the better error performance as compared to that of the conventional Benedetto type in case of the same interleaver size. And it can be observed that the difference of BER performance is increased with the increase of Eb/No. In case of the same length of input frame, the proposed type shows almost same performance with Benedetto type despite that the interleaver size is reduced by half.

A Study on the Gray Code Digit Sequence (그래이부호디지트 절차에 관한 연구)

  • 김병찬
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.12 no.5
    • /
    • pp.6-11
    • /
    • 1975
  • 반복형 그래이 부호 중 14진 및 16진 부호용 디지트 절차(digit sequence 또는 DS)의 여러가지 특성에 관하여 논하였으며 그것들을 통일적으로 기적할 수 있는 PDS는 각각 31종 및 11종이 있다는 것을 명백히 하였다. 그리고 이 PDS들에 회전변환과 순렬변환을 실시하여 얻을 수 있는 DS의 총수와 각종 특수 DS의 성질에 관하여도 논하였으며 대칭형 DS를 이용한 14진 및 16진 GC Counter를 설계하여 그것들의 동작을 실험에 의하여 확인하였다. Investigations on some characteristics of Tetra-Decimal and Hexa-Decimal recycling Gray co de (GC)-digit sequence(DS) are carried out, and, 31 and 11 kinds of prime digit sequence(PDS) are proposed respectively. From these PDS, by means of rotational conversion and permutational conversion, the numbers of all DS are obtained, and also the characteristics of some special DS are studied. Tetra Decimal and Hexa-decimal GC counters are designed using symmetrical DS, and, their operations are experimentally verified.

  • PDF

A 4 kbps PSI-VSELP Speech Coding Algorithm (4 kbps PSI-VSELP 음성 부호화 알고리듬)

  • Choi, Yong-Soo;Kang, Hong-Goo;Park, Sang-Wook;Youn, Dae-Hee
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.6
    • /
    • pp.59-65
    • /
    • 1996
  • This paper proposes a 4 kbps PSI-VSELP(Pitch Synchronous Innovation-Vector Sum Excited Linear Prediction) speech coder which produces speech equivalent to that of the conventional 4.8 kbps VSELP. Since the 'half-rate' is differently defined from country to country, there may be a need to reduce the bit rate of conventional half-rate coder. To minimize the degradation of speech quality caused by bit-rate reduction, it is desirable to perform bit-allocation based on the carefull consideration of the effect of various transmission parameters. This paper adopts this analytical approach for bit-allocation at 4 kbps. To improve the quality of the VSELP coder at 4 kbps, basis vectors which play the most important role in the performance, are optimized by an iterative closed-loop training process and the PSI technique is employed in the VSELP performance, are optimized by an iterative closed-loop training process and the PSI technique is employed in the VSELP coder. To demonstrate the performance of the proposed speech coder, we peformed experiments under the noiseless and error free conditions. From experimental results, even though the proposed 4 kbps PSI-VSELP coder showed lower scores in the objective measure, higher scores in subjective measure was obtained compared with those of the conventional 4.8 kbps VSELp.

  • PDF

Design of a Lossless Audio Coding Using Cholesky Decomposition and Golomb-Rice Coding (콜레스키 분해와 골롬-라이스 부호화를 이용한 무손실 오디오 부호화기 설계)

  • Cheong, Cheon-Dae;Shin, Jae-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.11
    • /
    • pp.1480-1490
    • /
    • 2008
  • Design of a linear predictor and matching of an entropy coder is the art of lossless audio coding. In this paper, we use the covariance method and the Choleskey decomposition for calculating linear prediction coefficients instead of the autocorreation method and the Levinson-Durbin recursion. These results are compared to the polynomial predictor. Both of them, the predictor which has small prediction error is selected. For the entropy coding, we use the Golomb-Rice coder using the block-based parameter estimation method and the sequential adaptation method with LOCO-land RLGR. The proposed predictor and the block-based parameter estimation have $2.2879%{\sim}0.3413%$ improved compression ratios compared to FLAC lossless audio coder which use the autocorrelation method and the Levinson-Durbin recursion. The proposed predictor and the LOCO-I adaptation method could improved by $2.2879%{\sim}0.3413%$. But the proposed predictor and the RLGR adaptation method got better results with specific signals.

  • PDF

Performance Analysis of Optical CDMA System with Cross-Layer Concept (계층간 교차 개념을 적용한 광 부호분할 다중접속 시스템의 성능 분석)

  • Kim, Jin-Young;Kim, Eun-Cheol
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.7
    • /
    • pp.13-23
    • /
    • 2009
  • In this paper, the network performance of a turbo coded optical code division multiple access (CDMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated. We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) is considered. In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical CDMA network can be substantially improved by increasing e interleaver length and e number of iterations in e decoding process. The results of this paper can be applied to implement the indoor optical wireless LANs.

An LDPC Code Replication Scheme Suitable for Cloud Computing (클라우드 컴퓨팅에 적합한 LDPC 부호 복제 기법)

  • Kim, Se-Hoe;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.2
    • /
    • pp.134-142
    • /
    • 2012
  • This paper analyze an LDPC code replication method suitable for cloud computing. First, we determine the number of blocks suitable for cloud computing through analysis of the performance for the file availability and storage overhead. Also we determine the type of LDPC code appropriate for cloud computing through the performance for three types of LDPC codes. Finally we present the graph random generation method and the comparing method of each generated LDPC code's performance by the iterative decoding process. By the simulation, we confirmed the best graph's regularity is left-regular or least left-regular. Also, we confirmed the best graph's total number of edges are minimum value or near the minimum value.

Extended Quasi Orthogonal Functions for 3G CDMA Systems (3G CDMA 시스템을 위한 확장 준직교 함수)

  • Lee Kwang-Jae;Moon Myung-Ryong;Hou Jia;Lee Moon-Ho
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.7 s.98
    • /
    • pp.697-708
    • /
    • 2005
  • The forward link of the 3G CDMA system may become limited under the increasing of the number of users. The conventional channelization code, Walsh code, has not enough sizes f3r much possible users, therefore, the quasi orthogonal function(QOF), which process optimal crosscorrelation with Walsh code, is considered. In this paper, we investigate quasi orthogonal function on Jacket matrices, which can lead lower correlations values and better performance in 3G CDMA system. Moreover, to simplify the detector and improve the BER performance, a novel detection for QOF CDMA system is proposed. Finally, the simple recursive generation of the bent sequences for QOF mask function is discussed.