Sharif Digital Repository

There are a number of Artificial In elligence (AI) algorithms for implementation of 'Blokus Duo' game. We needed an implementation on FPGA, and moreover, the design had to respond under a given time constraint. In this paper we examine some of these algorithms and propose a heuristic algorithm to solve the problem by considering intelligence, time constraint and FPGA implementation limitations  

Although exemplar based approaches have shown good accuracy in classification problems, some limitations are observed in the accuracy of exemplar based automatic speech recognition (ASR) applications. The main limitation of these algorithms is their high computational complexity which makes them difficult to extend to ASR applications. In this paper, an N-best class selector is introduced based on sparse representation (SR) and a tree search strategy. In this approach, the classification is fulfilled in three steps. At first, the set of similar training samples for the specific test sample is selected by k-dimensional (KD) tree search algorithm. Then, an SR based N-best class selector is... 

This paper addresses the issue of finding and accessing desired items when a large amount of data items are concerned, by proposing some concepts based on Tree Search Structure -a hierarchical structure for information retrieval. The proposed concepts are applicable to several environments such as File Managers on PCs, help tree views, site maps, taxonomies, and cell phones. A software tool, FTS (File Tree Search), that is developed to utilize the proposed concepts is also presented  

Lattice Reduction (LR) has been proposed as a method to enhance the performance of MIMO detectors such as ZF, MMSE and V-BLAST. Until recently, the application of LR to the superior K-Best tree-search detection algorithm was not practical due to the significant increase in complexity of K-Best as a result of the distortion of tree symmetry caused by LR. However, in our recently published work we developed an innovative K-Best algorithm to accommodate tree-asymmetry with no additional complexity. In this work, we build on this result and perform a detailed analysis of the effect of various LR algorithms on the performance of LR-aided K-Best. We show that LLL and Seysen provide equivalent...