betaFeedback

WorksEngineering

Brain-inspired Beam Selection for mmWave RIS Communication

Abstract

Beam selection at large passive reconfigurable intelligent surfaces (RISs) requires either full channel knowledge or beam training, both of which entail unwanted overhead. On the other hand, learned models that predict the optimal codeword from channels sampled at a few active elements avoid both, at the cost of energy-demanding multiply-and-accumulate operations. In this paper, we propose spiking neural network (SNN)-based beam selection for a semi-active RIS assisting a mmWave multiple-input single-output communication system. Direct and sigmoid rate coding are compared against a multi- layer perceptron (MLP) of identical architecture. Energy analysis further reveals that the input layer dominates SNN energy consumption.

Introduction

Reconfigurable intelligent surface (RIS) is a key enabler for high-frequency 6G communications, restoring connectivity when the direct path is obstructed [1]. At millimeter-wave (mmWave) frequencies, the reflected link suffers a double path loss, so the surface needs thousands of meta-elements to provide a useful gain [2]. Selecting the reflection beam that maximizes the rate at the user then becomes costly. Estimating the channel at every element requires an RF chain per element, i.e., a fully active surface, whereas beam training sweeps a codebook whose size grows with the number of elements, at a prohibitive overhead [3].

To address this, deep learning (DL) has been proposed to avoid both requirements. For example, Taha et al. in [2] predicted the optimal codeword from channels sampled at a few active elements. The DL model, however, runs on the RIS controller, whose energy supply is limited, and every inference costs millions of multiply-and-accumulate (MAC) operations. Spiking neural networks (SNNs) target this cost, replacing MACs with accumulations (ACs) triggered only by binary spikes, which neuromorphic processors execute at low energy [4]. SNNs have been applied to RIS phase-shift optimization [5], to beamforming in vehicular integrated sensing and communication [6], and to RIS beam training with spiking input encoders [7]. These works, however, do not examine how the energy per inference of the SNN depends on the system parameters or on the spike encoding of its input.

To bridge the aforementioned critical gap, and in sharp contrast to the energy-intensive conventional DL model of [2] and the unsupervised continuous-phase design of [5], our technical contribution is as follows:

  • We formulate a codebook-constrained reflection beam selection for a semi-active RIS-assisted mmWave multiple-input single-output (MISO) orthogonal frequency division multiplexing (OFDM) system as a supervised regression problem.

  • We design an SNN that predicts each codeword’s maximum achievable rate from the respective channel coefficients sampled at a few randomly placed active elements. Hence, neither full channel state information nor exhaustive beam training is needed.

  • We compare direct coding and sigmoid rate coding to an MLP with identical architecture. Moreover, the rate-energy trade-off is characterized as a function of the number of active elements.

Notation: X\mathbf{X}, x\mathbf{x}, xx, and X\mathcal{X} denote a matrix, vector, scalar, and set, with ∣X∣|\mathcal{X}| the cardinality of X\mathcal{X}, ∣x∣|x| the modulus of xx, xix_i the ii-th entry of x\mathbf{x}, and Xi,jX_{i,j} the (i,j)(i,j)-th entry of X\mathbf{X}. (⋅)T(\cdot)^{\mathrm{T}}, (⋅)H(\cdot)^{\mathrm{H}}, ∥⋅∥\|\cdot\|, vec⁡(⋅)\operatorname{vec}(\cdot), and diag⁡(⋅)\operatorname{diag}(\cdot) denote transpose, conjugate transpose, Euclidean norm, column-wise vectorization, and the diagonal matrix formed from x\mathbf{x}, while ℜ{⋅}\Re\{\cdot\} and ℑ{⋅}\Im\{\cdot\} denote the real and imaginary parts. Bernoulli (p)(p) and CN(μ,σ2)\mathcal{CN}(\mu,\sigma^2) denote the Bernoulli distribution with success probability pp and the complex Gaussian distribution. σ(⋅)\sigma(\cdot) is the sigmoid function.

System Model

In this paper, we consider an RIS-assisted MISO downlink system in the mmWave band. The RIS is deployed at a fixed location to assist the data transmission from the base station (BS) to a single-antenna user. The location of the RIS is known a priori to the BS. In this scenario, the direct link between the BS and the user is blocked and the RIS is placed to provide a virtual line-of-sight (LoS) link. The BS is equipped with NN antennas, while the RIS employs a total of MM elements. We also adopt an OFDM-based transmission with KK subcarriers. Let Gk∈CM×N\mathbf{G}_k \in\mathbb{C}^{M \times N} be the channel between the BS and the RIS, and hk∈CM\mathbf{h}_k \in\mathbb{C}^{M} be the channel between the RIS and the user, at the kk-th subcarrier, respectively. The received signal at the user is expressed as

yk=hkTΨGkwkxk+nk,(1)y_k = \mathbf{h}_k^{\mathrm{T}}\mathbf{\Psi}\mathbf{G}_k\mathbf{w}_k x_k + n_k, \tag*{(1)}

where xkx_k is the transmitted symbol, Ψ=diag⁡(ψ)∈CM×M\mathbf{\Psi} = \operatorname{diag}(\boldsymbol{\psi}) \in\mathbb{C}^{M \times M} is the RIS reflection matrix, with ψ∈CM\boldsymbol{\psi} \in\mathbb{C}^{M} the reflection vector, and wk∈CN\mathbf{w}_k \in\mathbb{C}^{N} denotes the beamforming vector used by the BS at the kk-th subcarrier. The receiver noise is denoted by nk∼CN(0,σn2)n_k \sim\mathcal{CN}(0,\sigma_n^2). Note that, in the above model, paths that reach the RIS more than once are ignored, as their additional hops render their power negligible.

We also assume that the channel knowledge is not available at the RIS. To counterbalance this, the RIS employs a semi-active operation regime [2]. The operation of the RIS occurs in two phases. First, both the BS and the user send pilot symbols to the RIS. After estimating both channels the RIS controller initiates the beam reflection. The channel is reconstructed from independent samples acquired by randomly scattered active elements on the RIS. Each active element is connected to an RF chain for channel estimation. The channels enter (1) only through the cascaded BS–RIS–user channel Ak=diag⁡(hk)Gk∈CM×N\mathbf{A}_k = \operatorname{diag}(\mathbf{h}_k)\mathbf{G}_k \in\mathbb{C}^{M \times N}, as hkTΨGk=ψTAk\mathbf{h}_k^{\mathrm{T}}\mathbf{\Psi}\mathbf{G}_k = \boldsymbol{\psi}^{\mathrm{T}}\mathbf{A}_k. For a given ψ\boldsymbol{\psi} and wk\mathbf{w}_k, the effective channel coefficient is therefore

heff,k=ψTAkwk.(2)h_{\mathrm{eff},k} = \boldsymbol{\psi}^{\mathrm{T}}\mathbf{A}_k\mathbf{w}_k. \tag*{(2)}

The sampled channel, Hˉk∈CMa×N\bar{\mathbf{H}}_k \in\mathbb{C}^{M_a \times N}, at the RIS is obtained by acquiring the channel estimates at MaM_a sparsely placed active elements, for each of the NN BS antennas, and for KDLK_{\mathrm{DL}} of the KK subcarriers, as

Hˉk=Sdiag⁡(hk+n1,k)(Gk+N2,k),k=1,…,KDL,(3)\bar{\mathbf{H}}_k = \mathbf{S}\operatorname{diag}(\mathbf{h}_k+\mathbf{n}_{1,k})(\mathbf{G}_k+\mathbf{N}_{2,k}), \quad k=1,\ldots,K_{\mathrm{DL}}, \tag*{(3)}

where S∈{0,1}Ma×M\mathbf{S} \in\{0,1\}^{M_a \times M} is a sampling matrix that selects the active elements, and n1,k∈CM\mathbf{n}_{1,k} \in\mathbb{C}^{M} and N2,k∈CM×N\mathbf{N}_{2,k} \in\mathbb{C}^{M \times N} are the channel-estimation noise vector and matrix, whose entries are independent CN(0,σe2)\mathcal{CN}(0,\sigma_e^2) across elements, antennas and subcarriers.

To achieve reduced energy consumption at the RIS, each meta-element of the surface is implemented with a discrete phase shifter, which supports a quantized set of angles. To capture this constraint, we assume that the reflection beamforming vector ψ\boldsymbol{\psi} can only be picked from a pre-defined codebook C\mathcal{C}. Every candidate reflection beamforming codeword ψc\boldsymbol{\psi}_c in C\mathcal{C} is assumed to be implemented using discrete phase shifters. In conventional far-field RIS beam training based on angular steering codebooks, the reflection codebook size is typically chosen on the order of the number of RIS elements, i.e., ∣C∣=M|\mathcal{C}| = M, so as to sample the angular space with array-limited resolution [2], [3].

