{"id":{"repo_id":"greece","oai_identifier":"oai:10442/0146"},"canonical_url":"https://search.dev.ndltd.org/etd/greece/oai:10442/0146","repository":{"repo_id":"greece","name":"Greek National Archive of PhD Theses","base_url":"https://phdtheses.ekt.gr/eadd_oai/request"},"display":{"title":"ΜΕΛΕΤΗ ΤΗΣ ΥΠΟΛΟΓΙΣΤΙΚΗΣ ΠΟΛΥΠΛΟΚΟΤΗΤΑΣ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ","abstract":"THE PH.D. DISSERTATION DEALS WITH THE DEVELOPMENT OF NEW ALGORITHMS FOR DIGITAL SIGNAL PROCESSING, HAVING GOOD COMPUTATIONAL COMPLEXITY CHARACTERISTICS, SMALL MEMORY REQUIREMENTS AND SMALL COMPUTATION ERRORS. NEW IN-PLACE DFT ALGORITHMS ARE DEVELOPED. SOME NEW MULTIDIMENSIONAL DFT ALGORITHMS HAVING REDUCED I-O OPERATIONS ARE INTRODUCED. NEW ALGORITHMS FOR MULTIDIMENSIONAL CONVOLUTION HAVING MINIMAL COMPUTATIONAL COMPLEXITY ARE PRESENTED. A SYSTEMATIC TECHNIQUE FOR PARALLEL DFT CALCULATION IS DEVELOPED. NEW ALGORITHMS FOR CONVOLUTIONS OVER GALOIS FIELDS ARE PRESENTED. FINALLY THE ERROR ANALYSIS IN FLOATING POINT ARITHMETIC OF THE RECTANGULAR TRANSFORM AND THE MULTIDIMENSIONAL DFTS IS PRESENTED.","abstract_html":"THE PH.D. DISSERTATION DEALS WITH THE DEVELOPMENT OF NEW ALGORITHMS FOR DIGITAL SIGNAL PROCESSING, HAVING GOOD COMPUTATIONAL COMPLEXITY CHARACTERISTICS, SMALL MEMORY REQUIREMENTS AND SMALL COMPUTATION ERRORS. NEW IN-PLACE DFT ALGORITHMS ARE DEVELOPED. SOME NEW MULTIDIMENSIONAL DFT ALGORITHMS HAVING REDUCED I-O OPERATIONS ARE INTRODUCED. NEW ALGORITHMS FOR MULTIDIMENSIONAL CONVOLUTION HAVING MINIMAL COMPUTATIONAL COMPLEXITY ARE PRESENTED. A SYSTEMATIC TECHNIQUE FOR PARALLEL DFT CALCULATION IS DEVELOPED. NEW ALGORITHMS FOR CONVOLUTIONS OVER GALOIS FIELDS ARE PRESENTED. FINALLY THE ERROR ANALYSIS IN FLOATING POINT ARITHMETIC OF THE RECTANGULAR TRANSFORM AND THE MULTIDIMENSIONAL DFTS IS PRESENTED.","abstract_has_math":false,"creators":["Πήτας, Ιωάννης","Pitas, Ioannis"],"institution":"Aristotle University Of Thessaloniki (AUTH)","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1985,"date_issued":"1985","date_published":"1985","updated_at":"2026-07-24T02:24:59Z","subjects":["ΕΦΑΡΜΟΣΜΕΝΗ ΑΛΓΕΒΡΑ","ΘΕΩΡΙΑ ΑΛΓΟΡΙΘΜΩΝ","Πληροφορική","Υπολογιστική πολυπλοκότητα","ΨΗΦΙΑΚΑ ΦΙΛΤΡΑ","Ψηφιακή επεξεργασία εικόνας","Ψηφιακή επεξεργασία σημάτων","ΨΗΦΙΑΚΗ ΣΥΝΕΛΙΞΗ","Ψηφιακός μετασχηματισμός Fourier","Algorithms","APPLIED ALGEBRA","Computational complexity","DIGITAL CONVOLUTION","DIGITAL FILTERS","Digital Fourier transform","Digital image processing","Digital signal processing","Επιστήμες Μηχανικού και Τεχνολογία","Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ","Engineering and Technology","Electrical Engineering, Electronic Engineering, Information Engineering"],"languages":["gre"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["10.12681/eadd/0146"],"render_values":[{"text":"10.12681/eadd/0146","href":"https://doi.org/10.12681/eadd/0146","code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10442/hedi/0146","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Πήτας, Ιωάννης","Pitas, Ioannis"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1985"]},{"key":"dc:publisher","label":"Institution","values":["Aristotle University Of Thessaloniki (AUTH)","Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)"]},{"key":"dc:type","label":"Dc Type","values":["PhD Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["ΕΦΑΡΜΟΣΜΕΝΗ ΑΛΓΕΒΡΑ","ΘΕΩΡΙΑ ΑΛΓΟΡΙΘΜΩΝ","Πληροφορική","Υπολογιστική πολυπλοκότητα","ΨΗΦΙΑΚΑ ΦΙΛΤΡΑ","Ψηφιακή επεξεργασία εικόνας","Ψηφιακή επεξεργασία σημάτων","ΨΗΦΙΑΚΗ ΣΥΝΕΛΙΞΗ","Ψηφιακός μετασχηματισμός Fourier","Algorithms","APPLIED ALGEBRA","Computational complexity","DIGITAL CONVOLUTION","DIGITAL FILTERS","Digital Fourier transform","Digital image processing","Digital signal processing","Επιστήμες Μηχανικού και Τεχνολογία","Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ","Engineering and Technology","Electrical Engineering, Electronic Engineering, Information Engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["gre"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.12681/eadd/0146","http://hdl.handle.net/10442/hedi/0146"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["THE PH.D. DISSERTATION DEALS WITH THE DEVELOPMENT OF NEW ALGORITHMS FOR DIGITAL SIGNAL PROCESSING, HAVING GOOD COMPUTATIONAL COMPLEXITY CHARACTERISTICS, SMALL MEMORY REQUIREMENTS AND SMALL COMPUTATION ERRORS. NEW IN-PLACE DFT ALGORITHMS ARE DEVELOPED. SOME NEW MULTIDIMENSIONAL DFT ALGORITHMS HAVING REDUCED I-O OPERATIONS ARE INTRODUCED. NEW ALGORITHMS FOR MULTIDIMENSIONAL CONVOLUTION HAVING MINIMAL COMPUTATIONAL COMPLEXITY ARE PRESENTED. A SYSTEMATIC TECHNIQUE FOR PARALLEL DFT CALCULATION IS DEVELOPED. NEW ALGORITHMS FOR CONVOLUTIONS OVER GALOIS FIELDS ARE PRESENTED. FINALLY THE ERROR ANALYSIS IN FLOATING POINT ARITHMETIC OF THE RECTANGULAR TRANSFORM AND THE MULTIDIMENSIONAL DFTS IS PRESENTED.","Η ΔΙΔΑΚΤΟΡΙΚΗ ΔΙΑΤΡΙΒΗ ΑΣΧΟΛΕΙΤΑΙ ΜΕ ΤΗΝ ΚΑΤΑΣΚΕΥΗ ΝΕΩΝ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ. ΟΙ ΑΛΓΟΡΙΘΜΟΙ ΑΥΤΟΙ ΕΧΟΥΝ ΒΕΛΤΙΩΜΕΝΗ ΥΠΟΛΟΓΙΣΤΙΚΗ ΠΟΛΥΠΛΟΚΟΤΗΤΑ, ΜΕΙΩΜΕΝΟ ΘΟΡΥΒΟ ΥΠΟΛΟΓΙΣΜΟΥ ΚΑΙ ΠΕΡΙΟΡΙΣΜΕΝΕΣ ΑΠΑΙΤΗΣΕΙΣ ΜΝΗΜΗΣ. ΕΙΔΙΚΩΤΕΡΑ ΕΧΕΙ ΚΑΤΑΣΚΕΥΑΣΘΕΙ ΑΛΓΟΡΙΘΜΟΣ ΠΟΛΥΔΙΑΣΤΑΤΟΥ DFT ΜΕ ΑΠΟΘΗΚΕΥΣΗ ΑΠΟΤΕΛΕΣΜΑΤΩΝ ΕΠΙ ΤΟΠΟΥ. ΕΠΙΣΗΣ ΕΧΕΙ ΚΑΤΑΣΚΕΥΑΣΘΕΙ ΑΛΓΟΡΙΘΜΟΣ ΠΟΛΥΔΙΑΣΤΑΤΟΥ DFT ΜΕ ΠΕΡΙΟΡΙΣΜΕΝΕΣ ΑΠΑΙΤΗΣΕΙΣ Ι-Ο. ΕΧΕΙ ΠΡΟΤΑΘΕΙ ΝΕΑ ΜΕΘΟΔΟΣ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗΣ ΑΛΓΟΡΙΘΜΩΝ FFT. ΕΧΟΥΝ ΠΡΟΤΑΘΕΙ ΝΕΟΙ ΑΛΓΟΡΙΘΜΟΙ ΓΙΑ ΤΟΝ ΘΕΩΡΗΤΙΚΟ ΒΕΛΤΙΣΤΟ ΥΠΟΛΟΓΙΣΜΟ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΥΝΕΛΙΞΕΩΝ. ΕΧΟΥΝ ΠΡΟΤΑΘΕΙ ΝΕΟΙ ΑΛΓΟΡΙΘΜΟΙ ΓΙΑ ΤΟΝ ΥΠΟΛΟΓΙΣΜΟ ΣΥΝΕΛΙΞΕΩΝ ΣΕ ΣΩΜΑΤΑ GALOIS. ΕΧΕΙ ΓΙΝΕΙ ΑΝΑΛΥΣΗ ΛΑΘΩΝ ΔΙΑΦΟΡΩΝ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΜΕΤΑΣΧΗΜΑΤΙΣΜΩΝ DFT ΚΑΙ ΕΧΟΥΝ ΠΡΟΤΑΘΕΙ ΝΕΟΙ ΤΡΟΠΟΙ ΓΙΑ ΤΗΝ ΥΛΟΠΟΙΗΣΗ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΨΗΦΙΑΚΩΝ ΦΙΛΤΡΩΝ."]},{"key":"dc:title","label":"Title","values":["ΜΕΛΕΤΗ ΤΗΣ ΥΠΟΛΟΓΙΣΤΙΚΗΣ ΠΟΛΥΠΛΟΚΟΤΗΤΑΣ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ","COMPUTATIONAL COMPLEXITY STUDY OF MULTIDIMENSIONAL SIGNAL PROCESSING ALGORITHMS"]}]}],"canonical_facts":{"dc:creator":["Πήτας, Ιωάννης","Pitas, Ioannis"],"dc:date":["1985"],"dc:description":["THE PH.D. DISSERTATION DEALS WITH THE DEVELOPMENT OF NEW ALGORITHMS FOR DIGITAL SIGNAL PROCESSING, HAVING GOOD COMPUTATIONAL COMPLEXITY CHARACTERISTICS, SMALL MEMORY REQUIREMENTS AND SMALL COMPUTATION ERRORS. NEW IN-PLACE DFT ALGORITHMS ARE DEVELOPED. SOME NEW MULTIDIMENSIONAL DFT ALGORITHMS HAVING REDUCED I-O OPERATIONS ARE INTRODUCED. NEW ALGORITHMS FOR MULTIDIMENSIONAL CONVOLUTION HAVING MINIMAL COMPUTATIONAL COMPLEXITY ARE PRESENTED. A SYSTEMATIC TECHNIQUE FOR PARALLEL DFT CALCULATION IS DEVELOPED. NEW ALGORITHMS FOR CONVOLUTIONS OVER GALOIS FIELDS ARE PRESENTED. FINALLY THE ERROR ANALYSIS IN FLOATING POINT ARITHMETIC OF THE RECTANGULAR TRANSFORM AND THE MULTIDIMENSIONAL DFTS IS PRESENTED.","Η ΔΙΔΑΚΤΟΡΙΚΗ ΔΙΑΤΡΙΒΗ ΑΣΧΟΛΕΙΤΑΙ ΜΕ ΤΗΝ ΚΑΤΑΣΚΕΥΗ ΝΕΩΝ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ. ΟΙ ΑΛΓΟΡΙΘΜΟΙ ΑΥΤΟΙ ΕΧΟΥΝ ΒΕΛΤΙΩΜΕΝΗ ΥΠΟΛΟΓΙΣΤΙΚΗ ΠΟΛΥΠΛΟΚΟΤΗΤΑ, ΜΕΙΩΜΕΝΟ ΘΟΡΥΒΟ ΥΠΟΛΟΓΙΣΜΟΥ ΚΑΙ ΠΕΡΙΟΡΙΣΜΕΝΕΣ ΑΠΑΙΤΗΣΕΙΣ ΜΝΗΜΗΣ. ΕΙΔΙΚΩΤΕΡΑ ΕΧΕΙ ΚΑΤΑΣΚΕΥΑΣΘΕΙ ΑΛΓΟΡΙΘΜΟΣ ΠΟΛΥΔΙΑΣΤΑΤΟΥ DFT ΜΕ ΑΠΟΘΗΚΕΥΣΗ ΑΠΟΤΕΛΕΣΜΑΤΩΝ ΕΠΙ ΤΟΠΟΥ. ΕΠΙΣΗΣ ΕΧΕΙ ΚΑΤΑΣΚΕΥΑΣΘΕΙ ΑΛΓΟΡΙΘΜΟΣ ΠΟΛΥΔΙΑΣΤΑΤΟΥ DFT ΜΕ ΠΕΡΙΟΡΙΣΜΕΝΕΣ ΑΠΑΙΤΗΣΕΙΣ Ι-Ο. ΕΧΕΙ ΠΡΟΤΑΘΕΙ ΝΕΑ ΜΕΘΟΔΟΣ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗΣ ΑΛΓΟΡΙΘΜΩΝ FFT. ΕΧΟΥΝ ΠΡΟΤΑΘΕΙ ΝΕΟΙ ΑΛΓΟΡΙΘΜΟΙ ΓΙΑ ΤΟΝ ΘΕΩΡΗΤΙΚΟ ΒΕΛΤΙΣΤΟ ΥΠΟΛΟΓΙΣΜΟ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΥΝΕΛΙΞΕΩΝ. ΕΧΟΥΝ ΠΡΟΤΑΘΕΙ ΝΕΟΙ ΑΛΓΟΡΙΘΜΟΙ ΓΙΑ ΤΟΝ ΥΠΟΛΟΓΙΣΜΟ ΣΥΝΕΛΙΞΕΩΝ ΣΕ ΣΩΜΑΤΑ GALOIS. ΕΧΕΙ ΓΙΝΕΙ ΑΝΑΛΥΣΗ ΛΑΘΩΝ ΔΙΑΦΟΡΩΝ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΜΕΤΑΣΧΗΜΑΤΙΣΜΩΝ DFT ΚΑΙ ΕΧΟΥΝ ΠΡΟΤΑΘΕΙ ΝΕΟΙ ΤΡΟΠΟΙ ΓΙΑ ΤΗΝ ΥΛΟΠΟΙΗΣΗ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΨΗΦΙΑΚΩΝ ΦΙΛΤΡΩΝ."],"dc:identifier":["10.12681/eadd/0146","http://hdl.handle.net/10442/hedi/0146"],"dc:language":["gre"],"dc:publisher":["Aristotle University Of Thessaloniki (AUTH)","Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)"],"dc:subject":["ΕΦΑΡΜΟΣΜΕΝΗ ΑΛΓΕΒΡΑ","ΘΕΩΡΙΑ ΑΛΓΟΡΙΘΜΩΝ","Πληροφορική","Υπολογιστική πολυπλοκότητα","ΨΗΦΙΑΚΑ ΦΙΛΤΡΑ","Ψηφιακή επεξεργασία εικόνας","Ψηφιακή επεξεργασία σημάτων","ΨΗΦΙΑΚΗ ΣΥΝΕΛΙΞΗ","Ψηφιακός μετασχηματισμός Fourier","Algorithms","APPLIED ALGEBRA","Computational complexity","DIGITAL CONVOLUTION","DIGITAL FILTERS","Digital Fourier transform","Digital image processing","Digital signal processing","Επιστήμες Μηχανικού και Τεχνολογία","Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ","Engineering and Technology","Electrical Engineering, Electronic Engineering, Information Engineering"],"dc:title":["ΜΕΛΕΤΗ ΤΗΣ ΥΠΟΛΟΓΙΣΤΙΚΗΣ ΠΟΛΥΠΛΟΚΟΤΗΤΑΣ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ","COMPUTATIONAL COMPLEXITY STUDY OF MULTIDIMENSIONAL SIGNAL PROCESSING ALGORITHMS"],"dc:type":["PhD Thesis"]},"updated_at":"2026-07-24T02:24:59Z"}