Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Asynchronous Cooperative MIMO Systems using A Linear Dispersion Structure

Published

Author(s)

Hamid Gharavi

Abstract

In this treatise, we propose a novel family of Asynchronous Cooperative Linear Dispersion Codes (ACLDCs),which is capable of maintaining full diversity in cooperative scenarios even at the presence of asynchronous reception. The linear dispersion structure is employed in order to accommodate the dynamic topology of cooperative networks, as well as to achieve higher throughput than conventional space time codes based on orthogonal designs. By introducing guard intervals and block encoding/decoding techniques, the interference signals caused by asynchronous reception can be exploited rather than discarded.
Citation
IEEE Transactions on Vehicular Technology
Volume
59
Issue
2

Keywords

MIMO systems, cooperative transmission, space-time block codes, linear dispersion codes, asynchronous reception

Citation

Gharavi, H. (2010), Asynchronous Cooperative MIMO Systems using A Linear Dispersion Structure, IEEE Transactions on Vehicular Technology, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=904689 (Accessed October 9, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created February 2, 2010, Updated February 19, 2017
Was this page helpful?