Skip to main content
SpringerLink
Log in

Exponential sums and faster than Nyquist signaling

  • Conference paper
  • First Online:
Number Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1383))

  • 693 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Forney, “Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference”, IEEE Trans. Com., COM-20, No. 1 (1972), pp. 76–77.

    Google Scholar 

  2. G. Foschini, “Performance Bound for Maximum Likelihood Reception of Digital Data”, IEEE Trans. Information Theory, IT-21 (1975), pp. 47–50.

    Article  MathSciNet  MATH  Google Scholar 

  3. D. Hajela, “On Computing the Minimum Distance for Faster than Nyquist Signaling”, The 1987 Symposium on Information Theory and its Applications (SITA ′87), November 1987, Enoshima Island, Japan.

    Google Scholar 

  4. A. Ingham, “Some Trigonometrical Inequalities With Applications to The Theory of Series”, Mathematische Zeitschrift, Vol. 41 (1936), pp. 367–379.

    Article  MathSciNet  MATH  Google Scholar 

  5. J. Mazo, “Faster Than Nyquist Signaling,” Bell System Technical Journal, Vol. 54, No. 8, (1975), pp. 1451–1462.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Wyner, “Upper Bound on Error Probability For Detection With Unbounded Intersymbol Interference”, Bell System Technical Journal, Vol. 54, No. 7, (1975), pp. 1341–1351.

    Article  MathSciNet  MATH  Google Scholar 

  7. A. Zygmund, “Trigonometric Series”, Vol. 2, Cambridge University Press, 1977.

    Google Scholar 

  8. G. Foschini, “Contrasting Performance of Faster Binary Signaling with QAM”, AT&T Bell Labs. Tech. J. 63 (1984), pp. 1419–1445.

    Article  Google Scholar 

  9. D. Hajela, “Some New Results on Faster Than Nyquist Signaling”, Proceedings of the Twenty-first Annual Conference on Information Sciences and Systems, John Hopkins University, March 1987, pp. 399–403.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bellcore, 435 South Street, 07960, Morristown, New Jersey

    D. Hajela

Authors
  1. D. Hajela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David V. Chudnovsky Gregory V. Chudnovsky Harvey Cohn Melvyn B. Nathanson

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Hajela, D. (1989). Exponential sums and faster than Nyquist signaling. In: Chudnovsky, D.V., Chudnovsky, G.V., Cohn, H., Nathanson, M.B. (eds) Number Theory. Lecture Notes in Mathematics, vol 1383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083570

Download citation

  • DOI: https://doi.org/10.1007/BFb0083570

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51549-4

  • Online ISBN: 978-3-540-46640-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation