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

Zi-Ning Wu

dblp:51/4499 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 3 · 3 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%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › equalization › adaptive equalization
decision-directed equalization
0.012001
Low-complexity iterative decoding with decision-aided equalization for magnetic recording channels · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications
equalization
0.012001
Low-complexity iterative decoding with decision-aided equalization for magnetic recording channels · IEEE J. Sel. Areas Commun. 2001
Coding theory › error-correcting codes › decoding
iterative decoding
0.012001
Low-complexity iterative decoding with decision-aided equalization for magnetic recording channels · IEEE J. Sel. Areas Commun. 2001
Coding theory › channel coding
turbo codes
0.012001
Low-complexity iterative decoding with decision-aided equalization for magnetic recording channels · IEEE J. Sel. Areas Commun. 2001

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

SOVA · 0.1MMSE · 0.1BCJR algorithm · 0.1
YearPublicationVenuePosition
2001 Low-complexity iterative decoding with decision-aided equalization for magnetic recording channels
abstract
Turbo codes are applied to magnetic recoding channels by treating the channel as a rate-one convolutional code that requires a soft a posteriori probability (APP) detector for channel inputs. The complexity of conventional APP detectors, such as the BCJR algorithm or the soft-output Viterbi algorithm (SOVA), grows exponentially with the channel memory length. This paper derives a new APP module for binary intersymbol interference (ISI) channels based on minimum mean squared error (MMSE) decision-aided equalization (DAE), whose complexity grows linearly with the channel memory length, and it shows that the MMSE DAE is also optimal by the maximum a posteriori probability (MAP) criterion. The performance of the DAE is analyzed, and an implementable turbo-DAE structure is proposed. The reduction of channel APP detection complexity reaches 95% for a five-tap ISI channel when the DAE is applied. Simulations performed on partial response channels show close to optimum performance for this turbo-DAE structure. Error propagation of the DAE is also studied, and two fixed-delay solutions are proposed based on combining the DAE with the BCJR algorithm.
Zi-Ning Wu, John M. Cioffi
IEEE J. Sel. Areas Commun.1
1999 Interleaved parity check codes and reduced complexity detection
abstract
We show that high rate interleaved parity check (IPC) codes provide significant coding gain on the magnetic recording channel. A reduced complexity detector performing joint channel detection and IPC decoding is introduced. Simulation result shows an SNR gain of 1.6 dB for the E/sup 2/PR4 channel at a bit error rate of 10/sup -5/, using a rate 196/200 4-way interleaved parity check code.
Zi-Ning Wu, Peter A. McEwen, Kelly K. Fitzpatrick, John M. Cioffi
ICC1
1997 A MMSE Interpolated Timing Recovery Scheme for the Magnetic Recording Channel
abstract
Advances in VLSI technology permit the use of interpolated timing recovery (ITR) as a replacement for the conventional VCO-based phase lock loop. Fully digital ITR has the advantage of lower cost and higher stability. In this paper, we present an interpolated timing recovery scheme that requires almost no oversampling, which should be suitable for high-speed storage channels.
Zi-Ning Wu, John M. Cioffi, Kevin D. Fisher
ICC (3)1