Sciweavers

1698 search results - page 57 / 340
» Growing Complex Games
Sort
View
ICC
2008
IEEE
113views Communications» more  ICC 2008»
15 years 4 months ago
Complexity Reduction of Maximum-Likelihood Multiuser Detection (ML-MUD) Receivers with Carrier Interferometry Codes in MC-CDMA
—We propose to use carrier interferometry (CI) codes to reduce the complexity of the maximumlikelihood multiuser-detection (ML-MUD) receiver in MC-CDMA systems with carrier frequ...
Layla Tadjpour, Shang-Ho Tsai, C. C. Jay Kuo
VTC
2008
IEEE
15 years 4 months ago
Reduced-Complexity Adaptive Receiver Algorithms for 4G SU-MIMO Systems
Abstract—In this paper we present reduced-complexity highperformance receivers for single-user MIMO systems that employ coded OFDM transmission with bit-interleaved coded modulat...
Ozgun Y. Bursalioglu, Haralabos C. Papadopoulos, C...
RAS
2008
109views more  RAS 2008»
14 years 9 months ago
When hard realtime matters: Software for complex mechatronic systems
A still growing number of software concepts and framworks have been proposed to meet the challenges in the development of more and more complex robotic systems, like humanoids or n...
Berthold Bäuml, Gerd Hirzinger
FOSSACS
2008
Springer
14 years 11 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
ISLPED
1998
ACM
86views Hardware» more  ISLPED 1998»
15 years 2 months ago
The energy complexity of register files
Register files (RF) represent a substantial portion of the energy budget in modern processors, and are growing rapidly with the trend towards wider instruction issue. The actual ...
Victor V. Zyuban, Peter M. Kogge