Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification
eess.SY, cs.SY, eess.SP, math.OC
Submitted: 2026-09-23
Updated: 2026-09-23
Comments: 17 pages, 9 figures. Published as a NASA Technical Memorandum. Available on the NASA Technical Reports Server (NTRS), Document ID: 20240009677
Project page: http://www.sti.nasa.gov
License: http://creativecommons.org/publicdomain/zero/1.0/
The gist: Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated.
Terminology
Abstract
Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.
Related papers
- One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
- A Geometric Decision Procedure for STL Feasibility and Repair
- From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
- Battery Second Life: A Review of Experimental Studies
- Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
- Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model