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

Deepti Singh

dblp:12/8091 · DBLP profile ↗
← Back
2ranked-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 · 2

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
diversity combining
0.012003
Analysis of Rake reception with multiple symbol weight estimation for antipodal signaling · IEEE Trans. Commun. 2003
Physical-layer communications › diversity combining
RAKE reception
0.012003
Analysis of Rake reception with multiple symbol weight estimation for antipodal signaling · IEEE Trans. Commun. 2003
Physical-layer communications › error probability analysis
symbol error probability
0.012003
Analysis of Rake reception with multiple symbol weight estimation for antipodal signaling · IEEE Trans. Commun. 2003
Physical-layer communications
fading channels
0.012003
Analysis of Rake reception with multiple symbol weight estimation for antipodal signaling · IEEE Trans. Commun. 2003
Physical-layer communications › fading channels
rayleigh fading
0.012003
Analysis of Rake reception with multiple symbol weight estimation for antipodal signaling · IEEE Trans. Commun. 2003

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

markov model · 0.0characteristic function · 0.0
YearPublicationVenuePosition
2003 Analysis of Rake reception with multiple symbol weight estimation for antipodal signaling
abstract
In Rake receiver for coherent binary antipodal signaling with weight estimation by matched filtering using the reference signal along with the decision of the previous M symbol intervals, and predetection maximal-ratio combining (MRC), the estimation errors are not independent of the additive noise, and do not fit into the Gaussian weighting error model for MRC. Here we analyze the error performance of the receiver by: (1) obtaining the conditional symbol error probability (SEP), conditioned on past decisions, from the characteristic function of the decision variable, (2) getting the unconditional SEP using a Markov model of the decision process.
Ranjan K. Mallik, Deepti Singh
ICC2
2003 Analysis of Rake reception with multiple symbol weight estimation for antipodal signaling
abstract
Consider a Rake receiver for coherent binary antipodal signaling with: 1) a delayed received signal configuration; 2) weight estimation by matched filtering using the reference signal along with the decisions of the previous M symbol intervals; and 3) predetection maximal-ratio combining (MRC). The weight estimation errors here are not independent of the additive noise, and do not fit into the Gaussian weighting error model for MRC. Here we analyze the error performance of the receiver by obtaining the conditional symbol error probability, conditioned on past decisions, from the characteristic function of the decision variable, and getting the unconditional error probability (UEP) for a block of M consecutive symbols using a Markov model of the decision process. The channel is Rayleigh fading with independent and identically distributed branch gains. Results show that the error performance of the Gaussian distributed weighting error model is a bound for that of multiple symbol weight estimation by matched filtering, and the steady state UEP decreases with increase of M, but the amount of decrease reduces as M increases.
Ranjan K. Mallik, Deepti Singh
IEEE Trans. Commun.2