On faster than Nyquist signaling: Computing the minimum distance

DOI10.1016/0021-9045(90)90118-AzbMath0723.41016OpenAlexW2081272752MaRDI QIDQ757764

D. Kharzeev

Publication date: 1990

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(90)90118-a

zbMATH Keywords

data communicationsNyquist signaling

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation with constraints (41A29) Communication theory (94A05)

Related Items (1)

A comparative study on the convergence rate of some iteration methods involving contractive mappings

Cites Work

• Unnamed Item
• On computing the minimum distance for faster than Nyquist signaling
• Minimum probability of error for asynchronous Gaussian multiple-access channels
• Performance bound for maximum-likelihood reception of digital data
• Upper Bound on Error Probability for Detection With Unbounded Intersymbol Interference
• Faster-Than-Nyquist Signaling

This page was built for publication: On faster than Nyquist signaling: Computing the minimum distance