Given (2), our objective is to design the RIS reflection beamforming vector, ψ\boldsymbol{\psi}, and beamforming vector, wk\mathbf{w}_k, to maximize the achievable rate at the receiver, which can be formulated as

R=1K∑k=1Klog⁡2(1+1σn2∣ψTAkwk∣2).(4)R = \frac{1}{K}\sum_{k=1}^{K}\log_2\left(1+\frac{1}{\sigma_n^2}\left|\boldsymbol{\psi}^{\mathrm{T}}\mathbf{A}_k\mathbf{w}_k\right|^2\right). \tag*{(4)}

Each subcarrier has the same power under an equal power allocation scheme, with PtP_t being the total transmission power. The optimization problem can be formulated as

max⁡wk,ψ Rs.t.ψ∈C,∥wk∥2=Pt/K.(5)\max_{\mathbf{w}_k,\boldsymbol{\psi}} \ R \quad\text{s.t.}\quad\boldsymbol{\psi}\in\mathcal{C},\quad\lVert\mathbf{w}_k\rVert^2 = P_t/K. \tag*{(5)}

The optimization problem in (5) has no closed-form solution, and ψ\boldsymbol{\psi} and wk\mathbf{w}_k are coupled. We decouple them with maximal ratio transmission (MRT) at the BS, whose optimal beamforming vector is [8], [9]

wk∗=PtK(ψTAk)H∥ψTAk∥.(6)\mathbf{w}_k^* = \sqrt{\frac{P_t}{K}}\frac{\left(\boldsymbol{\psi}^{\mathrm{T}}\mathbf{A}_k\right)^{\mathrm{H}}}{\left\lVert\boldsymbol{\psi}^{\mathrm{T}}\mathbf{A}_k\right\rVert}. \tag*{(6)}

By applying (6), (5) reduces to an exhaustive search over the codebook,

c∗=arg⁡max⁡c 1K∑k=1Klog⁡2(1+PtKσn2∣ψcTAk∣2)c^* = \underset{c}{\arg\max}\ \frac{1}{K}\sum_{k=1}^{K}\log_2\left(1+\frac{P_t}{K\sigma_n^2}\left|\boldsymbol{\psi}_c^{\mathrm{T}}\mathbf{A}_k\right|^2\right)
s.t.c∈{1,…,∣C∣},ψc∈C(7)\text{s.t.}\quad c\in\{1,\ldots,|\mathcal{C}|\},\qquad\boldsymbol{\psi}_c\in\mathcal{C} \tag*{(7)}

This search, however, requires full channel knowledge, i.e., a fully active RIS, which is prohibitive in hardware cost and energy, while beam training incurs an excessive overhead even under the codebook constraint. Therefore, a learned model instead interpolates the missing channel information from the sampled channels in (3), and an SNN further improves its energy efficiency.

Proposed Spiking Architecture

Input Features

To train the learned models, the sampled channels of each measurement are stacked over the KDLK_{\mathrm{DL}} subcarriers into hˉ=vec⁡([Hˉ1,…,HˉKDL])∈CKDLMaN\bar{\mathbf{h}} = \operatorname{vec}([\bar{\mathbf{H}}_1,\ldots,\bar{\mathbf{H}}_{K_{\mathrm{DL}}}]) \in\mathbb{C}^{K_{\mathrm{DL}}M_aN}, whose real and imaginary parts form the input feature vector

z=[ℜ{hˉ}T,ℑ{hˉ}T]T∈R2KDLMaN.(8)\mathbf{z} = [\Re\{\bar{\mathbf{h}}\}^{\mathrm{T}},\Im\{\bar{\mathbf{h}}\}^{\mathrm{T}}]^{\mathrm{T}} \in\mathbb{R}^{2K_{\mathrm{DL}}M_aN}. \tag*{(8)}

The features are normalized by the largest channel modulus in the dataset, i.e.,

z~=zΔ,Δ=max⁡u∈U,i∣hˉi(u)∣,(9)\tilde{\mathbf{z}} = \frac{\mathbf{z}}{\Delta},\qquad\Delta= \max_{u\in\mathcal{U},i}\left|\bar{h}_i^{(u)}\right|, \tag*{(9)}

where hˉ(u)\bar{\mathbf{h}}^{(u)} is the stacked vector of measurement uu and U\mathcal{U} is the set of measurements, so that z~∈[−1,1]2KDLMaN\tilde{\mathbf{z}} \in[-1,1]^{2K_{\mathrm{DL}}M_aN}.

Input Encoding

Two common encoding schemes for producing spike inputs are direct coding and rate coding [10]. Each encoding scheme leads to different assumptions about hardware implementation and energy consumption of the SNN [11].

Under direct coding, the features drive the first layer directly, i.e., p=z~\mathbf{p}=\tilde{\mathbf{z}}, as in conventional DL. The first layer thus acts as the spike encoder for the rest of the network, and its operations are MACs.

Under rate coding, each feature pip_i is converted into a spike train si=[si,1,…,si,T]T\mathbf{s}_i = [s_{i,1},\ldots,s_{i,T}]^{\mathrm{T}} of TT independent Bernoulli trials, si,t∼Bernoulli⁡(pi)s_{i,t} \sim\operatorname{Bernoulli}(p_i). As the success probabilities must lie in [0,1][0,1], the signed features are mapped as psig=σ(−ρz~)p^{\mathrm{sig}}=\sigma(-\rho\tilde{z}), with ρ=GΔ\rho=G\Delta, so that ρz~=Gz\rho\tilde{z}=Gz, i.e., the fixed gain GG rescales the unnormalized channel coefficients, which are small due to the double path loss, to the sensitive range of the sigmoid.

SNN Architecture

In this work, we employ the leaky integrate-and-fire (LIF) neuron model with reset to zero [10], whose spike generation is described by

st,i(l)=Θ(ut,i(l)−uth,i(l)),(10)s_{t,i}^{(l)}=\Theta\left(u_{t,i}^{(l)}-u_{\mathrm{th},i}^{(l)}\right), \tag*{(10)}

where ut,i(l)u_{t,i}^{(l)} is the membrane potential at time step tt, for the ii-th neuron of the ll-th layer of the SNN, uth,i(l)u_{\mathrm{th},i}^{(l)} is the threshold potential at the ii-th neuron of the ll-th layer, and Θ(⋅)\Theta(\cdot) is the Heaviside step function. For the 0-th time step we have u0,i(l)=0u_{0,i}^{(l)}=0 and s0,i(l)=0s_{0,i}^{(l)}=0. The corresponding discrete-time membrane dynamics are

ut,i(l)=β(1−st−1,i(l))ut−1,i(l)+∑jWi,j(l)st,j(l−1),(11)u_{t,i}^{(l)}=\beta\left(1-s_{t-1,i}^{(l)}\right)u_{t-1,i}^{(l)}+\sum_j W_{i,j}^{(l)}s_{t,j}^{(l-1)}, \tag*{(11)}

where Wi,j(l)W_{i,j}^{(l)} is the weight connecting pre-synaptic neuron jj to post-synaptic neuron ii, β\beta is the membrane-potential decay rate. When a neuron spikes, its accumulated potential is discarded, so at the next time step it integrates only the fresh input current.

In regression tasks, the output layer typically consists of leaky-integrator (LI) neurons to accumulate incoming spikes without generating output spikes [12]. This is achieved by disabling the reset mechanism and setting the firing threshold sufficiently high to prevent spike generation. The LI output therefore provides a continuous-valued representation through membrane readout, which is appropriate for the regression task at hand [13].

Computational Energy Model

Inference cost is measured in synaptic operations. A dense layer performs Nin(l)Nout(l)N_{\mathrm{in}}^{(l)}N_{\mathrm{out}}^{(l)} MAC operations, so a conventional MLP regressor with NlN_l layers requires

OMLP=∑l=1NlNin(l)Nout(l),(12)O_{\mathrm{MLP}}=\sum_{l=1}^{N_l}N_{\mathrm{in}}^{(l)}N_{\mathrm{out}}^{(l)}, \tag*{(12)}

operations per inference. In a spiking layer, by contrast, an operation is triggered only when a presynaptic neuron fires, and each such event costs a single accumulation (AC), since the binary spikes reduce the product Wi,j(l)st,j(l−1)W_{i,j}^{(l)}s_{t,j}^{(l-1)} in (11) to a conditional addition of the weight. The relevant quantity is therefore the spike count per neuron per inference,

