Skip to main content

Strategien, Berechnungs- und Darstellungsformen

  • Chapter
Diskrete Orthogonaltransformationen
  • 40 Accesses

Zusammenfassung

Es sei die Aufgabe gestellt, die Koeffizienten einer diskreten Orthogonal-transformation zu berechnen. Zur Durchführung dieser Aufgabe kann man sich verschiedener Strategien bedienen.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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.

Literaturverzeichnis

  1. Kashef, B.G.; Habibi, A.: Direct computation of higher-order DCT co-efficents from lower-order DCT coefficients. SPIE Conf. on Applications of Digital Image Processing VII. 504 (1984) 425–431

    Google Scholar 

  2. Tadokoro, Y.; Higuchi, T.: Conversion factors from Walsh coefficients to Fourier coefficients. IEEE Trans. Acoust., Speech and Signal Processing. ASSP-31 (1983) 231–232

    Google Scholar 

  3. Soderstrand, M.A.; Jenkins, W.K.; Jullien, G.A.; Taylor, F.J. (Eds.): Residue number system arithmetic: modern applications in digital signal processing. New York: IEEE Press 1986

    MATH  Google Scholar 

  4. Tseng, B.D.; Jullien, G.A.; Miller, W.C.: Implementation of FFT structures using the residue number system. IEEE Trans. Comput. C-28 (1979) 831–844

    Google Scholar 

  5. Jaroslavskij, L.P.: Einführung in die digitale Bildverarbeitung. Berlin: VEB Deutscher Verlag der Wissenschaften 1985

    MATH  Google Scholar 

  6. Lee, M.H.: Kaveh, M.: Fast Hadamard transform based on a simple matrix factorization. IEEE Trans. Acoust., Speech and Signal Processing. ASSP-34 (1986) 1666–1667

    Google Scholar 

  7. Fino, B.J., Algazi, V.R.: A unified treatment of discrete fast unitary transforms. SIAM J. Comput. 6 (1977) 700–716

    Article  MathSciNet  MATH  Google Scholar 

  8. Burrus, C.S., Parks, T.W.: DFT/FFT and convolution algorithms. New York, Chichester, Brisbane, Toronto, Singapore: Wiley 1985

    Google Scholar 

  9. Blahut, R.E.: Fast algorithms for digital signal processing. Reading, M.A: Addison-Wesley 1987

    Google Scholar 

  10. Heidemann, M.T.: Multiplicative complexity, convolution, and the DFT. Berlin. Heidelberg, New York: Springer 1988

    Book  Google Scholar 

  11. Agarwal, R.C.; Cooley, J.W.: Vectorized mixed radix Fourier transform algorithms. Proc. IEEE 75 (1987) 1283–1292

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Besslich, P.W., Lu, T. (1990). Strategien, Berechnungs- und Darstellungsformen. In: Diskrete Orthogonaltransformationen. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48933-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48933-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52151-8

  • Online ISBN: 978-3-642-48933-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics