• Title/Summary/Keyword: Check Node Ratio

Search Result 7, Processing Time 0.022 seconds

New Min-sum LDPC Decoding Algorithm Using SNR-Considered Adaptive Scaling Factors

  • Jung, Yongmin;Jung, Yunho;Lee, Seongjoo;Kim, Jaeseok
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.591-598
    • /
    • 2014
  • This paper proposes a new min-sum algorithm for low-density parity-check decoding. In this paper, we first define the negative and positive effects of the received signal-to-noise ratio (SNR) in the min-sum decoding algorithm. To improve the performance of error correction by considering the negative and positive effects of the received SNR, the proposed algorithm applies adaptive scaling factors not only to extrinsic information but also to a received log-likelihood ratio. We also propose a combined variable and check node architecture to realize the proposed algorithm with low complexity. The simulation results show that the proposed algorithm achieves up to 0.4 dB coding gain with low complexity compared to existing min-sum-based algorithms.

Parity Check Based Iterative Interference Cancellation Scheme for LDPC Coded MIMO Systems (LDPC 부호화된 MIMO 시스템을 위한 패리티 검사 기반 반복 간섭 제거 기법)

  • Park, Sangjoon;Choi, Sooyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1728-1730
    • /
    • 2015
  • In this letter, a parity check based iterative IC scheme is proposed for LDPC coded MIMO systems. After the decoding procedures in each iteration of the proposed scheme, each decoded codeword is utilized for the IC procedures only when the ratio of the check nodes satisfying the parity check equations to the total number of check nodes is not smaller than the pre-defined threshold value. Simulation results verify that the proposed scheme can achieve an improved BLER at the high SNR region compared to the conventional iterative IC scheme.

Combined Normalized and Offset Min-Sum Algorithm for Low-Density Parity-Check Codes (LDPC 부호의 복호를 위한 정규화와 오프셋이 조합된 최소-합 알고리즘)

  • Lee, Hee-ran;Yun, In-Woo;Kim, Joon Tae
    • Journal of Broadcast Engineering
    • /
    • v.25 no.1
    • /
    • pp.36-47
    • /
    • 2020
  • The improved belief-propagation-based algorithms, such as normalized min-sum algorithm (NMSA) or offset min-sum algorithm (OMSA), are widely used to decode LDPC(Low-Density Parity-Check) codes because they are less computationally complex and work well even at low SNR(Signal-to-Noise Ratio). However, these algorithms work well only when an appropriate normalization factor or offset value is used. A new method that uses a CMD(Check Node Message Distribution) chart and least-square method, which has been recently proposed, has advantages on computational complexity over other approaches to get optimal coefficients. Furthermore, this method can be used to derive coefficients for each iteration. In this paper, we apply this method and propose an algorithm to derive a combination of normalization factor and offset value for a combined normalized and offset min-sum algorithm to further improve the decoding of LDPC codes. Simulations on the next-generation broadcasting standards, ATSC 3.0 LDPC codes, prove that a combined normalized and offset min-sum algorithm which takes the proposed coefficients as correction coefficients shows the best BER performance among other decoding algorithms.

A study of set route path avoiding traffic concentration in Mobile Ad hoc Network (MANET에서 트래픽 집중현상을 회피하는 경로설정에 관한 연구)

  • Oh, Dong-keun;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.781-783
    • /
    • 2014
  • Mobile ad hoc network(MANET) consists of node that has mobility. MANET has increased overhead that caused by frequent topology changes. For reducing overhead, hierarchical network that communicates through cluster head node has been researched. When traffic is concentrated on cluster head node, cluster member node can't send message. To solve this problem, we proposed Step Parent algorithm. Proposed algorithm, cluster member node checks traffic of cluster head node using route path of other cluster head node in efficient coverage area. When cluster head node has increased traffic, cluster member node make a new route path by route path by routing path to another cluster head node. So cluster member node sends a message to destination node, we check improving delivery ratio.

  • PDF

