Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nandakumar N. Tendolkar

dblp:04/5121 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1985
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 83% Logic in computer science · 17%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 52% Hardware reliability and fault tolerance · 39% Processor architecture and microarchitecture · 9%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
binary linear codes
0.011984
Generalization of chase algorithms for soft decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes
block codes
0.011984
Generalization of chase algorithms for soft decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1984
Logic in computer science
chase algorithm
0.011984
Generalization of chase algorithms for soft decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › decoding
decoding algorithms
0.011984
Generalization of chase algorithms for soft decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1984
Coding theory
error-correcting codes
0.011984
Generalization of chase algorithms for soft decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011984
Generalization of chase algorithms for soft decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1984
Electronic design automation › hardware verification and test
fault diagnosis
0.011983
Diagnosis of TCM failures in the IBM 3081 Processor complex · DAC 1983
Electronic design automation
design for manufacturability
0.011985
Analysis of timing failures due to random AC defects in VLSI modules · DAC 1985
Electronic design automation › yield analysis
yield prediction
0.011985
Analysis of timing failures due to random AC defects in VLSI modules · DAC 1985

Methods — techniques the papers use, named apart from their topics

statistical analysis · 0.0maximum-likelihood decoding · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1985 Analysis of timing failures due to random AC defects in VLSI modules
abstract
This paper presents an analytical model for projecting the yield loss due to random delay defects for modules or VLSI packages containing multiple semiconductor chips. A module to be analyzed is characterized by distribution of path delays. Statistical analysis is applied to obtain the distribution of delays caused by defects in logic circuits of LSI chips. The model uses these two distributions to calculate the probability that a module contains a path that does not meet the system timing requirements. All inputs to the model can be obtained much earlier than the availability of modules for actual testing. Therefore expected module yield loss due to delay defects can be projected before the modules are actually manufactured.
Nandakumar N. Tendolkar
DAC1
1984 Generalization of chase algorithms for soft decision decoding of binary linear codes
abstract
Soft decision decoding of binary linear block codes transmitted over the additive white Gaussian channel (AWGN) using antipodal signaling is considered. A set of decoding algorithms called generalized Chase algorithms is proposed. In contrast to Chase algorithms, which require a\lfloor (d- 1)/2 \rfloorbinary error-correcting decoder for decoding a binary linear block code of minimum distanced, the generalized Chase algorithms can use a binary decoder that can correct less than\lfloor ( d - 1)/2 \rfloorhard errors. The Chase algorithms are particular cases of the generalized Chase algorithms. The performance of all proposed algorithms is asymptotically optimum for high signal-to-noise ratio (SNR). Simulation results for the(47, 23)quadratic residue code indicate that even for low SNR the performance level of a maximum likelihood decoder can be approached by a relatively simple decoding procedure.
Nandakumar N. Tendolkar, Carlos R. P. Hartmann
IEEE Trans. Inf. Theory1
1983 Diagnosis of TCM failures in the IBM 3081 Processor complex
Nandakumar N. Tendolkar
DAC1