Low-complexity inverse square root approximation for baseband matrix operations

DOI10.5402/2011/615934MaRDI QIDQ630824zbMATH OpenOpenAlexWikidataFDO

Authors Perttu Salmela, Adrian Burian, T. Järvinen, Aki Happonen, Jarmo Takala

Publication date 22 March 2011

Published in ISRN Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2011/615934

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Fast enclosure for a matrix inverse square root
• On low-complexity approximation of matrices
• On the computation of a matrix inverse square root
• Inversion free algorithms for computing the principal square root of a matrix
• An Iterative Method for the Computation of a Matrix Inverse Square Root
• Efficient inversion of matrix -functions of low order
• Improved inverse scaling and squaring algorithms for the matrix logarithm
• Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse
• scientific article; zbMATH DE number 554501
• Fast and stable algorithms for computing the principal square root of a complex matrix

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• Powering by a table look-up and a multiplication with operand modification
• Reciprocation, square root, inverse square root, and some elementary functions using small multipliers

This page was built for publication: Low-complexity inverse square root approximation for baseband matrix operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630824)