Sciweavers

85 search results - page 2 / 17
» Spectral Techniques for Expander Codes
Sort
View
MICRO
1997
IEEE
87views Hardware» more  MICRO 1997»
14 years 3 months ago
Improving Code Density Using Compression Techniques
We propose a method for compressing programs in embedded processors where instruction memory size dominates cost. A post-compilation analyzer examines a program and replaces commo...
Charles Lefurgy, Peter L. Bird, I-Cheng K. Chen, T...
MOBILIGHT
2010
13 years 8 months ago
Spectral Efficiency Using Combinations of Transmit Antenna Selection with Linear Dispersion Code Selection
In this paper the objective is to enhance the spectral efficiency using combinations of transmit antenna selection with Linear Dispersion Code Selection. Both bit error rate minimi...
Ismael Gutiérrez, Faouzi Bader
IWCMC
2006
ACM
14 years 4 months ago
Low complexity design of space-time convolutional codes with high spectral efficiencies
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
14 years 4 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
14 years 2 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla