Exploration of sign precomputation-based CORDIC in reconfigurable systems
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
Presented is an analysis of standard CORDIC implementations with sign precomputation mapped onto four modern Xilinx Field-Programmable Gate Arrays (FPGA) families, Virtex-4, -5, -6 and Spartan-6. Three methods of sign precomputation, P-CORDIC, Flat-CORDIC and Para-CORDIC have been proposed in previous literature as parallel methods for reducing CORDIC algorithm logic delay when implemented on an Application Specific Integrated Circuits (ASICs). However, little analysis exists on reconfigurable implementations where one major algorithm optimization design goal is to reduce interconnection delay. All three sign precomputation CORDIC techniques are shown to improve delay and logic utilization when compared with standard CORDIC. On state-of-the-art FPGAs, such as Virtex-6, P-CORDIC is found to perform best; on older devices, such as Virtex-4, Flat-CORDIC has the best performance. On in-between FPGAs, such as the Virtex-5, and Spartan-6, there is no clear winner between P-CORDIC and Flat-CORDIC. Para-CORDIC never outperforms P-CORDIC and Flat-CORDIC, but still represents an improvement over standard CORDIC implementations. Furthermore, Para-CORDIC can be deeply pipelined for applications where high throughput is the main design goal.
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.000 |
| 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.000 |
| 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