Sciweavers

10608 search results - page 103 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICCD
2006
IEEE
275views Hardware» more  ICCD 2006»
14 years 7 months ago
Split-Row: A Reduced Complexity, High Throughput LDPC Decoder Architecture
— A reduced complexity LDPC decoding method is presented that dramatically reduces wire interconnect complexity, which is a major issue in LDPC decoders. The proposed Split-Row m...
Tinoosh Mohsenin, Bevan M. Baas
CISS
2008
IEEE
14 years 4 months ago
A low complexity linear multiuser MIMO beamforming system with limited feedback
—In this paper, we propose a low complexity linear multiuser beamforming system for the multiple-input multipleoutput (MIMO) broadcast channel. We consider the specific case of ...
Chan-Byoung Chae, David Mazzarese, Nihar Jindal, R...
ICC
2007
IEEE
141views Communications» more  ICC 2007»
14 years 4 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
ICALP
2001
Springer
14 years 2 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 1 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson