• Title/Summary/Keyword: Viterbi algorithm.

Search Result 195, Processing Time 0.027 seconds

Iterative Multiple Symbol Differential Detection for Turbo Coded Differential Unitary Space-Time Modulation

  • Vanichchanunt, Pisit;Sangwongngam, Paramin;Nakpeerayuth, Suvit;Wuttisittikulkij, Lunchakorn
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.44-54
    • /
    • 2008
  • In this paper, an iterative multiple symbol differential detection for turbo coded differential unitary space-time modulation using a posteriori probability (APP) demodulator is investigated. Two approaches of different complexity based on linear prediction are presented to utilize the temporal correlation of fading for the APP demodulator. The first approach intends to take account of all possible previous symbols for linear prediction, thus requiring an increase of the number of trellis states of the APP demodulator. In contrast, the second approach applies Viterbi algorithm to assist the APP demodulator in estimating the previous symbols, hence allowing much reduced decoding complexity. These two approaches are found to provide a trade-off between performance and complexity. It is shown through simulation that both approaches can offer significant BER performance improvement over the conventional differential detection under both correlated slow and fast Rayleigh flat-fading channels. In addition, when comparing the first approach to a modified bit-interleaved turbo coded differential space-time modulation counterpart of comparable decoding complexity, the proposed decoding structure can offer performance gain over 3 dB at BER of $10^{-5}$.

HMM-based Music Identification System for Copyright Protection (저작권 보호를 위한 HMM기반의 음악 식별 시스템)

  • Kim, Hee-Dong;Kim, Do-Hyun;Kim, Ji-Hwan
    • Phonetics and Speech Sciences
    • /
    • v.1 no.1
    • /
    • pp.63-67
    • /
    • 2009
  • In this paper, in order to protect music copyrights, we propose a music identification system which is scalable to the number of pieces of registered music and robust to signal-level variations of registered music. For its implementation, we define the new concepts of 'music word' and 'music phoneme' as recognition units to construct 'music acoustic models'. Then, with these concepts, we apply the HMM-based framework used in continuous speech recognition to identify the music. Each music file is transformed to a sequence of 39-dimensional vectors. This sequence of vectors is represented as ordered states with Gaussian mixtures. These ordered states are trained using Baum-Welch re-estimation method. Music files with a suspicious copyright are also transformed to a sequence of vectors. Then, the most probable music file is identified using Viterbi algorithm through the music identification network. We implemented a music identification system for 1,000 MP3 music files and tested this system with variations in terms of MP3 bit rate and music speed rate. Our proposed music identification system demonstrates robust performance to signal variations. In addition, scalability of this system is independent of the number of registered music files, since our system is based on HMM method.

  • PDF

Monosyllable Speech Recognition through Facial Movement Analysis (안면 움직임 분석을 통한 단음절 음성인식)

  • Kang, Dong-Won;Seo, Jeong-Woo;Choi, Jin-Seung;Choi, Jae-Bong;Tack, Gye-Rae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.6
    • /
    • pp.813-819
    • /
    • 2014
  • The purpose of this study was to extract accurate parameters of facial movement features using 3-D motion capture system in speech recognition technology through lip-reading. Instead of using the features obtained through traditional camera image, the 3-D motion system was used to obtain quantitative data for actual facial movements, and to analyze 11 variables that exhibit particular patterns such as nose, lip, jaw and cheek movements in monosyllable vocalizations. Fourteen subjects, all in 20s of age, were asked to vocalize 11 types of Korean vowel monosyllables for three times with 36 reflective markers on their faces. The obtained facial movement data were then calculated into 11 parameters and presented as patterns for each monosyllable vocalization. The parameter patterns were performed through learning and recognizing process for each monosyllable with speech recognition algorithms with Hidden Markov Model (HMM) and Viterbi algorithm. The accuracy rate of 11 monosyllables recognition was 97.2%, which suggests the possibility of voice recognition of Korean language through quantitative facial movement analysis.

