Title : 
Compatible class encoding in hyper-function decomposition for FPGA synthesis
         
        
            Author : 
Jiang, Jie-Hong R. ; Jou, Jing-Yang ; Huang, Juinn-Dar
         
        
            Author_Institution : 
Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
         
        
        
        
        
        
            Abstract : 
Recently, functional decomposition has been adopted for LUT based FPGA technology mapping with good results. In this paper, we propose a novel method for functional multiple-output decomposition. We first address a compatible class encoding method to minimize the compatible classes in the image function. After the encoding algorithm is applied, the decomposability will be improved in the subsequent decomposition of the image function. The above encoding algorithm is then extended to encode multiple-output functions through the construction of a hyper-function. Common sub-expressions among these multiple-output functions can be extracted during the decomposition of the hyper-function. Therefore, we can handle the multiple-output decomposition in the same manner as the single-output decomposition. Experimental results show that our algorithms are very promising.
         
        
            Keywords : 
encoding; field programmable gate arrays; logic design; table lookup; FPGA synthesis; LUT based FPGA technology mapping; compatible class encoding; compatible class encoding method; encoding algorithm; functional decomposition; functional multiple-output decomposition; hyper-function decomposition; image function; multiple-output decomposition; multiple-output functions; Boolean functions; Encoding; Field programmable gate arrays; Image coding; Network synthesis; Partitioning algorithms; Permission; Programmable logic arrays; Prototypes; Table lookup;
         
        
        
        
            Conference_Titel : 
Design Automation Conference, 1998. Proceedings
         
        
            Conference_Location : 
San Francisco, CA, USA
         
        
            Print_ISBN : 
0-89791-964-5