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

P. K. M. Pun

dblp:43/670 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

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

Computer 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.

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 › signal detection
detection and estimation
0.112007
Fano Multiple-Symbol Differential Detectors for Differential Unitary Space-Time Modulation · IEEE Trans. Commun. 2007
Physical-layer communications › MIMO › space-time modulation
differential unitary space-time modulation
0.112007
Fano Multiple-Symbol Differential Detectors for Differential Unitary Space-Time Modulation · IEEE Trans. Commun. 2007
Physical-layer communications
MIMO
0.112007
Fano Multiple-Symbol Differential Detectors for Differential Unitary Space-Time Modulation · IEEE Trans. Commun. 2007
Physical-layer communications › signal detection › differential detection
multiple-symbol differential detection
0.112007
Fano Multiple-Symbol Differential Detectors for Differential Unitary Space-Time Modulation · IEEE Trans. Commun. 2007
Physical-layer communications › MIMO
space-time coding
0.112007
Fano Multiple-Symbol Differential Detectors for Differential Unitary Space-Time Modulation · IEEE Trans. Commun. 2007

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

sphere decoding · 0.1fano algorithm · 0.1
YearPublicationVenuePosition
2007 Fano Multiple-Symbol Differential Detectors for Differential Unitary Space-Time Modulation
abstract
We present a class of suboptimal multiple-symbol differential detectors (MSDDs) for differential unitary space-time (ST) codes in a time-selective Rayleigh flat-fading channel. These noncoherent detectors, termed Fano ST-MSDDs, employ the well-known Fano algorithm as their decoding engines. Their bit-error rate (BER) performance is excellent, as there is no irreducible error floor, even at very high fade rates. Compared with the sphere decoder, which is optimal, our best detector, termed an on-demand bi-Fano ST-MSDD, suffers only a 0.3 dB degradation in power efficiency. However, its computational complexity, as a function of the signal-to-noise ratio (SNR), is consistently lower than that of the sphere decoder and does not experience the exponential growth in complexity in the latter when the SNR decreases. It can thus be concluded that the Fano algorithm is a powerful detection strategy for differential ST codes in fading channels. Our main contribution is in making the modifications and improvements to the Fano algorithm that enables this realization. The innovations include the bi-Fano, edge-bi-Fano, and on-demand bi-Fano search strategies, as well as a new dynamic threshold adjustment scheme for avoiding unnecessary back-and-forth node evaluations during backtracking
P. K. M. Pun, Paul K. M. Ho
IEEE Trans. Commun.1