Abstract
Software synthesizers have great flexibility in the connection of the basic components of many synthesis methods, and can generate any kinds of sounds of any synthesis methods. However, the performance of the current microprocessors are not still enough for generating many sounds at a time. Speedup of the computation by some simple hardwares is expected especially for real time performance. We are now developing hardware accelerators for the software synthesizers using off the shelf boards with Field Programmable Gate Arrays (FPGAs). With these hardware accelerators, we can realize any kinds of combinations of different sampling rates and data width of sounds not only generating many sounds (350 sounds on a desktop computer and 110 sounds on a note computer) at a time. This performance can be achieved by fully utilizing the flexibility of FPGAs, and outperforms DSPs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Puckette, M. “Pure Data” Proceedings, International Computer Music Conference. San Francisco, 1996, pp. 269–272.
Puckette, M. “Pure Data: recent progress” Proceedings, Third Inter-college Computer Music Festival, Tokyo, Japan, 1997. pp. 1–4.
Raczinski and Sladek, “The Modular Architecture of SYNTHUP, FPGA Based PCI Board for Real-Time Sound Synthesis and Digital Signal Processing”, FPL 2000, pp. 834–837.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saito, T., Maruyama, T., Hoshino, T., Hirano, S. (2001). A Music Synthesizer on FPGA. In: Brebner, G., Woods, R. (eds) Field-Programmable Logic and Applications. FPL 2001. Lecture Notes in Computer Science, vol 2147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44687-7_39
Download citation
DOI: https://doi.org/10.1007/3-540-44687-7_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42499-4
Online ISBN: 978-3-540-44687-3
eBook Packages: Springer Book Archive