Rajiv V. Joshi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Neha Gupta

> Home > Persons > Rajiv V. Joshi

Publications

2023
[c87]
- view
  authority control:
- export record
  dblp key:
  - conf/vlsid/KushwahaJGSMJDB23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vlsid/KushwahaJGSMJDB23
Dinesh Kushwaha, Ashish Joshi, Neha Gupta, Aditya Sharma, Sandeep Miryala, Rajiv V. Joshi, Sudeb Dasgupta, Anand Bulusu:
An Energy-Efficient Multi-bit Current-based Analog Compute-In-Memory Architecture and design Methodology. VLSID 2023: 359-364
2022
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/tcasII/KushwahaJKGMJDB22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcasII/KushwahaJKGMJDB22
Dinesh Kushwaha, Ashish Joshi, Chaudhry Indra Kumar, Neha Gupta, Sandeep Miryala, Rajiv V. Joshi, Sudeb Dasgupta, Anand Bulusu:
An Energy-Efficient High CSNR XNOR and Accumulation Scheme for BNN. IEEE Trans. Circuits Syst. II Express Briefs 69(4): 2311-2315 (2022)
[c83]
- view
  authority control:
- export record
  dblp key:
  - conf/iscas/KushwahaSGRJMKM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscas/KushwahaSGRJMKM22
Dinesh Kushwaha, Aditya Sharma, Neha Gupta, Ritik Raj, Ashish Joshi, Jwalant Mishra, Rajat Kohli, Sandeep Miryala, Rajiv V. Joshi, Sudeb Dasgupta, Anand Bulusu:
A 65nm Compute-In-Memory 7T SRAM Macro Supporting 4-bit Multiply and Accumulate Operation by Employing Charge Sharing. ISCAS 2022: 1556-1560

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.