{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/caffeinated-fpgas-fpga-framework-for","title":"Caffeinated FPGAs: FPGA Framework For Convolutional Neural Networks","arxiv_id":"1609.09671","date":"2016-09-30","proceeding":null,"authors":["Roberto DiCecco","Griffin Lacey","Jasmina Vasiljevic","Paul Chow","Graham Taylor","Shawki Areibi"],"abstract":"Convolutional Neural Networks (CNNs) have gained significant traction in the\nfield of machine learning, particularly due to their high accuracy in visual\nrecognition. Recent works have pushed the performance of GPU implementations of\nCNNs to significantly improve their classification and training times. With\nthese improvements, many frameworks have become available for implementing CNNs\non both CPUs and GPUs, with no support for FPGA implementations. In this work\nwe present a modified version of the popular CNN framework Caffe, with FPGA\nsupport. This allows for classification using CNN models and specialized FPGA\nimplementations with the flexibility of reprogramming the device when\nnecessary, seamless memory transactions between host and device, simple-to-use\ntest benches, and the ability to create pipelined layer implementations. To\nvalidate the framework, we use the Xilinx SDAccel environment to implement an\nFPGA-based Winograd convolution engine and show that the FPGA layer can be used\nalongside other layers running on a host processor to run several popular CNNs\n(AlexNet, GoogleNet, VGG A, Overfeat). The results show that our framework\nachieves 50 GFLOPS across 3x3 convolutions in the benchmarks. This is achieved\nwithin a practical framework, which will aid in future development of\nFPGA-based CNNs.","url_abs":"http://arxiv.org/abs/1609.09671v1","url_pdf":"http://arxiv.org/pdf/1609.09671v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"caffeinated-fpgas-fpga-framework-for","repo_url":"https://github.com/dicecco1/fpga_caffe","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"dicecco1/fpga_caffe","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"546e1af405a45c34b3153eaa299ae3c6d7f68587b9d6601d547114de2f49660e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}