Content area

Abstract

Translate

Two novel methods developed by A. Papoulis for the factorization of a class of time limited functions are discussed. They are both implemented in the Pascal programming language on a Macintosh Plus personal computer and the results of test cases are presented. A summary of the accuracy of the results and the computational requirements of both algorithms is included.

Details

1010268
Subject
Computer engineering;
Automotive engineering;
Electrical engineering
Classification
0544: Electrical engineering
0464: Computer Engineering
0540: Automotive engineering
Identifier / keyword
Algorithms; Time limited functions; Pascal programming language; Macintosh Plus personal computer; Computational requirements
Title
Two Algorithms for the Factorization of Time Limited Functions
Author
Farinaccio, Joseph N.
Number of pages
130
Publication year
1990
Degree date
1990
School code
0179
Source
MAI 84/11(E), Masters Abstracts International
ISBN
9798379457020
Advisor
Papoulis, Athanasious
University/institution
Polytechnic University
Department
Electrical engineering
University location
United States -- New York
Degree
M.S.
Source type
Dissertation or Thesis
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
30513240
ProQuest document ID
2811363926
Document URL
https://www.proquest.com/dissertations-theses/two-algorithms-factorization-time-limited/docview/2811363926/se-2?accountid=208611
Copyright
Copyright ProQuest Dissertations Publishing 1990
Database
ProQuest One Academic