AWhat changed
Replaces explicit sign-correction branching with a uniform pair-transition signed binary add/subtract/shift procedure.
Scientific scope
Replaces explicit sign-correction branching with a uniform pair-transition signed binary add/subtract/shift procedure. Exact target is the original finite signed-binary complement/mod 2 fractional representation and pair-transition add/subtract/right-shift process, including its start/end conventions. Correctness relies on the stated modular arithmetic and shift/register conventions; converting it to bounded-width integer hardware needs explicit sign extension, width and overflow rules. The account does not supply an executable transcription or extreme-value certification. The original motivates simpler sign handling, not a universal speed, energy or circuit-area advantage. It does not imply subquadratic complexity; later modified higher-radix Booth recoding and modern multiplier layouts are separate. Earlier complementary representation, non-restoring division and Rey/Spencer sign-correction work retain credit.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Andrew D. Booth · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Andrew D. Booth, A Signed Binary Multiplication Technique, QJMAM 4(2),236–240 (1951), institution-hosted original scan
- Oxford Academic: Booth signed-binary multiplication publication record
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction