Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform

作者：Lee Moon Ho^*; Khan Md Hashem Ali; Kim Kyeong Jin

来源：Eurasip Journal on Advances in Signal Processing, 2013, 2013(1): 37.

DOI：10.1186/1687-6180-2013-37

• Arikan and Alamouti matrices
• Fast block-wise inverse Jacket transform
• Kronecker product
• Sparse matrix factorization

Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to the identity matrix. Therefore, we mathematically propose a fast block-wise inverse Jacket transform of orders N = 2 (k) , 3 (k) , 5 (k) , and 6 (k) , where k is a positive integer. Based on the Kronecker product of the successive lower order Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse and fast algorithms of Arikan polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are obtained from BIJTs, they can be applied in areas such as 3GPP physical layer for ultra mobile broadband permutation matrices design, first-order q-ary Reed-Muller code design, diagonal channel design, diagonal subchannel decompose for interference alignment, and 4G MIMO long-term evolution Alamouti precoding design.

• 出版日期2013