Implementation of Givens QR-Decomposition in FPGA

1. Roelands, W.: Platform FPGA-the Future of Logic Design. XESS Journal. V38, N4 (2000) 4–7

   Google Scholar 

2. Kung, S.Y.: VLSI processor arrays. Prentice Hall, Englewood Cliffs (1988).

   Google Scholar 

3. Quinton, P., Robert, Y.: Systolic algorithms and architectures. Prentice Hall, Englewood Cliffs (1991).

   Google Scholar 

4. Kanevski, J.S., Sergyienko, A.M., Piech, H.: A method for the structural synthesis of pipelined array processors. In: Proc. 1-st Int. Conf. ”Parallel Processing and Applied Mathematics”, PPAM’94, Częstochowa (Poland), Sept. 14–16 (1994) 100–108.

   Google Scholar 

5. Guzinski, A., Kanevski, J.S., Sergyienko, A.M.: A method for mapping unimodular loops into application-specific parallel architectures.In: Proc. 2-nd Int. Conf. on Parallel Processing and Applied Math.-PPAM’97, Zakopane (Poland) (1997) 362–371.

   Google Scholar 

6. Kanevski, Ju.S., Wyrzykowski, R., Maslennikov, O.V.: Mapping Recursive Algorithms into Processor Arrays. In: Proc. of the Int. Workshop ”Parallel Numer-ics’94”, Smolenice (1994) 169–191.

   Google Scholar 

7. Gjotze, J. and Schwiegelsohn. A Square root and division free Givens rotation for solving least square problems on systolic arrays. SIAM J. Sci. Statist. Comput, vol. 12, N4 (1991) 300–807.

   Google Scholar 

8. Valero-Garcia, M., Navarro, J.J., Llaberia, J.M., Valero, M. and Lang, T.: A method for implementation of one-dimensional systolic algorithms with data contraflow using pipelined functional units. J. of VLSI Signal Processing, vol. 4, (1992) 7–25.

   Article  Google Scholar 

9. Heller, D.H., Ipsen, I.C.F.: Systolic Networks for Orthogonal Equivalence Transformations and their Application. Conf. on Advanced Research in VLSI. Cambridge. MA; M.I.T. Press (1982) 113–122.

   Google Scholar 

10. Ahmed, H.M., Desolme, J.M. and Morf, M.: Higly Concurrent computing structures for matrix arithmetic and signal processing. Computer, vol. 15, N1 (1982) 65–82.

    Article  Google Scholar 

11. A. Bojanczyk, R.P. Brent, H.T. Kung. Numerically stable solution for dense systems of linear equations using mesh-connected processors. SIAM J. Sci. Statist. Comput. V1 (1984) 95–104.

    MathSciNet  Google Scholar 

12. Gentleman, W.M., Kung, H.T.: Matrix triangularization by systolic arrays. Proc. SPIE, Real-Time Signal Processing IV (1981) 19–26.

    Google Scholar 

13. Luk, F.T.: A rotation method for computing the QR-decomposition, SIAM J. Sci. Statist. Comput. V7 (1986) 452–459.

    Article  MathSciNet  MATH  Google Scholar 

14. Schwiegelshohn, V.: One-and two-dimensional arrays for least squares problems. In: Proc. Int. Conf. on Acoust., Speech and Signal Processing, Dallas, T.X. (1987) 791–794.

    Google Scholar 

15. Chun, J., Kailath, T., Lev-Ari H.: Fast parallel algorithms for QR and triangular factorization. SIAM J. Sci. Statist. Comput. V6 (1987) 899–913.

    MathSciNet  Google Scholar 

16. Sergyienko, A., Kanevski, J., Maslennikov, O., Wyrzykowski, R.: Mapping Regular Algorithms into Processor Arrays using Program Pipelining. Proc. 1st Int. Conf. on Parallel Computing in Electrical Engineering-PARELEC’98, Bialystok, Sept. 2-5, Poland (1998) 362–371.

    Google Scholar 

Download references