• Title/Summary/Keyword: reliability-based decoding

Search Result 35, Processing Time 0.022 seconds

Lowering Error Floor of LDPC Codes Using an Improved Parallel WBF Algorithm

  • Ma, Kexiang;Li, Yongzhao;Zhu, Caizhi;Zhang, Hailin;Zhang, Yuming
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.171-174
    • /
    • 2014
  • In weighted bit-flipping-based algorithms for low-density parity-check (LDPC) codes, due to the existence of overconfident incorrectly received bits, the metric values of the corresponding bits will always be wrong in the decoding process. Since these bits cannot be flipped, decoding failure results. To solve this problem, an improved parallel weighted bit flipping algorithm is proposed. Specifically, a reliability-saturation strategy is adopted to increase the flipping probability of the overconfident incorrectly received bits. Simulation results show that the error floor of LDPC codes is greatly lowered.

On the Performance of Turbo Codes-Based Hybrid ARQ with Segment Selective Repeat in WCDMA

  • Shi Tao;Cao Lei
    • Journal of Communications and Networks
    • /
    • v.8 no.2
    • /
    • pp.212-219
    • /
    • 2006
  • In this paper, a new turbo codes-based hybrid automatic repeat request (TC-HARQ) scheme with segment selective repeat (SSR) is proposed. The main strategy is, upon retransmission, to repeat the data that are most important for the next round of decoding based on the distribution of residual errors after current decoding. The performance in terms of reliability and throughput is analyzed. To adapt to correlated fading channels where an inter-leaver is always employed before transmission, we further modify the SSR strategy so that data having experienced correlated deep fading are selected for retransmission. Finally, this proposed scheme is applied to the wideband code division multiple access (WCDMA) system under frequency selective fading channels. Simulation results demonstrate that in all single and multiple user cases, SSR-based TC-HARQ leads to significant throughput improvement with similar bit error rate (BER) performance as compared to type-I TC-HARQ.

Joint Virtual User Identification and Channel Security En/Decoding Method for Ad hoc Network

  • Zhang, Kenan;Li, Xingqian;Ding, Kai;Li, Li
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.11
    • /
    • pp.241-247
    • /
    • 2022
  • Ad hoc network is self-organized network powered by battery. The reliability of virtual user identification and channel security are reduced when SNR is low due to limited user energy. In order to solve this problem, a joint virtual user identification and channel security en/decoding method is proposed in this paper. Transmitter-receiver-based virtual user identification code is generated by executing XOR operation between orthogonal address code of transmitter and pseudo random address code of receiver and encrypted by channel security code to acquire orthogonal random security sequence so as to improve channel security. In order to spread spectrum as well as improve transmission efficiency, data packet is divided into 6-bit symbols, each symbol is mapped with an orthogonal random security sequence. Subspace-based method is adopted by receiver to process received signal firstly, and then a judgment model is established to identify virtual users according to the previous processing results. Simulation results indicate that the proposed method obtains 1.6dB Eb/N0 gains compared with reference methods when miss alarm rate reaches 10-3.

Reliability-Based Deblocking Filter for Wyner-Ziv Video Coding

  • Dinh, Khanh Quoc;Shim, Hiuk Jae;Jeon, Byeungwoo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.2
    • /
    • pp.129-142
    • /
    • 2016
  • In Wyner-Ziv coding, video signals are reconstructed by correcting side information generated by block-based motion estimation/compensation at the decoder. The correction is not always accurate due to the limited number of parity bits and early stopping of low-density parity check accumulate (LDPCA) decoding in distributed video coding, or due to the limited number of measurements in distributed compressive video sensing. The blocking artifacts caused by block-based processing are usually conspicuous in smooth areas and degrade the perceptual quality of the reconstructed video. Conventional deblocking filters try to remove the artifacts by treating both sides of the block boundary equally; however, coding errors generated by block-based processing are not necessarily the same on both sides of the block boundaries. Such a block-wise difference is exploited in this paper to improve deblocking for Wyner-Ziv frameworks by designing a filter where the deblocking strength at each block can be non-identical, depending on the reliability of the reconstructed pixels. Test results show that the proposed filter not only improves subjective quality by reducing the coding artifacts considerably, but also gains rate distortion performance.

