• ETRI Journal
• /
• v.25 no.2
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1991.06a
• /
• pp.7-10
• /
• 1991

In a text-to-speech system, sound units (phonemes, words, or phrases, etc.) can be concatenated together to produce required utterance. The quality of the resulting speech is dependent on factors including the phonological/prosodic contour, the quality of basic concatenation units, and how well the units join together. Thus although the quality of each basic sound unit is high, if occur the discontinuity in the concatenation part then the quality of synthesis speech is decrease. To solve this problem, a smoothing operation should be carried out in concatenation parts. But a major problem is that, as yet, no method of parameter smoothing is available for joining the segment together. Thus in this paper, we proposed a new aigorithm that smoothing the unnatural discountinuous parts which can be occured in speech waveform editing. This algorithm used the exponential smoothing method.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1991.06a
• /
• pp.15-20
• /
• 1991

In a text-to-speech system, sound units (e. q., phonemes, words, or phrases) can be concatenated together to produce required utterance. The quality of the resulting speech is dependent on factors including the phonological/prosodic contour, the quality of basic concatenation units, and how well the units join together. Thus although the quality of each basic sound unit is high, if occur the discontinuity in the concatenation part then the quality of synthesis speech is decrease. To solve this problem, a smoothing operation should be carried out in concatenation parts. But a major problem is that, as yet, no method of parameter smoothing is availalbe for joining the segment together.

• MALSORI
• /
• no.56
• /
• pp.225-235
• /
• 2005

Speech unit concatenation with a large database is presently the most popular method for speech synthesis. In this approach, the mismatches at the unit boundaries are unavoidable and become one of the reasons for quality degradation. This paper proposes an algorithm to reduce undesired discontinuities between the subsequent units. Optimal matching points are calculated in two steps. Firstly, the fullback-Leibler distance measurement is utilized for the spectral matching, then the unit sliding and the overlap windowing are used for the waveform matching. The proposed algorithm is implemented for the corpus-based unit concatenating Korean text-to-speech system that has an automatically labeled database. Experimental results show that our algorithm is fairly better than the raw concatenation or the overlap smoothing method.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.15 no.4
• /
• pp.100-107
• /
• 2007

We proposed the concatenation of logistics' Information to constructing the intelligent logistics city that is to manage efficiently cargo distribution as providing at real-time information of cargo location trace and management through the Telematics/RFID. Case of the Incheon of the "Air Logistics Hub", this area is on an increasing trend on the quantity of cargo transport of the Air & Sea cargo system until 2006. As intelligent project of the Air's and the Sea's field is independently developed at each area, it is a problem on the concatenation of logistics' information such as freight location trace and management, operation management and route information of cargo vehicles. Therefore, we propose the advanced transport service model for the concatenating smoothly of Air & Sea cargo system. In this paper, we only manage the model of Air & Sea cargo system of the advance logistics city.

• Journal of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.933-944
• /
• 2013

Based on the four kinds of theoretical definitions of the continuous module homomorphism between random locally convex modules, we first show that among them there are only two essentially. Further, we prove that such two are identical if the family of $L^0$-seminorms for the former random locally convex module has the countable concatenation property, meantime we also provide a counterexample which shows that it is necessary to require the countable concatenation property.

• Journal of the Korean Society of Radiology
• /
• v.14 no.5
• /
• pp.715-723
• /
• 2020

Cross-talk artifacts occur in two adjacent groups of axial imaging of lesions lumbar 4-5 and sacrum 1 in lumbar spine MRI. This causes problems in reading lesions in areas corresponding to the posterior vertebra. In this study, we are going to completely remove the cross-talk artifacts through optimal concatenation TR. The region of interested were measured by averaging them into fat (ROI1), erector spinal muscle(lateral tract: iliocostalis lumborum muscle) (ROI2), erector spinal muscle(lateral tract: longissimus muscle) (ROI3), and spinous process (ROI4). The mean signal intensity (SI) was 163.43 ± 25.08 at C4 for ROI1, ROI 2 and ROI 3 at C6, 67.89 ± 11.75 and 69.99 ± 10.91 and ROI4 at C5, respectively (p<0.000). The mean signal to noise ratio (SNR) was 135.45 ± 35.90, 56.92 ± 15.90, 58.77 ± 15.59, and 54.91 ± 118.95 for SNR 1, 2, 3 and 4 (p<0.000). The contrast-to-noise ratio (CNR) was CNR1 78.52 ± 24.11, CNR2 was 76.67 ± 24.38 and CNR3 was 80.54 ± 26.33 in concatenation 6, respectively (p<0.000). The SNR, CNR, and the most efficient concatenation TR value over time are 6, and it is considered to help reduce cross-talk artifact if this is applied to T1 axial images.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 1995.02a
• /
• pp.215-224
• /
• 1995

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.395-398
• /
• 1994

In this paper the word recognition using sub-model based Hidden Markov Model was studied. Phoneme models were composed of 61 phonemes in therms of Korean language pronunciation characteristic. Using this, word model was maded by serial concatenation. But, in case of this phoneme concatenation, the second and the third phoneme of syllable are overlapped in distribution at the same time. So considering this, the method that combines the second and the third phoneme to one model was proposed. And to prevent the increase in number of model, similar phonemes were combined to one, and finially, 57 models were created. In experiment proper model structure of sub-model was searched for, and recognition results were compared. So similar recognition results were maded, and overall recognition rates were increased in case of using parameter tying method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.183-191
• /
• 2001

We develop the new data s]ice representation, called the data value flow graph(VFG), for modeling the information flow oil data slices. Then we define a slice complexity measure by using the existing flow complexity measure in order to measure the complexity of the information flow on VFG. We show relation of the slice complexity on a slice with the slice complexity on a procedure. We also demonstrate the measurement scale factors through a set of atomic modifications and a concatenation operator on VFG.