A new redundant binary Booth encoding for fast 2^n-bit multiplier design
The use of redundant binary (RB) arithmetic in the design of high-speed digital multipliers is beneficial due to its high modularity and carry-free addition. To reduce the number of partial products, a high-radix-modified Booth encoding algorithm is...
| Principais autores: | , |
|---|---|
| Outros Autores: | |
| Formato: | Journal Article |
| Idioma: | English |
| Publicado em: |
2010
|
| Assuntos: | |
| Acesso em linha: | https://hdl.handle.net/10356/91940 http://hdl.handle.net/10220/6242 |