2 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 2 / 2
Yayın Linear expansions for frequency selective channels in OFDM(Elsevier GMBH, 2006) Şenol, Habib; Çırpan, Hakan Ali; Panayırcı, ErdalModeling the frequency selective fading channels as random processes, we employ a linear expansion based on the Karhumen-Loeve (KL) series representation involving a complete set of orthogonal deterministic vectors with a corresponding uncorrelated random coefficients. Focusing on OFDM transmissions through frequency selective fading, this paper pursues a computationally efficient, pilot-aided linear minimum mean square error (MMSE) uncorrelated KL series expansion coefficients estimation algorithm. Based on such an expansion, no matrix inversion is required in the proposed MMSE estimator. Moreover, truncation in the linear expansion of channel is achieved by exploiting the optimal truncation property of the KL expansion resulting in a smaller computational load on the estimation algorithm. The performance of the proposed approach is studied through analytical and experimental results. We first exploit the performance of the MMSE channel estimator based on the evaluation of minimum Bayesian MSE. We also provide performance analysis results studying the influence of the effect of SNR and correlation mismatch on the estimator performance. Simulation results confirm our theoretical results and illustrate that the proposed algorithm is capable of tracking fast fading and improving performance.Yayın Predictive vector quantization of 3-D mesh geometry by representation of vertices in local coordinate systems(Elsevier Inc, 2007-08) Bayazıt, Uluğ; Orcay, Özgür; Konur, Umut; Gürgen, Sadık FikretIn predictive 3-D mesh geometry coding, the position of each vertex is predicted from the previously coded neighboring vertices and the resultant prediction error vectors are coded. In this work, the prediction error vectors are represented in a local coordinate system in order to cluster them around a subset of a 2-D planar subspace and thereby increase block coding efficiency. Alphabet entropy constrained vector quantization (AECVQ) of Rao and Pearlman is preferred to the previously employed minimum distortion vector quatitization (MDVQ) for block coding the prediction error vectors with high coding efficiency and low implementation complexity. Estimation and compensation of the bias in the parallelogram prediction rule and partial adaptation of the AECVQ codebook to the encoded vector source by normalization using source statistics, are the other salient features of the proposed coding system. Experimental results verify the advantage of the use of the local coordinate system over the global one. The visual error of the proposed coding system is lower than the predictive coding method of Touma and Gotsman especially at low rates, and lower than the spectral coding method of Karni and Gotsman at medium-to-high rates.