LDPC Decoder Architecture for High-speed UWB System (고속 UWB 시스템의 LDPC 디코더 구조 설계)

  • Choi, Sung-Woo;Lee, Woo-Yong;Chung, Hyun-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3C
    • /
    • pp.287-294
    • /
    • 2010
  • MB-OFDM UWB system will adopt LDPC codes to enhance the decoding performance with higher data rates. In this paper, we will consider algorithm and architecture of the LDPC codes in MB-OFDM UWB system. To suggest the hardware efficient LDPC decoder architecture, LLR(log-likelihood-ration) calculation algorithms and check node update algorithms are analyzed. And we proposed the architecture of LDPC decoder for the high throughput application of Wimedia UWB. We estimated the feasibility of the proposed architecture by implementation in a FPGA. The implementation results show our architecture attains higher throughput than other result of QC-LDPC case. Using this architecture, we can implement LDPC decoder for high throughput transmission, but it is 0.2dB inferior to the BP algorithm.

A Study on Secure Routing Technique using Trust Model in Mobile Ad-hoc Network (신뢰 모델을 이용한 보안 라우팅 기법에 관한 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.17 no.4
    • /
    • pp.11-16
    • /
    • 2017
  • MANET composed of only mobile node is applied to various environments because of its advantage which can construct network quickly in emergency situation. However, many routing vulnerabilities are exposed due to the dynamic topology and link failures by the movement of nodes. It can significantly degrade network performance. In this paper, we propose a secure routing protocol based on trust model. The domain-based network structure is used for efficient trust evaluation and management of nodes in the proposed technique. The reliability evaluation of nodes was performed by the discard ratio of control packet and data packet of the nodes. The abnormal nodes are detected by performing traffic check and inspecting of nodes on a path that generates excessive traffic in order to increase the efficiency of routing. It is confirmed through experiments of the proposed technique that data transmission is performed securely even if an attack exists on the path.

Characteristics of Tillering as Affected by Light intensity in Dasanbyeo, an Indica/Japonica High Yielding Rice Cultivar (광도 변화에 따른 다산벼의 분얼경 발생 특성)

  • 김덕수;양원하;신진철;김제규;류점호
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.4 no.3
    • /
    • pp.151-158
    • /
    • 2002
  • In Korean high yielding varieties developed by crosses between indica and japonica rice, the most limiting factor for yield increase may be attributed to the less number of tillers per unit area. The goal of this study is to find out the effect of the environmental factors as well as cultivation practice on the development and increase of tillers of Dasanbyeo, the high yielding indica / japonica hybrid cultivar. The effect of temperature was examined with 3 different light intensity, 220,600, and 1220 $\mu$㏖/s/$m^2$, respectively. For all the experiments, the leading japonica variety in Korea, Hwaseongbyeo, was used fur the check cultivar for the comparison with Dasanbyeo. The increase of the tillers was more prominent in Dasanbyeo than in Hwaseongbyeo at 220 $\mu$㏖/s/$m^2$ of light intensity, while the similar increase of tiller no. was found at 600 $\mu$㏖/s/$m^2$ of light intensity treatment. However, Hwaseongbyeo showed more rapid increase of tiller at 1220 $\mu$㏖/s/$m^2$ of light intensity. The mean number of the primary tiller ranged 5 to 7 in Dasanbyeo, and 2 to 7 in Hwaseongbyeo, showing greater variation in the latter case. However, the secondary tiller number ranged from 2 to 13 for the former, and 2 to 12 for the latter. The earliest initiation of tiller node of Dasanbyeo and Hwaseongbyeo was observed on 6 and 4 days after transplanting(DAT), respectively, at 600 $\mu$㏖/s/$m^2$ of light intensity, while 10, and 7 DAT, respectively, at 1,220 $\mu$㏖/s/$m^2$. No cultivar difference was observed at 600 $\mu$㏖/s/$m^2$ with the 18 DAT. The ratio of effective tiller was lower in Dasanbyeo, ranging from 47 to 55% than in Hwaseongbyeo, ranging from 72 to 100%.