FPGA Algorithms and Applications for the Internet of Things (Hardcover)

In the research area of computer science, practitioners are constantly searching for faster platforms with pertinent results. With analytics that span environmental development to computer hardware emulation, problem-solving algorithms are in high demand. Field-Programmable Gate Array (FPGA) is a promising computing platform that can be significantly faster for some applications and can be applied to a variety of fields. FPGA Algorithms and Applications in the IoT, AI, and High-Performance Computing provides emerging research exploring the theoretical and practical aspects of computable algorithms and applications within robotics and electronics development. Featuring coverage on a broad range of topics such as neuroscience, bioinformatics, and artificial intelligence, this book is ideally designed for computer science specialists, researchers, professors, and students seeking current research on cognitive analytics and advanced computing.

General

Imprint:	IGI Global
Country of origin:	United States
Release date:	March 2020
Editors:	Ching Wa Daniel Ng
Dimensions:	254 x 178mm (L x W)
Format:	Hardcover
Pages:	300
ISBN-13:	978-1-5225-9806-0
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > General Books > Computing & IT > Applications of computing > Artificial intelligence > General Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Automatic control engineering > General Promotions
LSN:	1-5225-9806-5
Barcode:	9781522598060

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!