Sciweavers

4934 search results - page 374 / 987
» complexity 2008
Sort
View
153
Voted
TSP
2008
81views more  TSP 2008»
15 years 6 months ago
Subspace Beamforming for Near-Capacity MIMO Performance
A subspace beamforming method is presented that decomposes a MIMO channel into multiple pairs of subchannels. The pairing is done based on singular values such that similar channel...
Sirikiat Lek Ariyavisitakul, Jun Zheng, E. Ojard, ...
TSP
2008
105views more  TSP 2008»
15 years 6 months ago
Code-Assisted Synchronization for UWB-IR Systems: Algorithms and Analysis
Timing synchronization is a critical challenge in ultra-wideband impulse radios (UWB-IRs). Conventional fulldigital synchronization methods encounter implementation difficulties su...
Yeqiu Ying, Mounir Ghogho, Ananthram Swami
TVCG
2008
135views more  TVCG 2008»
15 years 6 months ago
A Fast and Stable Penalty Method for Rigid Body Simulation
Two methods have been used extensively to model resting contact for rigid body simulation. The first approach, the penalty method, applies virtual springs to surfaces in contact to...
Evan Drumwright
TVCG
2008
109views more  TVCG 2008»
15 years 6 months ago
Rapid Graph Layout Using Space Filling Curves
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...
Chris Muelder, Kwan-Liu Ma
TVLSI
2008
89views more  TVLSI 2008»
15 years 6 months ago
Test Set Development for Cache Memory in Modern Microprocessors
Up to 53% of the time spent on testing current Intel microprocessors is needed to test on-chip caches, due to the high complexity of memory tests and to the large amount of transis...
Zaid Al-Ars, Said Hamdioui, Georgi Gaydadjiev, Sta...