Sciweavers

254 search results - page 27 / 51
» On randomized one-round communication complexity
Sort
View
ICC
2008
IEEE
110views Communications» more  ICC 2008»
14 years 2 months ago
On the Eigenvalue Distribution of Ricean MIMO Channels by Character Expansion of Groups
Abstract— Joint eigenvalue distribution of the noncentral complex Wishart matrix, i.e. HH∗ where H is the nonzero-mean complex Gaussian random channel matrix of a multiple-inpu...
Alireza Ghaderipoor, Chintha Tellambura
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
TCAD
2010
168views more  TCAD 2010»
13 years 2 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
ICC
2007
IEEE
177views Communications» more  ICC 2007»
14 years 2 months ago
Intelligent Gateways Placement for Reduced Data Latency in Wireless Sensor Networks
— Many applications of wireless sensor networks (WSNs) have emerged over the last few years. In such networks resource-constrained sensor nodes are deployed to probe their surrou...
Waleed A. Youssef, Mohamed F. Younis