Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A recursive algorithm for efficient calculation of quaternary fixed polarity arithmetic expansions (QFPAEs) spectra is presented in this paper. It derives either all QFPAE spectra or a QFPAE coefficient vector in nonzero polarity for the input function from the functions' QFPAE in polarity zero. Fast flow graphs and computational costs for the new algorithm are given. The number of additions/subtractions and multiplications required by the algorithm for n <7 are also listed and compared with the fast transform method. The comparison shows that the new algorithm has lor computational cost for generating the complete polarity matrix than other algorithms.
['Bogdan J. Falkowski', 'Cicilia C. Lozano', 'Tadeusz Luba']
I am writing a research paper on a idea Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions
[{"from": "human", "value": "I am writing a research paper on a idea Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A recursive algorithm for efficient calculation of quaternary fixed polarity arithmetic expansions (QFPAEs) spectra is presented in this paper. It derives either all QFPAE spectra or a QFPAE coefficient vector in nonzero polarity for the input function from the functions' QFPAE in polarity zero. Fast flow graphs and computational costs for the new algorithm are given. The number of additions/subtractions and multiplications required by the algorithm for n <7 are also listed and compared with the fast transform method. The comparison shows that the new algorithm has lor computational cost for generating the complete polarity matrix than other algorithms."}]