Constant Envelope Enhanced FQPSK and Its Performance Analysis

  • Xie, Zhidong;Zhang, Gengxin;Bian, Dongming
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.442-448
    • /
    • 2011
  • It's a challenging task to design a high performance modulation for satellite and space communications due to the limited power and bandwidth resource. Constant envelope modulation is an attractive scheme to be used in such cases for their needlessness of input power back-off about 2~3 dB for avoidance of nonlinear distortion induced by high power amplifier. The envelope of Feher quadrature phase shift keying (FQPSK) has a least fluctuation of 0.18 dB (quasi constant envelope) and can be further improved. This paper improves FQPSK by defining a set of new waveform functions, which changes FQPSK to be a strictly constant envelope modulation. The performance of the FQPSK adopting new waveform is justified by analysis and simulation. The study results show that the novel FQPSK is immune to the impact of HPA and outperforms conventional FQPSK on bit error rate (BER) performance. The BER performance of this novel modulation is better than that of FQPSK by more than 0.5 dB at least and 2 dB at most.

A Study on the Speaker Adaptation in CDHMM (CDHMM의 화자적응에 관한 연구)

  • Kim, Gwang-Tae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.116-127
    • /
    • 2002
  • A new approach to improve the speaker adaptation algorithm by means of the variable number of observation density functions for CDHMM speech recognizer has been proposed. The proposed method uses the observation density function with more than one mixture in each state to represent speech characteristics in detail. The number of mixtures in each state is determined by the number of frames and the determinant of the variance, respectively. The each MAP Parameter is extracted in every mixture determined by these two methods. In addition, the state segmentation method requiring speaker adaptation can segment the adapting speech more Precisely by using speaker-independent model trained from sufficient database as a priori knowledge. And the state duration distribution is used lot adapting the speech duration information owing to speaker's utterance habit and speed. The recognition rate of the proposed methods are significantly higher than that of the conventional method using one mixture in each state.

Operation load estimation of chain-like structures using fiber optic strain sensors

  • Derkevorkian, Armen;Pena, Francisco;Masri, Sami F.;Richards, W. Lance
    • Smart Structures and Systems
    • /
    • v.20 no.3
    • /
    • pp.385-396
    • /
    • 2017
  • The recent advancements in sensing technologies allow us to record measurements from target structures at multiple locations and with relatively high spatial resolution. Such measurements can be used to develop data-driven methodologies for condition assessment, control, and health monitoring of target structures. One of the state-of-the-art technologies, Fiber Optic Strain Sensors (FOSS), is developed at NASA Armstrong Flight Research Center, and is based on Fiber Bragg Grating (FBG) sensors. These strain sensors are accurate, lightweight, and can provide almost continuous strain-field measurements along the length of the fiber. The strain measurements can then be used for real-time shape-sensing and operational load-estimation of complex structural systems. While several works have demonstrated the successful implementation of FOSS on large-scale real-life aerospace structures (i.e., airplane wings), there is paucity of studies in the literature that have investigated the potential of extending the application of FOSS into civil structures (e.g., tall buildings, bridges, etc.). This work assesses the feasibility of using FOSS to predict operational loads (e.g., wind loads) on chain-like structures. A thorough investigation is performed using analytical, computational, and experimental models of a 4-story steel building test specimen, developed at the University of Southern California. This study provides guidelines on the implementation of the FOSS technology on building-like structures, addresses the associated technical challenges, and suggests potential modifications to a load-estimation algorithm, to achieve a robust methodology for predicting operational loads using strain-field measurements.

Image Coding using Conditional Entropy Constrained Vector Quantization (조건부 엔트로피 제한 벡터 양자화를 이용한 영상 부호화)

  • Lee, Seung-Jun;Seo, Yong-Chang;Lee, Choong-Woong
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.11
    • /
    • pp.88-96
    • /
    • 1994
  • This paper proposes a new vector quantization scheme which exploits high correlations among indexes in vector quantization. An optimal vector quantizer in the rate-distortion sense can be obtained, if it is designed so that the average distortion can be minimized under the constraint of the conditional entropy of indes, which is usually much smaller than the entropy of index due to the high correlations among indexes of neighboring vectors. The oprimization process is very similar to that in ECVQ(entropy-constrained vector quanization) except that in the proposed scheme the Viterbi algorithm is introduced to find the optimal index sequence. Simulations show that at the same bitrate the proposed method provides higher PSNR by 1.0~3.0 dB than the conventional ECVQ when applied to image coding.

  • PDF