ζ(l)=Ospike(l)Oneuron(l),(13)\zeta^{(l)}=\frac{O_{\mathrm{spike}}^{(l)}}{O_{\mathrm{neuron}}^{(l)}}, \tag*{(13)}

where Ospike(l)O_{\mathrm{spike}}^{(l)} counts the spikes emitted across all TT time steps by the Oneuron(l)=Nin(l)O_{\mathrm{neuron}}^{(l)}=N_{\mathrm{in}}^{(l)} presynaptic neurons of layer ll, i.e., by the input spike trains for l=1l=1, so that ζ(l)\zeta^{(l)} is bounded by TT rather than by unity. A rate-coded SNN then requires

OSNNrate=∑l=1Nlζ(l)Nin(l)Nout(l)(14)O_{\mathrm{SNN}}^{\mathrm{rate}}=\sum_{l=1}^{N_l}\zeta^{(l)}N_{\mathrm{in}}^{(l)}N_{\mathrm{out}}^{(l)} \tag*{(14)}

accumulations [14].

Under direct coding, the first layer receives continuous values, so its operations are MACs. The input current is constant over the simulation window and is evaluated once per inference, giving

OSNNdrct=Nin(1)Nout(1)+∑l=2Nlζ(l)Nin(l)Nout(l),(15)O_{\mathrm{SNN}}^{\mathrm{drct}}=N_{\mathrm{in}}^{(1)}N_{\mathrm{out}}^{(1)}+\sum_{l=2}^{N_l}\zeta^{(l)}N_{\mathrm{in}}^{(l)}N_{\mathrm{out}}^{(l)}, \tag*{(15)}

where the first spiking layer acts as the encoder for the remainder of the network. The energy per inference is

E=EMACOMAC+EACOAC,(16)E=E_{\mathrm{MAC}}O_{\mathrm{MAC}}+E_{\mathrm{AC}}O_{\mathrm{AC}}, \tag*{(16)}

with OMAC=Nin(1)Nout(1)O_{\mathrm{MAC}}=N_{\mathrm{in}}^{(1)}N_{\mathrm{out}}^{(1)} and OACO_{\mathrm{AC}} the summation term of (15) for direct coding, OMAC=0O_{\mathrm{MAC}}=0 and OAC=OSNNrateO_{\mathrm{AC}}=O_{\mathrm{SNN}}^{\mathrm{rate}} for rate coding, OMAC=OMLPO_{\mathrm{MAC}}=O_{\mathrm{MLP}}, OAC=0O_{\mathrm{AC}}=0 for the MLP. Following [14], (16) accounts for synaptic operations, which dominate the inference cost of fully connected architectures of this size. A spiking layer is cheaper than its MAC counterpart only while ζ(l)<EMAC/EAC≈5.1\zeta^{(l)}<E_{\mathrm{MAC}}/E_{\mathrm{AC}}\approx5.1. The final arg max over the ∣C∣|\mathcal{C}| outputs adds ∣C∣|\mathcal{C}| comparisons, which is negligible.

Simulation and Results

Simulation setup

In this section, the SNN-based beam selection is evaluated against the MLP in terms of achievable rate and inference energy. Channels are generated with DeepMIMO [15] for the O1 scenario at 28 GHz, with a single path (L=1L=1) per link, a bandwidth of B=100B=100 MHz and K=512K=512 subcarriers, of which the first KDL=64K_{\mathrm{DL}}=64 are used as learned model inputs. The BS employs a 2×22\times2 uniform planar array (N=4N=4) with transmit power Pt=5P_t=5 dBW at a fixed position (row 850, column 90 of the O1 user grid), and the RIS has 64×6464\times64 (M=4096M=4096) elements with half-wavelength spacing.

The reflection codebook is a DFT codebook with ∣C∣=M|\mathcal{C}|=M codewords, and Ma∈{4,8,16}M_a\in\{4,8,16\} active elements are selected at random, with Ma=8M_a=8 unless stated otherwise. The 36200 candidate receiver positions (rows 1000 to 1199) are split at random into 30000 training and 6200 evaluation users, so training and evaluation positions are spatially interleaved. Each user corresponds to a receiver position, i.e., a distinct channel realization and optimal codeword, so that the training size is the number of positions observed by the models.

The sampled measurements at the MaM_a active elements are corrupted by channel-estimation noise, whereas the “ground-truth” labels are computed from the noiseless cascaded channel. The channel-estimation noise variance, σe2\sigma_e^2, is the noise power per subcarrier, −204-204 dBW/Hz +10log⁡10(B/K)+10\log_{10}(B/K) with a 5 dB noise figure and a 10 dB processing gain, i.e., −156.1-156.1 dBW, normalized by the 5 dBW transmit power and the 3 dBi antenna gains at the BS and the user, i.e., σe2≈−167.1\sigma_e^2\approx-167.1 dB.

All models minimize the mean square error to the training targets, i.e., the achievable rates of the ∣C∣|C| codewords, normalized per user by their maximum so that the model is not biased towards users with strong channels. Moreover, all models are trained with the AdamW optimizer, i.e., Adam with decoupled weight decay, with momentum parameters (0.9,0.999)(0.9, 0.999), a batch size of 500 and no dropout, for at most 200 epochs, stopping after 8 epochs without improvement of the validation loss and retaining the best weights. The MLP uses a learning rate of 10−310^{-3}, halved every 20 epochs, and a weight decay of 10−210^{-2}, whereas the SNNs use a constant learning rate of 10−410^{-4} without weight decay. The SNNs are trained by backpropagation through time with T=5T = 5, a fast-sigmoid surrogate gradient of slope 25, with the LIF thresholds initialized uniformly in [0,1][0, 1], a membrane decay rate β=0.9375=1−2−4\beta= 0.9375 = 1 - 2^{-4}, which allows the leak to be computed with a bit shift and a subtraction in fixed-point neuromorphic hardware, and a reset to zero, while the output LI neurons use β=1\beta= 1 and no reset, and the rate encoder uses G=1012G = 10^{12}, i.e., ρ≈8.3\rho\approx8.3 for Ma=8M_a = 8.

To remain deployable on neuromorphic processors, whose neurons and synapses share a limited on-chip memory [4], the network size is kept bounded. Hidden widths that scale with the codebook, e.g., ∣C∣|C|, 4∣C∣4|C| and 4∣C∣4|C|, would require about 4.2×1084.2 \times10^{8} weights for a 64×6464 \times64 RIS with Ma=8M_a = 8. All models therefore share Nl=4N_l = 4 weight layers, with 2KDLMaN2K D_L M_a N inputs, three hidden layers of 500 neurons, selected empirically, and ∣C∣|C| outputs, i.e., about 4.6×1064.6 \times10^{6} weights for Ma=8M_a = 8. In contrast to β\beta, the thresholds are optimized jointly with the weights, so that each layer adapts its firing sparsity to the dynamic range of its input current.

Achievable Rate

Two types of accuracy are used for evaluating our implementations, the top-1 beam accuracy, i.e., the fraction of evaluation users for which the selected codeword coincides with the optimal one, and the rate accuracy defined as the ratio between the rate achieved by the selected beam and the optimal rate. Both accuracies are evaluated on the first subcarrier, so that (4) reduces to its k=1k = 1 term, and averaged over the 6200 held-out users.

For the 64×6464 \times64 RIS with Ma=8M_a = 8 and 30000 training users, the MLP attains a top-1 beam accuracy of 95.2% and a rate accuracy of 99.65%, the direct-coded SNN 90.5% and 98.18%, and the rate-coded SNN 87.4% and 96.92%. For every model, the rate accuracy exceeds the top-1 beam accuracy, i.e., most mis-selected codewords provide a gain close to the optimal one. This is consistent with Figure 1, where mis-selections appear at the boundaries between adjacent codewords, whose beams are nearly equivalent. On the training users, the top-1 beam accuracy is slightly higher, namely 95.7%, 91.7% and 88.9%, indicating that all three models generalize to the interleaved evaluation positions.

Selected reflection beamforming index over the receiver grid for the 64 × 64 RIS with $M_a = 8$ active elements, with panels (a)–(d)

Figure 1. Selected reflection beamforming index over the receiver grid for the 64×6464 \times64 RIS with Ma=8M_a = 8 active elements. (a) Optimal beams, (b) MLP baseline, (c) direct-coded SNN with T=5T = 5, and (d) rate-coded SNN with T=5T = 5.

Figure 2 shows the achievable rate against the number of training users, with the optimal rate of 7.02 bps/Hz as reference. All models improve monotonically with the training set size, but the spiking models require more data: with 10000 training users, the MLP attains a rate accuracy of 97.8%, against 93.1% and 87.4% for the direct- and rate-coded SNNs, and the gaps narrow at 30000 users. Among the brain-inspired models, direct coding attains the higher accuracy, while the lower accuracy of rate coding is consistent with studies reporting an accuracy penalty for rate encoding [11].

Figure 2. Achievable rate against the number of training users for Ma=8M_a = 8 and T=5T = 5.

Energy Efficiency and Rate–Energy Trade-off

Next, the inference energy of the three models is compared, using (16) with EMAC=4.6E_{\mathrm{MAC}} = 4.6 pJ and EAC=0.9E_{\mathrm{AC}} = 0.9 pJ for a 45 nm, 32-bit design [16]. For Ma=8M_a = 8, the MLP requires 21.14 μ\muJ per inference, against 10.04 μ\muJ for the direct-coded and 5.67 μ\muJ for the rate-coded SNN, i.e., 2.1 times and 3.7 times less energy at a rate accuracy loss of 1.5 and 2.7 percentage points. The spiking layers are sparse, with the hidden neurons firing on average 0.10 and 0.14 times per time step, so that ζ(l)≈0.5\zeta^{(l)} \approx0.5 and 0.7, well below the break-even value EMAC/EAC≈5.1E_{\mathrm{MAC}}/E_{\mathrm{AC}} \approx5.1. The consumption of both SNNs is therefore dominated by the input layer, which accounts for 93.8% and 81.3% of the total, against 44.6% for the MLP. Under rate coding, the normalized features are symmetric around zero, so the sigmoid encoder fires at an average rate of 0.5 per time step, i.e., ζ(1)=T/2\zeta^{(1)} = T/2 in (14). Comparing the first term of (14) with that of (12) and (15), the rate-coded input layer costs TEAC/(2EMAC)≈0.49T E_{\mathrm{AC}/(2E_{\mathrm{MAC}}) \approx0.49} of its MAC counterpart at T=5T = 5. By the break-even condition ζ(1)<EMAC/EAC\zeta^{(1)} < E_{\mathrm{MAC}}/E_{\mathrm{AC}}, this advantage vanishes for T>2EMAC/EAC≈10T > 2E_{\mathrm{MAC}}/E_{\mathrm{AC}} \approx10, a regime not considered in Figure 3.

Figure 3. Achievable rate against inference energy for Ma∈{4,8,16}M_a \in\{4,8,16\} active elements, for the 64×6464 \times64 RIS with T=5T = 5 and 30000 training users.

Figure 3 shows the resulting rate–energy trade-off over the number of active elements. The MLP saturates already at Ma=4M_a = 4, with a rate accuracy of 99.5–99.7%, whereas both SNNs benefit from additional active elements, from 96.8% to 98.7% under direct coding and from 96.2% to 97.2% under rate coding. Since every input feature adds 500 synaptic operations to the input layer, the energy of all models grows with MaM_a. The MLP and the direct-coded SNN grow identically, so the direct-coded SNN saves a constant 11.1 μ\muJ, and its energy reduction shrinks from 3.1 times at Ma=4M_a = 4 to 1.6 times at Ma=16M_a = 16. The rate-coded SNN grows at half the slope, retaining a reduction of 4.9 times to 3.0 times.

The non-dominated configurations are the rate-coded SNN, the direct-coded SNN and the MLP, each at Ma∈{4,8}M_a \in\{4,8\}. At Ma=16M_a = 16, the direct-coded SNN (98.65%, 19.5 μ\muJ) is dominated by the MLP at Ma=4M_a = 4 (99.52%, 16.4 μ\muJ), and the rate-coded SNN by the direct-coded SNN at Ma=8M_a = 8. As every active element also requires an RF chain, a small MaM_a is preferable for the RIS, with the encoder selecting the operating point on the front, i.e., direct coding for a higher rate and rate coding for a lower energy.

Conclusion

In this letter, an SNN-based beam selection scheme was presented for a semi-active RIS, which predicts the achievable rate of every codeword from channels sampled at a few active elements. For a 64×6464 \times64 RIS, direct and rate coding attain 98.2% and 96.9% of the optimal rate at 2.1 and 3.7 times lower inference energy than an MLP of identical architecture, which attains 99.7%. As the input layer dominates the SNN energy, the advantage of direct coding shrinks as the number of active elements grows, whereas rate coding retains a 3.0 to 4.9 times reduction. The encoder thus selects the operating point on the rate–energy front.

References

References

  1. [1]A.-A. A. Boulogeorgos and A. Alexiou, “Performance analysis of reconfigurable intelligent surface-assisted wireless systems and comparison with relaying,” IEEE Access, vol. 8, pp. 94463–94483, May 2020.DOI
  2. [2]A. Taha, M. Alrabeiah, and A. Alkhatibee, “Enabling large intelligent surfaces with compressive sensing and deep learning,” IEEE Access, vol. 9, pp. 44304–44321, March 2021.arxiv.org/abs/1904.10136
  3. [3]X. Wei, L. Dai, Y. Zhao, G. Yu, and X. Duan, “Codebook design and beam training for extremely large-scale RIS: Far-field or near-field?,” China Commun., vol. 19, pp. 193–204, June 2022.arxiv.org/abs/2109.10143
  4. [4]M. Davies et al., “Laiho: A neuromorphic manycore processor with on-chip learning,” IEEE Micro, vol. 38, pp. 82–99, January 2018.DOI
  5. [5]C. G. Tsinos, A.-A. A. Boulogeorgos, and T. A. Tsiftsis, “NeuroRIS: Neuromorphic-inspired metasurfaces,” IEEE Wireless Commun. Lett., vol. 13, pp. 1878–1882, July 2024.arxiv.org/abs/2312.14548
  6. [6]C. Shang, J. Yu, and D. T. Hoang, “Energy-efficient and intelligent ISAC in V2X networks with spiking neural networks-driven DRL,” IEEE Trans. Wireless Commun., vol. 25, pp. 1182–1195, July 2026.DOI
  7. [7]T. Urakami, H. Jia, D. Zhao, N. Chen, and M. Okada, “Individual-driven spiking-mixer deep learning model for IRS-assisted mmWave systems beam training,” in Proc. IEEE Global Conf. Consum. Electron. (GCCE), pp. 296–297, October 2023.DOI
  8. [8]P. Wang et al., “Intelligent reflecting surface-assisted millimeter wave communications: Joint active and passive precoding design,” IEEE Trans. Veh. Technol., vol. 69, pp. 14960–14973, December 2020.DOI
  9. [9]X. Cheng et al., “Joint optimization for RIS-assisted wireless communications: From physical and electromagnetic perspectives,” IEEE Trans. Commun., vol. 70, pp. 606–620, January 2022.DOI
  10. [10]J. K. Ekshraghian et al., “Training spiking neural networks using lessons from deep learning,” Proc. IEEE, vol. 111, pp. 1016–1054, September 2023.
  11. [11]Y. Kim et al., “Rate coding or direct coding: Which one is better for accurate, robust, and energy-efficient spiking neural networks?,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), pp. 71–75, May 2022.
  12. [12]U. Rançon, J. Cuadrado-Anibarro, B. R. Cottereau, and T. Masquelier, “StereoSpike: Depth learning with a spiking neural network,” IEEE Access, vol. 10, pp. 127428–127439, December 2022.
  13. [13]A. Henkes, J. K. Ekshraghian, and H. Wessels, “Spiking neural networks for nonlinear regression,” R. Soc. Open Sci., vol. 11, p. 231606, May 2024.
  14. [14]S. Kundu, G. Datta, M. Pedram, and P. A. Beeral, “Spike-Thrift: Towards energy-efficient deep spiking neural networks by limiting spiking activity via attention-guided compression,” in Proc. IEEE/CVF Winter Conf. Appl. Comput. Vis. (WACV), pp. 3953–3962, January 2021.DOI
  15. [15]A. Alkhatibee, “DeepMIMO: A generic deep learning dataset for millimeter wave and massive MIMO applications,” arXiv:1902.06435, February 2019.arxiv.org/abs/1902.06435
  16. [16]M. Horowitz, “1.1 Computing’s energy problem (and what we can do about it),” in Proc. IEEE Int. Solid-State Circuits Conf. (ISSCC), pp. 10–14, February 2014.DOI

Paper details

vlnc:W_v2z5tyq3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents