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

Vinayak Nagpal

dblp:00/4255 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorComputer networks · 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 · 64% Information theory · 36%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › channel coding › decoding algorithms
belief propagation
0.212013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013
Physical-layer communications
channel coding
0.212013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013
Physical-layer communications › channel coding
factor graph
0.212013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013
Coding theory › error-correcting codes
LDPC codes
0.212013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013
Information theory
quantize-map-and-forward
0.212013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013
Coding theory › channel coding › cooperative channel coding
relay channel coding
0.212013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013
Coding theory › channel coding
capacity-approaching codes
0.012013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013
Information theory › network information theory
relay channel
0.012013
Coding and System Design for Quantize-Map-and-Forward Relaying · IEEE J. Sel. Areas Commun. 2013

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

density evolution · 0.3bit-interleaved coded modulation · 0.3
YearPublicationVenuePosition
2013 Relay scheduling and interference cancellation for quantize-map-and-forward cooperative relaying
abstract
This paper presents system design aspects of a multi-relay half-duplex QMF cooperative system. We propose two simple algorithms that address the design of relay scheduling and inter-relay interference schemes. Proposed linear-complexity scheduling algorithm is proven to be optimal for a multi-relay diamond network under specific channel conditions. We demonstrate through simulations that for typical channel conditions, the achievable QMF rate of a five-relay cooperative system is up to 3 times higher compared to a system without cooperation.
Milos Jorgovanovic, Matthew Weiner, David Tse, Borivoje Nikolic, I-Hsiang Wang, Vinayak Nagpal
ISIT6
2013 Coding and System Design for Quantize-Map-and-Forward Relaying
abstract
In this paper we develop a low-complexity coding scheme and system design framework for the half duplex relay channel based on the Quantize-Map-and-Forward (QMF) relaying scheme. The proposed framework allows linear complexity operations at all network terminals. We propose the use of binary LDPC codes for encoding at the source and LDGM codes for mapping at the relay. We express joint decoding at the destination as a belief propagation algorithm over a factor graph. This graph has the LDPC and LDGM codes as subgraphs connected via probabilistic constraints that model the QMF relay operations. We show that this coding framework extends naturally to the high SNR regime using bit interleaved coded modulation (BICM). We develop density evolution analysis tools for this factor graph and demonstrate the design of practical codes for the half-duplex relay channel that perform within 1dB of information theoretic QMF threshold.
Vinayak Nagpal, I-Hsiang Wang, Milos Jorgovanovic, David Tse, Borivoje Nikolic
IEEE J. Sel. Areas Commun.1
2009 Cooperative multiplexing in the multiple antenna half duplex relay channel
abstract
Cooperation between terminals has been proposed to improve the reliability and throughput of wireless communication. While recent work has shown that relay cooperation provides increased diversity, increased multiplexing gain over that offered by direct link has largely been unexplored. In this work we show that cooperative multiplexing gain can be achieved by using a half duplex relay. We capture relative distances between terminals in the high SNR diversity multiplexing tradeoff (DMT) framework. The DMT performance is then characterized for a network having a single antenna half-duplex relay between a single-antenna source and two-antenna destination. Our results show that the achievable multiplexing gain using cooperation can be greater than that of the direct link and is a function of the relative distance between source and relay compared to the destination. Moreover, for multiplexing gains less than 1, a simple scheme of the relay listening 1/3 of the time and transmitting 2/3 of the time can achieve the 2 by 2 MIMO DMT.
Vinayak Nagpal, Sameer Pawar, David Tse, Borivoje Nikolic
ISIT1