Uğurdağ, Hasan FatihBayram, A.Levent, Vecdi LeventGören, S.2017-01-242017-01-2420161063-6889http://hdl.handle.net/10679/4723https://doi.org/10.1109/ARITH.2016.23Division of an integer by an integer constant is a widely used operation and hence justifies a customized efficient implementation. There are various versions of this operation. This paper attacks a particular version of this problem, where the divisor is small and the circuit outputs a quotient and remainder. We propose a fast (low-latency) yet area-efficient combinational circuit topology, which we call Binary Tree based Constant Division (BTCD). BTCD uses a collection of small LUTs wired to each other to form a binary tree. The circuit also has bunch of adders, whose latencies are almost hidden as they operate in parallel with the binary tree. We wrote RTL code generators for BTCD and two previous works in the literature, then generated circuits for dividends of up to 128 bits and divisors of 3, 5, 11, and 23. We synthesized the generated RTL designs using a commercial ASIC synthesis tool. BTCD strikes a good balance between timing (latency) and area. It is up to 3.3 times better in Area-Timing Product (ATP) compared to the best alternative. ATP has a good correlation with energy consumption.enginfo:eu-repo/semantics/restrictedAccessArticle00038923300000110.1109/ARITH.2016.23Integer constant divisionParameterized circuit generatorRTL generatorLow latency combinational circuitArea-time productASIC synthesis2-s2.0-84988946474