DocumentCode
1492719
Title
The fast Tamari transform
Author
Lloris, A. ; Ortega, J. ; Prieto, A.
Author_Institution
Dept. de Ingenieria Electromecanica, Murcia Univ., Spain
Volume
138
Issue
3
fYear
1991
fDate
5/1/1991 12:00:00 AM
Firstpage
147
Lastpage
153
Abstract
The fast Tamari transform (FTT), which is suitable to obtain some properties of p-valued digital functions and networks (p being the power of a prime) is presented. A systematic procedure to calculate the FTT is defined, and an expression for the complexity of calculation, and flow-graphs and networks for the calculation of the FTT are also presented. All aspects are illustrated with several examples.
Keywords
computational complexity; many-valued logics; transforms; FTT; complexity; fast Tamari transform; flow-graphs; p-valued digital functions;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings E
Publisher
iet
ISSN
0143-7062
Type
jour
Filename
75502
Link To Document