IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-43799-5_30.html
   My bibliography  Save this book chapter

The Diagonal Reduction Algorithm Using Fast Givens

In: Computer Mathematics

Author

Listed:
  • Wen Zhang

    (Qingdao University of Science and Technology, School of Mathematics and Physics)

  • Sanzheng Qiao

    (McMaster University, Shanghai Key Laboratory of Contemporary Applied Mathematics, Department of Computing and Software)

  • Yimin Wei

    (Fudan University, Shanghai Key Laboratory of Contemporary Applied Mathematics, School of Mathematical Sciences)

Abstract

Recently, a new lattice basis reduction notion, called diagonal reduction, was proposed for lattice-reduction-aided detection (LRAD) of multiinput multioutput (MIMO) systems. In this paper, we improve the efficiency of the diagonal reduction algorithm by using the fast Givens transformations. The technique of the fast Givens is applicable to a family of LLL-type lattice reduction methods to improve efficiency. Also, in this paper, we investigate dual diagonal reduction and derive an upper bound of the proximity factors for a family of dual reduction aided successive interference cancelation (SIC) decoding. Our upper bound not only extends an existing bound for dual LLL reduction to a family of dual reduction methods, but also improves the existing bound.

Suggested Citation

  • Wen Zhang & Sanzheng Qiao & Yimin Wei, 2014. "The Diagonal Reduction Algorithm Using Fast Givens," Springer Books, in: Ruyong Feng & Wen-shin Lee & Yosuke Sato (ed.), Computer Mathematics, edition 127, pages 453-465, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-43799-5_30
    DOI: 10.1007/978-3-662-43799-5_30
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-662-43799-5_30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.