Low-complexity fast coding method of quasi-orthogonal grouped space-time codes
The invention discloses a low-complexity fast coding method of quasi-orthogonal grouped space-time codes and mainly aims to solve the problem of excessive complexity of the prior art. The low-complexity fast coding method includes the following steps: conducting QR decomposition on an equivalent cha...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention discloses a low-complexity fast coding method of quasi-orthogonal grouped space-time codes and mainly aims to solve the problem of excessive complexity of the prior art. The low-complexity fast coding method includes the following steps: conducting QR decomposition on an equivalent channel matrix in a system model to simplify the equivalent mode of a receiving end and achieve decoupling of partial signals; turning the equivalent channel matrix in a left-right way to convert the equivalent channel matrix so as to get a converted channel matrix; conducting QR decomposition on the converted channel matrix to simplify the conversion mode of the receiving end so as to achieve decoupling of the remained signals; conducting parallel decoding on decoupled formulas to get needed information. The low-complexity fast coding method has the advantages of low complexity and fast decoding, and can be used for information transmission of quasi-orthogonal grouped space-time codes. |
---|