A signal detection method based on RIS-SM

By using improved maximum ratio merging algorithm and tree search decoder in RIS-SM system, the problem of high complexity of signal detection methods is solved, faster and more efficient signal detection performance is achieved, and calculation complexity and time are reduced .

CN116318532BActive Publication Date: 2024-12-06CHONGQING UNIV OF POSTS & TELECOMM
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211464956.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-11-22
Publication Date
2024-12-06
Estimated Expiration
2042-11-22

AI Technical Summary

Technical Problem

The existing signal detection methods are complex and cannot be approximately optimal in detection performance. Especially in MIMO systems, there are problems of inter-channel interference and inter-antenna synchronization, which is difficult to implement in hardware.

Method used

Using RIS-SM-based signal detection method, pilot information is sent through the client and split into index bits and modulation bits, the cascade estimation channel is calculated using the LS algorithm, and the improved maximum ratio merging algorithm MMRC and minimum cumulative Euclidean distance is used. The tree search decoder reduces the number of calculation nodes and reduces the search space.

Benefits of technology

It significantly reduces the complexity and time complexity of signal detection, and achieves a faster detection speed, which is close to the optimal detection performance compared to traditional methods.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116318532B_ABST
    Figure CN116318532B_ABST
Patent Text Reader

Abstract

The present invention relates to a signal detection method based on RIS-SM, comprising: a client sends pilot information to a base station and selects a target transmitting antenna according to an index bit; selects a target modulation symbol from a modulation symbol set according to a modulation bit; transmits the modulation symbol to a RIS through a UE-RIS channel through the target transmitting antenna, and then transmits the modulation symbol to the base station through a RIS-base station channel after reflection; the base station calculates a cascade estimation channel by using an LS algorithm according to a received signal and a pilot signal; and calculates an optimal transmitting antenna index set by using an improved maximum ratio combining algorithm MMRC according to the received signal and the cascade estimation channel; the base station combines the index of the transmitting antenna in the optimal transmitting antenna index set with the modulation symbols in all modulation symbol sets to construct a tree decoder; and uses the tree decoder and a maximum and minimum Euclidean distance criterion to jointly detect the index of the target transmitting antenna and the modulation symbol to restore information bits.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of communication technology, and in particular relates to a signal detection method based on RIS-SM. Background Art

[0002] 6G wireless communication aims to meet the needs of high rates and support for a large amount of heterogeneous traffic in various applications. These requirements are very important for supporting extended reality, smart healthcare, automatic vehicle control, dense cellular connections, etc. With the integration of multiple wireless access technologies in the future and the access of massive smart devices, the new 6G-oriented heterogeneous network faces severe challenges in terms of energy consumption, system capacity and reliability. In order to reduce energy consumption and improve service quality, communication through RIS has been proposed as a candidate technology for 6G. At the same time, since spatial modulation (SM) has a good balance between spectrum efficiency and energy efficiency, and can avoid the problems of inter-channel interference and inter-antenna synchronization in MIMO systems, it has been widely studied in intelligent traffic systems (ITS), Internet of Things and other systems. Introducing the concept of RIS-assisted communication into SM and combining it with SM can better play the advantages of SM and make up for the shortcomings of MIMO systems. As a promising candidate technology for the future 6G heterogeneous network integration technology, the RIS-assisted spatial modulation (RIS-SM) system may be used in systems that highly focus on reliability, such as ITS. Therefore, the research on the RIS-SM system is very important.

[0003] The maximum likelihood (ML) algorithm is one of the classic signal detection algorithms. Although the ML algorithm has the best detection performance, it needs to check all nodes, and the detection complexity is very high, making the algorithm difficult to implement in hardware. In addition, some known solutions using the ML criterion, such as sphere decoding (SD) and QR decomposition of M-order maximum likelihood decoding, maintain the best performance, but still have some disadvantages. For example, the SD complexity is highly dependent on the initial value of the search radius: if the initial radius is too small, the index and transmission symbols may not be correctly detected. However, if the search radius is too large, the search space may become very large and the complexity is still very high. Compared with SD, the QR decomposition technology of M-order maximum likelihood decoding has a fixed throughput and is suitable for hardware implementation. However, for higher-order modulation methods, it still has high complexity. Summary of the invention

