• The Journal of the Acoustical Society of Korea
• /
• v.21 no.2
• /
• pp.190-198
• /
• 2002

In general, we have used the Viterbi algorithm of Speech recognition for decoding. But a decoder in speaker verification has to recognize same word of every speaker differently. In this paper, we propose a noble decoding algorithm that could replace the typical Viterbi algorithm for the speaker verification system. We utilize for the proposed algorithm the speaker adaptation algorithms that transform feature vectors into the region of the client' characteristics in the speech recognition. There are many adaptation algorithms, but we take MLLR (Maximum Likelihood Linear Regression) and MAP (Maximum A-Posterior) adaptation algorithms for proposed algorithm. We could achieve improvement of performance about 30% of EER (Equal Error Rate) using proposed algorithm instead of the typical Viterbi algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.899-902
• /
• 2003

무선 환경에서의 실시간 서비스의 확대와 노드의 이동성 증가에 따라 handover 시 발생되는 패킷 손실과 지연으로 인한 실시간 서비스의 중단이 해결해야 할 중요한 문제점이 되고 있다. 본 논문에서는 IETF (Internet Engineering Task Force)의 중요한 마이크로 이동성 프로토콜인 HMIPv6의 기본 동작을 설명하고, 여전히 문제점으로 남아있는 Inter-MAP (Mobility Anchor Point) handover의 성능을 향상시키기 위한 Dynamic MAP Switching handover 알고리듬을 제안한다. 제안한 알고리듬은 인접한 MAP 도메인을 중첩되게 설정하고 Inter-MAP handover가 발생되기 전에 미리 MAP을 switching한다. 따라서 Inter-MAP handover가 발생하지 않도록 함으로써 handover 시 발생하는 데이터의 손실 및 지연을 감소시킬 수 있다. 제안된 알고리듬의 성능 향상은 산술적 분석을 통하여 검증한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1259-1265
• /
• 2006

In this paper, we propose a combined synthetic algorithm of the logic level for high speed FPGA design. The algorithm divides critical path to reduce delay time and generates a circuit which the divided circuits execute simultaneously. This kernel selection algorithm is made by C-langage of SUN UNIX. We compare this with the existing FlowMap algorithm. This proposed algorithm shows result on 33.3% reduction of delay time by comparison with the existing algorithm.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.138-141
• /
• 1994

기존의 HMM을 이용한 음성인식기는 대부분 ML 추정에 기초한 Baum-Welch 알고리듬으로 학습되었다. ML학습은 기본적으로 무한한 양의 학습 데이터가 주어지고, 각 모델들이 서로 독립이라는 가정에 기초한다. 하지만 실제적인 학습의 경우에 각 모델들이 서로 독립이라고 보기 어렵고, 학습 데이터의 양도 상당히 제한되어 있어서 인식기의 변별력을 저하시키는 주된 원인이 되고 있다. 본 논문에서는 전통적인 패턴분류기법인 Bayes 결정이론에 따라 최소오차율분류를 위한 MAP 수식화를 유도하고, 그에 기초한 HMM의 변별력 있는 학습 알고리듬을 제안한다. 최소오차율분류를 근사화한 사후확률로 표현된 비용함수를 정의하고, 그 비용함수에 조건부 경사강하법을 적용한다. 제안된 알고리듬을 분류하기 어려운 한국어 단음절 인식에 적용한 결과, 기존의 ML 알고리듬으로 학습한 경우 발생한 오인식 개수의 약 10% 가량이 개선되었다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.3
• /
• pp.68-75
• /
• 1999

본 논문은 항공영상으로부터 REM( recovered elevation map)를 추출하여 DEM (digital elevation model)과 정합함으로써 비행체의 위치를 추정하는 기법을 제안하였다. 제안한 알고리듬은 연속항공영상을 이용함으로써 보다 넓은 지역에 대한 REM (recovered elevation map)복원이 가능하여 정합확률이 높아진다. 또한 강건한 거리 척도를 사용함으로써 몇 개의 점에서의 매우 큰 오차에 영향을 받지 않은 알고리듬을 제안하였다. 본 논문에선 몇 개의 항공영상을 가지고 컴퓨터 시뮬레이션을 통하여 제안한 알고리듬의 효용성을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.117-122
• /
• 2006

In this paper, we present a simple and general soft bit decision expression for a Gray coded PAM signal over additive white Gaussian noise(AWGN) channel with the log likelihood ratio(LLR). In order to reduce the complexity of the LLR calculation, we make the bitwise LLR expression simple by replacing the mathematical max functions of the conventional Max-Log-MAP expression with simple arithmetic functions associated with some deterministic parameters, such as a received value and distance between symbols on a signal space. Taking the implementation issues, like the area of silicon, the power consumption, the timing latency, and so on, into consideration, we submit that the proposed method is a promising alternative way to conventional methods for reconfigurable systems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.12
• /
• pp.3702-3707
• /
• 2009

In this paper, a new approximated MAP algorithm for soft bit decision from QAM symbols is proposed for Gray Coded QAM signals, based on the Max-Log-MAP and a Gray coded QAM signal can be separated into independent two Gray coded PAM signal, M-PAM on I axis with M symbols and N-PAM on Q axis with N symbols. The Max-Log-MAP used distance comparisons between symbols to get the soft bit decision instead of mathematical exponential or logarithm functions. But in accordance with the increase of the number of symbols, the number of comparisons also increase with high complexity. The proposed algorithm is used with the Euclidean distance and constituted with plain arithmetic functions, thus we can know intuitively that the algorithm has low implementing complexity comparing to conventional ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8A
• /
• pp.784-789
• /
• 2006

In this paper, we propose a bitwise information decomposition algorithm for an M-PSK signal based on the Max-Log-MAP algorithm. In order to obtain the algorithm, we use a coordinate transformation from M-PSK to M-PAM signal space. Using the proposed algorithm, we analyze the performance of a Turbo iterative decoding method. The proposed algorithm can be applicable not only for a communication with PSK and iterative decoding method but for adaptive modulation and coding system.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.3
• /
• pp.35-41
• /
• 2008

Recently needs for the convergence of CAD and GIS data are increasing, and many studies on converting two systems to each other are being carried out. In this study, to revise and update the building data of digital map using CAD data for construction, the outline of building is abstracted from the CAD data and the outline is generalized to the same level of detail with the building data of digital map. Several line simplification algorithms to generalize the outline are adopted and compared, especially at the view of satisfaction to the drawing rule for digital map. Douglas-Peucker algorithm, Lang's algorithm, Reumann-Witkam algorithm, and Opheim algorithm are applied as the line simplification method. To evaluate the results of these algorithms, visual assessment and variation ratio of the number of points, total length of lines, the area of polygon, and satisfaction ratio to the drawing rule of digital map are analyzed. The result of Lang algorithm and Douglas-Peucker algorithm show superior satisfaction ratio. But general satisfaction ratio is 50~60% for all algorithm. Therefore there seems to be a limit to use these algorithms for the simplification method to update the building data in digital map and it is necessary to develop line simplification algorithm which satisfy the drawing rule well.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.81-91
• /
• 1994

A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.