Computational cost reduction for N+2 order coupling matrix synthesis based on Desnanot-Jacobi identity

File Description SizeFormat 
2016_11_IEEE Access2.pdfPublished version6.57 MBAdobe PDFDownload
Title: Computational cost reduction for N+2 order coupling matrix synthesis based on Desnanot-Jacobi identity
Author(s): Muller, A
Sanabria-Codesal, E
Lucyszyn, S
Item Type: Journal Article
Abstract: Matrix inversion is routinely performed in computational engineering, with coupling matrix filter synthesis considered here as just one of many example applications. When calculating the elements of the inverse of a matrix, the determinants of the submatrices are evaluated. The recent mathematical proof of the Desnanot-Jacobi (also known as the “Lewis Carol”) identity shows how the determinant of an N+2 order square matrix can be directly computed from the determinants of the N+1 order principal submatrices and N order core submatrix. For the first time, this identity is applied directly to an electrical engineering problem, simplifying N+2 order coupled matrix filter synthesis (general case, which includes lossy and asymmetrical filters). With the general two-port network theory, we prove the simplification using the Desnanot-Jacobi identity and show that the N+2 coupling matrix can be directly extracted from the zeros of the admittance parameters (given by N+1 order determinants) and poles of the impedance parameters (given by the N order core matrix determinant). The results show that it is possible to decrease the computational complexity (by eliminating redundancy), reduce the associated cost function (by using less iterations), and under certain circumstances obtain different equivalent solutions. Nevertheless, the method also proves its practical usefulness under constrained optimizations when the user desires specific coupling matrix topologies and constrained coefficient values (e.g, purely real/imaginary/positive/negative). This can lead to a direct coupling matrix constrained configuration where other similar methods fail (using the same optimization algorithms).
Publication Date: 21-Nov-2016
Date of Acceptance: 17-Nov-2016
URI: http://hdl.handle.net/10044/1/44284
DOI: https://dx.doi.org/10.1109/ACCESS.2016.2631262
Publisher: IEEE
Start Page: 10042
End Page: 10050
Journal / Book Title: IEEE Access
Volume: 4
Copyright Statement: © 2016 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Publication Status: Published
Open Access location: http://ieeexplore.ieee.org/document/7750588/
Appears in Collections:Faculty of Engineering
Electrical and Electronic Engineering



Items in Spiral are protected by copyright, with all rights reserved, unless otherwise indicated.

Creative Commons