By Topic

RSFQ asynchronous serial multiplier and spreading codes generator for multiuser detector

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kidiyarova-Shevchenko, A.Yu. ; Microelectron. & Nanoscience Dept., Chalmers Univ. of Technol., Gothenburg, Sweden ; Platov, K.Yu. ; Tolkacheva, E.M. ; Kataeva, I.A.

Serial multiplier and serial spreading code generators are vital elements of the RSFQ multiuser detector. We have designed different versions of both circuits to achieve maximum speed and at the same time minimize Josephson junction count. Comparison of different serial multipliers architectures supporting signed multiplication favored for asynchronous shifting over zero circuits based on carry save adder and co-flow distribution of the partial product and the clock. A 25-bit spreading code generator supporting parallel input/output has been designed for 4 kA/cm2 (TRW) and for 1 kA/cm2 (HYPRES) processes. The corresponding maximum simulated clock speed of 52 GHz and 26 GHz and effective device area of 1×0.12 mm2 and 1.9×0.2 mm2.

Published in:

Applied Superconductivity, IEEE Transactions on  (Volume:13 ,  Issue: 2 )