6568 search results - page 4 / 1314 » Reducing the Complexity of Reductions |
127
Voted
VTC
2008
IEEE
15 years 10 months ago
2008
IEEE
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...
130
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
112
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
146
click to vote
EUROSYS
2006
ACM
16 years 1 months ago
2006
ACM
The large size and high complexity of securitysensitive applications and systems software is a primary cause for their poor testability and high vulnerability. One approach to all...
132
click to vote
ISLPED
2005
ACM
15 years 9 months ago
2005
ACM
We describe an adiabatic microprocessor implemented with a reversible logic, nRERL [1]. We employed an 8-phase clocked power instead of 6-phase one to reduce the number of buffers...