{"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/lutnet-rethinking-inference-in-fpga-soft","title":"LUTNet: Rethinking Inference in FPGA Soft Logic","arxiv_id":"1904.00938","date":"2019-04-01","proceeding":null,"authors":["Erwei Wang","James J. Davis","Peter Y. K. Cheung","George A. Constantinides"],"abstract":"Research has shown that deep neural networks contain significant redundancy,\nand that high classification accuracies can be achieved even when weights and\nactivations are quantised down to binary values. Network binarisation on FPGAs\ngreatly increases area efficiency by replacing resource-hungry multipliers with\nlightweight XNOR gates. However, an FPGA's fundamental building block, the\nK-LUT, is capable of implementing far more than an XNOR: it can perform any\nK-input Boolean operation. Inspired by this observation, we propose LUTNet, an\nend-to-end hardware-software framework for the construction of area-efficient\nFPGA-based neural network accelerators using the native LUTs as inference\noperators. We demonstrate that the exploitation of LUT flexibility allows for\nfar heavier pruning than possible in prior works, resulting in significant area\nsavings while achieving comparable accuracy. Against the state-of-the-art\nbinarised neural network implementation, we achieve twice the area efficiency\nfor several standard network models when inferencing popular datasets. We also\ndemonstrate that even greater energy efficiency improvements are obtainable.","url_abs":"http://arxiv.org/abs/1904.00938v1","url_pdf":"http://arxiv.org/pdf/1904.00938v1.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":"lutnet-rethinking-inference-in-fpga-soft","repo_url":"https://github.com/awai54st/LUTNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"lutnet-rethinking-inference-in-fpga-soft","repo_url":"https://github.com/awai54st/logic-shrinkage","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"BSD-2-Clause"}}],"tasks":[],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.00938","atlas_url":"https://app.syntology.ai/?focus=1904.00938","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1904.00938"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.00938\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.00938"},"call":"get_concepts_for_paper(arxiv_id=\"1904.00938\")"}],"by_repo":[{"repo":"awai54st/LUTNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1910.12625"],"harvested_for_calls":[{"arxiv_id":"1910.12625","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.12625"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.12625\")"}]},{"repo":"awai54st/logic-shrinkage","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"0cfdc0370fd9cce9ed726da5a79a5294a61e40608ec021cbd0590643e02b8234","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}