On the Construction of Finite Oscillator Dictionary
Rongquan Feng, Zhenhua Gu, Zilong Wang, Hongfeng Wu, and Kai Zhou

TL;DR
This paper revisits the finite split oscillator dictionary with simplified proofs, explores non-split tori in group theory, and provides an explicit algorithm for constructing the finite non-split oscillator dictionary, advancing sequence design and compressive sensing applications.
Contribution
It offers a simplified proof of the finite split oscillator dictionary, studies non-split tori in SL(2, F_p), and introduces an explicit algorithm for the non-split oscillator dictionary.
Findings
Simplified proof of the finite split oscillator dictionary.
Analysis of non-split tori in SL(2, F_p).
Explicit algorithm for the non-split oscillator dictionary.
Abstract
A finite oscillator dictionary which has important applications in sequences designs and the compressive sensing was introduced by Gurevich, Hadani and Sochen. In this paper, we first revisit closed formulae of the finite split oscillator dictionary by a simple proof. Then we study the non-split tori of the group . Finally, An explicit algorithm for computing the finite non-split oscillator dictionary is described.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Coding theory and cryptography · Digital Image Processing Techniques
