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

Ali Zerik

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

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

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal detection
sequence estimation
0.011990
Sequential sequence estimation for channels with intersymbol interference of finite or infinite length · IEEE Trans. Commun. 1990
Physical-layer communications › signal detection › sequence estimation
sequential sequence estimation
0.011990
Sequential sequence estimation for channels with intersymbol interference of finite or infinite length · IEEE Trans. Commun. 1990
Physical-layer communications
signal processing for communications
0.011990
Sequential sequence estimation for channels with intersymbol interference of finite or infinite length · IEEE Trans. Commun. 1990
Physical-layer communications
equalization
0.011990
Sequential sequence estimation for channels with intersymbol interference of finite or infinite length · IEEE Trans. Commun. 1990
Physical-layer communications › interference
intersymbol interference
0.011990
Sequential sequence estimation for channels with intersymbol interference of finite or infinite length · IEEE Trans. Commun. 1990

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

whitened matched filter · 0.0viterbi algorithm · 0.0
YearPublicationVenuePosition
1990 Sequential sequence estimation for channels with intersymbol interference of finite or infinite length
abstract
A sequential sequence estimator for channels with finite or infinite intersymbol interference (ISI) is proposed. It consists of a whitened matched filter followed by a sequential algorithm. A key component of a sequential estimator is a suitable metric that accounts for the unequal search depth. This metric is derived for the ISI channel. Computer simulations for three different channels show that the sequential sequence estimator has considerably less computational complexity than a maximum-likelihood sequence estimator using the Viterbi algorithm (MLSE-VA), while still maintaining the optimum estimation performance of the MLSE-VA, a performance not achievable with any reduced-state Viterbi algorithm.>
Fuqin Xiong, Ali Zerik, Edward Shwedyk
IEEE Trans. Commun.2