An improved VLSI squaring circuit, for a Viterbi algorithm, is designed and implemented in the n-well CMOS 2μm process. It is faster and more area efficient than conventional and table look-up approaches. In addition it compensates for... more
An improved VLSI squaring circuit, for a Viterbi algorithm, is designed and implemented in the n-well CMOS 2μm process. It is faster and more area efficient than conventional and table look-up approaches. In addition it compensates for inaccuracies and noise. The new design is based on combinational logic and the implemented chip reduces the IC area by more than 40%
Research Interests:
ABSTRACT
Research Interests:
ABSTRACT
Research Interests:
ABSTRACT The design of Residue Number System (RNS) multipliers has received considerable attention in the last few years. This paper presents a new approach for designing modular multipliers using a combinational logic technique. The idea... more
ABSTRACT The design of Residue Number System (RNS) multipliers has received considerable attention in the last few years. This paper presents a new approach for designing modular multipliers using a combinational logic technique. The idea is based on constructing a truth table whose inputs are the bits of the multiplicand and the multiplier. The outputs are the bits of the modular product. Realizing any minimized Boolean function is achieved using two levels of gates. Compared to most recent developed approach, our new technique requires less integrated circuit area and operates at a higher speed
Research Interests:
Research Interests:
ABSTRACT
Research Interests:
Research Interests:
... IEEE Transactions on Vehicular Technology 1979; 182203. AUTHORS' BIOGRAPHIES OmarHasan received his MS and PhD degree in Digital Communications from the New Mexico State University, Las Cruces, New Mexico, in 1990 and 1996,... more
... IEEE Transactions on Vehicular Technology 1979; 182203. AUTHORS' BIOGRAPHIES OmarHasan received his MS and PhD degree in Digital Communications from the New Mexico State University, Las Cruces, New Mexico, in 1990 and 1996, respectively. ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
This paper presents a new algorithm which converts moduli (2k , 2k-1, 2k-1-1) residue numbers to their binary equivalents; it is the first converter which has been dedicated to this particular moduli set. The complexity of conversion has... more
This paper presents a new algorithm which converts moduli (2k , 2k-1, 2k-1-1) residue numbers to their binary equivalents; it is the first converter which has been dedicated to this particular moduli set. The complexity of conversion has been greatly reduced using new compact forms for the multiplicative inverses and the properties of modular arithmetic. A hardware implementation which utilizes