Sciweavers

358 search results - page 7 / 72
» Sparse squares of polynomials
Sort
View
IEICET
2008
84views more  IEICET 2008»
13 years 7 months ago
Factorization of Square-Free Integers with High Bits Known
Abstract. In this paper we propose an algorithm of factoring any integer N which has k different prime factors with the same bit-length, when ( 1 k+2 + k(k-1) ) log N high-order bi...
Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Ka...
FPL
2010
Springer
104views Hardware» more  FPL 2010»
13 years 5 months ago
Multiplicative Square Root Algorithms for FPGAs
Abstract--Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs ...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca, ...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...
ASPDAC
2005
ACM
96views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Comprehensive frequency dependent interconnect extraction and evaluation methodology
Abstract— Frequency dependent interconnect analysis is challenging since lumped equivalent circuit models extracted at different frequencies exhibit distinct time and frequency d...
Rong Jiang, Charlie Chung-Ping Chen
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 7 months ago
Compressed Sensing for Sparse Underwater Channel Estimation: Some Practical Considerations
We examine the use of a structured thresholding algorithm for sparse underwater channel estimation using compressed sensing. This method shows some improvements over standard algo...
Sushil Subramanian