Abstract

Employing Chinese remainder theorem (CRT) index mapping for DFT matrices, a notation referred as cocyclic DFT matrices is proposed. Following the mathematical proof, it can be seen that using CRT index scheme proves the resulting DFT matrix in possession of cocyclic property. By exploiting the close relationship of successively lower order DFT matrices, a fast construction approach for general cocyclic DFT matrices is described in simple way. The proposed construction algorithm is presented for simplicity and clarity for it only minimally related to sparse matrices. The result indicates the presented fast algorithm performs quite well at decreasing the computation complexity.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call