Inverterless Cauchy Cells for a Systolic Reed-Solomon Encoder
Bibliographic record
Abstract
Summary Consider an (n, k) Reed-Solomon (RS) code of length n = q - 1 and redundancy r = n - IC over the finite field GF(q). The usual implementation of the RS encoder consists of an T stage feedback shift register [1]. In some very high speed applications, the presence of the accompanying global feedback path restricts the speed of the encoder. Recently, Seroussi has proposed an architecture for the RS encoder [a]. Unlike the usual implementation of the RS encoder, Seroussi’s architecture does not require any global feedback path. Furthermore, the architecture is of systolic type and has modular a structure- it consists of one pre-processing cell and T Cauchy cells [2]. This modularity feature of the encoder makes it suitable for hardware implementation. The circuit complexity of Seroussi’s RS encoder depends essentially on the Cauchy cells. Each Cauchy cell computes one parity symbol for the RS code and contains one parallel type divider for the finite field GF(q). Unfortunately, the realization of a divider is much more complicated than that of a multiplier 131. Let M denote the circuit complexity of a parallel type multiplier of GF(q), where q = pm, p is prime and m is a nonzero positive integer. Then the circuit complexity of a modular parallel divider is, in general, O(mM) and that of Seroussi’s RS encoder is O(rmM). In this paper, we extent Seroussi’s work. It is shown here that the Cauchy cell can be implemented without any divider. The proposed Cauchy cell also has a shorter logic path and yields an RS encoder which has a circuit complexity O(rM).
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 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.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".