Reduction of sphere decoding complexity using an adaptive SD-OSIC system
Sherlie Portugal, Saransh Malik, Changwoo Seo, Cheolsung Kim, Intae Hwang
Abstract
Sherlie Portugal, Saransh Malik, Changwoo Seo, Cheolsung Kim, Intae Hwang
Abstract
Sphere decoding is a technique able to achieve the optimal performance of the maximum likelihood decoder, but its high and variable complexity can make the practical implementation infeasible. In this paper, we present an adaptive system, called adaptive SD-OSIC, as a way of reducing the decoding complexity while maintaining the error performance of conventional sphere decoding.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Sphere decoding is a technique able to achieve the optimal performance of the maximum likelihood decoder, but its high and variable complexity can make the practical implementation infeasible. In this paper, we present an adaptive system, called adaptive SD-OSIC, as a way of reducing the decoding complexity while maintaining the error performance of conventional sphere decoding.
Key concepts: Decoding methods, Reduction (mathematics), Computer science, Variable (mathematics), Algorithm, Computational complexity theory, List decoding, Sequential decoding