Bibliographic record
Abstract
The Reconfigurable Computing program at Los Alamos National Laboratory (LANL) required synthesizable VHDL Fast Fourier Transform (FFT) designs that could be quickly implemented into FPGA-based high speed Digital Signal Processing architectures. Several different FFTs were needed for the different systems. As a result, the MATLAB-Based VHDL Development Environment was developed so that with a small amount of work and forethought, arbitrarily sized FFTs with different bit-width parameters could be produced quickly from one VHDL generating algorithm. The result is highly readable VHDL that can be modified quickly via the generating function to adapt to new algorithmic requirements. Several additional capabilities are integrated into the development environment. These capabilities include a bit-true parameterized mathematical model, fixed-point design validation, test vector generation, VHDL design verification, and chip resource use estimation. LANL needed the flexibility to build a wide variety of FFTs with a quick turn around time. It was important to have an effective way of trading off size, speed and precision. The FFTs also needed to be efficiently implemented into our existing FPGA-based architecture. Reconfigurable computing systems at LANL have been designed to accept two or four inputs on each clock. This allows the data processing rate to be reduced to a more manageable speed. This approach, however, limits us from using existing FFT cores. A MATLAB-Based VHDL Development Environment (MBVDE) was created in response to our FFT needs. MBVDE provides more flexibility than is available with VHDL. The technique allows new designs to be implemented and verified quickly. In addition, analysis tools are incorporated to evaluate trade-offs. MBVDE incorporates the performance of VHDL, the fast design time of core generation, and the benefit of not having to know VHDL available with C-tools into one environment. The MBVDE approach is not a comprehensive solution, but is a powerful method for algorithms that involve the cascading of fundamental building blocks.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.071 | 0.039 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".