Efficient Algorithms of Direct and Inverse First-Order S-Z Transformations

dc.contributor.authorZaplatilek, K.
dc.contributor.authorLares, M.
dc.coverage.issue1cs
dc.coverage.volume10cs
dc.date.accessioned2016-05-02T12:05:14Z
dc.date.available2016-05-02T12:05:14Z
dc.date.issued2001-04cs
dc.description.abstractIn the article, we describe principles of numerical algorithms by means of which coefficients of continuous-time and discrete-time frequency filters are possible to transform each other for several s-z trans-formations. The basis of algorithms is so-called Pascal matrix for calculation of which an original procedure is used. We discuss problems of numerical conditionality of Pascal matrix and possibility of its practical usage. Illustrative examples of numerical calculations programmed in Matlab 5.1 are the constituent part of the article.en
dc.formattextcs
dc.format.extent6-10cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationRadioengineering. 2001, vol. 10, č. 1, s. 6-10. ISSN 1210-2512cs
dc.identifier.issn1210-2512
dc.identifier.urihttp://hdl.handle.net/11012/58176
dc.language.isoencs
dc.publisherSpolečnost pro radioelektronické inženýrstvícs
dc.relation.ispartofRadioengineeringcs
dc.relation.urihttp://www.radioeng.cz/fulltexts/2001/01_01_06_10.pdfcs
dc.rightsCreative Commons Attribution 3.0 Unported Licenseen
dc.rights.accessopenAccessen
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/en
dc.subjectContinuous-time and discrete-time linear filtersen
dc.subjectPascal matrixen
dc.subjects-z transformationsen
dc.subjectnumerical condi-tionalityen
dc.titleEfficient Algorithms of Direct and Inverse First-Order S-Z Transformationsen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.facultyFakulta eletrotechniky a komunikačních technologiícs
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
01_01_06_10.pdf
Size:
340.27 KB
Format:
Adobe Portable Document Format
Description:
Collections