• ETRI Journal
• /
• 제25권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.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1991년도 학술발표회 논문집
• /
• 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.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1991년도 학술발표회 논문집
• /
• 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.

• 대한음성학회지:말소리
• /
• 제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.

• 한국항공운항학회지
• /
• 제15권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.

• 대한수학회지
• /
• 제50권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.

• 한국방사선학회논문지
• /
• 제14권5호
• /
• pp.715-723
• /
• 2020

요추 자기공명 검사 시 병변 호발 부위인 Lumbar 4-5번, Sacrum 1번의 축상 영상 검사에서 인접한 두 그룹의 슬라이스 겹침으로 Cross-Talk 인공물이 발생한다. 이로 인해 병변 판독 시 문제점이 발생한다. 본 연구에서는 최적의 분할 TR의 적용을 통해서 Cross-Talk 인공물을 완벽히 제거하고자 한다. 관심 영역은 지방(ROI 1), 척추 기립근 바깥쪽(ROI 2), 척추 기립근 안쪽(ROI 3), 가시돌기(ROI 4)로 나눠 평균화하여 계측하였다. 신호 강도(SI)는 ROI 1의 경우 C4에서 163.43 ± 25.08, ROI 2, ROI 3은 C6에서 각각 67.89 ± 11.75, 69.99 ± 10.91, ROI 4는 C5에서 70.65 ± 27.21을 나타내었다(p<0.000). 신호 대 잡음 비(SNR)는 분할 TR 6에서 SNR 1, 2, 3, 4 값이 각각 135.45 ± 35.90, 56.92 ± 15.90, 58.77 ± 15.59, 54.91 ± 118.95로 나타났다(p<0.000). 대조도 대 잡음비(CNR)는 분할TR 6에서 CNR1, CNR2, CNR3, 값이 각각 78.52 ± 24.11, 76.67 ± 24.38, 80.54 ± 26.33로 나타났다(p<0.000). 시간 대비 최적의 분할 TR 값은 6이며, 이를 T1 축상면 영상에 적용한다면 인공물 저감화에 도움이 되리라고 판단된다.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 1995년도 Language, Information and Computation = Proceedings of the 10th Pacific Asia Conference, Hong Kong
• /
• pp.215-224
• /
• 1995

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 제11회 음성통신 및 신호처리 워크샵 논문집 (SCAS 11권 1호)
• /
• 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.

• 한국정보통신학회논문지
• /
• 제5권1호
• /
• pp.183-191
• /
• 2001

본 논문은 데이터 슬라이스에서의 정보 흐름을 모델링하기 위해서 데이터 값 흐름 그래프(VFG: data Value Flow Graph)라고 하는 새로운 데이터 슬라이스(data slice) 표현을 개발한다. 다음으로, VFG에서의 정보 흐름의 복잡도를 측정하기 위해 기존의 흐름 복잡도를 이용하여 슬라이스 복잡도 척도를 정의한다. 본 연구에서는 각 슬라이스에 대한 슬라이스 복잡도와 전체 슬라이스 복잡도 간의 관계를 보여주고, VFG에서의 극소 수정(atomic modification)과 합성 연산자(concatenation operator)를 통해서 슬라이스 복잡도 척도의 스케일(scale) 인자들을 증명한다.