What is recorded here?
Booth’s1951 paper gives an add/subtract/shift procedure for signed binary multiplication that avoids a separate sign-detection and correction routine. It adapts a shortcut idea from decimal desk calculators to complementary binary representation. A computer should multiply two negative numbers just as reliably as two positive ones, without first switching to a separate routine. Booth looks at transitions between neighboring multiplier digits. Those transitions tell the machine whether to add, subtract or simply shift the accumulated partial result. The same pattern handles all sign combinations in the paper’s representation, making the control procedure more uniform.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
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.
Read the original work
- 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
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Andrew D. Booth
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Booth: multiplying positive and negative binary numbers uniformly
Booth’s1951 paper gives an add/subtract/shift procedure for signed binary multiplication that avoids a separate sign-detection and correction routine. It adapts a shortcut idea from decimal desk calculators to complementary binary representation.
A computer should multiply two negative numbers just as reliably as two positive ones, without first switching to a separate routine. Booth looks at transitions between neighboring multiplier digits. Those transitions tell the machine whether to add, subtract or simply shift the accumulated partial result. The same pattern handles all sign combinations in the paper’s representation, making the control procedure more uniform.
Scientific scope
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.
People and systems
Andrew D. Booth