Closed form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennas

被引：0
作者：
Lu, KJ [1 ]
Fu, SL [1 ]
Xia, XG [1 ]
机构：
[1] Univ Texas, CATSS, Richardson, TX 75083 USA
来源：
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2004年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：307 / 307
页数：1
相关论文
共 50 条
[21]   SOME T-(2K,K,LAMBDA) DESIGNS [J].
NODA, R .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1978, 24 (01) :89-95
[22]   A New Approach for High Performance RNS-FIR Filter Using the Moduli Set {2k-1, 2k, 2k-1-1} [J].
Kotha, Srinivasa Reddy ;
Singhvi, Akshit ;
Sahoo, S. K. .
2014 IEEE SYMPOSIUM ON COMPUTER APPLICATIONS AND INDUSTRIAL ELECTRONICS (ISCAIE), 2014,
[23]   关于K+1类亏度为K的2K次插值样条 [J].
胡承列 .
华东师范大学学报(自然科学版), 1987, (04) :100-103
[24]   Comments on "The digit parallel method for fast RNS to weighted number system conversion for specific moduli (2k-1, 2k, 2k+1)" [J].
Mohan, PVA .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 2000, 47 (09) :972-974
[25]   Optimal designs for 2k choice experiments [J].
Burgess, L ;
Street, DJ .
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2003, 32 (11) :2185-2206
[26]   On a family of diophantine triples {k, A2k + 2A, (A + 1)2k + 2 (A + 1)} with two parameters [J].
B. He ;
A. Togbé .
Acta Mathematica Hungarica, 2009, 124 :99-113
[27]   Construction of (2k, k, 2) Convolutional Codes with Double-Loop Cyclic Codes [J].
Zhang, Chengchang ;
Peng, Wanquan .
WIRELESS PERSONAL COMMUNICATIONS, 2014, 77 (04) :3093-3104
[28]   Analyzing Unreplicated 2k Factorial Designs by Examining their Projections into k-1 Factors [J].
Angelopoulos, P. ;
Evangelaras, H. ;
Koukouvinos, C. .
QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2010, 26 (03) :223-233
[29]   Constructive spherical codes in 2k dimensions [J].
Miyamoto, Henrique K. ;
Earp, Henrique N. Sa ;
Costa, Sueli I. R. .
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, :1612-1616
[30]   Finding paths of length k in O*(2k) time [J].
Williams, Ryan .
INFORMATION PROCESSING LETTERS, 2009, 109 (06) :315-318
12345