Sciweavers

6568 search results - page 38 / 1314
» Reducing the Complexity of Reductions
Sort
View
137
Voted
DFT
2003
IEEE
79views VLSI» more  DFT 2003»
15 years 10 months ago
Partial Error Masking to Reduce Soft Error Failure Rate in Logic Circuits
A new methodology for designing logic circuits with partial error masking is described. The key idea is to exploit the asymmetric soft error susceptibility of nodes in a logic cir...
Kartik Mohanram, Nur A. Touba
ICASSP
2011
IEEE
14 years 9 months ago
On the implementation of MIMO-OFDM schemes using perturbation of the QR decomposition: Application to 3GPP LTE-a systems
Consider a flat-fading Multiple-Input Multiple-Output (MIMO) system. The near-optimum detection problematic has been shown to be efficiently solved through QR Decomposition (QRD...
Sébastien Aubert, Jane Tournois, Fabienne N...
ICASSP
2008
IEEE
15 years 11 months ago
Frequency domain selective tap adaptive algorithms for sparse system identification
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...
Andy W. H. Khong, Xiang Lin, Milos Doroslovacki, P...
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
16 years 2 months ago
Basis Reduction, and the Complexity of Branch-and-Bound
Gabor Pataki, Mustafa Tural
CCE
2004
15 years 5 months ago
On the use of reduced order models in bifurcation analysis of distributed parameter systems
Bifurcation theory provides a powerful tool for analyzing the nonlinear dynamic behavior of process systems. However, although the theory in principle applies to lumped as well as...
Yi Liu, Elling W. Jacobsen