CP-based SBHT-RLS algorithms for tracking channel estimates in multicarrier modulation systems (Q415829)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6032000
Language Label Description Also known as
default for all languages
No label defined
    English
    CP-based SBHT-RLS algorithms for tracking channel estimates in multicarrier modulation systems
    scientific article; zbMATH DE number 6032000

      Statements

      CP-based SBHT-RLS algorithms for tracking channel estimates in multicarrier modulation systems (English)
      0 references
      9 May 2012
      0 references
      Summary: Cyclic prefix (CP) in multicarrier modulation systems has been considered as an alternative to the training sequences to track channel estimates. In this paper, two new algorithms are developed that exploit CP from their data detection part and employ systolic block Householder transformation recursive least squares (SBHT-RLS) algorithms for channel tracking in multicarrier systems. The new methods are compared with the existing CP exploiting correlation matrix based block RLS (CMB-RLS) channel tracking approach to outline their relative advantages. Aspects of computational complexity and parallel implementation are addressed, and the algorithms are tested in terms of their channel estimation and tracking capabilities. Performance of the algorithms is also evaluated for varying forgetting factor parameter values, constellation size, and word lengths. Floating-point and fixed-point simulations are tailored to illustrate pertinent tradeoffs.
      0 references
      multicarrier modulation systems
      0 references
      cyclic prefix
      0 references
      systolic block Householder transformation recursive least squares
      0 references
      channel tracking
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references