首页> 外国专利> FAST BLOCK-WISE INVERSE JACKET TRANSFORM BASED ON ARIKAN AND ALAMOUTI MATRICES

FAST BLOCK-WISE INVERSE JACKET TRANSFORM BASED ON ARIKAN AND ALAMOUTI MATRICES

机译:基于ARIKAN和ALAMOUTI矩阵的快速整机逆夹克变换

摘要

Fast Arikan polar binary BIJTs and Alamouti MIMO non-binary block-wise inverse transforms satisfy the relation [J]_N[J](_N^-1) = [I]_N. Binary BJTs of 2^k, 3^k, 5^k, and 6^k order are provided, and their binary block-wise inverse transforms are obtained by transposing binary block-wise transforms. One- and two-dimensional binary block-wise fast transforms are constructed in recursive forms. Kronecker products of successive lower order matrices and a binary block-wise basis matrix are used in recursive forms. Alamouti MIMO non-binary BJT is the Kronecker product of a lower order unit matrix and basis matrix [J]_2. As a result, the BIJTs in accordance to the present invention can be used in areas such as 3GPP mobile ultra-broadband permutation matrices, Reed-Muller code design, diagonal channels, MIMO 4G LTE Alamouti code, and pre-coding design. In addition, diagonal block-wise basis unit matrices are suitable for OFDM without inter-symbol interference (ISI), diagonal block zero-forcing pre-coding, and SVD in multi-user MIMO.;COPYRIGHT KIPO 2015
机译:快速的Arikan极性二进制BIJT和Alamouti MIMO非二进制块式逆变换满足关系[J] _N [J](_ N ^ -1)= [I] _N。提供了2 ^ k,3 ^ k,5 ^ k和6 ^ k阶的二进制BJT,并通过转置二进制逐块变换获得了它们的二进制逐块逆变换。一维和二维二进制逐块快速变换以递归形式构造。递归形式使用连续低阶矩阵的Kronecker乘积和二进制逐块基础矩阵。 Alamouti MIMO非二进制BJT是低阶单位矩阵和基本矩阵的Kronecker乘积[J] _2。结果,根据本发明的BIJT可以在诸如3GPP移动超宽带置换矩阵,里德-穆勒码设计,对角信道,MIMO 4G LTE Alamouti码和预编码设计的领域中使用。此外,对角逐块基础单位矩阵适用于无符号间干扰(ISI),对角块迫零预编码和多用户MIMO中的SVD的OFDM.COPYRIGHT KIPO 2015

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号