[0004] In order to solve the problem that the existing signal detection method is highly complex and the detection performance cannot be close to the optimal, the present invention provides a signal detection method based on RIS-SM, comprising:

[0005] S1: The client sends pilot information to the base station The information bits of each transmission time slot are split into two parts: space bits and baseband bits; a target transmitting antenna is selected according to the index bit; a target modulation symbol is selected from the modulation symbol set according to the modulation bit;

[0006] S2: The client transmits the modulation symbol to the RIS through the target transmitting antenna via the UE-RIS channel. The RIS reflects the signal and transmits the reflected signal to the base station via the RIS-base station channel. The base station obtains the received signal Y.

[0007] S3: The base station receives the signal Y and the pilot signal Calculate the cascaded estimated channel using the LS algorithm And estimate the channel based on the received signal Y and the cascade The optimal transmit antenna index set is calculated using the improved maximum ratio combining algorithm MMRC;

[0008] S4: The base station combines the index of the transmitting antenna in the optimal transmitting antenna index set with the modulation symbols in all modulation symbol sets to construct a tree decoder;

[0009] S5: The base station performs joint detection on the index and modulation symbol of the target transmitting antenna using a tree decoder according to the received signal; and restores the information bit according to the mapping relationship between the information bit of each transmitting time slot and the index and modulation symbol of the target transmitting antenna.

[0010] The present invention has at least the following beneficial effects

[0011] The present invention reduces the number of nodes required for calculation through a tree search decoder with minimum cumulative Euclidean distance. At the same time, the most likely L-root transmit antenna index set is obtained according to MMRC, which reduces the search space. Compared with traditional signal detection, the present invention has lower complexity and faster detection speed. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 is a flow chart of the method of the present invention;

[0013] Figure 2 It is a schematic diagram of the process framework of the present invention;

[0014] Figure 3 It is a structural schematic diagram of a tree decoder of the present invention;

[0015] Figure 4 Schematic diagram of the structure of a tree decoder in an embodiment of the present invention;

[0016] Figure 5A diagram comparing the complexity of the signal detection of the present invention and the traditional method at different transmitting and receiving antennas;

[0017] Figure 6 BER analysis in different configurations for signal detection of the present invention and conventional signal detection;

[0018] Figure 7 The figure is a performance comparison diagram of the present invention and traditional signal detection. DETAILED DESCRIPTION

[0019] The following describes the embodiments of the present invention by specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the illustrations provided in the following embodiments only illustrate the basic concept of the present invention in a schematic manner, and the following embodiments and the features in the embodiments can be combined with each other without conflict.

[0020] See also Figure 1 The present invention provides a signal detection method based on RIS-SM, comprising:

[0021] S1: The client sends pilot information to the base station The information bit of each transmission time slot is split into two parts: an index bit and a modulation bit; a target transmitting antenna is selected according to the index bit; a target modulation symbol is selected from a modulation symbol set according to the modulation bit;

[0022] The information bits (log2(N t )+log2(M)) is split into index bits log2(N t ) and modulation bits log2(M), N t represents the number of transmitting antennas, and M represents the modulation order. For example, when the number of transmitting antennas is N t is 4, the modulation order M is 4, each group has 4 information bits, and assuming that there is an information sequence of 1001, it means that the selected transmitting antenna index is 3, and the symbol is the second symbol among the normalized energy M modulation symbols.

[0023] See also Figure 2 , the client includes N t The modulation symbol set has M modulation symbols, and the RIS is N=N hor N ver Reflection units, N hor is the number of RIS reflector units in each row, N verThe number of RIS firing units per column is controlled by a microcontroller.

[0024] S2: The client transmits the modulation symbol to the RIS through the target transmitting antenna via the UE-RIS channel. The RIS reflects the signal and transmits the reflected signal to the base station via the RIS-base station channel. The base station obtains the received signal Y.

