Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAtin Mukherjee 0001
Person information
- affiliation: National Institute of Technology Rourkela, India
- affiliation (PhD 2017): Indian Institute of Technology, Kharagpur, Department of Electronics & Electrical Communication Engineering, India
Other persons with the same name
- Atin Mukherjee 0002 — Neotia Institute of Technology, Management and Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Anusaka Gon
, Atin Mukherjee:
FPGA-Based Low-Cost Architecture for R-Peak Detection and Heart-Rate Calculation Using Lifting-Based Discrete Wavelet Transform. Circuits Syst. Signal Process. 42(1): 580-600 (2023)- [j7]Sandeep Kumar, Atin Mukherjee:
High performance radiation-hardened SRAM cell design for robust applications. Microelectron. J. 140: 105934 (2023) - [c7]Anwesh Kumar Samal, Sandeep Kumar, Atin Mukherjee:
Design of Single Node Upset Resilient Latch for Low Power, Low Cost and Highly Robust Applications. ITC-Asia 2023: 1-5 - 2021
- [j6]Sandeep Kumar, Atin Mukherjee:
A Highly Robust and Low-Power Real-Time Double Node Upset Self-Healing Latch for Radiation-Prone Applications. IEEE Trans. Very Large Scale Integr. Syst. 29(12): 2076-2085 (2021) - [c6]Sandeep Kumar, Atin Mukherjee:
A Self-Healing, High Performance and Low-Cost Radiation Hardened Latch Design. DFT 2021: 1-6 - 2020
- [c5]Atin Mukherjee:
Defect Tolerant Approach for Reliable Majority Voter Design Using Quadded Transistor Logic. TENCON 2020: 165-169
2010 – 2019
- 2019
- [j5]Atin Mukherjee, Anindya Sundar Dhar:
Triple transistor based triple modular redundancy with embedded voter circuit. Microelectron. J. 87: 101-109 (2019) - [c4]Atin Mukherjee, Anindya Sundar Dhar:
Defect Tolerant Majority Voter Design Using Triple Transistor Redundancy. iSES 2019: 63-68 - 2018
- [j4]Atin Mukherjee, Anindya Sundar Dhar:
Reliable VLSI Architecture Design Using Modulo-Quad-Transistor Redundancy Method. Circuits Syst. Signal Process. 37(12): 5595-5615 (2018) - 2017
- [j3]Atin Mukherjee, Anindya Sundar Dhar:
Triple transistor based fault tolerance for resource constrained applications. Microelectron. J. 68: 1-6 (2017) - 2016
- [j2]Atin Mukherjee, Anindya Sundar Dhar:
Choice of granularity for reliable circuit design using dynamic reconfiguration. Microelectron. Reliab. 63: 291-303 (2016) - 2015
- [j1]Atin Mukherjee, Anindya Sundar Dhar:
Real-time fault-tolerance with hot-standby topology for conditional sum adder. Microelectron. Reliab. 55(3-4): 704-712 (2015) - [c3]Atin Mukherjee, Anindya Sundar Dhar:
New triple-transistor based defect-tolerant systems for reliable digital architectures. ISCAS 2015: 1917-1920 - 2012
- [c2]Atin Mukherjee, Anindya Sundar Dhar:
Design of a Self-Reconfigurable Adder for Fault-Tolerant VLSI Architecture. ISED 2012: 92-96 - [c1]Atin Mukherjee, Anindya Sundar Dhar:
Design of a Fault-Tolerant Conditional Sum Adder. VDAT 2012: 217-222
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
