Low-complexity distributed differential spacetime coding scheme for amplify-and-forward cooperative networks

By introducing a space-time coding scheme based on amicable orthogonality, we develop a distributed differential space-time coding scheme with the amplify-and-forward (AF) method for wireless cooperative networks. The scheme requires no knowledge of the channel state information at both transmitters...

Full description

Saved in:
Bibliographic Details
Published inScience China. Information sciences Vol. 52; no. 8; pp. 1418 - 1427
Main Authors Yu, XiangBin, Bi, GuangGuo, Xu, WeiYe
Format Journal Article
LanguageEnglish
Published Heidelberg SP Science in China Press 01.08.2009
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:By introducing a space-time coding scheme based on amicable orthogonality, we develop a distributed differential space-time coding scheme with the amplify-and-forward (AF) method for wireless cooperative networks. The scheme requires no knowledge of the channel state information at both transmitters and receivers, and effectively decreases the realization complexity due to no channel estimation. Moreover, it has lower decoding complexity and higher coding advantage than the existing scheme, thus avoiding the shortcoming of exponential decoding complexity of some existing schemes. According to the pairwise error probability (PEP) analysis of the system, the power allocations of source and relay terminals are jointly optimized, and as a result, the PEP is minimized, which will provide a helpful guideline for system design. Numerical calculation and simulation results show that the developed scheme is superior to the existing scheme. Moreover, the scheme with optimal power allocation yields obvious performance improvement over that with equal power allocation.
Bibliography:TN929.533
11-4426/N
differential space-time coding, cooperative communication, amplify-and-forward method, power allocation
TN929.5
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1009-2757
1674-733X
1862-2836
1869-1919
DOI:10.1007/s11432-009-0117-6