Trellis-coded $\pi$/8 shift 8PSK-OFDM with Sliding Multiple Symbol Detection (흐름 다중 심벌 검파를 사용한 트렐리스 부호화된 $\pi$/8 shift 8PSK-OFDM)

  • ;;;Zhengyuan Xu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.4
    • /
    • pp.535-543
    • /
    • 2002
  • In this paper, we propose $\pi$/8 shift 8PSK and trellis-coded $\pi$/8 shift 8PSK-OFDM techniques by applying $\pi$/4 shift QPSK to trellis-coded modulation (TCM), and performing signal set expansion and set partition correspondingly based on phase difference. In our Viterbi decoding algorithm, up to L phase differences from successively received symbols are employed in the new branch metrics. Such sliding multiple symbol detection (SMSD) method provides improved bit-error-rate (BER) performance in the differential detection of the trellis-coded $\pi$/8 shift 8PSK-OFDM signals. The performance improvements are achieved for different communication channels without sacrificing bandwidth and power efficiency. It thus makes the proposed modulation and sliding detection scheme more attractive for power and band-limited systems.

Iterative LBG Clustering for SIMO Channel Identification

  • Daneshgaran, Fred;Laddomada, Massimiliano
    • Journal of Communications and Networks
    • /
    • v.5 no.2
    • /
    • pp.157-166
    • /
    • 2003
  • This paper deals with the problem of channel identification for Single Input Multiple Output (SIMO) slow fading channels using clustering algorithms. Due to the intrinsic memory of the discrete-time model of the channel, over short observation periods, the received data vectors of the SIMO model are spread in clusters because of the AWGN noise. Each cluster is practically centered around the ideal channel output labels without noise and the noisy received vectors are distributed according to a multivariate Gaussian distribution. Starting from the Markov SIMO channel model, simultaneous maximum ikelihood estimation of the input vector and the channel coefficients reduce to one of obtaining the values of this pair that minimizes the sum of the Euclidean norms between the received and the estimated output vectors. Viterbi algorithm can be used for this purpose provided the trellis diagram of the Markov model can be labeled with the noiseless channel outputs. The problem of identification of the ideal channel outputs, which is the focus of this paper, is then equivalent to designing a Vector Quantizer (VQ) from a training set corresponding to the observed noisy channel outputs. The Linde-Buzo-Gray (LBG)-type clustering algorithms [1] could be used to obtain the noiseless channel output labels from the noisy received vectors. One problem with the use of such algorithms for blind time-varying channel identification is the codebook initialization. This paper looks at two critical issues with regards to the use of VQ for channel identification. The first has to deal with the applicability of this technique in general; we present theoretical results for the conditions under which the technique may be applicable. The second aims at overcoming the codebook initialization problem by proposing a novel approach which attempts to make the first phase of the channel estimation faster than the classical codebook initialization methods. Sample simulation results are provided confirming the effectiveness of the proposed initialization technique.

Performance Analysis of Smart Antenna Base Station Implemented for CDMA2000 1X (CDMA2000 1X용으로 구현된 스마트 안테나 기지국 시스템의 성능분석)

  • 김성도;이원철;최승원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.694-701
    • /
    • 2003
  • In this paper, we present a hardware structure and new features of a smart antenna BTS (Base Transceiver Station) for CDMA2000 1X system. The proposed smart antenna BTS is a composite system consisting of many subsystems, i.e., array antenna element, frequency up/down converters, AD (Analog-to-Digital) and DA (Digital-to-Analog) converters, spreading/despreading units, convolutional encoder/Viterbi decoder, searcher, tracker, beamformer, calibration unit etc. Through the experimental tests, we found that the desired beam-pattern in both uplink and downlink communications is provided through the calibration procedure. Also it has been confirmed that the adaptive beamforming algorithm adopted to our smart antenna BTS is fast and accurate enough to support 4 fingers to each user. In our experiments, commercial mobile terminals operating PCS (Personal Communication System) band have been used. It has been confirmed that the smart antenna BTS tremendously improves the FER (Frame Error Rate) performance compared to the conventional 2-antenna diversity system.