5.0

5.0 | 1 rating Rate this file 13 Downloads (last 30 days) File Size: 36.8 KB File ID: #11931

Priority First Stack-based Sequential Decoder

by

 

09 Aug 2006 (Updated )

Stack-based sequential decoder for M-QAM modulated MIMO-type problems, i.e., of fixed tree depth.

| Watch this File

File Information
Description

A stack-based sequential priority first decoder that returns Maximum-Likelihood solutions to M-QAM modulated MIMO system-type problems, i.e., a lattice decoder with optional justified rectangular boundary control. In such problems, the depth of the search tree is known and the number of children per node is also fixed.

Real or complex inputs are permitted; in practice, this implementation of the sequential decoding algorithm is near-ML because it operates with finite memory. If that memory is exceeded, nodes are dropped from the stack and the number of such dropped nodes is returned.

In addition, this implementation allows specification of the size of the finite memory block (in terms of number of nodes) allocated for its execution. Generally we find that restricting the sequential decoder to finite memory is not a major consideration, as very near-ML performance can be achieved with relatively low allocations.

Please see the function pre-amble (type `help Talg_det` at the Matlab prompt) for more details.

MATLAB release MATLAB 7.0.1 (R14SP1)
Other requirements The accompanying implementation of a mex heap is required for Talg_det to run.
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
Comments and Ratings (1)
09 Aug 2006 Bob Moore

Really useful, thanks!

Updates

Added to description to indicate that the algorithm is actually a general lattice decoder as well.

16 Aug 2006

Minor fix to heap.c; should not affect normal operation of Talg_det.m [v1.1].

Contact us