Yuto Hama

IT
3papers
1citation
Novelty42%
AI Score40

3 Papers

69.0ITMar 31
Scalable and Near-Optimal Discrete Phase Shift Optimization for Reconfigurable Intelligent Surfaces with Over 20,000 Elements

Yuto Hama, Daisuke Kitayama, Kensuke Inaba et al.

This paper proposes a novel optimization framework for discrete phase shifts of a reconfigurable intelligent surface (RIS) using a coherent Ising machine (CIM). Unlike conventional methods based on iterative convex approximation or combinatorial search with exponentially increasing complexity, the CIM physically explores the solution space of Ising Hamiltonians through collective mode competition in a network of optical oscillators, enabling efficient large-scale discrete optimization. We formulate the RIS discrete phase optimization problem as a quadratic Ising model, which supports both binary and quaternary phase shifts by appropriately mapping quantized phase states to spin variables. Using a real hardware CIM, we experimentally solve quadratic optimization problems for RISs with up to 22,201 elements. The results demonstrate that the proposed method achieves physically consistent beam patterns under both line-of-sight and non-line-of-sight environments and attains the theoretical gain when transitioning from binary to quaternary phase shift. To further enhance scalability, we introduce a spin-size reduction approach that removes spins deterministically fixed by dominant channel components. This technique efficiently reduces the problem size for CIM in line-of-sight conditions without performance loss. These results confirm that CIM-based optimization offers a practical and highly scalable solution for large RIS deployments with discrete phase shift constraints.

2.1ITMay 6
Z-Opt: A Near-Optimal Reduced-Complexity Two-Dimensional Grassmannian Constellation

Kotaro Shigenaga, Hiroki Iimori, Yuto Hama et al.

Grassmannian constellations are known to achieve the capacity of noncoherent communications over Rayleigh fading channels in the high-SNR regime, yet their efficient construction remains challenging. In this paper, we propose two construction methods for Grassmannian constellations of one-dimensional subspaces in a two-dimensional space, termed S-Opt and Z-Opt, along with two low-complexity detectors. Both the construction and detection procedures are performed on the unit sphere, known as the Bloch sphere in quantum computing. We show that the chordal distance on the Grassmann manifold is proportional to the Euclidean distance on the Bloch sphere and derive a corresponding theoretical upper bound based on the Fejes--Tóth bound on the minimum chordal distance. The S-Opt constellation is constructed from sphere-packing solutions and attains the derived upper bound for the optimal Bloch-sphere packings considered. The S-Opt detector can be applied to arbitrary Grassmannian constellations on $\mathcal{G}(2,1)$, and its time complexity scales linearly with the number of receive antennas and logarithmically with the constellation size, while yielding the same detection performance as the GLRT detector. Furthermore, based on the insight obtained through the S-Opt construction, the Z-Opt constellation is constructed by stacking regular polygons on the Bloch sphere, and its minimum chordal distance approaches the derived upper bound over the evaluated constellation sizes. The Z-Opt detector's time complexity scales linearly with the number of receive antennas, while yielding the same detection performance as the GLRT detector for Z-Opt.

35.5SPMar 27
Repeater-Assisted MIMO Can Also Boost Frequency Diversity: A Semi-Analytic Study

Hiroki Iimori, Yuto Hama

Massive multiple-input multiple-output (MIMO) has enabled substantial spatial multiplexing and array gains in real-world systems, while distributed MIMO (D-MIMO) improves macro-diversity over wide areas at the cost of deployment complexity. Repeater-assisted massive MIMO (RA-MIMO) is a lower-cost alternative that can recover key distributed-MIMO advantages. This paper asks whether repeater assistance can also enhance frequency diversity. We study an uncoded discrete Fourier transform-spread orthogonal frequency-division multiplexing (DFT-s-OFDM) uplink with one-tap single-carrier frequency-domain equalization (SC-FDE) based on minimum mean-square error (MMSE) and derive a receiver-matched semi-analytic bit-error rate (BER) expression by averaging over channel and interference realizations, without Gaussian approximation of residual despreading interference. The analysis clarifies how repeater delay reshapes frequency correlation, and waveform simulations confirm tight agreement with the derived expression together with improved high-signal-to-noise ratio (SNR) BER decay, highlighting delay as a practical tuning knob.