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

Kai P. Yiu

dblp:172/3369 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1986
—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.

Theoretical computer science
1 paper
Coding theory · 77% Information theory · 23%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
burst error correction
0.011986
Performance of Error-Correcting Codes on Channels with Memory · IEEE Trans. Commun. 1986
Information theory › communication channels › channel models
channels with memory
0.011986
Performance of Error-Correcting Codes on Channels with Memory · IEEE Trans. Commun. 1986
Coding theory
error-correcting codes
0.011986
Performance of Error-Correcting Codes on Channels with Memory · IEEE Trans. Commun. 1986
Coding theory › error-correcting codes › burst error correction
interleaved codes
0.011986
Performance of Error-Correcting Codes on Channels with Memory · IEEE Trans. Commun. 1986
Physical-layer communications › signal processing for communications › statistical signal processing › estimation theory
sequential estimation
0.011977
Acquisition of Pseudonoise Signals by Recursion-Aided Sequential Estimation · IEEE Trans. Commun. 1977
Physical-layer communications
spread spectrum
0.011977
Acquisition of Pseudonoise Signals by Recursion-Aided Sequential Estimation · IEEE Trans. Commun. 1977
Physical-layer communications
signal detection
0.011977
Acquisition of Pseudonoise Signals by Recursion-Aided Sequential Estimation · IEEE Trans. Commun. 1977

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

majority-logic decoding · 0.0error probability bounds · 0.0recursion-aided sequential estimation · 0.0
YearPublicationVenuePosition
1986 Performance of Error-Correcting Codes on Channels with Memory
abstract
Most magnetic recording and many other digital communication channels exhibit statistical dependencies among errors. The design of error-control schemes for such channels .requires proper models and tools that can be used to evaluate error performance after decoding. In this paper a simplified partitioned model of a channel with memory suggested by B. D. Fritchman is considered. This model is used to derive expressions for block and bit error probability bounds for major block burst-error-correcting codes: interleaved, single burst-correcting, and nonbiuary codes. The model-based bounds are compared to the experimental ones using the data obtained for helical scan magnetic tape recorders. The comparison showed an agreement between experimental and analytical data within one order of magnitude, with the average difference being as small as 16 percent in some cases. A simple and effective implementation of a multiple burst-error-correcting scheme based on the majority-logic decoding of interleaved binary codes is suggested. The scheme requires about ten off-the-shelf IC's for both encoder and decoder with the interleaving degree up to 512.
Alexander Drukarev, Kai P. Yiu
IEEE Trans. Commun.2
1977 Acquisition of Pseudonoise Signals by Recursion-Aided Sequential Estimation
abstract
An improved method of acquisition of pseudonoise signals (RARASE) is described and analyzed. This method is an outgrowth of the RASE method, rapid acquisition by sequential estimation. In the new method, the known recursion relation of the PN signal is used to determine if a short estimate of the state of the received PN signal is probably correct and if, consequently, an attempt should be made to track with that estimate. A high proportion of the incorrect initial state estimates can be discarded with relatively simple logic. Analyses are provided for a range of implementations from the simplest, a single 3-input modulo-2 gate, to multiple logic gates and for both a simple in-lock detector and a sequential detector. Significant improvement in acquisition time is shown for long PN signals and for the signal-to-noise range of -13 dB to +3 dB. Acquisition time reduction by a factor of 7.5 is calculated for a PN signal of length2^{15}-1bits compared to the sequential estimation (RASE) method using a simple in-lock detector. Reduction by factors of 1.5 to 3.5 is calculated using the sequential detector.
Robert B. Ward, Kai P. Yiu
IEEE Trans. Commun.2