Constrained Capacities for Faster-Than-Nyquist Signaling

DOI10.1109/TIT.2008.2009832MaRDI QIDQ4975734zbMATH OpenOpenAlexFDO

Authors Fredrik Rusek, John B. Anderson

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.2009832

Mathematics Subject Classification ID

Communication theory (94A05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding theorems (Shannon theory) (94A24)

Recommendations

• Faster-Than-Nyquist Signaling
• On Faster Than Nyquist Signaling: Further Estimations on the Minimum Distance
• scientific article; zbMATH DE number 4123666
• On faster than Nyquist signaling: Computing the minimum distance
• Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints
• Channel Capacity Under Sub-Nyquist Nonuniform Sampling
• Time-space MIMO system with faster-than-Nyquist signaling in frequency-selective fading channel
• Approaching capacity by equiprobable signaling on the Gaussian channel
• A practical method for approaching the channel capacity of constrained channels
• Efficient Approximation of Channel Capacities

Cited in

(4)

• Time-space MIMO system with faster-than-Nyquist signaling in frequency-selective fading channel
• On the benefits of being constrained when receiving signals
• On Faster Than Nyquist Signaling: Further Estimations on the Minimum Distance
• Faster-Than-Nyquist Signaling

This page was built for publication: Constrained Capacities for Faster-Than-Nyquist Signaling

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