1. Borowik G., Łuba T.: Fast Algorithm of Attribute Reduction Based on the complementation of Boolean Function, ch. 2, pp. 25-41, Springer International Publishing, 2014.
  2. Borowik, G., Łuba, T., Tomaszewicz, P.: On the Memory Capacity to Implement Logic Functions, Eds.
  3. F. Pichler, R. Moreno-Díaz, A. Quesada-Arencibia, Computer Aided Systems Theory – EUROCAST 2011, vol.6928: Springer-Verlag Berlin Heidelberg, Lecture Notes in Computer Science, 343-350, 2012.
  4. Brayton R., Hachtel G.D., McMullen C., Sangiovanni-Vincentelli A.: Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, Boston 1984.
  5. Brzozowski, J. A., Łuba, T.: Decomposition of Boolean Functions Specified by Cubes, in Journal of Multiple-Valued Logic and Soft Computing, Vol. 9, Old City Publishing Inc., Philadelphia, 377-417, 2003.
  6. Goodman D.J., Carey M.J.: Nine Digital Filters for Decimation and Interpolation, IEEE Trans. On Acoustics, Speech and Signal Processing 25(2), pp.121-126, 1977.
  7. Grzymala-Busse J. W.: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction. In: Peters J.F. et al. (eds.): Transactions on Rough Sets, LNCS 3100, pp. 78–95, Springer-Verlag, Berlin, 2004.
  8. Łuba T., Borowik G.: Synteza logiczna, Oficyna Wydawnicza PW, Warszawa 2015.
  9. Łuba T. (et al.): Rola i znaczenie syntezy logicznej w eksploracji danych dla potrzeb telekomunikacji i medycyny. Przegląd Telekomunikacyjny i Wiadomości Telekomunikacyjne, Nr. 5, 2014.
  10. Łuba T., Selvaraj H.: A General Approach to Boolean Function Decomposition and its Applications in FPGA-based Synthesis. VLSI Design, Special Issue on Decompositions in VLSI Design, Vol. 3, Nos. 3-4, pp. 289-300, 1995.
  11. Łuba T., Rybnik J.: Algorithmic Approach to Discernibility Function with Respect to Attributes and Objects Reduction, Foundations of Computing and Decision Sciences, Vol. 18, No. 3-4, 241–258, 1993.
  12. Łuba T., Poźniak K., Zbierzchowski B.: Redukcja i kompresja zmiennych w syntezie funkcji generowania indeksów. Przegląd Telekomunikacyjny i Wiadomości Telekomunikacyjne, Nr. 10, 2016.
  13. Mańkowski, M., Łuba, T., Jankowski, C.: Evaluation of Decision Table Decomposition Using Dynamic Programming Classifiers, The 24th International Workshop on Concurrency, Specification and Programming, Sept. 2015.
  14. Meyer-Baese U.: Digital Signal Processing with Field Programmable Gate Arrays. Springer Verlag, Second Edition, Berlin, 2004. [1.14] Rokach L., Maimon O.: Data Mining using Decomposition Methods. In Oded Maimon O., Lior Rokach R., Data Mining and Knowledge Discovery Handbook, pp. 981-998, Springer, New York 2010.
  15. Sasao T.: Index Generation Functions, Logic Synthesis for Pattern Matching, EPFL Workshop on Logic Synthesis & Verification, Dec. 2015.
  16. Sasao, T.: A Reduction Method For the Number of Variables to Represent Index Generation Functions: s-Min Method, IEEE 45th International Symposium on Multiple-Valued Logic, 164–169, 2015.
  17. Sasao, T.: Memory-Based Logic Synthesis, Springer New York Dordrecht Heidelberg London, 2011.
  18. Sysło M. M., Deo N., Kowalik J. S.: Algorytmy optymalizacji dyskretnej. PWN, 1993.

Ostatnia modyfikacja: wtorek, 16 listopada 2021, 13:42