[0025] Y=HX l,s +n=(H) l s+n

[0026]

[0027] Where Y represents the received signal obtained by the base station, l represents the index of the target transmitting antenna, s represents the target modulation symbol, and N t Indicates the number of transmitting antennas owned by the client, H represents the actual cascade channel between UE-RIS-base station, (H) l represents the lth column of H, and n represents additive Gaussian white noise with mean 0 and variance N0.

[0028] S3: The base station receives the signal Y and the pilot signal Calculate the cascaded estimated channel using the LS algorithm And estimate the channel based on the received signal Y and the cascade The optimal transmit antenna index set is calculated using the improved maximum ratio combining algorithm MMRC;

[0029]

[0030] represents the pilot signal, represents the cascaded estimation channel, express The conjugate transpose of , Y represents the received signal.

[0031] The channel is estimated based on the received signal Y and the cascade The optimal transmit antenna index set calculated using the improved maximum ratio combining algorithm MMRC includes:

[0032] S31: First, estimate the channel based on the received signal Y and the cascade Calculate the characteristic factors of the transmitting antenna;

[0033]

[0034] Among them, ξ i represents the characteristic factor of the i-th transmitting antenna, represents the cascade estimated channel, Y represents the received signal, represents the cascade estimated channel matrix The i-th column element of .

[0035] S32: Select L transmitting antennas with the largest characteristic factors from the characteristic factors of the transmitting antennas as the optimal transmitting antenna set.

[0036]

[0037] Among them, |ξ i | represents the modulus of the characteristic factor of the transmitting antenna, and χ represents the optimal transmitting antenna set.

[0038] See also Figure 3 , S4: the base station combines the index of the transmitting antenna in the optimal transmitting antenna index set with the modulation symbols in all modulation symbol sets to construct a tree decoder;

[0039] Divide the tree decoder into N r Level, each level has L×M nodes, and each branch corresponds to a detection combination;

[0040] S5: The base station performs joint detection on the index and modulation symbol of the target transmitting antenna using a tree decoder according to the received signal; and restores the information bit according to the mapping relationship between the information bit of each transmitting time slot and the index and modulation symbol of the target transmitting antenna.

[0041] S51: Set the initial access vector U of the tree decoder; and calculate the Euclidean distance of all nodes at the first level in the tree decoder; the Euclidean distance of each node at the first level is y1 and The Euclidean distance between

[0042]

[0043] i=1,2,....,L

[0044] j=1,2,....,M

[0045] Among them, y1 represents the first element in the received signal vector Y, represents the cascaded estimated channel Line 1, No. 1 i The access vector for the elements of the column is U = [u1,u2,...,u i ,...,u L×M ] represents the level tree where each node is currently located in the tree search;

[0046] Since the algorithm needs to calculate the Euclidean distance of all nodes in the first level of the tree search, that is, the cumulative Euclidean distance of the first receiving antenna, it is initialized as The Euclidean distance vector of each node at the first level is expressed as The Euclidean distances of all nodes at the first level in the tree decoder are the Euclidean distances of all possible combinations of L transmitting antennas and M symbols on the first receiving antenna.

[0047] S52: Find the index position w of the node with the smallest Euclidean distance from the Euclidean distance vector D1 of all nodes at the first level of the tree decoder, and update the corresponding position of the access vector U of the tree decoder according to the index position w, and execute S53;

[0048] The updating of the elements in the access vector U of the tree decoder comprises:

[0049] u w =u w +1,u w ∈U

[0050] Among them, the access vector of the U tree decoder, u w Represents the element corresponding to index position w in the access vector U in the tree decoder.

[0051] The index position w of the node with the smallest Euclidean distance includes:

[0052] w=arg min{D1}

[0053] w=1,2,...,L×M

[0054] Wherein, w represents the index position of the smallest element among the L×M elements in D1.

[0055] S53: Determine whether there is an element in the updated access vector U that is greater than N r , if it exists, execute S55, otherwise, execute S54;

