The search functionality is under construction.
The search functionality is under construction.

Open Access
Adaptive Space Shift Keying for RIS-Aided Communication

Ming YUE, Yuyang PENG, Liping XIONG, Chaorong ZHANG, Fawaz AL-HAZEMI, Mohammad Meraj MIRZA

  • Full Text Views

    89

  • Cite this
  • Free PDF (2.4MB)

Summary :

In this paper, we propose a novel communication scheme that combines reconfigurable intelligent surface with transmitted adaptive space shift keying (RIS-TASSK), where the number of active antennas is not fixed. In each time slot, the desired candidate antenna or antenna combination will be selected from all available antenna combinations for conveying information bits. Besides, an antenna selection method based on channel gains is proposed for RIS-TASSK to improve the bit error rate (BER) performance and decrease the complexity, respectively. By comparing with the RIS-aided transmitted space shift keying and RIS-aided transmitted generalized space shift keying schemes, the simulation and theoretical results show that the proposed scheme has better BER performance and appropriate complexity.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E107-A No.11 pp.1658-1662
Publication Date
2024/11/01
Publicized
2024/07/09
Online ISSN
1745-1337
DOI
10.1587/transfun.2024EAL2002
Type of Manuscript
LETTER
Category
Digital Signal Processing

1.  Introduction

In recent years, multiple input multiple output (MIMO) technology has become one of the key technologies in wireless communication with the properties of better spectral efficiency and energy efficiency. However, while providing high efficiency, MIMO leads to serious inter-antenna interference due to the multiple antennas, which results in complex demodulation. In order to solve this problem, spatial modulation (SM) as one of the index modulation techniques was developed in [1]. SM systems use the antenna index to convey additional information bits and transmit traditional phase shift keying (PSK) or quadrature amplitude modulation (QAM) symbols by the selected antenna. On the basis of SM technique, a simplified scheme named space shift keying (SSK) was proposed in [2]. Since SSK does not use antenna to transmit the modulated symbols, the decoding process at the receiver is simpler than that of SM, but this simplification is achieved at the expense of losing spectral efficiency. In order to improve the spectral efficiency, generalized space shift keying (GSSK) was proposed in [3]. Unlike SSK, GSSK allows multiple antennas to be activated at the same time and uses antenna combination to transmit information. By exploiting the freedom of MIMO system, an extended space shift keying (ESSK) was proposed in [4], which allows different number of antennas to be activated and improves the performance of bit error ratio (BER) and spectral efficiency. In [5], ESSK was extended to the enhanced spatial modulation (ESM) scheme.

With the development of new materials, reconfigurable intelligent surface (RIS) as an attractive technology for future communication, adjusting the phase of incident wave to improve the received signal quality brings new opportunities for future communication, and it also has great potential in index modulation field [6]. SSK and GSSK schemes applied with RIS were proposed in [7] and [8], respectively, which bring better BER performance and spectral efficiency. To further improve spectral efficiency and maintain considerable BER performance, the other RIS-SSK scheme has been proposed in [9]. The spectral efficiency of existing schemes usually depends on the number of antennas, but increasing antennas may not be practical in some cases, so it is necessary to seek a new transmission mode. Motivated by increasing spectral efficiency without adding antennas, we propose an adaptive transmitted SSK scheme with RIS named RIS-TASSK in this paper to provide better BER performance without increasing antennas.

In the proposed scheme, the system channel is assumed to be frequency flat with Rayleigh fading gains, and the RIS controller is assumed to know the channel state information (CSI) from the transmitter to the RIS and from the RIS to the receiver [6]-[9]. In each time slot, the number of activated antennas is not fixed, and single antenna or antenna combination can be used according to the designed mapping table which makes the transmission more flexible. This novel design allows RIS-TASSK scheme to achieve higher spectral efficiencies under the same number of transmit antennas by comparing with RIS assisted transmitted space shift keying (RIS-TSSK) [10] and RIS assisted transmitted generalized space shift keying (RIS-TGSSK) benchmark schemes. Besides the comparisons, the theoretical BER of RIS-TASSK scheme is also provided and analyzed. By considering all antenna combinations and sorting the channel gains, the antenna combinations with larger channel gains are selected as the candidate combinations for transmission. In this procedure, the transmitter needs to konw the CSI between transmitter and RIS, which can be achieved by using the methods in [11], [12].

2.  System Model

Figure 1 shows the RIS-TASSK scheme where the transmitter is equipped with \(N_{t}\) antennas and the receiver is equipped with single antenna. In each time slot, the transmitter allows \(N_{a}\) antennas to be activated with \(N_{a}\) = 1, 2, …, \(N_{t}\). The direct channel between the transmitter and the receiver is blocked by a barrier, and the RIS equipped with \(N\) reflection elements can effectively reflect the signal to the receiver by adjusting the phase of the incident wave [6]-[10].

Fig. 1  RIS-assisted TASSK system model.

2.1  Transmitter

In this scheme, adaptive space shift keying works at the transmitter, which maps the incoming bits into the indices of antenna combinations. The full set of antenna combinations is denoted as \(\varLambda\) and \(\varLambda(j)\) is a subset of antenna combinations selected from \(\varLambda\), where \(j\) = 1, 2, …, \(\text{J}\) represents the index of subset and J is given by:

\[\begin{equation*} \text{J} =\sum_{N_{a}=1}^{N_{t}}\left(\begin{array}{l} N_{t} \\ N_{a} \end{array}\right)=2^{N_{t}}-1. \tag{1} \end{equation*}\]

The data rate of RIS-TASSK system is determined by the antenna combinations which is shown as:

\[\begin{equation*} m = \lfloor \rm log_{2}(J) \rfloor . \tag{2} \end{equation*}\]

The wireless fading channel between the \(k\)-th transmit antenna and the \(i\)-th reflection element is defined by \(H_{k,i}\), while the channel between the \(i\)-th reflection element and the receive antenna is denoted by \(g_{i}\), where \(k\) = 1, …, \(N_t\) and \(i\) = 1, …, \(N\). Additionally, \(H_{k,i}\) and \(g_{i}\) are assumed to be independent and identically distributed complex Gaussian random variables with \(\mathcal{CN}\)(0,1), which can be expressed as \(H_{k,i}\) = \(\alpha_{k,i}e^{-j\theta_{k,i}}\) and \(g_{i}\) = \(\beta_{i}e^{-j\psi_{i}}\), where \(\alpha_{k, i}\) and \(\beta_{i}\) represent the Rayleigh factors, \(\theta_{k,i}\) and \(\psi_{i}\) represent the channel phases of these two channels. To better understand all antenna combinations, the fused channel formed by the corresponding channel of antenna combinations is regarded as the transmit channel, and the channel corresponding to the \(j\)-th antenna combination can be expressed as:

\[\begin{equation*} \hat{H}_{j,i}= \sqrt{\frac{E}{N_a}}\sum_{k \in \varLambda(j)} H_{k,i} \tag{3} \end{equation*}\]

where \(E\) is the total conveyed signal energy. By constructing (3), the number of available channels is expanded from \(N_{t}\) to J, which can improve the spectral efficiency. Since the number of available antenna combinations is greater than the required, i,e., S = \(2^m\) combinations, therefore, S candidate combinations are selected from J, and the corresponding channel is denoted as \(\hat{H}_{s,i} = \hat{\alpha}_{s,i}e^{-j\theta_{s,i}}\), with \(\hat{\alpha}_{s,i}\) and \(e^{-j\theta_{s,i}}\) being the Rayleigh factor and the channel phase of \(s\)-th selected transmit combination, respectively, where \(s\) = 1, …, S. A mapping sample for RIS-TASSK scheme with \(N_t\) = 4 is given in Table 1. Since the selected candidate combination is obtained, the received signal \(y\) at the receiver can be obtained as:

\[\begin{equation*} y =\sqrt{E}\left(\sum_{i=1}^{N} \hat{\alpha}_{s,i} \beta_{i} e^{j\left(\phi_{i}-\theta_{s, i}-\psi_{i}\right)}\right)+n, \tag{4} \end{equation*}\]

where \(n\) is the additive white Gaussian noise term, which has zero-mean and variance \(N_{0}\), and \(\phi_{i}\) is the adjusted optimal phase for the \(i\)-th reflection element of the RIS to the receiver.

Table 1  Mapping for selected antenna combinations with \(N_t\) = 4.

2.2  Receiver

Assuming that the CSI is perfectly known at the receiver and in order to provide the best detection for RIS-TASSK scheme, maximum likelihood (ML) detector is used to detect the bits conveyed by the index of selected antenna combination, which works as follow:

\[\begin{equation*} q = \operatorname{arg}\underset{s}{\operatorname{min}}\left\{|y-\tilde{y}|^{2}\right\}, \tag{5} \end{equation*}\]

where \(q\) represents estimated antenna combination, \(y\) represents the received signal of selected antenna combination, and \(\tilde{y}\) is defined as:

\[\begin{equation*} \begin{aligned} \tilde{y} &=\!\sqrt{E}\left(\!\sum_{i=1}^{N} \hat{\alpha}_{q,i} \beta_{i} e^{j (\phi_{i}-\theta_{q,i}-\psi_{i})}\! \right), \end{aligned} \tag{6} \end{equation*}\]

which represents that the received signal is estimated and conveyed by the \(q\)-th antenna combination, and \(\theta_{q,i}\) represents the adjusted phases of the signal transmitted from the \(q\)-th estimated antenna combination to the \(i\)-th reflecting element.

3.  Performance Analysis

Assuming the transmitter selects antenna combination \(s\) to convey an unmodulated signal to receiver by the RIS, however, it is detected erroneously as \(q\). The pairwise error probability (PEP) of the RIS-TASSK can be obtained based on the detection of ML in (5), which can be expressed as:

\[\begin{equation*} \begin{aligned} &\operatorname{Pr}\{s \rightarrow q \mid \hat{H}\}\\ &= \operatorname{Pr}\left\{\left|y-\sqrt{E} \hat{H}_{s}\right|^{2}>\left|y-\sqrt{E} \hat{H}_{q}\right|^{2}\right\}\\ &= \operatorname{Pr}(\left\{\left|y-\sqrt{E} \hat{H}_{s}\right|^{2}-\left|y-\sqrt{E} \hat{H}_{q}\right|^{2}\right\}>0)\\ &= \operatorname{Pr}\left\{-\!E\left|\hat{H}_{s}\!-\!\hat{H}_{q}\right|^{2}\!-\!2 \Re\left\{\sqrt{E}\left(\hat{H}_{s}\!-\!\hat{H}_{q}\right) n^*\!\right\}\!>\!0\right\}, \end{aligned} \tag{7} \end{equation*}\]

where \(\hat{H}_{s}=\sum_{i=1}^{N} \hat{\alpha}_{s, i} \beta_{i}, \hat{H}_{q}=\sum_{i=1}^{N} \hat{\alpha}_{q, i} \beta_{i}\), and \(n^*\) is the complex conjugate value of \(n\). To facilitate subsequent calculations, we define

\[\begin{equation*} F = -E\left|\hat{H}_{s}-\hat{H}_{q}\right|^{2}-2 \Re\left\{\sqrt{E}\left(\hat{H}_{s}-\hat{H}_{q}\right) n^*\right\}, \tag{8} \end{equation*}\]

where \(F\) is a Gaussian random variable with mean \(\mu_{F} = -E\left|\hat{H}_{s}-\hat{H}_{q}\right|^{2}\), variance \(\sigma^2_{F} = 2{E}N_{0}\left|\hat{H}_{s}-\hat{H}_{q}\right|^{2}\), and \(\Re\{\cdot\}\) is the real part of a complex number. Considering the PEP can also be calculated using the Q-function from \(P\{F>0\} = Q(-\mu_{F}/\sigma_{F})\), it can be written as follow:

\[\begin{equation*} \operatorname{Pr}(s \rightarrow q \mid \hat{H})=Q\left(\frac{E\left|\hat{H}_{s}-\hat{H}_{q}\right|^{2}}{\sqrt{2 E N_{0}\left|\hat{H}_{s}-\hat{H}_{q}\right|^{2}}}\right). \tag{9} \end{equation*}\]

Moving a step further by denoting \(D\) = \(\hat{H}_{s}-\hat{H}_{q}\), we have:

\[\begin{equation*} D = \sum_{i=1}^{N}\beta_{i}( \hat{\alpha}_{s, i}-\hat{\alpha}_{q, i}). \tag{10} \end{equation*}\]

At this point, \(D\) follows the Gaussian distribution with a zero mean value and a variance value of \(\sigma_{D}^2\). Considering the RIS has sufficiently large number of reflecting elements, i.e., \(N\) \(\gg\) 1, according to the central limit theorem (CLT), \(\sigma_{D}^2\) is calculated as \(N(2-\pi/2)\). Then, we define \(\nu\) = \(|D|^2\), which follows a central chi-square distribution with one degree of freedom, and the average PEP (APEP) can be derived as:

\[\begin{equation*} \begin{aligned} \overline{P}_{e} &= \int_{0}^{\infty} Q\left(\sqrt{\frac{E \nu}{2 N_{0}}}\right) f_{\nu}(\nu) d \nu\\ &= \frac{1}{\pi} \int_{0}^{\frac{\pi}{2}} M_{\nu}\left(-\frac{E}{4 N_{0} \sin ^{2} \eta}\right) d \eta, \end{aligned} \tag{11} \end{equation*}\]

where \(M_{\nu}(\cdot)\) is the moment generating function (MGF) of \(\nu\). In order to obtain the upper bound of APEP, by defining \(t = -\frac{E}{4N_{0}\text{sin}^{2}\eta}\) and \(M_{\nu}(t) = \left(\frac{1}{\sqrt{1-2\sigma_{D}^{2} t}}\right)\), the APEP of RIS-TASSK scheme can be expressed as:

\[\begin{equation*} \begin{aligned} \overline{P}_{e}=\frac{1}{\pi} \int_{0}^{\frac{\pi}{2}}\left(\frac{1}{\sqrt{1+\left(\frac{4-\pi}{2}\right) \frac{N E}{2 N_{0} \sin ^{2} \eta}}}\right) d \eta. \end{aligned} \tag{12} \end{equation*}\]

Eventually, the average bit error rate (ABER) of RIS-TASSK scheme is calculated in the form of a union bound [6] as follows:

\[\begin{equation*} \overline{P}_{b} \leq \frac{1}{ \log _{2} \text{S}} \sum_{q} \overline{P}_{e} \times d(s \rightarrow q)=\frac{\text{S}}{2} \overline{P}_{e}. \tag{13} \end{equation*}\]

where \(d(s \rightarrow q)\) denotes the Hamming distance between the binary representations of \(s\) and \(q\), while \(\sum_{q} d(s \rightarrow q)\) = \((\text{S}/2)\)\(\log_{2}(\text{S})\) represents the number of bits in error for all \(s\).

4.  Antenna Selection and Complexity Analysis with RIS-TASSK

In this section, an antenna selection method with RIS-TASSK scheme is proposed. Furthermore, the complexity of antenna selection and RIS-TASSK scheme are analyzed.

4.1  Antenna Selection Method

Since the available antenna combinations are more than the required antenna combinations and the selected antenna combinations must be a power of 2, we need to select the appropriate antenna combinations. In order to obtain better BER performance, we can flexibly select the antenna combinations with larger channel gains in antenna selection. Therefore, the instantaneous CSI corresponding to the transmit antenna can be used to activate the antenna with larger channel gain1. The channel gains of all possible antenna combinations are sorted as:

\[\begin{equation*} \left\|\hat{H}_{1, i}\right\|^{2}>\left\|\hat{H}_{2,i}\right\|^{2}>\left\|\hat{H}_{3, i}\right\|^{2}>\cdots>\left\|\hat{H}_{\text{J}, i}\right\|^{2} . \tag{14} \end{equation*}\]

In order to understand the process of antenna selection more clearly, Fig. 2 gives the antenna selection method that determines the transmission bits based on the transmit antenna \(N_{t}\). There is an example for \(N_{t}\) = 4 presented in Fig. 2, which shows that all possible antenna combinations are indicated by using indices, and then the channel gains corresponding to these antenna combinations are obtained according to the CSI of these channels. The channel gains corresponding to all antenna combinations are then sorted, and the eight largest ones (Nos. 1, 2, 5, 6, 8, 12, 13 and 15) are selected and the corresponding antenna combinations are chosen as the candidates to convey the incoming information. After the candidate antenna combinations are determined, the input three bits are mapped to these eight candidate antenna combinations. When the incoming bit sequence is 010, the third candidate antenna combination is selected to convey this information. In this way, the BER performance of the system can be improved by selecting the antenna combination with larger channel gain, because the performance of the communication system is affected by the quality of the channel.

Fig. 2  Antenna selection for RIS-TASSK with \(N_t\) = 4.

4.2  Complexity Analysis

The complexity is calculated by the number of complex multiplications and complex additions. The average complexity of antenna selection is calculated as:

\[\begin{equation*} C_{\mathrm{Antenna}-\mathrm{selection}}=\sum_{N_{a}=1}^{N_{t}}\left(\begin{array}{l} N_{t} \\ N_{a} \end{array}\right)\left[\left(NN_{a}+2\right) \right]. \tag{15} \end{equation*}\]

The average complexity of RIS-TASSK is calculated as:

\[\begin{equation*} C_{\mathrm{RIS}-\mathrm{TASSK}}=\left(\left(3+\left(\frac{N_{t}+1}{2}\right)\right) N+2\right) 2^{m}. \tag{16} \end{equation*}\]

where \(\left(\frac{N_{t}+1}{2}\right)\) is the expected value of \(N_a\).

The results of the complexity analysis are summarized in Table 2, which also includes RIS-TSSK and RIS-TGSSK schemes. It is clear that RIS-TSSK scheme has lowest complexity, while RIS-TGSSK and RIS-TASSK schemes have almost the same complexity. It is worth noting that in order to achieve the same spectral efficiency, the required transmit antennas of these three schemes are inconsistent, and the proposed scheme uses the least antennas.

Table 2  Detection complexity analysis summary.

5.  Simulation Results

In this section, the BER performance of the proposed RIS-TASSK scheme as well as its optimization scheme with antenna selection is investigated by Monte Carlo simulations. In the simulations, we compare RIS-TASSK scheme with RIS-TSSK scheme and RIS-TGSSK scheme to demonstrate the better BER performance2.

Firstly, the simulation and theoretical results of RIS-TASSK scheme with different number of reflection elements is shown in Fig. 3. As we can see from the figure, when \(N_{t}\) = 4 and \(N_t\) = 5, the system performance gets better with the increase of SNR. Here, the SNR is defined as E/\(N_0\). In these two cases, it can be observed that doubling the number of reflection elements ensures 4 dB and 5 dB gain in the SNR at BER of \(10^{-2}\). Obviously, the more reflection elements that RIS is equipped with the greater system performance can be achieved. Moreover, the theoretical results are close to the simulation results, especially at high SNR.

Fig. 3  The BER performance of RIS-TASSK system with increasing N in 3 bits/s/Hz and 4 bits/s/Hz.

In Fig. 4, the BER performance of RIS-TASSK scheme is respectively compared with RIS-TSSK scheme in [10] and RIS-TGSSK benchmark scheme. When \(N_t\) in RIS-TASSK scheme are 4 and 5, and the spectral efficiency are 3 bits/s/Hz and 4 bits/s/Hz, respectively. As we can see from the figure, RIS-TASSK has better BER performance than the other two schemes, and this improvement is more significant at high SNR. To achieve the same spectral efficiency, the RIS-TSSK scheme needs to increase the \(N_{t(TSSK)}\) to 8 and 16, and the RIS-TGSSK scheme also needs to increase the \(N_{t(TGSSK)}\) to 5 and 6. In this comparison, the RIS-TASSK scheme also has better BER performance with fewer antennas.

Fig. 4  Comparison of BER performance among RIS-TASSK, RIS-TSSK, and RIS-TGSSK for 3 and 4 bits/s/Hz with \(N\) = 64.

We then extend our analysis to the case of various number of transmit antennas for RIS-TASSK scheme, which is shown in Fig. 5. The results reveal that the BER performance for RIS-TASSK scheme deteriorates with the increase of the number of transmit antennas, and the spectral efficiency increases with the number of transmit antennas. Contrarily to other schemes, RIS-TASSK scheme does not require to adhere to the constraint of having the antenna number as a power of two to enhance spectral efficiency. Consequently, RIS-TASSK scheme can attain superior spectral efficiency without being limited by the antenna number, thereby presenting more feasible transmission.

Fig. 5  The BER performance of RIS-TASSK scheme for various number of transmit antennas under \(N\) = 64.

6.  Conclusion

In this paper, an RIS-TASSK scheme has been proposed for improving BER performance in wireless communication. In addition, an antenna selection method based on CSI have been designed for RIS-TASSK scheme to achieve the performance of ideal BER and lower complexity, respectively. Simulation results have shown that RIS-TASSK has better performance than RIS-TSSK and RIS-TGSSK systems, which indicates that RIS-TASSK can be a good candidate for the future wireless communications.

Acknowledgments

This work was supported by the Science and Technology Development Fund, Macau SAR (0108/2020/A3) and (0079/2023/ITP2). The authors would like to acknowledge the Deanship of Graduate Studies and Scientific Research, Taif University, for funding this work.

References

[1] R.Y. Mesleh, H. Haas, S. Sinanovic, C.W. Ahn, and S. Yun, “Spatial modulation,” IEEE Trans. Veh. Technol., vol.57, no.4, pp.2228-2241, July 2008.
CrossRef

[2] J. Jeganathan, A. Ghrayeb, L. Szczecinski, and A. Ceron, “Space shift keying modulation for MIMO channels,” IEEE Trans. Wireless Commun., vol.8, no.7, pp.3692-3703, July 2009.
CrossRef

[3] J. Jeganathan, A. Ghrayeb, and L. Szczecinski, “Generalized space shift keying modulation for MIMO channels,” Proc. IEEE Int. Symp. Pers., Indoor Mobile Radio Commun., pp.1-5, Sept. 2008.
CrossRef

[4] L. He, J. Wang, C. Pan, and J. Song, “Extended space shift keying scheme for MIMO channels,” 2014 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, pp.1-4, 2014.
CrossRef

[5] H. Qing, H. Yu, Y. Liu, and M. Wen, “Enhanced spatial modulation with generalized antenna selection in MISO channels,” IET Commun., vol.15, no.16, pp.2046-2053, 2021.
CrossRef

[6] E. Basar, “Reconfigurable intelligent surface-based index modulation: A new beyond MIMO paradigm for 6G,” IEEE Trans. Commun., vol.68, no.5, pp.3187-3196, May 2020.
CrossRef

[7] C. Zhang, Y. Peng, J. Li, and F. Tong, “An IRS-aided GSSK scheme for wireless communication system,” IEEE Commun. Lett., vol.26, no.6, pp.1398-1402, June 2022.
CrossRef

[8] M. Yue, Y. Peng, and J. Lee, “RIS-assisted flexible space shift keying for wireless communication system,” IEEE Wireless Commun. Lett., vol.12, no.10, pp.1776-1780, Oct. 2023.
CrossRef

[9] L. Xiong, Y. Peng, and J. Lee, “A partitioned-IRS assisted transmit GSSK scheme for wireless communication system,” IEEE Wireless Commun. Lett., vol.13, no.2, pp.260-264, 2024.
CrossRef

[10] A.E. Canbilen, E. Basar, and S.S. Ikki, “On the performance of RIS-assisted space shift keying: Ideal and non-ideal transceivers,” IEEE Trans. Commun., vol.70, no.9, pp.5799-5810, Sept. 2022.
CrossRef

[11] E. Shtaiwi, H. Zhang, S. Vishwanath, M. Youssef, A. Abdelhadi, and Z. Han, “Channel estimation approach for RIS assisted MIMO systems,” IEEE Trans. Cogn. Commun. Netw., vol.7, no.2, pp.452-465, June 2021.
CrossRef

[12] X. Chen, J. Shi, Z. Yang, and L. Wu, “Low-complexity channel estimation for intelligent reflecting surface-enhanced massive MIMO,” IEEE Wireless Commun. Lett., vol.10, no.5, pp.996-1000, May 2021.
CrossRef

Footnotes

1. Here, the mapping between incoming bits and the candidate channel is assumed to be known at the transmitter [11], [12], and the index corresponding to the candidate channel is in one-to-one correspondence with incoming bits.

2. RIS-TSSK reference scheme is proposed in [10], which can carry out phase cancellation at the receiver according to CSI.

Authors

Ming YUE
  Macau University of Science and Technology
Yuyang PENG
  Macau University of Science and Technology
Liping XIONG
  Macau University of Science and Technology
Chaorong ZHANG
  Macao Polytechnic University
Fawaz AL-HAZEMI
  University of Jeddah
Mohammad Meraj MIRZA
  Taif University

Keyword