{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:40:37Z","timestamp":1759333237397,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The computation of the sine and cosine functions is required in devices ranging from application-specific signal processors to general purpose floating-point units. Even in the latter case, the required functionality can be reduced to computing the sine and\/or cosine of multiples of a constant angle. The latency of a sine\/cosine generator can be reduced by using look-up tables. However, a direct implementation with look-up tables may be unfeasible if the input space is huge. In such a case, look-up tables with a number of entries lower than the size of the input space can be used indirectly. In previously published methods, the reduction in the number of table entries is obtained at the expense of increasing the table width and the computational cost. This paper introduces an alternative technique that makes it possible to reduce the size of the look-up tables as well as the required multiplications. The proposed technique can be used to implement sine\/cosine generators of huge input space. It has been used to implement several twiddle factor generators in reconfigurable hardware and has enabled the number of look-up tables to be reduced by between 6 and 26% with respect to previous table-based techniques. Also, these implementations are about 50% faster than those based on Volder\u2019s algorithm.<\/jats:p>","DOI":"10.1186\/s13634-020-00692-5","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T12:03:38Z","timestamp":1595419418000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Using the complement of the cosine to compute trigonometric functions"],"prefix":"10.1186","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1207-0335","authenticated-orcid":false,"given":"David","family":"Guerrero Martos","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"Mill\u00e1n Calder\u00f3n","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Juan Chico","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Viejo Cort\u00e9s","sequence":"additional","affiliation":[]},{"given":"Manuel J.","family":"Bellido D\u00edaz","sequence":"additional","affiliation":[]},{"given":"Paulino","family":"Ruiz-de-Clavijo Vazquez","sequence":"additional","affiliation":[]},{"given":"Enrique","family":"Ost\u00faa Arang\u00fcena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"issue":"5","key":"692_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/2641361.2641375","volume":"41","author":"F. de Dinechin","year":"2014","unstructured":"F. de Dinechin, M. Istoan, G. Sergent, Fixed-point trigonometric functions on FPGAS. SIGARCH Comput. Archit. News. 41(5), 83\u201388 (2014). https:\/\/doi.org\/10.1145\/2641361.2641375.","journal-title":"SIGARCH Comput. Archit. News"},{"doi-asserted-by":"publisher","unstructured":"K. J. Lin, C. C. Hou, in Proceedings of the IEEE 2nd Global Conference on Consumer Electronics (GCCE 2013). Implementation of trigonometric custom functions hardware on embedded processor (Tokyo, 2013), pp. 155\u2013157. https:\/\/doi.org\/10.1109\/GCCE.2013.6664782.","key":"692_CR2","DOI":"10.1109\/GCCE.2013.6664782"},{"issue":"3","key":"692_CR3","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s00034-013-9661-9","volume":"33","author":"H. Huang","year":"2014","unstructured":"H. Huang, L. Xiao, J. Liu, Cordic-based unified architectures for computation of DCT\/IDCT\/DST\/IDST. Circ. Syst. Signal Proc.33(3), 799\u2013714 (2014). https:\/\/doi.org\/10.1007\/s00034-013-9661-9.","journal-title":"Circ. Syst. Signal Proc."},{"issue":"1","key":"692_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D. Goldberg","year":"1991","unstructured":"D. Goldberg, What every computer scientist should know about floating-point arithmetic. ACM Comput. Surv.23(1), 5\u201348 (1991). https:\/\/doi.org\/10.1145\/103162.103163.","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"publisher","unstructured":"V. Lefevre, J. M. Muller, in Proceedings of the 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001. Worst cases for correct rounding of the elementary functions in double precision (Vail, 2001), pp. 111\u2013118. https:\/\/doi.org\/10.1109\/ARITH.2001.930110.","key":"692_CR5","DOI":"10.1109\/ARITH.2001.930110"},{"issue":"11","key":"692_CR6","doi-asserted-by":"publisher","first-page":"5101","DOI":"10.1007\/s00034-018-0810-z","volume":"37","author":"T. Kulshreshtha","year":"2018","unstructured":"T. Kulshreshtha, A. S. Dhar, Cordic-based high throughput sliding DFT architecture with reduced error-accumulation. Circ. Syst. Signal Proc.37(11), 5101\u20135126 (2018). https:\/\/doi.org\/10.1007\/s00034-018-0810-z.","journal-title":"Circ. Syst. Signal Proc."},{"doi-asserted-by":"publisher","unstructured":"IEEE Standard for broadband over power line networks: medium access control and physical layer specifications. IEEE Std 1901-2010, 1\u20131586 (2010). https:\/\/doi.org\/10.1109\/IEEESTD.2010.5678772.","key":"692_CR7","DOI":"10.1109\/IEEESTD.2010.5678772"},{"issue":"4","key":"692_CR8","doi-asserted-by":"publisher","first-page":"2072","DOI":"10.1109\/TCE.2010.5681074","volume":"56","author":"S. -Y. Lin","year":"2010","unstructured":"S. -Y. Lin, C. -L. Wey, M. -D. Shieh, Low-cost FFT processor for DVB-T2 applications. IEEE Trans. Consum. Electron.56(4), 2072\u20132079 (2010). https:\/\/doi.org\/10.1109\/TCE.2010.5681074.","journal-title":"IEEE Trans. Consum. Electron."},{"unstructured":"R. H. Stanton, in Proceedings of the 31st Annual SAS Symposium on Telescope Science. Photon counting - one more time (Big Bear Lake, 2012), pp. 177\u2013184. http:\/\/adsabs.harvard.edu\/abs\/2012SASS...31..177S.","key":"692_CR9"},{"issue":"5","key":"692_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/2460216.2460225","volume":"40","author":"H. Nakahara","year":"2012","unstructured":"H. Nakahara, H. Nakanishi, T. Sasao, On a wideband fast Fourier transform for a radio telescope. SIGARCH Comput. Archit. News. 40(5), 46\u201351 (2012). https:\/\/doi.org\/10.1145\/2460216.2460225.","journal-title":"SIGARCH Comput. Archit. News"},{"doi-asserted-by":"publisher","unstructured":"F. Qureshi, O. Gustafsson, in Proceedings of the 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers. Analysis of twiddle factor memory complexity of radix-2i pipelined FFTs (Pacific Grove, 2009), pp. 217\u2013220. https:\/\/doi.org\/10.1109\/ACSSC.2009.5470121.","key":"692_CR11","DOI":"10.1109\/ACSSC.2009.5470121"},{"doi-asserted-by":"publisher","unstructured":"J. G. Nash, Distributed-memory-based FFT architecture and FPGA implementations. Electronics. 7(7) (2018). https:\/\/doi.org\/10.3390\/electronics7070116.","key":"692_CR12","DOI":"10.3390\/electronics7070116"},{"issue":"10","key":"692_CR13","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1109\/PROC.1967.5959","volume":"55","author":"J. W. Cooley","year":"1967","unstructured":"J. W. Cooley, P. A. W. Lewis, P. D. Welch, Historical notes on the fast Fourier transform. Proc. IEEE. 55(10), 1675\u20131677 (1967). https:\/\/doi.org\/10.1109\/PROC.1967.5959.","journal-title":"Proc. IEEE"},{"issue":"11","key":"692_CR14","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/12.475133","volume":"44","author":"R. A. Smith","year":"1995","unstructured":"R. A. Smith, A continued-fraction analysis of trigonometric argument reduction. IEEE Trans. Bus. Econ.44(11), 1348\u20131351 (1995). https:\/\/doi.org\/10.1109\/12.475133.","journal-title":"IEEE Trans. Bus. Econ."},{"issue":"9","key":"692_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1049\/el.2013.0689","volume":"49","author":"H. Kang","year":"2013","unstructured":"H. Kang, B. Yang, J. Lee, Low complexity twiddle factor multiplication with ROM partitioning in FFT processor. Electron. Lett.49(9), 589\u2013591 (2013). https:\/\/doi.org\/10.1049\/el.2013.0689.","journal-title":"Electron. Lett."},{"unstructured":"D. Guerrero, J. Viejo, P. Ruiz-de-Clavijo, J. Juan, M. J. Bellido, A. Millan, E. Ostua, J. I. Villar, J. Quiros, A. Mu\u00f1oz, Digital Electronic circuit for calculating sines and cosines of multiples of an angle. WO2018104566A1: (2018).","key":"692_CR16"},{"unstructured":"D. Guerrero, A. Millan, J. Juan, J. Viejo, M. J. Bellido, P. Ruiz-de-Clavijo, E. Ostua, Dispositivo Electr\u00f3nico Calculador de Funciones Trigonom\u00e9tricas. P201831134: (2019).","key":"692_CR17"},{"unstructured":"D. Guerrero, A. Millan, J. Juan, J. Viejo, M. J. Bellido, P. Ruiz-de-Clavijo, E. Ostua, Dispositivo Electr\u00f3nico Calculador de Funciones Trigonom\u00e9tricas Y Usos Del mismo. P201831133: (2019).","key":"692_CR18"}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-020-00692-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-020-00692-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-020-00692-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T23:15:31Z","timestamp":1626909331000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-020-00692-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,22]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["692"],"URL":"https:\/\/doi.org\/10.1186\/s13634-020-00692-5","relation":{},"ISSN":["1687-6180"],"issn-type":[{"type":"electronic","value":"1687-6180"}],"subject":[],"published":{"date-parts":[[2020,7,22]]},"assertion":[{"value":"10 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors developed the inventions covered by patents WO2018104566A1, P201831134, and P201831133.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"35"}}