[0056] S54: Expand to the next level node of the branch corresponding to the smallest element in the Euclidean distance vector D1 of each node in the first level, assuming that the antenna index and transmission symbol corresponding to the smallest branch are l i and j , at this time the level corresponding to the next level node is u w , update the index position w where the element with the minimum Euclidean distance is located and execute S52;

[0057]

[0058] Among them, l i represents the transmit antenna index corresponding to the branch, j represents the index of the transmission symbol of the branch, Represents the updated front u w The cumulative Euclidean distance of the root receiving antennas, Representation Matrix uth w Line 1 i Elements of a column.

[0059] S55: according to the access vector U greater than N r , find the index of the target transmit antenna and the target modulation symbol.

[0060] In the embodiment, when the index of the transmitting antenna is l i , the transmission symbol is s j When , the cumulative Euclidean distance of the first k antennas, that is, the cumulative Euclidean distance of the kth level of the branch is Among them, k, (l i , j) represents the position in the tree search as antenna index l i and transmission symbol s j The k-th level node under the branch, Indicates the cumulative minimum Euclidean distance corresponding to the node, y i Represents the i-th element in the received signal vector Y. Therefore, the combination corresponding to the minimum value of the node value at the end of each branch is the result of signal detection. In tree detection, there are L main branches, representing the L most likely transmit antennas selected by MMRC, and each main branch has M branches, representing M possible modulation symbols. Therefore, there are a total of L×M branches in the tree decoder, representing all combinations of L transmit antennas and M transmission symbols. Figure 4 In the example, M=2, N t =4,N r =4, L=2. The process of constructing a tree search decoder is as follows: First, according to the MMRC algorithm in S31, four characteristic factors are obtained, and the two largest ones are taken. The transmitting antenna indexes corresponding to the two largest characteristic factors are l1 and l2 respectively. Therefore, there are 4 possible combinations of antenna indexes and transmission symbols, namely (l1, s1), (l1, s2), (l2, s1) and (l2, s2), which correspond to the 4 branches of the tree in the figure below. The depth of the tree is N r , starting from the first level, each node in the tree represents the cumulative minimum Euclidean distance between the branch and the level.

[0061] by Figure 4 Taking the tree search decoder in as an example, if the values ​​of each node in the tree are as follows, the search process of the proposed tree search decoder is introduced below.

[0062] First, according to S51 Calculate the cumulative Euclidean distance of all nodes in the first level, that is, U is initialized to U = [1, 1, 1, 1], and then S52 is executed. The first element in D1 is the smallest, so U is updated to U = [2, 1, 1, 1]. Then S53 is executed. Since the stop condition is not met, the next node is expanded according to S54. The first element in the updated D1 is the smallest. At this time, D1 = [0.4, 0.2, 0.5, 1.6]. Continue to execute the algorithm steps, and U and D1 thereafter are: U = [2, 2, 1, 1], D1 = [0.4, 0.3, 0.5, 1.6]; U = [2, 3, 1, 1], D1 = [0.4, 0.45, 0.5, 1.6]; U = [3, 3, 1, 1], D1 = [0.8, 0.45, 0.5, 1.6]; U = [3, 4, 1, 1], D1 = [0.8, 1.4, 0.5, 1.6]. At this time, the stopping condition is not reached, and the algorithm continues to execute. At this time, the third element in D1 is the smallest, so U = [3, 4, 2, 1], D1 = [0.8, 1.4, 1.5, 1.6], continue to execute S51, U: [4, 4, 2, 1], D1 = [1.2, 1.4, 1.5, 1.6], continue to execute S52, at this time, the first element in D1 is the smallest, so U is updated to U = [5, 4, 2, 1]. Then execute S53 to determine whether the first element in U is greater than N r , which means that the branch where the element exists in the tree search graph has obtained the minimum cumulative Euclidean distance, then S55 is executed, and the original antenna index l1 and transmission symbol s1 corresponding to the element are what is required. Then, the bit sequence can be restored based on the antenna index l1 and transmission symbol s1. According to the above search steps, it can be seen that in the above example, the maximum likelihood detection algorithm needs to calculate N t ×M×N r =32 nodes, the MMRC and tree search decoder only needs to calculate the cumulative Euclidean distance of 11 nodes, reducing the complexity of the calculation. When the number of transmitting antennas, receiving antennas and modulation order is larger, the effect of tree search decoder on reducing complexity is more obvious.

