🗊Презентация A FPGA Accelerated AI for Connect-5

Категория: Технология
Нажмите для полного просмотра!
A FPGA Accelerated AI for Connect-5, слайд №1A FPGA Accelerated AI for Connect-5, слайд №2A FPGA Accelerated AI for Connect-5, слайд №3A FPGA Accelerated AI for Connect-5, слайд №4A FPGA Accelerated AI for Connect-5, слайд №5A FPGA Accelerated AI for Connect-5, слайд №6A FPGA Accelerated AI for Connect-5, слайд №7A FPGA Accelerated AI for Connect-5, слайд №8A FPGA Accelerated AI for Connect-5, слайд №9A FPGA Accelerated AI for Connect-5, слайд №10
Скачать
Вы можете ознакомиться и скачать презентацию на тему A FPGA Accelerated AI for Connect-5. Доклад-сообщение содержит 10 слайдов. Презентации для любого класса можно скачать бесплатно. Если материал и наш сайт презентаций Mypresentation Вам понравились – поделитесь им с друзьями с помощью социальных кнопок и добавьте в закладки в своем браузере.

Слайды и текст этой презентации

Слайд 1


A FPGA Accelerated AI for Connect-5 ECE532 Digital Systems Design David Biancolin Mohamed Kayed Ritchie Zhao
Описание слайда:
A FPGA Accelerated AI for Connect-5 ECE532 Digital Systems Design David Biancolin Mohamed Kayed Ritchie Zhao

Слайд 2


Goal Build an AI for connect-5 (Gomoku) in FPGA hardware and leverage Vivado’s High Level Synthesis functions The AI should run faster than its software counterpart running on a top of the line general purpose PC The AI should be competitive with software AIs on Gomocup
Описание слайда:
Goal Build an AI for connect-5 (Gomoku) in FPGA hardware and leverage Vivado’s High Level Synthesis functions The AI should run faster than its software counterpart running on a top of the line general purpose PC The AI should be competitive with software AIs on Gomocup

Слайд 3


Literature Review Began by looking at papers from ICFPT design competition 2013: Blokus 2012: Connect-6 Variant Most papers use a board evaluation function and brute force every possible Sometimes search forward n-ply using a minimax tree, but cannot examine every move
Описание слайда:
Literature Review Began by looking at papers from ICFPT design competition 2013: Blokus 2012: Connect-6 Variant Most papers use a board evaluation function and brute force every possible Sometimes search forward n-ply using a minimax tree, but cannot examine every move

Слайд 4


Board Evaluation Board Evaluation Function sweeps a 5-square mask across board. Adds a number based on the pattern inside the window to board score.
Описание слайда:
Board Evaluation Board Evaluation Function sweeps a 5-square mask across board. Adds a number based on the pattern inside the window to board score.

Слайд 5


Board Evaluation (Cont.) If the board is represented with a bit-board, the BEF is just bit-manipulation, and can be done in hardware in parallel Other mask functions can be used to determine relevant squares (squares which extend or block a pattern) and trim away irrelevant positions
Описание слайда:
Board Evaluation (Cont.) If the board is represented with a bit-board, the BEF is just bit-manipulation, and can be done in hardware in parallel Other mask functions can be used to determine relevant squares (squares which extend or block a pattern) and trim away irrelevant positions

Слайд 6


Search Tree Minimax Search Tree + Alpha-Beta Pruning
Описание слайда:
Search Tree Minimax Search Tree + Alpha-Beta Pruning

Слайд 7


Search Tree (Cont.) To avoid dynamic memory allocation, we will specify how many moves per level and the maximum height of the tree The traversal algorithm will also be sequential and not recursive Possible to parallelize the traversal in hardware
Описание слайда:
Search Tree (Cont.) To avoid dynamic memory allocation, we will specify how many moves per level and the maximum height of the tree The traversal algorithm will also be sequential and not recursive Possible to parallelize the traversal in hardware

Слайд 8


Hardware Acceleration Instead of checking the squares in a mask sequentially, a hardware module can do all the checks in one cycle CPU writes data to predefined locations, the block reads the data, performs the calculations, and write back result FSM used to track program state and alert CPU when hardware modules are done
Описание слайда:
Hardware Acceleration Instead of checking the squares in a mask sequentially, a hardware module can do all the checks in one cycle CPU writes data to predefined locations, the block reads the data, performs the calculations, and write back result FSM used to track program state and alert CPU when hardware modules are done

Слайд 9


Block Diagram
Описание слайда:
Block Diagram

Слайд 10


Plan of Action Phase 1: Write the AI in C Build the game GUI using the touchscreen IP Phase 2: Run the AI purely on Microblaze, get the system to a point where one can play a game Phase 3: Accelerate the AI by choosing certain functions to convert to hardware
Описание слайда:
Plan of Action Phase 1: Write the AI in C Build the game GUI using the touchscreen IP Phase 2: Run the AI purely on Microblaze, get the system to a point where one can play a game Phase 3: Accelerate the AI by choosing certain functions to convert to hardware

Скачать

Похожие презентации
Mypresentation.ru
Загрузить презентацию