Open AccessCooperative relaying with block DFT processing and full‐duplex relays
Author(s) -
Stanković V.,
Spalević P.
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2012.4042
Subject(s) - block (permutation group theory) , computer science , circulant matrix , relay , overhead (engineering) , computational complexity theory , channel (broadcasting) , diagonal , duplex (building) , algorithm , channel state information , block matrix , transmission (telecommunications) , discrete fourier transform (general) , electronic engineering , fourier transform , telecommunications , mathematics , engineering , wireless , fractional fourier transform , fourier analysis , eigenvalues and eigenvectors , mathematical analysis , biology , genetics , operating system , dna , power (physics) , geometry , quantum mechanics , physics
Proposed is a cooperation scheme for a system with full‐duplex relays. The transmission over one frame from the source and the relay nodes is coordinated so that the effective channel matrix at the destination is block circulant. By using the low complexity block discrete Fourier transform the effective channel is transformed into a block diagonal matrix and the additional diversity gains are extracted with significantly lower computational complexity of the spatial processing. The scheme requires additional pilot overhead for the estimation of channel state information and additional time slots for the initial exchange of data between the source, the destination and the relay nodes.