[0063] See also Figure 5 , in this section, at least 10 6 Monte Carlo simulation results of Rayleigh fading channels are used to analyze the proposed detection algorithm from the aspects of complexity and bit error rate. In the complexity analysis, the computational nodes of tree search are used as the absolute complexity measurement index. In the SM detection algorithm, N t 、N r , M is an indispensable indicator in detection. For ML, detection will traverse all possible combinations, and the absolute complexity is C ML =N t N r M.

[0064] Figure 5(a) and Figure 5 (b) The computational complexity of the proposed algorithm and the relative ML decoding of the RSD and greedy algorithms based on the tree search algorithm is analyzed. rel , we can intuitively see the complexity of each algorithm compared to ML decoding. The relative complexity is defined as the ratio of the absolute complexity of the two, that is, the complexity of the proposed algorithm and RSD decoding relative to ML decoding is defined as C∈{C pro ,C RSD ,C 贪婪}.

[0065] In simulation Figure 5 In (a), it can be seen that no matter what the number of antennas and modulation scheme are, the detection complexity of the proposed algorithm is much smaller than that of RSD and ML. Figure 5 In (a), the modulation mode is 64QAM. When the SNR is 4dB, the number of transmitting antennas and the number of receiving antennas are 4 and 16 respectively, the proposed algorithm can reduce the complexity by nearly 87% compared with ML, and by nearly 12% compared with RSD. Compared with the greedy algorithm, the complexity is 7% higher. Figure 5 In (b), the proposed detection algorithm still has lower detection complexity than the ML and RSD algorithms, but higher detection complexity than the greedy algorithm based on tree search.

[0066] In the simulation of the proposed detection algorithm, the simulation results of different numbers of transmitting antennas, receiving antennas, and modulation configurations were selected for the RIS-SM system. The BER simulation results are shown in Figure 2. Figure 6 shown.

[0067] exist Figure 6 In the figure, the influence of transmitting antenna, receiving antenna and modulation mode on the performance of the proposed algorithm is shown. It can be seen that when the modulation mode is the same, t In comparison, N r The number of N has a greater impact on the system BER. This is because r Corresponding to the depth of the search tree, when the depth of the tree is greater, the impact of noise on the detection result of a single receiving antenna is smaller, and the probability of detection error is smaller. t =4, M=64, N=64, N r =8 BER can be reduced to N r =4 is close to 55%. t When the BER increases, the BER also increases. At the same time, keeping the number of transmitting and receiving days the same, the BER increases when the modulation order is increased. This is because when the modulation order is increased, it is easier for the signal constellation points to interfere with each other, thereby increasing the probability of detection errors.

[0068] exist Figure 7In Figure 2, the performance of ML, RSD, greedy algorithm and the proposed algorithm under different configurations are compared under different signal-to-noise ratios when the number of RIS N=64. It can be seen that the proposed algorithm and RSD decoder provide near-optimal detection performance, which is consistent with expectations. The detection performance is close to the optimal ML detection, but the complexity is much smaller than ML detection, which reflects the advantages of the proposed detection algorithm.

[0069] Finally, it should be noted that the above preferred embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail through the above preferred embodiments, those skilled in the art should understand that various changes can be made in form and details without departing from the scope defined by the claims of the present invention.

Claims

