TY - GEN
T1 - Limited-shift-full-rank matrices with applications in asynchronous cooperative communications
AU - Shang, Yue
AU - Xia, Xiang Gen
PY - 2007
Y1 - 2007
N2 - Shift-full-rank (SFR) matrices are matrices that have full row rank no matter how their rows are shifted. SFR matrices have been used lately as generator matrices for a family of space-time trellis codes to achieve full diversity in asynchronous cooperative communications, where the numbers of columns of the SFR matrices correspond to the memory sizes of the trellis codes and an upper bound is assumed for all the possible delays during each packet (frame) transmission. In this paper, we study a variation of SFR matrices with relaxed conditions: limited-shift-full-rank (LT-SFR) matrices, i.e., the matrices that keep full row rank when the shifts of their rows are within some range called delay tolerance. As the generator matrices for the previously proposed space-time trellis codes, LTSFR matrices can already guarantee asynchronous full diversity of the corresponding codes.
AB - Shift-full-rank (SFR) matrices are matrices that have full row rank no matter how their rows are shifted. SFR matrices have been used lately as generator matrices for a family of space-time trellis codes to achieve full diversity in asynchronous cooperative communications, where the numbers of columns of the SFR matrices correspond to the memory sizes of the trellis codes and an upper bound is assumed for all the possible delays during each packet (frame) transmission. In this paper, we study a variation of SFR matrices with relaxed conditions: limited-shift-full-rank (LT-SFR) matrices, i.e., the matrices that keep full row rank when the shifts of their rows are within some range called delay tolerance. As the generator matrices for the previously proposed space-time trellis codes, LTSFR matrices can already guarantee asynchronous full diversity of the corresponding codes.
UR - http://www.scopus.com/inward/record.url?scp=39349110754&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2007.268
DO - 10.1109/GLOCOM.2007.268
M3 - Conference contribution
AN - SCOPUS:39349110754
SN - 1424410436
SN - 9781424410439
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 1395
EP - 1399
BT - IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
T2 - 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
Y2 - 26 November 2007 through 30 November 2007
ER -