ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “four-channel architecture”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.AREmpiricalRecentJul 7, 2026

Boosting FPGA Performance with Direct BRAM-DSP Paths

Jiajun Hu, Ruthwik Reddy Sunketa, Andrew Boutros, Aman Arora

This paper proposes a lightweight architectural enhancement for FPGA designs to improve data movement between block RAMs and digital signal processing units for deep learning workloads, incurring negl…

View →
eess.AScs.SDEmpiricalRecentJul 21, 2026

Towards Array-Invariant Speech Enhancement via Geometry-Aware Dynamic Convolution

Zhenglong Liu, Wangyou Zhang, Chenda Li, Yanmin Qian

A new framework called Geo-DConv is proposed to make multi-channel speech enhancement systems adaptable to diverse microphone array geometries by leveraging microphone coordinates.

View →
cs.FLcs.CCcs.DSNEWTheoreticalJul 28, 2026

Breaking the $4^k$ Barrier for the $k$-Distinct Language

Ran Ben Basat

This paper presents a new nondeterministic finite automaton (NFA) for recognizing repetition-free words over a given alphabet, improving on the previous construction.

View →
eess.AScs.PLcs.SDEmpiricalRecentJun 19, 2026

Compiling Differentiable Audio Graphs to Real-Time DSP

Facundo Franchino, Sebastian J. Schlecht

This paper presents ADAC, a compiler that converts trained differentiable audio models into efficient FAUST code for real-time audio effects.

View →
cs.ARcs.CRcs.LGEmpiricalRecentJul 4, 2026

SABLE: An NDA-Safe Closed-Loop LLM Framework for Analog Circuit Optimization in Industrial EDA Flows

Xunqi Li, Chris H. Kim

The paper presents SABLE, an NDA-safe framework that allows large language models to optimize analog circuits in industrial EDA tools while protecting proprietary information.

View →
cs.PLcs.AREmpiricalRecentJul 21, 2026

High-Level Synthesis of Efficient Pipelines with Visibility Control

Jungin Rhee, Minseong Jang, Jaewoo Kim, Jeehoon Kang

A new HLS tool is presented that enables fine-grained pipeline control in a sequential programming model for competitive PPA.

View →
cs.CRRecentApr 30, 2026

SBN Explorer: An Empirical Study of Cryptographic Boolean Networks

Arnaud Valence

The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…

View →
cs.ARcs.LGEmpiricalRecentJul 4, 2026

Weave: Verified Netlist-to-Schematic Conversion via Layered Graph Layout

Senol Gulgonul

This paper presents Weave, a deterministic method to convert SPICE netlists into LTspice schematics with guaranteed connectivity preservation.

View →
cs.ARRecentMay 29, 2026

MixFP4: Enhancing NVFP4 with Adaptive FP4/INT4 Block Representations

Jiaxiang Zou, Yonghao Chen, Ruilong Wu, Xinyu Chen

MixFP4 introduces a mixed micro-format extension to NVFP4, allowing blocks to dynamically select between two stored FP4 formats (E2M1 and E1M2) to improve quantization accuracy without altering the st…

View →
cs.CRRecentApr 4, 2026

Partial Number Theoretic Transform Masking in Post-Quantum Cryptography (PQC) Hardware: A Security Margin Analysis

Ray Iskander, Khaled Kirah

The paper analyzes the security of a partially masked hardware accelerator for Number Theoretic Transform (NTT) in PQC, demonstrating that the claimed security margins are significantly overestimated…

View →
cs.AREmpiricalRecentJun 15, 2026

PDAGENT-BENCH: Characterizing, Grounding, and Architecting LLM Agents for VLSI Physical Design

Qiufeng Li, Rongqian Chen, Quan Cheng, Chengxuan Wang +8 more

This paper introduces PDAGENT-BENCH, a comprehensive benchmark for evaluating Large Language Models and vision-language models in the physical design stack of Very Large-Scale Integrated Circuits.

View →
cs.CCcs.PFcs.PLTheoreticalRecentJun 29, 2026

The Fourth-Root Complexity of Data Movement

Chen Ding

This paper analyzes data-access cost in a memory hierarchy and shows it scales with the fourth root of data size, predicting scalability.

View →
cs.CRcs.SCmath.NTRecentMay 17, 2026

Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography

Sakura Oku, Momonari Kudo

This paper provides an explicit cost analysis of Toom-4 multiplication specifically tailored for the incomplete Number Theoretic Transform (NTT) framework, offering a concrete cost model for hybrid la…

View →
cs.SDcs.AIcs.MMRecentMay 27, 2026

EigeNet: Geometry-Informed Multi-Modal Learning for Few-shot Novel View RIR Prediction

Chong Jing, Zitong Lan, Junan Zhang, Zhizheng Wu

EigeNet introduces a geometry-informed multi-modal Transformer framework to achieve state-of-the-art few-shot novel view Room Impulse Response (RIR) prediction by effectively integrating spatial geome…

View →