A novel particle swarm optimization for high-level synthesis of digital filters
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper presents a novel discrete particle swarm optimization (PSO) technique for the high-level synthesis of digital filter data-paths. In this technique, the cost associated with the final digital filter data-path is minimized for obtaining combined area-cum-time optimal digital filter data-paths subject to user-specified constraints on the number of the required arithmetic functional units. In the proposed technique, the digital filter data-path encoding is achieved by combining the information regarding the operation scheduling together with the information regarding the allocation and binding of operations to arithmetic functional units into a single particle. The scheduling, and allocation and binding information form the coordinate values of the particles in PSO. The salient feature of the resulting PSO technique is its fast convergence speed, achieved by ensuring that the (random) movement of the particles in the search space in the course of optimization are automatically guaranteed to preserve the data-dependency relationships in the original digital filter signal flow-graph without any recourse to backtracking. The usefulness of the proposed PSO technique is demonstrated through the application of it to the high-level synthesis of a benchmark elliptic wave digital filter. It is observed that the application of the PSO leads to substantially faster convergence speeds as compared to the corresponding genetic algorithms.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it