• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.299-304
• /
• 2008

For perpendicular magnetic recording channels, it is hard to expect improving the performance by using the PRML or NPML. Hence, we exploit LDPC code to improve the performance. In this paper, we examine a single message-passing detector/decoder matched to the combination of a perpendicular magnetic recording channel detector and an LDPC code decoder. We examine the performance of channel iteration with joint LDPC code on perpendicular magnetic recording channel, and simplify the complexity of the message-passing detector algorithm.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.807-817
• /
• 2008

We present a low-density parity-check (LDPC)-based, threaded layered space-time-frequency system with emphasis on the iterative receiver design. First, the unbiased minimum mean-squared-error iterative-tree-search (U-MMSE-ITS) detector, which is known to be one of the most efficient multi-input multi-output (MIMO) detectors available, is improved by augmentation of the partial-length paths and by the addition of one-bit complement sequences. Compared with the U-MMSE-ITS detector, the improved detector provides better detection performance with lower complexity. Furthermore, the improved detector is robust to arbitrary MIMO channels and to any antenna configurations. Second, based on the structure of the iterative receiver, we present a low-complexity belief-propagation (BP) decoding algorithm for LDPC-codes. This BP decoder not only has low computing complexity but also converges very fast (5 iterations is sufficient). With the efficient receiver employing the improved detector and the low-complexity BP decoder, the proposed system is a promising solution to high-data-rate transmission over selective-fading channels.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.5
• /
• pp.23-33
• /
• 2008

In this paper, we verify the performance of LDPC coded OFDM/DS system by Monte-Carlo simulation of BER on Eb/No. The simulation results show that LDPC coded OFDM/DS has a strong anti-jamming characteristic over pulse-noise jammer and partial-band noise jammer. The performance of LDPC coded OFDM/DS system is evaluated on both faded waveforms and non-faded waveforms. For non-faded waveforms, high coding gain is attained due to LDPC, even when waveforms have short PN sequence and JSR is only 5dB. Especially, the increase in the repeated number of LDPC decoding enhances coding gain. However, faded waveforms cannot achieve sufficient average effect when PN sequence is short. High coding gain of faded waveforms can be achieved by extending length of PN sequence. In addition, we compare LDPC coded OFDM/DS system with Convolutional coded OFDM/DS system. The simulation results illustrate that when LDPC coded OFDM/DS system with short PN sequence has sufficient average effects, the system shows lower BER than Convolutional coded OFDM/DS system with long PN sequence.

• Journal of agriculture & life science
• /
• v.50 no.5
• /
• pp.173-182
• /
• 2016

This study was aimed to identify the phenotypic relationships between calving interval and lactation curve parameters in Korean Holstein cow. The data of 36,505 lactation records was obtained from the Dairy Herd Improvement program run by Dairy Cattle Improvemnet Center of National Agricultural Federation of Korea. All lactation records were collectied from the multiparous cows calving between 2011 to 2013. The estimated lactation curves were drawn using Wood model based on actual milk yield records, and NLIN Procedure of SAS program (ver. 9.2). General linear multivariate models for calving interval, 305-d milk yield, lactation parameters(A, b, c), persistency, peak day, and peak yield included fixed effects of calving year-season (spring, summer, fall and winter) and parity(2, 3 and 4). For calving interval, 305-d milk yield, lactation parameters(A, b, c), persistency, peak day and peak yield, all two fixed effect(calving year-season, parity) were significant(p<0.05). The estimated lactation functions using Wood model for 2, 3, and 4 parity were yt=24.66t0.175e-0.00302t, yt=24.69t0.192e-0.00334t, and yt=24.22t0.200e-0.00341t, respectively. Phenotypic correlation (partial residual correlation) between calving interval and 305-d milk yield, A, b, c, persistency, peak day, and peak yield were 0.093, -0.014, 0.028, -0.046, 0.099, 0.085, and 0.052, respectively. To conclude, if calving interval increase then ascent to peak, persistency, peak day and peak yield are increase, and descent after peak is decrease. So, total 305-d milk yield is increase.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• Asian-Australasian Journal of Animal Sciences
• /
• v.33 no.1
• /
• pp.79-90
• /
• 2020

Objective: In the present study, an liquid chromatography/mass spectrometry (LC/MS) metabolomics approach was performed to investigate potential biomarkers of milk production in high- and low-milk-yield dairy cows and to establish correlations among rumen fluid metabolites. Methods: Sixteen lactating dairy cows with similar parity and days in milk were divided into high-yield (HY) and low-yield (LY) groups based on milk yield. On day 21, rumen fluid metabolites were quantified applying LC/MS. Results: The principal component analysis and orthogonal correction partial least squares discriminant analysis showed significantly separated clusters of the ruminal metabolite profiles of HY and LY groups. Compared with HY group, a total of 24 ruminal metabolites were significantly greater in LY group, such as 3-hydroxyanthranilic acid, carboxylic acids, carboxylic acid derivatives (L-isoleucine, L-valine, L-tyrosine, etc.), diazines (uracil, thymine, cytosine), and palmitic acid, while the concentrations of 30 metabolites were dramatically decreased in LY group compared to HY group, included gentisic acid, caprylic acid, and myristic acid. The metabolite enrichment analysis indicated that protein digestion and absorption, ABC transporters and unsaturated fatty acid biosynthesis were significantly different between the two groups. Correlation analysis between the ruminal microbiome and metabolites revealed that certain typical metabolites were exceedingly associated with definite ruminal bacteria; Firmicutes, Actinobacteria, and Synergistetes phyla were highly correlated with most metabolites. Conclusion: These findings revealed that the ruminal metabolite profiles were significantly different between HY and LY groups, and these results may provide novel insights to evaluate biomarkers for a better feed digestion and may reveal the potential mechanism underlying the difference in milk yield in dairy cows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.363-372
• /
• 2009

For large scale VOD service, cluster servers are spotlighted to their high performance and low cost. A cluster server usually consists of a front-end node and multiple back-end nodes. Though increasing the number of back-end nodes can result in the more QoS streams for clients, the possibility of failures in back-end nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a back-end node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. For the actual VOD service environment, we implement a cluster-based VOD servers composed of general PCs and adopt the parallel processing for MPEG movies. From the implemented VOD server, a video block recovery mechanism is designed on parity algorithms. However, without considering the architecture of cluster-based VOD server, the application of the basic technique causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of back-end nodes. To address these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2783-2790
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard, require a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithms for LDPC codes. First, sequential decoding with partial group is proposed. It has the same H/W complexity, and fewer number of iterations are required with the same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method reduces number of unnecessary iterations. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme. The LDPC decoder have been implemented in Xilinx System Generator and targeted to a Xilinx Virtx5-xc5vlx155t FPGA. When three algorithms are used, amount of device is about 45% off and the decoding speed is about two times faster than convectional scheme.