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

R. Sekhar Narayanaswami

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

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

Computer networks · 2Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 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%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.012003
Design of serial concatenated MSK schemes based on density evolution · IEEE Trans. Commun. 2003
Physical-layer communications › channel coding › error control coding
concatenated codes
0.012003
Design of serial concatenated MSK schemes based on density evolution · IEEE Trans. Commun. 2003
Physical-layer communications › modulation
continuous phase modulation
0.012003
Design of serial concatenated MSK schemes based on density evolution · IEEE Trans. Commun. 2003
Physical-layer communications › signal detection
iterative detection and decoding
0.012003
Design of serial concatenated MSK schemes based on density evolution · IEEE Trans. Commun. 2003
Physical-layer communications › modulation › continuous phase modulation
minimum shift keying
0.012003
Design of serial concatenated MSK schemes based on density evolution · IEEE Trans. Commun. 2003
Physical-layer communications
modulation
0.012003
Design of serial concatenated MSK schemes based on density evolution · IEEE Trans. Commun. 2003

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

density evolution · 0.0LDPC code design · 0.0
YearPublicationVenuePosition
2003 Design of serial concatenated MSK schemes based on density evolution
abstract
We consider the design of convolutional codes and low density parity check (LDPC) codes with minimum-shift keying (MSK) when the receiver employs iterative decoding and demodulation. The main idea proposed is the design of coded schemes that are well matched to the iterative decoding algorithm being used rather than to hypothetical maximum-likelihood decoding. We first show that the design is crucially dependent on whether the continuous phase encoder (CPE) is realized in recursive form or in nonrecursive form. We then consider the design of convolutionally coded systems and low density parity check codes with MSK to obtain near-capacity performance. With convolutional codes, we show that it is possible to improve the performance significantly by using a mixture of recursive and nonrecursive realizations for the CPE. For low density parity check codes, we show that codes designed for binary phase shift keying are optimal for MSK only if the nonrecursive realization is used; for the recursive realization, we design new LDPC codes based on the concept of density evolution. We show that these codes outperform the best known codes for MSK and have lower decoding complexity.
Krishna Narayanan 0001, Ibrahim Altunbas, R. Sekhar Narayanaswami
IEEE Trans. Commun.3
2001 On the design of LDPC codes for MSK
abstract
We investigate serial concatenation of low-density parity check (LDPC) codes and minimum shift keying (MSK) with iterative decoding. We show that the design of LDPC codes is crucially dependent on the realization of the MSK modulator. For MSK modulators with nonrecursive continuous phase encoders (CPEs), optimal codes for BPSK are optimal, whereas for MSK modulators with recursive CPEs, the BPSK codes are not optimal. We show that for nonrecursive CPEs, iterative demodulation and decoding is not required even though the CPE has memory. However, iterative demodulation is essential for recursive CPEs. For recursive CPEs, we design LDPC codes using density evolution and differential evolution considering iterative demodulation and decoding. The resulting codes provide significantly improved performance over the existing codes.
Krishna Narayanan 0001, Ibrahim Altunbas, R. Sekhar Narayanaswami
GLOBECOM3
1998 Recent developments in high integration multi-standard CMOS transceivers for personal communication systems
abstract
Issues associated with the integration of transceiver components on to a single silicon substrate are discussed. In particular, recently proposed receiver and transmitter architectures for high integration are examined on the promise of providing multistandard capability. In addition, existing barriers to lower power transceiver operation are examined as well as some proposed directions for future integrated transceiver research and development.
Jacques Christophe Rudell, Jia-Jiunn Ou, R. Sekhar Narayanaswami, George Chien, Jeffrey A. Weldon, Li Lin 0009, King-Chun Tsai, Luns Tee, Kelvin Khoo, Danelle Au, Troy Robinson, Danilo Gerna, Masanori Otsuka, Paul R. Gray
ISLPED3