sparsity-aware sphere decoding

Sparsity-Aware Sphere Decoding: Algorithms and Complexity Analysis

Integer least-squares problems, concerned with solving a system of equations where the components of the unknown vector are integer-valued, arise in a wide range of applications. In many scenarios the unknown vector is sparse, i.e., a large fraction of its entries are zero. Examples include various applications in wireless communications, digital fingerprinting, and array-comparative genomic hybridization systems.

Subscribe to RSS - sparsity-aware sphere decoding