A custom co-processor for the discovery of low autocorrelation binary sequences

• Autorzy: Russek P. , Karwatowski M. , Jamro E. , Wiatr K.
• Języki publikacji: EN

Abstrakty

EN

We present a custom processor that was designed to enhance algorithms of finding Low Autocorrelation Binary Sequences (LABS). Finding LABS is very computationally exhaustive, but no custom computing solutions have been reported in the literature so far. A computational kernel which allowed creating an effective single-purpose processor was determined and an appropriate architecture was proposed. The selected elements of the architecture were coded in High-Level Synthesis (HLS) language to speed up the design process. Afterwards, the processor was verified and tested in Xilinx’s Virtex7 FPGA. At the beginning of the paper, we briefly present the finding LABS problem and its importance. Later, we deliver the algorithm, its custom processor structure, and implementation results in terms of the processor performance, size and power.

Słowa kluczowe

EN

LABS; SDLS algorithm; custom processors; HLS; FPGA

• Wydawca: Wydawnictwo PAK
• Czasopismo: Measurement Automation Monitoring
• Rocznik: 2016
• Tom: Vol. 62, No. 5
• Strony: 154--156
• Opis fizyczny: Bibliogr. 9 poz., rys., schem., tab., wzory

Twórcy

autor

Russek P.

• AGH University of Science and Technology, 30 Mickiewicza Ave., Cracow, Poland

autor

Karwatowski M.

• AGH University of Science and Technology, 30 Mickiewicza Ave., Cracow, Poland

autor

Jamro E.

• AGH University of Science and Technology, 30 Mickiewicza Ave., Cracow, Poland

autor

Wiatr K.

• AGH University of Science and Technology, 30 Mickiewicza Ave., Cracow, Poland

Bibliografia

• [1] Nasrabadi M. A., Bastani M. H., Amin_Nasrabadi, M., & Bastani, M.: A survey on the design of binary pulse compression codes with low autocorrelation. INTECH Open Access Publisher, 2010.
• [2] Golay M. J. E.: A class of finite binary sequences with alternate autocorrelation values equal to zero. IEEE Trans. Inform. Theory, vol. IT-18, pp. 449-450, May 1972.
• [3] Mertens S.: Exhaustive search for low-autocorrelation binary sequences. Journal of Physics A: Mathematical and General, vol. 29, no. 18, 1996
• [4] Mow W. H., Du K. L. and Wu W. H.: New evolutionary search for long low autocorrelation binary sequences. Aerospace and Electronic Systems, IEEE Transactions on, vol. 51, no. 1, pp. 290-303, 2015.
• [5] Gallardo J. E., Cotta C. and Fernández A. J.: Finding low autocorrelation binary sequences with memetic algorithms. Applied Soft Computing, vol. 9, no. 4, pp. 1252-1262, 2009.
• [6] Moscato P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech concurrent computation program, C3P Report, pp. 826, 1989.
• [7] Russek P.: Data-intensive processing on FPGAs, AGH University of Science and Technology Press, 2015
• [8] https://git.plgrid.pl/users/plgrussek/repos/sdls-processor
• [9] http://xillybus.com/

Uwagi

EN

This work was performed thanks to the funds for AGH statutory activity 11.11.230.017.