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

A. Krishnamoorthy

dblp:22/821 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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.

Computer networks
1 paper
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.112005
Code and receiver design for the noncoherent fast-fading channel · IEEE J. Sel. Areas Commun. 2005
Physical-layer communications › fading channels › time-varying fading channel
fast fading
0.112005
Code and receiver design for the noncoherent fast-fading channel · IEEE J. Sel. Areas Commun. 2005
Physical-layer communications
multiple-antenna systems
0.112005
Code and receiver design for the noncoherent fast-fading channel · IEEE J. Sel. Areas Commun. 2005
Physical-layer communications › signal detection
noncoherent detection
0.112005
Code and receiver design for the noncoherent fast-fading channel · IEEE J. Sel. Areas Commun. 2005
Physical-layer communications
channel estimation
0.012005
Code and receiver design for the noncoherent fast-fading channel · IEEE J. Sel. Areas Commun. 2005
Physical-layer communications › channel estimation
pilot-assisted transmission
0.012005
Code and receiver design for the noncoherent fast-fading channel · IEEE J. Sel. Areas Commun. 2005
Processor architecture and microarchitecture
speculative execution
0.011995
Implementation Trade-Offs in Using a Restricted Data Flow Architecture in a High Performance RISC Microprocessor · ISCA 1995
Processor architecture and microarchitecture
superscalar processor
0.011995
Implementation Trade-Offs in Using a Restricted Data Flow Architecture in a High Performance RISC Microprocessor · ISCA 1995
Processor architecture and microarchitecture › instruction set architecture › RISC
RISC processor
0.011995
Implementation Trade-Offs in Using a Restricted Data Flow Architecture in a High Performance RISC Microprocessor · ISCA 1995

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

turbo-like codes · 0.1low-density parity-check codes · 0.1iterative detection · 0.1performance-cost trade-off analysis · 0.0
YearPublicationVenuePosition
2005 Code and receiver design for the noncoherent fast-fading channel
abstract
This paper deals with the design of coding/modulation and demodulation/decoding schemes for single- or multiple-antenna systems with focus on fast-fading channels, where channel state information (CSI) is not available at the transmitter and the receiver. We explore two possible solutions for this channel with increasing degree of sophistication. The first one utilizes pilots at the transmitter and a simple and explicit noniterative channel estimation algorithm at the receiver. We show that this pilot-assisted system is exactly equivalent, in terms of performance analysis and design, to an appropriately "degraded" system having perfect CSI at the receiver. The second scheme utilizes pilots and a family of well-justified and simple suboptimal iterative detection/estimation algorithms. It is shown that when turbo-like codes are considered in conjunction with this pilot-assisted transmission scheme and the proposed receiver algorithm, the unitary constellations investigated in the literature are inferior to simple pilot-assisted constellations in both complexity and performance. Specific instances of the proposed systems (that use optimized irregular low-density parity-check outer codes) are designed. The design examples provided show that the proposed systems can achieve a good tradeoff between complexity and performance and can be used to bridge the gap between the high complexity/high-performance optimal scheme and low-complexity/mediocre performance noniterative estimation/coherent detection scheme.
A. Krishnamoorthy, Achilleas Anastasopoulos
IEEE J. Sel. Areas Commun.1
1995 Implementation Trade-Offs in Using a Restricted Data Flow Architecture in a High Performance RISC Microprocessor
abstract
The implementation of a superscalar, speculative execution SPARC-V9 microprocessor incorporating Restricted Data Flow principles required many design trade-offs. Consideration was given to both performance and cost. Performance is largely a function of cycle time and instructions executed per cycle while cost is primarily a function of die area. Here we describe our Restricted Data Flow implementation and the means with which we arrived at its configuration. Future semiconductor technology advances will allow these trade-offs to be relaxed and higher performance Restricted Data Flow machines to be built.
Mike Simone, A. Essen, A. Ike, A. Krishnamoorthy, Tak Maruyama, Niteen Patkar, M. Ramaswami, Michael Shebanow, V. Thirumalaiswamy, DeForest Tovey
ISCA4