EURASIP Journal on Applied Signal Processing
Application-specific instruction set processor implementation of list sphere detector
EURASIP Journal on Embedded Systems
EURASIP Journal on Wireless Communications and Networking
Neighborhood localized iterative multi-input multi-output detector using swarm intelligence
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Integer least squares: sphere decoding and the LLL algorithm
Proceedings of the 2008 C3S2E conference
Code design for multihop wireless relay networks
EURASIP Journal on Advances in Signal Processing
Cyclic Division Algebras: A Tool for Space-Time Coding
Foundations and Trends in Communications and Information Theory
Parallelization of Sphere-Decoding Methods
High Performance Computing for Computational Science - VECPAR 2008
Radius selection algorithms for sphere decoding
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Exact polynomial factorization by approximate high degree algebraic numbers
Proceedings of the 2009 conference on Symbolic numeric computation
A stopping radius for the sphere decoder and its application to MSDD of DPSK
IEEE Communications Letters
A simplified fixed-complexity sphere decoder for V-BLAST systems
IEEE Communications Letters
Real-valued maximum likelihood decoder for quasi-orthogonal space-time block codes
IEEE Transactions on Communications
Efficient maximum-likelihood decoding of sphericallattice codes
IEEE Transactions on Communications
Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection
IEEE Transactions on Signal Processing
On the reconstruction of block-sparse signals with an optimal number of measurements
IEEE Transactions on Signal Processing
A power-efficient configurable low-complexity MIMO detector
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Probabilistic spherical detection and VLSI implementation for multiple-antenna systems
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Lattice-reduction aided equalization for OFDM systems
IEEE Transactions on Wireless Communications
Coding and decoding for the dynamic decode and forward relay protocol
IEEE Transactions on Information Theory
Designing low-complexity equalizers for wireless systems
IEEE Communications Magazine
Multi-branch successive interference cancellation for MIMO spatial multiplexing systems
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Performance of space-time-frequency block-coded MC-DS-CDMA in correlated conditions
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Distributed space-time diversity system using linear constellation precoding
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
ICT'09 Proceedings of the 16th international conference on Telecommunications
Multiple decision feedback equalizers for vector systems with complexity/performance tradeoff
ICT'09 Proceedings of the 16th international conference on Telecommunications
The expected complexity of sphere decoding algorithm in spatial correlated MIMO channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Tail behavior of sphere-decoding complexity in random lattices
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Engineering Applications of Artificial Intelligence
An efficient MIMO detection algorithm employed in imperfect noise estimation
WSEAS TRANSACTIONS on COMMUNICATIONS
WSEAS Transactions on Signal Processing
Design of adaptive multi-branch SIC receivers for MIMO spatial multiplexing systems
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Multistage MIMO receivers based on multi-branch interference cancellation for MIMO-CDMA systems
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
IEEE Transactions on Communications
Reduced complexity sphere decoding via a reordered lattice representation
IEEE Transactions on Communications
Channel estimation for OFDM modulated two-way relay networks
IEEE Transactions on Signal Processing
A flexible DSP architecture for MIMO sphere decoding
IEEE Transactions on Circuits and Systems Part I: Regular Papers
A deterministic method for choosing search radii in sphere decoding
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
An accelerated soft-output sphere decoding algorithm for MIMO system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
OFDM blind signal detection using the signal probability information
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
IH'06 Proceedings of the 8th international conference on Information hiding
On further reduction of complexity in tree pruning based sphere search
IEEE Transactions on Communications
Low-complexity decoding via reduced dimension maximum-likelihood search
IEEE Transactions on Signal Processing
A new decoding algorithm in MIMO-ZP-OFDM systems
ICDHM'07 Proceedings of the 1st international conference on Digital human modeling
A new quasi-optimal detection algorithm for a non orthogonal spectrally efficient FDM
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Efficient symbol detection in multi-device STBC-MIMO system
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Joint channel estimation in asynchronous amplify-and-forward relay networks based on OFDM signaling
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Enhancing data persistence for energy constrained networks by network modulation
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
An efficient parallel algorithm with partial decision feedback for near-optimal MIMO detection
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An efficient adaptive frequency diversity scheme for IEEE 802.11n networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Near-optimal detection in MIMO systems using Gibbs sampling
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Variable-breadth K-best detector for MIMO systems
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Spectrally efficient FDM signals: bandwidth gain at the expense of receiver complexity
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Extended LLL algorithm for efficient signal precoding in multiuser communication systems
IEEE Communications Letters
PIC-based iterative SDR detector for OFDM systems in doubly-selective fading channels
IEEE Transactions on Wireless Communications
A joint symbol detection algorithm efficient at low SNR for a multi-device STBC-MIMO system
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
An adaptive reduced complexity K-best decoding algorithm with early termination
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Multigroup ML decodable collocated and distributed space-time block codes
IEEE Transactions on Information Theory
Trellis coded spatial modulation
IEEE Transactions on Wireless Communications
Small-area and low-energy K-best MIMO detector using relaxed tree expansion and early forwarding
Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
Blind MIMO using the golden code
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
An efficient low-complexity detector for spatially multiplexed MC-CDM
IEEE Transactions on Signal Processing
High-throughput and area-efficient MIMO symbol detection based on modified Dijkstra's search
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Low-complexity soft-output decoding with lattice-reduction-aided detectors
IEEE Transactions on Communications
Matrix-lifting semi-definite programming for detection in multiple antenna systems
IEEE Transactions on Signal Processing
Performance and complexity analysis of infinity-norm sphere-decoding
IEEE Transactions on Information Theory
Small-area and low-energy K-best MIMO detector using relaxed tree expansion and early forwarding
IEEE Transactions on Circuits and Systems Part I: Regular Papers
A radius adaptive K-Best decoder with early termination: algorithm and VLSI architecture
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special section on 2009 IEEE custom integrated circuits conference
Designing low-complexity detectors based on Seysen's algorithm
IEEE Transactions on Wireless Communications
Group-orthogonal code-division multiplex: a physical-layer enhancement for IEEE 802.11n networks
EURASIP Journal on Wireless Communications and Networking
Design and implementation of a sort-free K-best sphere decoder
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A MIMO decoder accelerator for next generation wireless communications
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Prevoting cancellation-based detection for underdetermined MIMO systems
EURASIP Journal on Wireless Communications and Networking
Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors
Computers and Electrical Engineering
A List Sphere Decoding Algorithm with Improved Radius Setting Strategies
Wireless Personal Communications: An International Journal
Distributed Space-Time Codes Using Constellation Rotation
Wireless Personal Communications: An International Journal
Sparse representations and sphere decoding for array signal processing
Digital Signal Processing
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
Reduced complexity sphere decoding
Wireless Communications & Mobile Computing
Parallel High Throughput Soft-Output Sphere Decoding Algorithm
Journal of Signal Processing Systems
A complexity analysis of a Jacobi method for lattice basis reduction
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
Performance Analysis of the Cooperative ZP-OFDM: Diversity, Capacity and Complexity
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Advances in Artificial Intelligence
Low-complexity dominance-based sphere decoder for MIMO systems
Signal Processing
High-throughput soft-output MIMO detector based on path-preserving trellis-search algorithm
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A best-first soft/hard decision tree searching MIMO decoder for a 4×4 64-QAM system
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Multicore implementation of a fixed-complexity tree-search detector for MIMO communications
The Journal of Supercomputing
An efficient GPU implementation of fixed-complexity sphere decoders for MIMO wireless systems
Integrated Computer-Aided Engineering
Hi-index | 0.20 |
The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficient and given vector are comprised of real numbers, arises in many applications: communications, cryptography, GPS, to name a few. The problem is equivalent to finding the closest lattice point to a given point and is known to be NP-hard. In communications applications, however, the given vector is not arbitrary but rather is an unknown lattice point that has been perturbed by an additive noise vector whose statistical properties are known. Therefore, in this paper, rather than dwell on the worst-case complexity of the integer least-squares problem, we study its expected complexity, averaged over the noise and over the lattice. For the "sphere decoding" algorithm of Fincke and Pohst, we find a closed-form expression for the expected complexity, both for the infinite and finite lattice. It is demonstrated in the second part of this paper that, for a wide range of signal-to-noise ratios (SNRs) and numbers of antennas, the expected complexity is polynomial, in fact, often roughly cubic. Since many communications systems operate at noise levels for which the expected complexity turns out to be polynomial, this suggests that maximum-likelihood decoding, which was hitherto thought to be computationally intractable, can, in fact, be implemented in real time-a result with many practical implications.