• Title/Summary/Keyword: Parity

Search Result 1,098, Processing Time 0.019 seconds

Low Density Parity Check (LDPC) Coded OFDM System Using Unitary Matrix Modulation (UMM) (UMM(Unitary Matrix Modulation)을 이용한 LDPC(Low Density Parity Check) 코디드 OFDM 시스템)

  • Kim Nam Soo;Kang Hwan Min;Cho Sung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.436-444
    • /
    • 2005
  • Unitary matrix modulation (UMM) is investigated in multiple antennas system that is called unitary space-time modulation (USTM). In an OFDM, the diagonal components of UMM with splitting over the coherence bandwidth (UMM-S/OFDM) have been proposed. Recently LDPC code is strongly attended and studied due to simple decoding property with good error correction property. In this paper, we propose LDPC coded UMM-S/OFDM for increasing the system performance. Our proposed system can obtain frequency diversity using UMM-S/OFDM like USTM/OFDM, and large coding gain using LDPC code. The superior characteristics of the proposed UMM-S/OFDM are demonstrated by extensive computer simulations in multi-path Rayleigh fading channel.

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.

Architecture of an LDPC Decoder for DVB-S2 using reuse Technique of processing units and Memory Relocation (연산기와 메모리 재사용을 이용한 효율적인 DVB-S2 규격의 LDPC 복호기 구조)

  • Park Jae-Geun;Lee Chan-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.9 s.351
    • /
    • pp.31-37
    • /
    • 2006
  • Low-density parity-check (LDPC) codes are recently emerged due to its excellent performance. The standard for European high definition satellite digital video broadcast, DVB-S2 has adopted LDPC codes as a channel coding scheme. This paper proposes a DVB-S2 LDPC decoder architecture using a hybrid parity check matrix which is efficient in hardware implementation for both decoders and encoders. The hybrid H-matrices are constructed so that both the semi-random technique and the partly parallel structure can be applied to design encoders and decoders. Using the hybrid H-matrix scheme, the architecture of LDPC decoder for DVB-S2 can be very practical and efficient. In addition, we show a new Variable Node processor Unit (VNU) architecture to reuse the VNU for various code rates and optimized block memory placement to reuse. We design a DVB-S2 LDPC decoder of code rate 1/2 usng the proposed architecture. We estimate the performance of the DVB-S2 LDPC decoder and compare it with other decoders.

Average Repair Read Cost of Linear Repairable Code Ensembles (선형 재생 부호 앙상블의 평균 복구 접속 비용)

  • Park, Jin Soo;Kim, Jung-Hyun;Park, Ki-Hyeon;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.11
    • /
    • pp.723-729
    • /
    • 2014
  • In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.

A performance analysis of layered LDPC decoder for mobile WiMAX system (모바일 WiMAX용 layered LDPC 복호기의 성능분석)

  • Kim, Eun-Suk;Kim, Hae-Ju;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.921-929
    • /
    • 2011
  • This paper describes an analysis of the decoding performance and decoding convergence speed of layered LDPC(low-density parity-check) decoder for mobile WiMAX system, and the optimal design conditions for hardware implementation are searched. A fixed-point model of LDPC decoder, which is based on the min-sum algorithm and layered decoding scheme, is implemented and simulated using Matlab model. Through fixed-point simulations for the block lengths of 576, 1440, 2304 bits and the code rates of 1/2, 2/3A, 2/3B, 3/4A, 3/4B, 5/6 specified in the IEEE 802.16e standard, the effect of internal bit-width, block length and code rate on the decoding performance are analyzed. Simulation results show that fixed-point bit-width larger than 8 bits with integer part of 5 bits should be used for acceptable decoding performance.

Protograph-Based Block LDPC Code Design for Marine Satellite Communications (해양 위성 통신을 위한 프로토그래프 기반 블록 저밀도 패리티 검사 부호 설계)

  • Jeon, Ki Jun;Ko, Byung Hoon;Myung, Se-Chang;Lee, Seong Ro;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.7
    • /
    • pp.515-520
    • /
    • 2014
  • In this paper, the protograph-based block low density parity check (LDPC) code, which improves the performance and reduces the encoder/decoder complexity than the conventional Digital Video Broadcasting Satellite Second Generation (DVB-S2) LDPC code used for the marine satellite communication, is proposed. The computer simulation results verify that the proposed protograph-based LDPC code has the better performance in both the bit error rate (BER) and the frame error rate (FER) than the conventional DVB-S2 LDPC code. Furthermore, by analyzing the encoding and decoding computational complexity, we show that the protograph-based block LDPC code has the efficient encoder/decoder structure.

