On faster than Nyquist signaling: Computing the minimum distance

DOI10.1016/0021-9045(90)90118-AzbMATH Open0723.41016OpenAlexW2081272752MaRDI QIDQ757764FDOQ757764

Authors: 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

Recommendations

• On Faster Than Nyquist Signaling: Further Estimations on the Minimum Distance
• scientific article; zbMATH DE number 3943708
• scientific article; zbMATH DE number 4123666
• Faster-Than-Nyquist Signaling
• Channel shaping to maximize minimum distance

zbMATH Keywords

data communicationsNyquist signaling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Minimum probability of error for asynchronous Gaussian multiple-access channels
• On computing the minimum distance for faster than Nyquist signaling
• Performance bound for maximum-likelihood reception of digital data
• Upper Bound on Error Probability for Detection With Unbounded Intersymbol Interference
• Faster-Than-Nyquist Signaling

Cited In (5)

• On Faster Than Nyquist Signaling: Further Estimations on the Minimum Distance
• Constrained Capacities for Faster-Than-Nyquist Signaling
• Faster-Than-Nyquist Signaling
• Title not available (Why is that?)
• A comparative study on the convergence rate of some iteration methods involving contractive mappings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757764)