Sciweavers

105 search results - page 8 / 21
» Additive and Multiplicative Structure in Matrix Spaces
Sort
View
WCNC
2008
IEEE
14 years 1 months ago
Subspace Blind MIMO-OFDM Channel Estimation with Short Averaging Periods: Performance Analysis
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
Chao-Cheng Tu, Benoît Champagne
SIGIR
2004
ACM
14 years 27 days ago
Polynomial filtering in latent semantic indexing for information retrieval
Latent Semantic Indexing (LSI) is a well established and effective framework for conceptual information retrieval. In traditional implementations of LSI the semantic structure of...
Effrosini Kokiopoulou, Yousef Saad
JC
2000
138views more  JC 2000»
13 years 7 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
14 years 7 months ago
A Design of Analog C-Matrix Circuits Used for Signal/Data Processing
Various calculation of matrices and vectors has been used in many digital signal processing systems. Although the calculation simply repeats multiplication and addition, the reite...
Takayuki Sugawara, Yoshikazu Miyanaga, Norinobu Yo...
QEST
2009
IEEE
14 years 2 months ago
Exploiting Restricted Transitions in Quasi-Birth-and-Death Processes
—In this paper we consider Quasi-Birth-and-Death (QBD) processes where the upward (resp. downward) transitions are restricted to occur only from (resp. to) a subset of the phase ...
Juan F. Pérez, Benny Van Houdt