Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences

DOI10.1109/TSP.2009.2039821MaRDI QIDQ4570168zbMATH OpenFDO

Authors Alberto Carini

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2009.2039821

Mathematics Subject Classification ID

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

Recommendations

• Improved results on periodic multisequences with large error linear complexity
• Periodic multisequences with large error linear complexity
• Periodic sequences with large k-error linear complexity
• Information Security and Cryptology
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Cryptography and Coding
• A fast algorithm for determining the linear complexity in periodic sequences
• scientific article; zbMATH DE number 1955778
• An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
• Some algorithms for the error linear complexity of binary 2ⁿ-periodic sequences

This page was built for publication: Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences

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