A Packet Loss Control Scheme based on Network Conditions and Data Priority (네트워크 상태와 데이타 중요도에 기반한 패킷 손실 제어 기법)

  • Park, Tae-Uk;Chung, Ki-Dong
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.1-10
    • /
    • 2004
  • This study discusses Application-layer FEC using erasure codes. Because of the simple decoding process, erasure codes are used effectively in Application-layer FEC to deal with Packet-level errors. The large number of parity packets makes the loss rate to be small, but causes the network congestion to be worse. Thus, a redundancy control algorithm that can adjust the number of parity packets depending on network conditions is necessary. In addition, it is natural that high-priority frames such as I frames should produce more parity packets than low-priority frames such as P and B frames. In this paper, we propose a redundancy control algorithm that can adjust the amount of redundancy depending on the network conditions and depending on data priority, and test the performance in simple links and congestion links.

Genetic Evaluation of Somatic Cell Counts of Holstein Cattle in Zimbabwe

  • Mangwiro, F.K.;Mhlanga, F.N.;Dzama, K.;Makuza, S.M.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.13 no.10
    • /
    • pp.1347-1352
    • /
    • 2000
  • The objectives of the study were to examine non-genetic factors that influence somatic cell counts in dairy cattle and to estimate the genetic parameters of somatic cell counts. A total of 34, 097-test day somatic cell count records were obtained from the Zimbabwe Dairy Services Association (ZDSA). The data were from 5, 615 Holstein daughters of 390 sires and 2, 541 dams tested between May 1994 and December 1998. First lactation cows contributed 22, 147 records to the data set, while 11, 950 records were from second and later parity cows. The model for analysis included fixed effects of month of calving, year of calving, stage of lactation, calving interval and test date. Milk yield and age on test day were fitted in the model as covariates. The additive genetic effects pertaining to cows, sires and dams and the residual error were the random effects. The Average Information Restricted Maximum Likelihood algorithm was used for analysis. The heritability of somatic cell scores was low at $0.027{\pm}0.013$ for parity one cows and $0.087{\pm}0.031$ for parity two and above. Repeatability estimates were $0.22{\pm}0.01$ and $0.30{\pm}0.01$ for the two lactation groups, respectively. Genetic and phenotypic correlations between the somatic cell scores and test day milk production were small and negative. It seems that there is no genetic link between somatic cell counts and milk yield in Holstein cattle in Zimbabwe. The results also seem to indicate that somatic cell count is a trait that is mainly governed by environmental factors.

Network-Coding-Based Coded Cooperation

  • Wu, Suwen;Zhu, Jinkang;Qiu, Ling;Zhao, Ming
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.366-374
    • /
    • 2010
  • Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

Epidemiological Study on Breast Cancer Associated Risk Factors and Screening Practices among Women in the Holy City of Varanasi, Uttar Pradesh, India

  • Paul, Shatabdi;Solanki, Prem Prakash;Shahi, Uday Pratap;Srikrishna, Saripella
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.18
    • /
    • pp.8163-8171
    • /
    • 2016
  • Background: Breast cancer is the second most cause of death (1.38 million, 10.9% of all cancer) worldwide after lung cancer. In present study, we assess the knowledge, level of awareness of risk factors and screening practices especially breast self examination (BSE) among women, considering the non-feasibility of diagnostic tools such as mammography for breast screening techniques of breast cancer in the holy city Varanasi, Uttar Pradesh, India. Materials and Methods: A cross-sectional population based survey was conducted. The investigation tool adopted was self administrated questionnaire format. Data were analysed using SPSS 20 version and Chi square test to determine significant association between various education groups with awareness and knowledge, analysis of variance was applied in order to establish significance. Results: The attitude of participants in this study, among 560 women 500 (89%) responded (age group 18-65 years), 53.8% were married. The knowledge about BSE was very low (16%) and out of them 15.6% were practised BSE only once in life time. study shown that prominent age at which women achieve their parity was 20 yrs, among 500 participants 224 women have achieved their parity from age 18 to 30 yrs. Very well known awareness about risk factors of breast cancer were alcohol (64.6%), smoking (64%) and least known awareness risk factors were early menarche (17.2%) and use of red meat (23%). The recovery factors of breast cancer cases were doctors support (95%) and family support (94.5%) as most familiar responses of the holy city Varanasi. Conclusions: The study revealed that the awareness about risk factors and practised of BSE among women in Varanasi is extremely low in comparison with other cities and countries as well (Delhi, Mumbai, Himachal Pradesh, Turkey and Nigeria). However, doctors and health workers may promote the early diagnosis of breast cancer.