Fast algorithm for “error-free” convolution computation using Mersenne–Lucas codes

Vladimir M. Chernov

Chaos, Solitons & Fractals, 2006, vol. 29, issue 2, 372-380

Abstract: In this paper a new “error-free” algorithm for discrete circular convolution is proposed. The algorithm is based on new type of discrete orthogonal transforms for which there exist efficient multiplication-free implementations. The structure of these transforms is associated with the representation of data in the redundant number system associated with Lucas numbers. Numerical experiments to investigate the properties of these transform were performed, the obtained results are provided.

Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077905006636
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:29:y:2006:i:2:p:372-380

DOI: 10.1016/j.chaos.2005.08.081

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().