• DocumentCode
    1236864
  • Title

    RSFQ asynchronous serial multiplier and spreading codes generator for multiuser detector

  • Author

    Kidiyarova-Shevchenko, Anna Yu ; Platov, Konstantin Yu ; Tolkacheva, Elena M. ; Kataeva, Irina A.

  • Author_Institution
    Microelectron. & Nanoscience Dept., Chalmers Univ. of Technol., Gothenburg, Sweden
  • Volume
    13
  • Issue
    2
  • fYear
    2003
  • fDate
    6/1/2003 12:00:00 AM
  • Firstpage
    429
  • Lastpage
    432
  • Abstract
    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.
  • Keywords
    adders; asynchronous circuits; code division multiple access; multiplying circuits; multiuser detection; signal generators; spread spectrum communication; superconducting logic circuits; 25 bit; 26 GHz; 52 GHz; HYPRES processes; Josephson junction count minimization; RSFQ asynchronous serial multiplier; RSFQ multiuser detector; RSFQ spreading code generator; asynchronous shifting; parallel input/output; pseudo-noise generator; serial spreading code generator; signed multiplication; Adders; Base stations; Circuit simulation; Clocks; Delay estimation; Detectors; Hardware; Interference; Josephson junctions; Silicon carbide;
  • fLanguage
    English
  • Journal_Title
    Applied Superconductivity, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1051-8223
  • Type

    jour

  • DOI
    10.1109/TASC.2003.813889
  • Filename
    1211633