Symbolic computation and signal processing

DOI10.1016/j.jsc.2002.06.003zbMath1047.94506OpenAlexW2067949762MaRDI QIDQ597057

Hyungju Park

Publication date: 6 August 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2002.06.003

zbMATH Keywords

Signal processingLaurent polynomial rings

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (5)

Every discrete 2D autonomous system admits a finite union of parallel lines as a characteristic set ⋮ Elementary factorisation of box spline subdivision ⋮ Parametrizing compactly supported orthonormal wavelets by discrete moments ⋮ An algorithm for unimodular completion over Laurent polynomial rings ⋮ Computing Popov Forms of Matrices Over PBW Extensions

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Gröbner bases and multidimensional FIR multirate systems
• Algorithms for the Quillen-Suslin theorem
• An algorithmic proof of Suslin's stability theorem for polynomial rings
• Interpolating multiwavelet bases and the sampling theorem
• Multidimensional FIR filter bank design using Grobner bases
• Wavelets and filter banks: theory and design

This page was built for publication: Symbolic computation and signal processing