Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1004.2844

Minimizing the Complexity of Fast Sphere Decoding of STBCs

G. R. Jithamithra·B. Sundar Rajan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. R. Jithamithra, B. Sundar Rajan. 2011-05-22. Minimizing the Complexity of Fast Sphere Decoding of STBCs. https://arxiv.org/abs/1004.2844

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the Distribution of Age of Information in Time-varying Updating Systems

Age of Information (AoI) is a crucial metric for quantifying information freshness in real-time systems where the sampling rate of data packets is time-varying. Evaluating AoI under such conditions is challenging, as system states become temporally correlated and traditional stationary analysis is inapplicable. We investigate an $M_{t}/G/1/1$ queueing system with a time-varying sampling rate and probabilistic preemption, proposing a novel analytical framework based on multi-dimensional partial differential equations (PDEs) to capture the time evolution of the system's status distribution. To solve the PDEs, we develop a decomposition technique that breaks the high-dimensional PDE into lower-dimensional subsystems. Solving these subsystems allows us to derive the Aol distribution at arbitrary time instances. We show AoI does not exhibit a memoryless property, even with negligible processing times, due to its dependence on the historical sampling process. Our framework extends to the stationary setting, where we derive a closed-form expression for the Laplace-Stieltjes Transform (LST) of the steady-state AoI. Numerical experiments reveal AoI exhibits a non-trivial lag in response to sampling rate changes. Our results also show that no single preemption probability or processing time distribution can minimize Aol violation probability across all thresholds in either time-varying or stationary scenarios. Finally, we formulate an optimization problem and propose a heuristic method to find sampling rates that reduce costs while satisfying AoI constraints.

cs.IT↗
arXiv2026

Properties of Random Code Ensembles over Classical-Quantum Channels

We show two properties of i.i.d. code ensembles over classical-quantum (CQ) channels with arbitrary output states. The first property is that the probability distribution of the error exponent across the ensemble accumulates above a threshold that is strictly larger than the CQ random coding exponent (RCE) at low rates, while coinciding with it at rates close to the mutual information of the channel. This result, combined with the works by Dalai, Renes, Li and Yang and Cheng and Liu, implies that the ensemble distribution of error exponents concentrates around the CQ RCE in the high rate regime. Moreover, in the same rate region the threshold we derive coincides with the ensemble-average of the exponent, that is, the CQ typical random coding (TRC) exponent. The second property we derive is that the probability that a randomly selected code from an ensemble contains a nested code of the same rate such that each of its codewords achieves the CQ expurgated exponent goes to one asymptotically in the codeword length. Such nested code can be obtained by expurgating a vanishingly small fraction of codewords as the codeword length increases. This result refines Holevo's work [5], which proved that the expurgated exponent can be achieved by discarding the worst half of the codewords from at least one code in the ensemble.

cs.IT↗
arXiv2026

Taming Subpacketization without Sacrificing Communication: A Packet Type-based Framework for D2D Coded Caching

Finite-length design is essential for making coded caching practical, as the optimal communication gains of existing schemes often require prohibitively large subpacketization. This paper studies rate-optimal device-to-device (D2D) coded caching with reduced subpacketization. We propose a packet type-based (PT) framework that exploits the geometric structure induced by user grouping. Under this structure, subfiles, packets, and multicast groups are classified into types, allowing the originally symmetric Ji-Caire-Molisch (JCM) design~\cite{ji2016fundamental} to be systematically relaxed without sacrificing the optimal D2D communication rate. The key feature of the PT framework is that subpacketization reduction is achieved through two complementary mechanisms: \emph{subfile saving}, by excluding redundant subfile types, and \emph{further-splitting saving}, by assigning type-dependent further-splitting factors to subfiles through transmitter selection. The type-dependent splitting factors are then coordinated across multicast group types to produce a globally consistent file-splitting structure. Based on this framework, we construct several classes of rate-optimal D2D coded caching schemes that strictly improve upon the JCM subpacketization. The proposed schemes achieve either order-wise reductions in the number of users or constant-factor reductions over broad memory regimes, while preserving the optimal rate. These results reveal a structural distinction between D2D and shared-link coded caching: unlike in the shared-link setting, full symmetric subpacketization is not necessary for rate-optimal D2D caching.

cs.IT↗