Recursive Algorithm

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 315 Experts worldwide ranked by ideXlab platform

W.c. Miller - One of the best experts on this subject based on the ideXlab platform.

  • Recursive Algorithm for discrete sine transform with regular structure
    Electronics Letters, 1994
    Co-Authors: Z. Wang, Graham A. Jullien, W.c. Miller
    Abstract:

    A new Recursive Algorithm for the discrete sine transform (DST) is derived, and shown to possess a very regular structure. There is no data shifting required. The only other existing Recursive Algorithm for the DST (Gupta and Rao, 1990) requires many data shifts and possesses an irregular structure. >

  • A regular Recursive Algorithm for the discrete sine transform
    Proceedings of 27th Asilomar Conference on Signals Systems and Computers, 1
    Co-Authors: Z. Wang, Graham A. Jullien, W.c. Miller
    Abstract:

    We derive a new Recursive Algorithm for the discrete sine transform (DST) which possesses a very regular (Cooley-Tukey type butterfly) structure. The multiplication coefficients in our Algorithm can be generated by a simple recursion without a requirement for trigonometric functions, and no shifts of data are required. This new Algorithm improves on the original Recursive Algorithm which has an irregular structure and requires many data shifts. >

  • ICASSP (3) - A regular Recursive Algorithm for the discrete sine transform
    Proceedings of ICASSP '94. IEEE International Conference on Acoustics Speech and Signal Processing, 1
    Co-Authors: Z. Wang, Graham A. Jullien, W.c. Miller
    Abstract:

    We derive a new Recursive Algorithm for the discrete sine transform (DST) which possesses a very regular structure. The multiplication coefficients in our Algorithm can be generated by a simple recursion without the requirement for trigonometric functions; also, no shifts of data are required. In comparison, the existing Recursive Algorithm for the DST proposed by Wang (1990) has an irregular structure and requires considerable data shifts. >

Qing Huo Liu - One of the best experts on this subject based on the ideXlab platform.

  • A generalized Recursive Algorithm for wave-scattering solutions in two dimensions
    IEEE Transactions on Microwave Theory and Techniques, 1992
    Co-Authors: Weng Cho Chew, Y.m. Wang, Levent Gurel, G.p. Otto, R.l. Wagner, Qing Huo Liu
    Abstract:

    A generalized Recursive Algorithm valid for both the E/sub z/ and H/sub z/ wave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived Recursive Algorithms which have been found to be valid only for E/sub z/ polarized waves. In this generalized Recursive Algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n+n')-subscatterer solution. The computational complexity of such an Algorithm is found to be of O(N/sup 2/) in two dimensions while providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination, which has an O(N/sup 3/) complexity. >

