Sciweavers

995 search results - page 45 / 199
» complexity 2011
Sort
View
147
Voted
ISCAS
2011
IEEE
261views Hardware» more  ISCAS 2011»
14 years 6 months ago
Optimization of area in digit-serial Multiple Constant Multiplications at gate-level
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
Levent Aksoy, Cristiano Lazzari, Eduardo Costa, Pa...
130
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Particle algorithms for filtering in high dimensional state spaces: A case study in group object tracking
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
Lyudmila Mihaylova, Avishy Carmi
ICASSP
2011
IEEE
14 years 6 months ago
Spatial sound reproduction systems using higher order loudspeakers
Sound reproduction systems aim to produce a desired sound field over a region of space. At high frequencies, the number of loudspeakers required is prohibitive. This paper shows t...
Mark A. Poletti, Thushara D. Abhayapala
101
Voted
ICASSP
2011
IEEE
14 years 6 months ago
On spatio-temporal Tomlinson Harashima Precoding in IIR channels: MMSE solution, properties, and fast computation
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
Sander Wahls, Holger Boche
128
Voted
TCOM
2011
170views more  TCOM 2011»
14 years 9 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...