TY - GEN
T1 - Improved lower bound for quasi-complementary sequence set
AU - Liu, Zi Long
AU - Guan, Yong Liang
AU - Mow, Wai Ho
PY - 2011
Y1 - 2011
N2 - The Welch bound for aperiodic correlation for binary sequence set was improved by Levenshtein by weighting the cyclic shifts of the sequence vectors. Taking Levenshtein's idea, a new lower bound for quasi-complementary sequence set (QCSS) over the complex roots-of-unity is derived in this paper. It is shown to be tighter than the Welch bound for QCSS in one of the following cases: 1) K = 4M 1, M≥2 and N > 2/1- 1/M 2) K≥4M, M≥2 and N≥2. where K,M,N respectively denotes the set size, number of channels, elementary sequence length of QCSS.
AB - The Welch bound for aperiodic correlation for binary sequence set was improved by Levenshtein by weighting the cyclic shifts of the sequence vectors. Taking Levenshtein's idea, a new lower bound for quasi-complementary sequence set (QCSS) over the complex roots-of-unity is derived in this paper. It is shown to be tighter than the Welch bound for QCSS in one of the following cases: 1) K = 4M 1, M≥2 and N > 2/1- 1/M 2) K≥4M, M≥2 and N≥2. where K,M,N respectively denotes the set size, number of channels, elementary sequence length of QCSS.
UR - http://www.scopus.com/inward/record.url?scp=80054824314&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054824314&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6034175
DO - 10.1109/ISIT.2011.6034175
M3 - Conference contribution
AN - SCOPUS:80054824314
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 489
EP - 493
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -