Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.04019

qLevelPlace: A Level-Based Placement Framework for RSFQ Circuits

Ziyu Liu·Jingkai Hong·Robert S. Aviles·Sasan Razmkhah·Peter A. Beerel·Massoud Pedram
View original source ↗Read source document ↗Export metadata ↓

Abstract

Rapid Single Flux Quantum (RSFQ) logic can operate at ultra-high clock frequencies; however, its physical design is complicated by explicit splitter trees and deep gate-level pipelines in which every logic gate is clocked. To address this challenge, we present qLevelPlace, a level-based placement framework for RSFQ circuits. We separate gate and splitter placement into two stages to better support levelguided gate-to-row assignment and use a timing-aware quadratic cost function to penalize long interconnects. Experiments on the benchmark circuits show that, on average, qLevelPlace achieves a $2.65\times$ higher clock frequency and a 51% reduction in layout area compared with the state-of-the-art RSFQ placer qPlace.

Explore related subjects

cs.ET

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ziyu Liu, Jingkai Hong, Robert S. Aviles, Sasan Razmkhah, Peter A. Beerel, Massoud Pedram. 2026-11-02. qLevelPlace: A Level-Based Placement Framework for RSFQ Circuits. https://arxiv.org/abs/2611.04019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Edge AI and TinyML for Resource-Constrained Agriculture: Hardware Platforms, Model Optimization, and Deployment Strategies

Deploying artificial intelligence at the edge is increasingly important for systems that must operate under strict limits on memory, computation, energy, connectivity, and hardware cost. Tiny Machine Learning (TinyML) represents the most resource-constrained regime of this shift, enabling inference on microcontroller-class devices with tightly bounded flash and SRAM budgets. This study examines recent deployment trends in Edge AI and TinyML using precision farming as a representative real-world environment in which sensing nodes, gateways, UAVs, and embedded processors must often operate with intermittent connectivity and limited power. The analysis emphasizes the deployment stack rather than predictive accuracy alone, covering hardware classes, software toolchains, model- and system-level optimization, intelligence placement, and hardware-resource reporting. Across the analyzed studies, microcontroller-class platforms such as ESP32, STM32, and ATmega are prominent endpoint targets, while single-board computers and embedded accelerators support more compute-intensive workloads. Among the studies included in the optimization comparison, almost 50% report quantization, making reduced-precision inference the most frequently identified strategy within this subset. In contrast, structured pruning, hardware-aware neural architecture search, and coordinated cross-layer optimization remain comparatively limited. Resource profiling is also inconsistent as flash, peak RAM, MAC count, latency, and energy per inference are not reported uniformly, limiting reproducibility and comparisons across deployments. A recurring systems-level pattern is an inference-training asymmetry in which inference moves toward local devices while training and model lifecycle management remain predominantly centralized.

cs.ET↗
arXiv2026

TableTune: Measured, Self-Correcting Draft-Length Tables for Dynamic Speculative Decoding

Speculative decoding speeds up large language model (LLM) serving only while the GPU has spare compute, so the best draft length, the number of tokens a small drafter guesses per step, shrinks as the batch grows. vLLM lets operators set the draft length for each batch size with a hand-written table, but nothing measures or corrects that table. We present TableTune. Its tuner times the decoding step for every batch size and draft length on vLLM's own serving path and computes, in minutes, the table that maximizes throughput. Its controller, a vLLM plugin, tracks how many guesses are accepted in live traffic and rebuilds the table while serving. We measure TableTune only against other ways to speculate. On an H100, the tuned table delivers at least 94% of the throughput of the best fixed draft length at every load in four of five drafter settings (88% in the fifth) without the operator having to know which length that is. Against reimplementations of TurboSpec- and Nightjar-style control on the same engine, its worst-case loss is never higher than theirs, and with the EAGLE-3 drafter it is 3% against 9% and 12%. On a mixture-of-experts model, vLLM's documented table loses up to 18% and the tuned table at most 3%. Starting from mistuned tables, the controller raises throughput by up to 58% (up to 45% on vLLM's default runner), and after a workload switch with the DFlash drafter it recovers 96% of a stale table's loss. In llm-d's optimized-baseline deployment as shipped, two Qwen3-32B replicas on four GPUs, the tuned table is up to 32% faster than a fixed draft length of 3 and up to 25% faster than vLLM's documented table at high load, and the controller raises the documented table's throughput by up to 29%.

cs.ET↗
arXiv2026

Molecular Communication for Plaque Sensing in a Vascular Bifurcation with Receiver Constraints

Future molecular communication (MC) networks are envisioned to use the human cardiovascular system as a channel. Disease-related changes affect particle transport, allowing an MC receiver to also act as a sensor. In this work, we investigate plaque formation in a carotid bifurcation through a systematic fluid-dynamics simulation study with non-Newtonian blood rheology. We analyze how plaque geometry changes branch-specific particle reception and timing, and use these observations to estimate plaque-induced channel obstruction. At an illustrative reference of only 128 emitted particles, a 250 ms observation window and 50 ms temporal resolution, a Ridge detector estimates maximum local channel-width reduction with a mean absolute error of 8.30 percentage points. We evaluate robustness across system constraints like particle budgets, observation windows, branch access, detection efficiency, count resolution, and synchronization. Coarse counting has little effect when timing features remain available, whereas limited temporal resolution and clock uncertainty substantially affect short-window estimates. Extending the observation window to 1 s reduces these timing-related penalties. The results establish a baseline for plaque sensing from constrained MC observations and identify receiver capabilities relevant to the Internet of Bio-Nano Things.

cs.ET↗