A Complexity Efficient DMT-Optimal Tree Pruning Based Sphere Decoding
We present a diversity multiplexing tradeoff (DMT) optimal tree pruning sphere decoding algorithm which visits merely a single branch of the search tree of the sphere decoding (SD) algorithm, while maintaining the DMT optimality at high signal to noise ratio (SNR) regime. The search tree of the sphere decoding algorithm is pruned via intersecting one dimensional spheres with the hypersphere of the SD algorithm, and the radii are chosen to guarantee the DMT optimality. In contrast to the conventional DMT optimal SD algorithm, which is known to have a polynomial complexity at high SNR regime, we show that the proposed method achieves the DMT optimality by solely visiting a single branch of the search tree at high SNR regime. The simulation results are corroborated with the claimed characteristics of the algorithm in two different scenarios.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversitySimilar Papers 제목 키워드 기반
Learning-Aided Deep Path Prediction for Sphere Decoding in Large MIMO Systems
In this paper, we propose a novel learning-aided sphere decoding (SD) scheme for large multiple-input--multiple-output systems, namely, deep path prediction-based sphere decoding (DPP-SD). In this scheme, we employ a neu…
Deep Learning Based Sphere Decoding
In this paper, a deep learning (DL)-based sphere decoding algorithm is proposed, where the radius of the decoding hypersphere is learned by a deep neural network (DNN). The performance achieved by the proposed algorithm …
Deep LearningOptimal Decision Tree Pruning Revisited: Algorithms and Complexity
We present a comprehensive classical and parameterized complexity analysis of decision tree pruning operations, extending recent research on the complexity of learning small decision trees. Thereby, we offer new insights…
RASD: Retrieval-Augmented Speculative Decoding
Speculative decoding accelerates inference in large language models (LLMs) by generating draft tokens for target model verification. Current approaches for obtaining draft tokens rely on lightweight draft models or addit…
RetrievalMulti-Armed Bandits-Based Optimization of Decision Trees
Decision trees, without appropriate constraints, can easily become overly complex and prone to overfit, capturing noise rather than generalizable patterns. To resolve this problem,pruning operation is a crucial part in o…
Reinforcement LearningMulti-Armed Bandits