Delayed branch decision in quadrature decomposition with M-searching
View Patent ↗A QRD-M decomposition includes a first and a sequential second stage, at least. In the first stage, M branches are selected from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated. In the second stage, more than M branches are selected from among those branches entering the second stage as survive branches from which multiple decompositions are calculated. The symbol of the received signal is decided from a branch that is a survive branch of both the first and second stages. The second stage may be within a window that may include additional stages at which the pruning decision down to M survive branches is delayed. One or more windows may be used in a single QRD-M decomposition. In an embodiment, all branches entering the second stage are survive branches. It is shown that the marginal increased computational load increases accuracy.
1. A method comprising:
receiving a signal at an apparatus;
processing the signal in a processor of the apparatus using a multi-stage quadrature decomposition search, wherein the processing comprises:
for a first stage, the processor selecting M branches from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated, where M is an integer greater than one;
and for a second stage sequential with the first stage, the processor selecting more than M branches from among those entering the second stage as survive branches from which multiple decompositions are calculated; and
the processor deciding a symbol of the received signal from a branch that is a survive branch of both the first and second stages.
2. The method of claim 1 , wherein for the first stage, the processor selecting M branches comprises the processor pruning 2M branches entering the first stage to M survive branches; and wherein for the second stage, the processor selecting more than M branches comprises the processor selecting each of 2M branches entering the second stage.
3. The method of claim 2 , wherein the processing further comprises, in a third stage following the second stage, the processor selecting M branches from among more than M branches entering the third stage as survive branches from which the processor calculates multiple decompositions, such that the second and third stages form a window within which is a number of stages d at which all entering branches are selected by the processor as survive branches, where d is an integer at least equal to one.
4. The method of claim 3 , wherein d is equal to one.
5. The method of claim 3 , wherein the window comprises a first window, and wherein the processing further comprises the processor decomposing in a second window comprising a number of stages d at which all entering branches are selected by the processor as survive branches and a final stage at which a number of entering branches is pruned by the processor to M survive branches.
6. The method of claim 1 , wherein the processing during the entire multi-stage quadrature decomposition search further comprises, for every stage except the second stage, the processor selecting M branches from among 2M branches entering the respective stage as survive branches.
7. The method of claim 6 , wherein the second stage is other than a final stage of the multi-stage quadrature decomposition search.
8. The method of claim 1 , wherein the signal comprises a multi-input multi-output (MIMO) signal.
9. The method of claim 1 , wherein the first stage is sequentially after the second stage.
10. A computer readable memory tangibly embodying a computer program and executable by a digital data processor, to perform actions directed toward performing a multi-stage quadrature decomposition search, the actions comprising, for an input signal:
for a first stage, selecting M branches from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated, where M is an integer greater than one;
and for a second stage sequential with the first stage, selecting more than M branches from among those entering the second stage as survive branches from which multiple decompositions are calculated; and
deciding a symbol of the received signal from a branch that is a survive branch of both the first and second stages.
11. The computer readable memory of claim 10 , wherein for the first stage, selecting M branches comprises pruning 2M branches entering the first stage to M survive branches; and wherein for the second stage, selecting more than M branches comprises selecting each of 2M branches entering the second stage.
12. The computer readable memory of claim 11 , wherein the actions further comprise, in a third stage following the second stage, selecting M branches from among more than M branches entering the third stage as survive branches from which multiple decompositions are calculated, such that the second and third stages form a window within which is a number of stages d at which all entering branches are selected as survive branches, where d is an integer at least equal to one.
13. The computer readable memory of claim 12 , where d is equal to one.
14. The computer readable memory of claim 12 , where d is adaptable.
15. The computer readable memory of claim 12 , wherein the window comprises a first window, and wherein the processing further comprises decomposing in a second window comprising a number of stages d at which all entering branches are selected as survive branches and a final stage at which a number of entering branches is pruned to M survive branches.
16. The computer readable memory of claim 10 , wherein performing the multi-stage quadrature decomposition search comprises, for every stage except the second stage, selecting M branches from among 2M branches entering the respective stage as survive branches.
17. The computer readable memory of claim 16 , wherein the second stage is other than a final stage of the multi-stage quadrature decomposition search.
18. The computer readable memory of claim 10 , wherein the signal comprises a multi-input multi-output (MIMO) signal.
19. The computer readable memory of claim 10 , wherein the first stage is sequentially after the second stage.
20. An apparatus, comprising:
at least one processor;
at least one memory including a computer program;
in which the at least one memory and the computer program are configured to, with the at least one processor, cause the apparatus at least to:
process an input signal using a multi-stage quadrature decomposition search by:
for a first stage, selecting M branches from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated, where M is an integer greater than one;
and for a second stage sequential with the first stage, selecting more than M branches from among those entering the second stage as survive branches from which multiple decompositions are calculated; and
deciding a symbol of the received signal from a branch that is a survive branch of both the first and second stages.
21. The apparatus of claim 20 , wherein for the first stage, selecting M branches comprises pruning 2M branches entering the first stage to M survive branches; and wherein for the second stage, selecting more than M branches comprises selecting each of 2M branches entering the second stage.
22. The apparatus of claim 21 , wherein the at least one memory and the computer program are configured with the at least one processor to cause the apparatus at least to further process the input signal using the multi-stage quadrature decomposition search by, in a third stage following the second stage, selecting M branches from among more than M branches entering the third stage as survive branches from which multiple decompositions are calculated, such that the second and third stage form a window within which is a number of stages d at which all entering branches are selected as survive branches, where d is an integer at least equal to one.
23. The apparatus of claim 22 , wherein the window comprises a first window, and wherein the processing further comprises decomposing in a second window comprising a number of stages d at which all entering branches are selected as survive branches and a final stage at which a number of entering branches is pruned to M survive branches.
24. The apparatus of claim 22 , wherein the at least one memory and the computer program are configured with the at least one processor to cause the apparatus at least to process the input signal using the multi-stage quadrature decomposition search by, for every stage except the second stage, selecting M branches from among 2M branches entering the respective stage as survive branches.
25. An apparatus comprising:
means for receiving a wireless signal; and
means for decomposing the received signal according to a multi-stage quadrature decomposition by:
for a first stage, selecting M branches from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated, where M is an integer greater than one;
and for a second stage sequential with the first stage, selecting more than M branches from among those entering the second stage as survive branches from which multiple decompositions are calculated; and
deciding a symbol of the received signal from a branch that is a survive branch of both the first and second stages.
26. The apparatus of claim 25 , wherein the means for receiving comprises a receiver and the means for decomposing comprises a processor executing a computer program embodied on a memory coupled to the processor.