1. A signal detection method based on RIS-SM, characterized in that: include: S1: The client sends pilot information to the base station The information bits of each transmission time slot are split into two parts: an index bit and a modulation bit; and a target transmission antenna is selected according to the index bit; Selecting a target modulation symbol from a modulation symbol set according to the modulation bit; S2: The client transmits the modulation symbol to the RIS through the target transmitting antenna via the UE-RIS channel. The RIS reflects the signal and transmits the reflected signal to the base station via the RIS-base station channel. The base station obtains the received signal Y. S3: The base station receives the signal Y and the pilot signal Calculate the cascaded estimated channel using the LS algorithm And estimate the channel based on the received signal Y and the cascade The optimal transmit antenna index set is calculated using the improved maximum ratio combining algorithm MMRC; S4: The base station combines the index of the transmitting antenna in the optimal transmitting antenna index set with the modulation symbols in all modulation symbol sets to construct a tree decoder; S5: The base station performs joint detection on the index and modulation symbol of the target transmitting antenna using a tree decoder according to the received signal; restores the information bit according to the mapping relationship between the information bit of each transmitting time slot and the index and modulation symbol of the target transmitting antenna; The method of jointly detecting the index and modulation symbol of the target transmitting antenna by using a tree decoder according to the received signal comprises: S51: Set the initial access vector U of the tree decoder; and calculate the Euclidean distance of all nodes at the first level in the tree decoder; the Euclidean distance of each node at the first level is y1 and The Euclidean distance between Among them, y1 represents the first element in the received signal vector Y, represents the cascaded estimated channel Line 1, No. 1 i The access vector for the elements of the column is U = [u1, u2, ..., u i , ..., u L×M ] represents the level tree where each node is currently located in the tree search; the Euclidean distance vector of each node at the first level is expressed as S52: Find the index position w of the node with the smallest Euclidean distance from the Euclidean distance vector D1 of all nodes at the first level of the tree decoder, and update the corresponding position of the access vector U of the tree decoder according to the index position w, and execute S53; The updating of the elements in the access vector U of the tree decoder comprises: in w =in w +1, in w ∈U Among them, the access vector of the U tree decoder, u w represents the element corresponding to the index position w of the access vector U in the tree decoder; The index position w of the node with the smallest Euclidean distance includes: Where ω represents the index position of the smallest element among the L×M elements in D1; S53: Determine whether there is an element in the updated access vector U that is greater than N r , if it exists, execute S55, otherwise, execute S54; S54: Expand to the next level node of the branch corresponding to the smallest element in the Euclidean distance vector D1 of each node in the first level, assuming that the antenna index and transmission symbol corresponding to the smallest branch are l i and j , at this time the level corresponding to the next level node is u w , update the index position w where the element with the minimum Euclidean distance is located And execute step S52; Among them, l i represents the transmit antenna index corresponding to the branch, j represents the index of the transmission symbol of the branch, Represents the updated front u w The cumulative Euclidean distance of the root receiving antennas, Representation Matrix uth w Line 1 i Elements of a column; S55: according to the access vector U greater than N r , find the index of the target transmit antenna and the mapped symbol.

2. A signal detection method based on RIS-SM according to claim 1, characterized in that: The receiving signal Y comprises: Y=HX l,s +n=(H) l s+n Where Y represents the received signal obtained by the base station, l represents the index of the target transmitting antenna, s represents the target modulation symbol, and N t Indicates the number of transmitting antennas owned by the client, H represents the actual cascade channel between UE-RIS-base station, (H) l represents the lth column of H, and n represents additive Gaussian white noise with mean 0 and variance N0.

3. The signal detection method based on RIS-SM according to claim 1, characterized in that: The cascade estimates the channel include: represents the pilot signal, represents the cascaded estimation channel, express The conjugate transpose of , Y represents the received signal.

4. The signal detection method based on RIS-SM according to claim 1, characterized in that: The channel is estimated based on the received signal Y and the cascade The optimal transmit antenna index set calculated using the improved maximum ratio combining algorithm MMRC includes: S31: First, estimate the channel based on the received signal Y and the cascade Calculate the characteristic factors of the transmitting antenna; S32: Select L transmitting antennas with the largest characteristic factors from the characteristic factors of the transmitting antennas as the optimal transmitting antenna set.

5. The signal detection method based on RIS-SM according to claim 4, characterized in that: The characteristic factors of the transmitting antenna include: Among them, ξ i represents the characteristic factor of the i-th transmitting antenna, represents the cascade estimated channel, Y represents the received signal, represents the cascade estimated channel matrix The i-th column element of .