Design of distributed collaborative space-time block codes for two-way relaying networks

Utilising the recently-developed unique factorisation of signals and distributed Alamouti coding, a distributed collaborative space-time block code design is presented for a two-way amplify-and-forward (AF) relaying network, where all nodes are equipped with a single antenna. Two asymptotic pairwise...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IET communications Ročník 7; číslo 13; s. 1367 - 1376
Hlavní autoři:	Gong, Fengkui, Zhang, Jian-Kang, Wang, Hui, Ge, Jianhua
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Stevenage The Institution of Engineering and Technology 01.09.2013 John Wiley & Sons, Inc
Témata:	amplify and forward communication asymptotic pairwise error probability Asymptotic properties average block error rate Block codes Channels Constellations Detectors distributed collaborative Alamouti space‐time block code design error statistics fixed transmission bit rate fixed‐gain AF linear codes linear‐decoding complexity maximum likelihood detection maximum‐likelihood detector Networks newly‐designed code optimal constellation Optimization Rayleigh channels recently‐developed unique factorisation Relaying space‐time block codes two‐way amplify‐and‐forward relaying network two‐way relaying networks unity average transmission energy variable‐gain AF maximum likelihood detection optimal constellation linear codes linear-decoding complexity Rayleigh channels distributed collaborative Alamouti space-time block code design maximum-likelihood detector two-way amplify-and-forward relaying network amplify and forward communication average block error rate asymptotic pairwise error probability two-way relaying networks recently-developed unique factorisation space-time block codes variable-gain AF newly-designed code fixed-gain AF unity average transmission energy error statistics fixed transmission bit rate
ISSN:	1751-8628, 1751-8636
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!