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.

Anand Raghavan

dblp:32/3523 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous 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.

Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
arithmetic codes
0.012001
Continuous error detection (CED) for reliable communication · IEEE Trans. Commun. 2001
Coding theory › error-correcting codes › hybrid ARQ
automatic repeat request
0.012001
Continuous error detection (CED) for reliable communication · IEEE Trans. Commun. 2001
Coding theory › error-correcting codes
error detection
0.012001
Continuous error detection (CED) for reliable communication · IEEE Trans. Commun. 2001
Coding theory › error-correcting codes
concatenated codes
0.012001
Continuous error detection (CED) for reliable communication · IEEE Trans. Commun. 2001
Coding theory › error-correcting codes
forward error correction
0.012001
Continuous error detection (CED) for reliable communication · IEEE Trans. Commun. 2001

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

reduced state sequence estimation · 0.0CRC comparison · 0.0
YearPublicationVenuePosition
2006 Practical considerations for participatory design with rural school children in underdeveloped regions: early reflections from the field
abstract
This paper draws on a 2-week design workshop conducted at a rural primary school in northern India to provide recommendations on carrying out participatory design with school children in rural, underdeveloped regions. From our experiences in prototyping low-tech and hi-tech English language learning games with rural student participants, we advocate that researchers build a more equal relationship that is qualitatively different from one between teachers and students, enlist local adults and children as facilitators, and explore hi-tech prototyping to inspire the best designs.
Matthew Kam, Divya Ramachandran, Anand Raghavan, Jane Chiu, Urvashi Sahni, John F. Canny
IDC3
2001 Continuous error detection (CED) for reliable communication
abstract
Block cyclic redundancy check (CRC) codes represent a popular and powerful class of error detection techniques used almost exclusively in modern data communication systems. Though efficient, CRCs can detect errors only after an entire block of data has been received and processed. In this work, we exploit the "continuous" nature of error detection that results from using arithmetic codes for error detection, which provides a novel tradeoff between the amount of added redundancy and the amount of time needed to detect an error once it occurs. We demonstrate how this continuous error detection framework improves the overall performance of communication systems, and show how considerable performance gains can be attained. We focus on several important scenarios: 1) automatic repeat request (ARQ) based transmission; 2) forward error correction (FEC frameworks based on (serially) concatenated coding systems involving an inner error-correction code and an outer error-detection code; and 3) reduced state sequence estimation (RSSE) for channels with memory. We demonstrate that the proposed CED framework improves the throughput of ARQ systems by up to 15% and reduces the computational/storage complexity of FEC and RSSE by a factor of two in the comparisons that we make against state-of-the-art systems.
Anand Raghavan, Kannan Ramchandran, Igor Kozintsev
IEEE Trans. Commun.1
2000 Wireless Image Transmission Using Multiple-Description Based Concatenated Codes
abstract
Summary form only given. This work introduces a multiple-description product code which aims at optimally generating multiple, equally-important wavelet image descriptions from an image encoded by the popular SPIHT image coder. Because the SPIHT image coder is highly sensitive to errors, forward error correction is used to protect the image against bit errors occurring in the channel. The error-correction code is a concatenated channel code including a row (outer) code based on RCPC codes with CRC error detection and a source-channel column (inner) code consisting of the scalable SPIHT image coder and an optimized array of unequal protection Reed-Solomon erasure-correction codes. By matching the unequal protection codes to the embedded source bitstream using our simple, fast optimizer, we maximize expected image quality and provide for graceful degradation of the received image during fades. To achieve unequal protection, each packet is split into many Reed-Solomon symbols. The i/sup th/ symbol in each packet forms an (n,k) Reed-Solomon code or "column". A fast, nearly-optimal optimizer, based on Lagrange multipliers and optimal to within convex hull and discretization approximations, chooses k for each Reed-Solomon "column" to minimize the expected mean-square error at the receiver. We validated our use of this structure by evaluating its performance in the context of transmitting images over a wireless fading channel. The performance of this scheme was evaluated by simulating the transmission of the Lena image over a Clarke flat-fading channel with an average SNR of 10 dB and a normalized Doppler frequency of 10/sup -5/ Hz.
Daniel Grobe Sachs, Anand Raghavan, Kannan Ramchandran
Data Compression Conference2
2000 Application of Continuous Error Detection for Joint Equalization and Coding for ISI Channels
abstract
Intersymbol interference (ISI) distorts digital signals transmitted over band-limited channels. While solutions like decision feedback equalization (DFE) suffer from error propagation, sequence estimation methods have exponential complexity. We present a scheme that effectively reduces the complexity of sequence estimation by removing paths that are in error on the fly, using continuous error detection (CED). The number of symbols taken for detecting an error can be tuned based on the amount of redundancy available for the particular application. Simulations show that our scheme can bring about a factor of two reduction in complexity in the trellis of Yellin, Vardy and Amrani (see IEEE Trans. on Info. Theory, vol.43, p.409-25, 1997) and give about 0.5 dB performance improvement at the same complexity. CED can be implemented efficiently at low complexity in hardware and can enhance the performance of ARQ/FEC based digital transmission systems. This work presents the performance gains in a reduced state sequence estimation framework.
Anand Raghavan, Kannan Ramchandran
ICC (1)1