Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition

Details Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition

2009-01-22

arxiv.org/abs/0901.3475v1

Computer Science

Information Theory

This paper is submitted to IEEE transactions on Information theory

Scientific paper

An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides various combinations of two or more different searching algorithms. Hence it makes flexibility in error rate and complexity for the algorithms using it. We calculate diversity orders and upper bounds of error rates for typical models when these models are solved by divided decodings with sphere decoder, and discuss about the effects of divided decoding on complexity. Simulation results of divided decodings combined with a sphere decoder according to different splitting indices correspond to the theoretical analysis.

Affiliated with

Also associated with

No associations

Rating

Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189625