| Paper: | DISPS-P2.12 | ||
| Session: | Fast Algorithms | ||
| Time: | Friday, May 21, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Design and Implementation of Signal Processing Systems: Algorithm Transformation and Mapping Techniques | ||
| Title: | NEW MODULO DECOMPOSED RESIDUE-TO-BINARY ALGORITHM FOR GENERAL MODULI SETS | ||
| Authors: | Shaoqiang Bi; Concordia University | ||
| Wei Wang; University of Western Ontario | |||
| Asim Al-Khalili; Concordia University | |||
| Abstract: | In this paper, we propose a new modulo arithmetic theorem to decompose the base of the modulo operations. This new theorem has been used to further reduce the modulo size of the modified CRT for general moduli sets. Furthermore, we have applied the modulo decomposition technique and the modulo improved CRT to derive a R/B algorithm for a newly found three-moduli set M={ -1, , }. In comparison to the modified CRT, the improved CRT can cut by half the modulo size and reduce the length of the modulo operator in terms of 36%. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops