Polynomial ambiguity resistant precoders: Theory and applications in ISI/multipath cancellation
From MaRDI portal
Publication:1586505
DOI10.1007/BF01212464zbMath0963.94010OpenAlexW2013167027MaRDI QIDQ1586505
Publication date: 5 July 2001
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01212464
communication systemsblind identificationalgebraic closed-form algorithmpolynomial ambiguity resistanceprecoders
Filtering in stochastic control theory (93E11) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ambiguity resistant polynomial matrices
- Matched spectral-null codes for partial-response channels
- Trellis Coding for Partial-Response Channels
- Binary convolutional codes with application to magnetic recording
- Trellis shaping
- Trellis precoding: combined coding, precoding and shaping for intersymbol interference channels
- Channel identification for high speed digital communications
- A simple and effective precoding scheme for noise whitening on intersymbol interference channels
- A subspace algorithm for certain blind identification problems
- On blind identifiability of multipath channels using fractional sampling and second-order cyclostationary statistics
This page was built for publication: Polynomial ambiguity resistant precoders: Theory and applications in ISI/multipath cancellation