Search arXiv⌕ Search

arXiv · 2610.39337

Versatile Photonic Encoding Platform with Selectable Back Ends for Automotive Edge Processing

Abstract

The increasing diversity and computational demands of automotive edge functions require hardware architectures that support heterogeneous processing while limiting implementation complexity and system overhead. We investigate a system-level approach in which a common, fixed photonic front end provides a shared physical transformation for multiple processing functions, while application adaptation is handled by lightweight peripheral processing. We propose the Versatile Photonic Encoding Platform (VPEP), implemented using a fabricated silicon-photonic chip with 32 phase-modulated inputs, a passive fixed encoding core, and 17 on-chip photodetector outputs. Without reconfiguring the photonic core, the same chip is evaluated across four representative functions relevant to automotive edge systems: classification and regression for machine learning, analog-to-digital conversion for mixed-signal processing, and photonic information encoding and recovery for communication-related processing. Compared with linear baselines without photonic encoding, VPEP improves the mean macro-F1 score on 12 of 13 classification datasets and the mean coefficient of determination on 9 of 12 regression benchmarks. For analog-to-digital conversion, the best configuration achieves an in-sample normalized root-mean-square error of approximately 0.75% of full scale. For information encoding and recovery, a lightweight nonlinear decoder reconstructs four-character (32-bit) inputs from 17-channel encoded outputs with approximately 94% character accuracy for a 26-symbol set. These results demonstrate the feasibility of cross-application processing with a single fixed silicon-photonic encoding core and suggest a system-level design approach, complementary to reconfigurable photonic architectures, that combines common photonic hardware with lightweight application-specific processing for future automotive edge systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isamu Takai, Makoto Nakai, Ayana Mizuno, Atsutaka Miyamichi. 2026-10-29. Versatile Photonic Encoding Platform with Selectable Back Ends for Automotive Edge Processing. https://arxiv.org/abs/2610.39337

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

KEEP EXPLORING

Related papers

A Co-Design Approach to Physically-Informed Molecular Docking for Quantum Annealers

Molecular docking is a crucial step in computer- aided drug design, involving the identification of ligand poses that are physically plausible within a protein pocket. Recent studies have shown that this problem can be formulated as a geometric weighted subgraph isomorphism, which can then be encoded as a QUBO and thus solved on D-Wave quantum annealers. In this work, we adopt a co-design approach, addressing molecular docking at the formulation and encoding levels, and examining how hardware topology affects solution quality on current quantum annealers. We propose new QUBO formulations that extend the state-of-the-art ones by including van der Waals, Coulomb, hydrogen bonding, and hydrophobic interactions. Experimental results show that incorporating physicochemical terms improves the average docking quality by more than 18% compared to the purely geometric baseline on D-Wave quantum annealers with the Pegasus topology, and by up to 29% on those with the Zephyr topology. The choice of topology, along with an improved encoding design, yields significant gains in embedding efficiency and the number of valid solutions. Our designs reduce the number of physical qubits required by up to 14.5% and decrease the chain break fraction by an order of magnitude, thereby enhancing confidence in the resulting solutions.

cs.ET↗

Continuous-time nonlinear closed-loop in-memory computing for high-accuracy massive MIMO detection

Analog in-memory computing (IMC) has emerged as a promising approach for accelerating matrix operations by exploiting the intrinsic physics of memory arrays. To date, however, most IMC architectures have focused on linear algebra workloads in which computation is encoded in the equilibrium state of a physical system. Extending these principles to nonlinear optimization remains challenging and typically relies on iterative algorithms composed of repeated linear operations. Here, we introduce a continuous-time nonlinear closed-loop IMC architecture for box-constrained zero-forcing (BCZF) decoding in massive multiple-input multiple-output (MIMO) systems. The proposed architecture embeds the decoding problem directly within the dynamics of a nonlinear feedback network of memory arrays and supply-limited operational amplifiers, allowing solutions to emerge through continuous-time physical optimization. We derive a compact analytical model of the circuit and show that its trajectories minimize an equivalent energy function. Experimental emulation using a fabricated IMC chip confirms the predicted dynamics under realistic hardware nonidealities for up to 16x16 MIMO systems. To overcome the finite precision of analog hardware, we extend mixed-precision iterative refinement from linear algebra to nonlinear continuous-time optimization, enabling reliable detection of high-order modulation formats including 1024-QAM. Benchmark projections indicate operation from ultra-low-energy approximate decoding to high-accuracy massive MIMO detection. Together, these results extend closed-loop IMC from equilibrium-based linear algebra to continuous-time nonlinear optimization and establish a pathway toward efficient physical accelerators for high-accuracy wireless communications.

cs.ET↗

On the completeness of transformation rules in reversible logic synthesis

Transformation rules play a central role in reversible circuit optimization, template-based rewriting, and equivalence checking, and establishing their completeness is a fundamental problem in reversible logic synthesis. In this work, we investigate the completeness of transformation rules for reversible circuits both with and without ancillary bits and garbage outputs. For reversible circuits without ancillary bits and garbage outputs, we introduce a refined and complete transformation rule set $\mathcal{RC}^{r}$, obtained by replacing one rule in the rule set $\mathcal{RC}$ proposed in the previous work (TCAD, 45, pp. 3711--3724, 2026) with a simpler and widely adopted transformation rule. Since all rules in $\mathcal{RC}^{r}$ are commonly used in reversible logic synthesis, this result reveals that practically adopted transformation rules are already sufficient to establish a complete rewriting framework. Based on this result, we further propose an extended rule set, denoted by $\mathcal{RC}^+$, and prove its completeness for reversible circuits with ancillary bits and garbage outputs. To the best of our knowledge, this work presents the first complete transformation rule set for arbitrary reversible circuits, regardless of whether ancillary bits or garbage outputs are employed. The proposed framework establishes a theoretical foundation for circuit optimization, template generation, and equivalence checking, and may facilitate the development of automated design tools for reversible and quantum circuits.

cs.ET↗