Weng Cho Chew - One of the best experts on this subject based on the ideXlab platform.

  • Recursive Algorithm for wave scattering solutions using windowed addition theorem
    Journal of Electromagnetic Waves and Applications, 1992
    Co-Authors: Weng Cho Chew, Y.m. Wang, L. Gurel
    Abstract:

    A review of a Recursive Algorithm with a more succinct derivation is first presented. This Algorithm, which calculates the scattering solution from an inhomogeneous body, first divides the body into N subscatterers. The Algorithm then uses an aggregate T matrix and translation formulas to solve for the solution of n+1 subscatterers from the solution for n subscatterers. This Recursive Algorithm has reduced computational complexity. Moreover, the memory requirement is proportional to the number of unknowns. This Algorithm has been used successfully to solve for the volume scattering solution of two-dimensional scatterers for Ez -polarized waves. However, for Hz -polarized waves, a straightforward application of the Recursive Algorithm yields unsatisfactory solutions due to the violation of the restricted regime of the addition theorem. But by windowing the addition theorem, the restricted regime of validity is extended. Consequently, the Recursive Algorithm with the windowed addition theorem works well eve...

  • A generalized Recursive Algorithm for wave-scattering solutions in two dimensions
    IEEE Transactions on Microwave Theory and Techniques, 1992
    Co-Authors: Weng Cho Chew, Y.m. Wang, Levent Gurel, G.p. Otto, R.l. Wagner, Qing Huo Liu
    Abstract:

    A generalized Recursive Algorithm valid for both the E/sub z/ and H/sub z/ wave scattering of densely packed scatterers in two dimensions is derived. This is unlike previously derived Recursive Algorithms which have been found to be valid only for E/sub z/ polarized waves. In this generalized Recursive Algorithm, a scatterer is first divided into N subscatterers. The n-subscatterer solution is then used to solve the (n+n')-subscatterer solution. The computational complexity of such an Algorithm is found to be of O(N/sup 2/) in two dimensions while providing a solution valid for all angles of incidence. This is better than the method of moments with Gaussian elimination, which has an O(N/sup 3/) complexity. >

Z. Wang - One of the best experts on this subject based on the ideXlab platform.

  • Recursive Algorithm for discrete sine transform with regular structure
    Electronics Letters, 1994
    Co-Authors: Z. Wang, Graham A. Jullien, W.c. Miller
    Abstract:

    A new Recursive Algorithm for the discrete sine transform (DST) is derived, and shown to possess a very regular structure. There is no data shifting required. The only other existing Recursive Algorithm for the DST (Gupta and Rao, 1990) requires many data shifts and possesses an irregular structure. >

  • A regular Recursive Algorithm for the discrete sine transform
    Proceedings of 27th Asilomar Conference on Signals Systems and Computers, 1
    Co-Authors: Z. Wang, Graham A. Jullien, W.c. Miller
    Abstract:

    We derive a new Recursive Algorithm for the discrete sine transform (DST) which possesses a very regular (Cooley-Tukey type butterfly) structure. The multiplication coefficients in our Algorithm can be generated by a simple recursion without a requirement for trigonometric functions, and no shifts of data are required. This new Algorithm improves on the original Recursive Algorithm which has an irregular structure and requires many data shifts. >

  • ICASSP (3) - A regular Recursive Algorithm for the discrete sine transform
    Proceedings of ICASSP '94. IEEE International Conference on Acoustics Speech and Signal Processing, 1
    Co-Authors: Z. Wang, Graham A. Jullien, W.c. Miller
    Abstract:

    We derive a new Recursive Algorithm for the discrete sine transform (DST) which possesses a very regular structure. The multiplication coefficients in our Algorithm can be generated by a simple recursion without the requirement for trigonometric functions; also, no shifts of data are required. In comparison, the existing Recursive Algorithm for the DST proposed by Wang (1990) has an irregular structure and requires considerable data shifts. >

Sei-jong Chung - One of the best experts on this subject based on the ideXlab platform.

  • Recursive Algorithm with C++ program for floating-point arithmetic
    ACM SIGCSE Bulletin, 1999
    Co-Authors: Sei-jong Chung
    Abstract:

    Floating point Arithmetic is a topic included in virtually all textbooks for Computer Systems (CS 3: ACM's Curriculum Recommendation) or for Computer Organization (CS 4: ACM's Curriculum Recommendation). This paper presents a mathematical optimization model for the topic. The problem of converting real (float) numbers into binary equivalents is first modeled as a Zero-One Integer Programming problem. Then, a Recursive Algorithm is formulated for Floating-Point Formats. Computer programs are written in both C and C++ for a 32-bit floating-point format, using the Recursive Algorithm. [The computer programs are available at the email

  • Recursive Algorithm with c program for floating point arithmetic
    Technical Symposium on Computer Science Education, 1999
    Co-Authors: Sei-jong Chung
    Abstract:

    Floating point Arithmetic is a topic included in virtually all textbooks for Computer Systems (CS 3: ACM's Curriculum Recommendation) or for Computer Organization (CS 4: ACM's Curriculum Recommendation). This paper presents a mathematical optimization model for the topic. The problem of converting real (float) numbers into binary equivalents is first modeled as a Zero-One Integer Programming problem. Then, a Recursive Algorithm is formulated for Floating-Point Formats. Computer programs are written in both C and C++ for a 32-bit floating-point format, using the Recursive Algorithm. [The computer programs are available at the email

Related terms

Recursive Algorithm - 15 days free trial to Access Experts & Abstracts