A Study on the Decoding of Hamming Codes using Soft Values on the Molecular Communication Channel (분자통신 채널에서 소프트 값을 이용한 해밍부호의 복호에 대한 연구)

  • Cheong, Ho-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.5
    • /
    • pp.338-343
    • /
    • 2020
  • In this paper, it was shown that the decoding method of Hamming codes using soft values can be applied to molecular communication channels. A soft value criterion that can be used for decoding of Hamming codes for a molecular communication channel was proposed, and it has been shown through simulation that the decoding method using these values can improve reliability even in the molecular communication channel. A diffusion-based molecular communication channel was assumed, and information symbols were transmitted using BCSK modulation. After demodulating the number of molecules absorbed by the receiver at each symbol interval with an appropriate threshold, the number of molecules is no longer used. In this paper, the BER performance of the decoder was improved by utilizing information on the number of molecules that are no longer used as soft values in the decoding process. Simulation was performed to confirm the improvement in BER performance. When the number of molecules per bit is 600, the error rate of the Hamming code (15,11) was improved about 5.0×10-3 to the error rate of the BCSK system without the Hamming code. It can be seen that the error rate of (15,11) Hamming code with the soft values was improved to the same extent. In the case of (7,4) Hamming code, the result is similar to that of (15,11) Hamming code. Therefore, it can be seen that the BER performance of the Hamming code can be greatly improved even in the molecular communication channel by using the difference between the number of molecules absorbed by the receiver and the threshold value as a soft value.

The Softest handoff Design using iterative decoding (Turbo Coding)

  • Yi, Byung-K.;Kim, Sang-G.;Picknoltz, Raymond-L.
    • Journal of Communications and Networks
    • /
    • v.2 no.1
    • /
    • pp.76-84
    • /
    • 2000
  • Communication systems, including cell-based mobile communication systems, multiple satellite communication systems of multi-beam satellite systems, require reliable handoff methods between cell-to-cell, satellite-to-satellite of beam-to-team, respectively. Recent measurement of a CDMA cellular system indicates that the system is in handoff at about 35% to 70% of an average call period. Therefore, system reliability during handoff is one of the major system performance parameters and eventually becomes a factor in the overall system capacity. This paper presents novel and improved techniques for handoff in cellular communications, multi-beam and multi-satellite systems that require handoff during a session. this new handoff system combines the soft handoff mechanism currently implemented in the IS-95 CDMA with code and packet diversity combining techniques and an iterative decoding algorithm (Turbo Coding). the Turbo code introduced by Berrou et all. has been demonstrated its remarkable performance achieving the near Shannon channel capacity [1]. Recently. Turbo codes have been adapted as the coding scheme for the data transmission of the third generation international cellular communication standards : UTRA and CDMA 2000. Our proposed encoder and decoder schemes modified from the original Turbo code is suitable for the code and packet diversity combining techniques. this proposed system provides not only an unprecedented coding gain from the Turbo code and it iterative decoding, but also gain induced by the code and packet diversity combining technique which is similar to the hybrid Type II ARQ. We demonstrate performance improvements in AWGN channel and Rayleigh fading channel with perfect channel state information (CSI) through simulations for at low signal to noise ratio and analysis using exact upper bounding techniques for medium to high signal to noise ratio.

  • PDF

A Study of MIMO FTN Scheme based on Layered Space Time Code using Turbo Code (터보부호를 이용한 계층적 시공간 부호기반 MIMO FTN 전송기법 연구)

  • Park, Gun-Woong;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.895-901
    • /
    • 2016
  • The next generation wireless and satellite communications require high transmission efficiency and high reliability to provide various services with subscribers. To satisfied these requirements, incorporated MIMO (Multiple Input Multiple Output) system with FTN (Faster Than Nyquist) techniques based on layered space time coded method are considered in the paper. To improve performance, STTC (Space Time Trellis Code) was employed as an inner code. As the same as SISO (Single Input Single Output) system, the outer codes are turbo codes. In receiver side, BCJR algorithm is used for STTC decoding in order to eliminate interferences induced by FTN transmission. They can yield significantly increased the data rates and improved link reliability without additional bandwidth. Therefore, we proposed a new decoding model for MIMO FTN model and confirmed that performance was improved compared to conventional SISO model according to amount of interference for FTN.

An Aging Measurement Scheme for Flash Memory Using LDPC Decoding Information

  • Kang, Taegeun;Yi, Hyunbean
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.1
    • /
    • pp.29-36
    • /
    • 2020
  • Wear-leveling techniques and Error Correction Codes (ECCs) are essential for the improvement of the reliability and durability of flash memories. Low-Density Parity-Check (LDPC) codes have higher error correction capabilities than conventional ECCs and have been applied to various flash memory-based storage devices. Conventional wear-leveling schemes using only the number of Program/Erase (P/E) cycles are not enough to reflect the actual aging differences of flash memory components. This paper introduces an actual aging measurement scheme for flash memory wear-leveling using LDPC decoding information. Our analysis, using error-rates obtained from an flash memory module, shows that LDPC decoding information can represent the aging degree of each block. We also show the effectiveness of the wear-leveling based on the proposed scheme through wear-leveling simulation experiments.

Design and Implementation of Intelligent IP Switch with Packet FEC for Ensuring Reliability of ATSC 3.0 Broadcast Streams

  • Lee, Song Yeon;Paik, Jong Ho;Dan, Hyun Seok
    • Journal of Internet Computing and Services
    • /
    • v.20 no.2
    • /
    • pp.21-27
    • /
    • 2019
  • The terrestrial ATSC 3.0 broadcasting system, which is capable of converging broadcast and communication services, uses IP based technology for data transmission between broadcasting equipment. In addition, data transmission between broadcasting equipment uses IP-based technology like existing wired communication network, which has advantageous in terms of equipment construction and maintenance In case IP based data transmission technology is used, however, it may inevitably cause an error that a packet is lost during transmission depending on the network environments. In order to cope with a broadcasting accident caused by such a transmission error or a malfunction of a broadcasting apparatus, a broadcasting system is generally configured as a duplication, which can transmit a normal packet when various types of error may occur. By this reason, correction method of error packets and intelligent switching technology are essential. Therefore, in this paper, we propose a design and implementation of intelligent IP switch for Ensuring Reliability of ATSC 3.0 Broadcast Streams. The proposed intelligent IP consists of IP Stream Analysis Module, ALP Stream Analysis Module, STL Stream Analysis Module and SMPTE 2022-1 based FEC Encoding/Decoding Module.

A High Speed LDPC Decoder Structure Based on the HSS (HSS 기반 초고속 LDPC 복호를 위한 구조)

  • Lee, In-Ki;Kim, Min-Hyuk;Oh, Deock-Gil;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.2
    • /
    • pp.140-145
    • /
    • 2013
  • This paper proposes the high speed LDPC decoder structure base on the DVB-S2. Firstly, We study the solution to avoid the memory conflict. For the high speed decoding process the decoder adapts the HSS(Horizontal Shuffle Scheduling) scheme. Secondly, for the high speed decoding algorithm normalized Min-Sum algorithm is adapted instead of Sum-Product algorithm. And the self corrected is a variant of the LDPC decoding that sets the reliability of a Mc${\rightarrow}$v message to 0 if there is an inconsistency between the signs of the current incoming messages Mv'${\rightarrow}$c and the sign of the previous incoming messages Moldv'${\rightarrow}$c This self-corrected algorithm avoids the propagation on unreliable information in the Tanner graph and thus, helps the convergence of the decoder.Start after striking space key 2 times. Lastly, and this paper propose the optimal hardware architecture supporting the high speed throughput.