Sciweavers

4714 search results - page 77 / 943
» The Complexity of Iterated Multiplication
Sort
View
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
15 years 4 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 10 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 10 months ago
Achieving Near-Capacity at Low SNR on a Multiple-Antenna Multiple-User Channel
We analyze the sensitivity of the capacity of a multi-antenna multi-user system to the number of users being served. We show analytically that, for a given desired sum-rate, the e...
Chau Yuen, Bertrand M. Hochwald
ICST
2009
IEEE
15 years 4 months ago
PKorat: Parallel Generation of Structurally Complex Test Inputs
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
Junaid Haroon Siddiqui, Sarfraz Khurshid
TSP
2008
99views more  TSP 2008»
14 years 9 months ago
Low-Complexity Block Turbo Equalization for OFDM Systems in Time-Varying Channels
We propose low-complexity block turbo equalizers for orthogonal frequency-division multiplexing (OFDM) systems in time-varying channels. The presented work is based on a soft minim...
Kun Fang, Luca Rugini, Geert Leus