Reduction of sphere decoding complexity using an adaptive SD-OSIC system
Explore this paper's citation graph
- Type
- article
- Published
- 2011-10-13
- Cited by
- 0
- References
- 8
- OpenAlex
- https://openalex.org/W2161474341
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:10580984
Keywords
Decoding methods, Reduction (mathematics), Computer science, Variable (mathematics), Algorithm
References
- A new reduced-complexity sphere decoder for multiple antenna systems
- A Simplified Sphere Decoding Algorithm for MIMO Transmission System
- A Fixed-Complexity MIMO Detector Based on the Complex Sphere Decoder
- A universal lattice code decoder for fading channels
- A Hybrid Zero-Forcing and Sphere-Decoding Method for MIMO Systems
- Fixing the Complexity of the Sphere Decoder for MIMO Detection
- Algorithm and implementation of the K-best sphere decoding for MIMO detection
- On the Complexity of Sphere Decoding
Cited by
No citing papers recorded for this paper.
Related papers
- Efficient Sphere Polar Decoding via Synchronous Determination
- Low-Complexity Successive Cancellation List Decoding of Polar Codes Based on Path Metric
- Research of an improved BP decoding arithmetic
- Fast A soft decision decoding for binary block codes
- Soft decision decoding using the hierarchy of linear block codes
- Adjustable Soft List Decoding for Polar Codes
- Research of modified IRA decoding algorithm based on offset approximation
- Adaptive soft - decision decoding for array codes
- Filling-in some of the decoding gap between belief propagation (BP) and maximum a posteriori (MAP) for convolutional codes