• 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.

• 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.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.4
• /
• pp.198-204
• /
• 2024

LDPC, known for its excellent error correction capability, has been adopted as the channel coding technique in the IRIG 106 standard, which is standard for data transmission methods in the aerospace field. Iterative codes such as LDPC require large block sizes and number of iterations in order to improve performance. However, large number of iterations induce computational complexity and power consumption. To solve these problems, this paper presents a parity check-based early stop algorithm that reduces the average number of iterations while maintaining the same performance. BER performance and iteration reduction amounts are compared between early stop algorithm and conventional method that has fixed number of iterations for various coding rate and information bit size defined in the IRIG 106 standard. Through simulation results, we confirmed required iteration numbers are reduced about 50% above without performance loss.

• Journal of the Korean Society for Geothermal and Hydrothermal Energy
• /
• v.14 no.1
• /
• pp.16-21
• /
• 2018

This work aims to develop a platform to investigate the effect of operation schedules on the building energy consumption and to derive a simulation model based optimal start and stop daily strategy. An open-source building energy simulation tool DOE2 is used for the engine, and the developed simulation model is validated using ASHRAE guideline 14. The effect of late-start/early-stop operation of HVAC system on the daily building energy consumption was analyzed using the developed simulation model. It was found that about 10% of energy consumption cut was possible using the control strategy for an hour of advance of the stop operation, and about 3% per an hour of delay of the start operation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.40 no.1
• /
• pp.59-67
• /
• 2020

In this study, a suitable algorithm for each BRT stop type is presented through the network construction and algorithm design effect analysis through the LISA, a traffic signal program, for the BRT stop type in the BRT Design Guidelines, Ministry of Land, Transport and Maritime Affairs, 2010.6. It was. The phase insert technique is the most effective method for the stop before passing the intersection, the early green technique for the stop after the intersection, and the extend green technique for the mid-block type stop. The extension green technique is used only because it consists of BRT vehicles, general vehicles and pedestrians. Analyzed. After passing through the intersection, the stop was analyzed as 56.4 seconds for the total crossing time and 29.8 seconds for the delay time. In the mid-block type stop, the total travel time of the intersection was 40.5 seconds, the delay time was 9.6 seconds, the average travel time of up and down BRT was 70.2 seconds, the delay time was 14.0 seconds, and the number of passages was 29.

• Phonetics and Speech Sciences
• /
• v.2 no.4
• /
• pp.29-37
• /
• 2010

Previous studies have investigated a between-category relationship of multiple acoustic cues for a laryngeal contrast by examining the distributions of VOT, f0 and H1-H2. The current study examined within-category correlations between cues comprising stops by Korean- and English-speaking adults and children to understand how children master the internal structure of stop phonation types in two languages. Word-initial stops were collected from about 70 children and 15 adults speaking English and Korean, and were analyzed in terms of VOT, f0 and H1-H2 to compute correlation coefficients. Findings in adults' productions included a gender-differentiated cue-correlation pattern associated with H1-H2 in Korean tense stops and a trading relationship between f0 and VOT in Korean lax and aspirated stops and English voiced and voiceless stops. Children did not necessarily have adult-like cue-correlation patterns even in early-acquired categories, suggesting that the mastery of intra-category structure of phonation type might occur later than inter-category structure.

• Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
• /
• v.17 no.2
• /
• pp.89-97
• /
• 2006

The stop consonants in Korean are classified into three types according to the manner of articulation as unaspirated (UA), slightly aspirated (SA) and heavily aspirated (HA) stops. Both the UA and the HA types are always voiceless in any environment. Generally, the voice onset time (VOT) could be measured spectrographically from release of consonant burst to onset of following vowel. The VOT of the UA type is within 20 msec of the burst, and about 40-50 msec in the SA and 50-70 msec in the HA. There have been many efforts to clarify properties that differentiate these manner categories. Umeda, et $al^{1)}$ studied that the fundamental frequency at voice onset after both the UA and HA consonants was higher than that for the SA consonants, and the voice onset times were longest in the HA followed by the SA and UA. Han, et $al^{2)}$ reported in their speech synthesis and perception studies that the SA and UA stops differed primarily in terms of a gradual versus a relatively rapid intensity build-up of the following vowel after the stop release. Lee, et $al^{3)}$ measured both the intraoral and subglottal air pressure that the subglottal pressure was higher for the HA stop than for the other two stops. They also compared the dynamic pattern of the subglottal pressure slope for the three categories and found that the HA stop showed the most rapid increase in subglottal pressure in the time period immediately before the stop release. $Kagaya^{4)}$ reported fiberscopic and acoustic studies of the Korean stops. He mentioned that the UA type may be characterized by a completely adducted state of the vocal folds, stiffened vocal folds and the abrupt decreasing of the stiffness near the voice onset, while the HA type may be characterized by an extensively abducted state of the vocal folds and a heightened subglottal pressure. On the other hand, none of these positive gestures are observed for the SA type. Hong, et $al^{5)}$ studied electromyographic activity of the thyroarytenoid and posterior cricoarytenoid (PCA) muscles during stop production. He reported a marked and early activation of the PCA muscle associated with a steep reactivation of the thyroarytenoid muscle before voice onset in the production of the HA consonants. For the production of the UA consonants, little or no activation of the PCA muscle and earliest and most marked reactivation of the thyroarytenoid muscle were characteristic. For the SA consonants, he reported a more moderate activation of the PCA muscle than for the UA consonant, and the least and the latest reactivation of the thyroarytenoid muscle. Hong, et $al^{6)}$ studied the observation of the vibratory movements of vocal fold edges in terms of laryngeal gestures according to the different types of stop consonants. The movements of vocal fold edges were evaluated using high speed digital images. EGG signals and acoustic waveforms were also evaluated and related to the vibratory movements of vocal fold edges during stop production.

• Journal of Advanced Information Technology and Convergence
• /
• v.8 no.2
• /
• pp.119-127
• /
• 2018

Training a very large deep neural network can be painfully slow and prone to overfitting. Many researches have done for overcoming the problem. In this paper, a combination of early stopping and ADAM based deep neural network was presented. This form of deep network is useful for handling the big data because it automatically stop the training before overfitting occurs. Also generalization ability is better than pure deep neural network model.

• 한국도로학회:학술대회논문집
• /
• 2011.03a
• /
• pp.71-74
• /
• 2011

• ETRI Journal
• /
• v.27 no.5
• /
• pp.525-532
• /
• 2005

In this paper, we propose and present implementation results of a high-speed turbo decoding algorithm. The latency caused by (de)interleaving and iterative decoding in a conventional maximum a posteriori turbo decoder can be dramatically reduced with the proposed design. The source of the latency reduction is from the combination of the radix-4, center to top, parallel decoding, and early-stop algorithms. This reduced latency enables the use of the turbo decoder as a forward error correction scheme in real-time wireless communication services. The proposed scheme results in a slight degradation in bit error rate performance for large block sizes because the effective interleaver size in a radix-4 implementation is reduced to half, relative to the conventional method. To prove the latency reduction, we implemented the proposed scheme on a field-programmable gate array and compared its decoding speed with that of a conventional decoder. The results show an improvement of at least five fold for a single iteration of turbo decoding.