Fixed complexity sphere decoder

[annuay]

I would like to know how we could limit the number of nodes visited (counting all nodes from all levels of the decoder tree). Could you please provide a suggestion on how we can keep track of the number of nodes visited? (This helps in fixing the complexity or number of computations)

[maflcko]

By limiting the total number of layers that are visited, the bit error rate is increased, as the algorithm is no longer optimal. You might as well choose one of the approximate, but faster, alternative solutions.

On Tue, Apr 11, 2017 at 9:00 PM, annuay [email protected] wrote:

I would like to know how we could limit the number of nodes visited (counting all nodes from all levels of the decoder tree). Could you please provide a suggestion on how we can keep track of the number of nodes visited?

— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/MarcoFalke/SphereDecoding/issues/2, or mute the thread https://github.com/notifications/unsubscribe-auth/AGGmvyBydJzmy-BPpr_IyS-JYclL613zks5ru826gaJpZM4M6gwb .

[annuay]

I am fine with the suboptimal case. My aim is to ensure that the number of computations in any case does not exceed a fixed number of flops (system requirement). As flops and number of nodes visited are proportional, I could limit the number of nodes visited. Could you please tell me where I should place counter variables in the while loops to count number of nodes visited?

[vinodkavya]

Please let me know that while I have used in Matlab, they asked for input arguments. Could you please tell me about the main program that is used for calling all of these functions?