Phase coding methods, apparatus and communication equipment

Abstract

This application, applicable to the field of communication technology, provides a phase coding method, apparatus, and communication device. The method includes: determining the number of bits required to encode multiple phases based on multiple phases to be encoded; generating first-order and higher-order terms for the multiple bits; constructing a bit matrix based on the multiple phases, first-order terms, and higher-order terms, wherein the bit matrix is ​​composed of various combinations of bit values; calculating multiple coding coefficients based on the bit matrix and multiple phases; and encoding the multiple phases using the multiple coding coefficients. Using this method can reduce redundant coding generated during the encoding process, thereby improving the solution speed and quality of the optimization algorithm. This method can be applied to any encoding process where the encoding object is a discrete value.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a phase encoding method, apparatus and communication device. Background Technology

[0002] The rapid development of wireless communication technology has led to increasingly scarce spectrum resources. As a key technology for current fifth-generation mobile communication (5G) and next-generation mobile communication, massive multiple-in multiple-out (MIMO) systems can significantly improve spectrum utilization by utilizing spatial division technology.

[0003] Massive MIMO antenna arrays can achieve beamforming by arranging multiple antenna elements in an array and then using weight optimization. In a multi-antenna scenario, the spatial electric field is obtained by coherently superimposing the radiation fields of each antenna according to their phases. Due to the interference and diffraction characteristics of waves, signals with different amplitudes and phases emitted by different antennas will have increased energy in some directions and decreased energy in others after superposition. In multi-antenna communication, the characteristic that electromagnetic waves radiate into a narrow beam oriented in a certain direction can be utilized to intervene in the beamforming process. This means that the transmitted signals of each antenna can be weighted as needed, and the amplitude or phase of the transmitted signals of each antenna can be intentionally changed so that the final beam has exactly the width and orientation required for actual communication. This process is called beamforming.

[0004] The key to beamforming is weight optimization using optimization algorithms. When applying partial optimization algorithms, phase encoding is required, and the encoding method directly affects the solution quality. As antenna sizes increase from hundreds to thousands, applying existing phase encoding methods will generate a large amount of redundant encoding, severely impacting the speed and quality of weight optimization. Summary of the Invention

[0005] This application provides a phase encoding method, apparatus, and communication device to solve the problem that phase encoding in the prior art generates a large amount of redundant encoding, which seriously affects the speed and quality of weight optimization.

[0006] To achieve the above objectives, this application adopts the following technical solution:

[0007] A first aspect of this application provides a phase encoding method, including:

[0008] Based on the multiple phases to be encoded, determine the number of bits required to encode the multiple phases;

[0009] Generate first-order and higher-order terms for the plurality of bits;

[0010] Based on the multiple phases, the first-order term, and the higher-order term, a bit matrix is ​​constructed, wherein the bit matrix is ​​composed of multiple combinations of values ​​of the multiple bits;

[0011] Calculate multiple coding coefficients based on the bit matrix and the multiple phases;

[0012] The multiple phases are encoded using the multiple coding coefficients.

[0013] Compared with the prior art, the beneficial effects of the phase encoding method provided in this application embodiment include: by introducing higher-order terms to construct the encoding, this application embodiment can make the coefficient matrix of the linear equation system to be solved a full-rank square matrix, realizing N bits to 2 N One-to-one encoding of each phase. Applying this method avoids generating a large amount of redundant encoding during the encoding process, which is beneficial for subsequent optimization algorithms. Secondly, the phase encoding method provided in this application can minimize the number of bits required for encoding; compared to the existing technology using QAM encoding for pure phase encoding, it can reduce the number of bits by at least half.

[0014] It should be understood that the phase encoding method provided in this application can be applied to various scenarios. These scenarios may include communication scenarios or non-communication scenarios. For example, in a communication scenario, this method can be applied to encode the phase of a discrete signal; in a non-communication scenario, if the object to be encoded is a discrete value, this method can also be used for encoding.

[0015] In one example of the first aspect, when the number of the plurality of phases is 2 N At this time, the encoding of the 2 N The number of bits required for each phase is N.

[0016] In one possible implementation of the first aspect, generating the first-order and higher-order terms of the plurality of bits may include: generating a first-order term for each bit; multiplying each bit itself sequentially to obtain higher-order terms ranging from second-order to N-order multiplication terms. Here, the first-order term can be each bit itself, N is the number of the plurality of bits, and higher-order terms of any order can include multiplication terms of the plurality of bits, where each bit in the same multiplication term is distinct.

[0017] It should be understood that when generating the first-order and higher-order terms of the plurality of bits, all first-order and higher-order terms of the plurality of bits can be generated.

[0018] In one possible implementation of the first aspect, the step of multiplying each bit itself one by one to obtain higher-order terms, ranging from second-order to N-order multiplication terms, includes: determining the order of the higher-order terms to be generated; determining the number of terms in the higher-order terms of the order; and multiplying each bit itself one by one according to the number of terms to obtain the higher-order terms of the order.

[0019] For example, when generating higher-order terms of multiple bits, the order of the term to be generated can be determined first, such as third, fourth, or fifth order. Then, for the corresponding order, the number of terms in the higher-order terms is determined, and then all higher-order terms of that order are obtained by multiplying each bit by itself. This ensures that complete higher-order terms are generated without omissions.

[0020] In one example of the first aspect, when the number of the plurality of bits is N and the order is X, the number of higher-order terms of the order is item.

[0021] In one possible implementation of the first aspect, constructing the bit matrix based on the plurality of phases, the first-order terms, and the higher-order terms includes: constructing a system of linear equations based on the plurality of phases, the first-order terms, and the higher-order terms; and determining the bit matrix based on the system of linear equations.

[0022] The linear equation system contains an equal number of equations to the number of phases. The expressions of the phases on one side of the equal sign of the equations are different from each other. The expressions of the first-order terms and the higher-order terms on the other side of the equal sign of the equations are the same. The first-order terms and the higher-order terms in each equation have coefficients, which constitute the coding coefficients.

[0023] In another possible implementation of the first aspect, if the rotation angles of the multiple phases to be encoded are equally spaced, then half of the phase can be obtained by rotating the other half by 180°, that is, multiplying half of the phase by -1 to obtain the other half. Therefore, for multiple phases with equally spaced rotation angles, a simplified calculation method can be used in the process of generating higher-order terms, extracting only the higher-order terms of the odd-numbered terms. Then, based on the multiple phases, the first-order terms, and the extracted higher-order terms of the odd-numbered terms, the linear equation system is constructed.

[0024] In another possible implementation of the first aspect, when determining the bit matrix according to the linear equations, the value of any one bit can be determined first; then, based on the value of the one bit, the values ​​of the other bits are generated to obtain multiple combinations of the values ​​of the multiple bits, and the multiple combinations of the values ​​constitute the bit matrix.

[0025] In one example of the first aspect, the value of any one bit and the other bits can be 1 or -1.

[0026] In one example, one can first determine that any one bit is 1, and then determine the values ​​of the other bits. The values ​​of the other bits should meet the above requirements, that is, the values ​​of the other bits should also be 1 or -1; or one can first determine that any one bit is -1, and then determine the values ​​of the other bits are 1 or -1.

[0027] In one possible implementation of the first aspect, the step of calculating multiple coding coefficients based on the bit matrix and the multiple phases includes: determining a phase vector composed of the multiple phases; calculating the product of the transpose of the phase vector and the inverse of the bit matrix to obtain the transpose of the coefficient vector composed of the multiple coding coefficients; and determining the multiple coding coefficients based on the transpose of the coefficient vector.

[0028] In one possible implementation of the first aspect, the system of linear equations can be represented in matrix computation form, i.e.:

[0029] S N C T =P T

[0030] Among them, S N A bit matrix, a vector Vector C is a coefficient vector composed of multiple coding coefficients, and vector P is a phase vector composed of multiple phases to be encoded. T and P T These are the transposes of the coefficient vector C and the phase vector P, respectively.

[0031] The expression for the coding coefficients can be obtained through matrix calculations:

[0032] C T =S N -1 P T

[0033] Among them, S N -1 For bit matrix S N The inverse matrix.

[0034] A second aspect of this application provides a phase encoding apparatus, which may include the following modules: a determining module, a generating module, a constructing module, a calculating module, and an encoding module, wherein:

[0035] A determining module is used to determine the number of bits required to encode the multiple phases based on the multiple phases to be encoded;

[0036] The generation module is used to generate the first-order and higher-order terms of the plurality of bits;

[0037] A construction module is used to construct a bit matrix based on the multiple phases, the first-order term, and the higher-order term, wherein the bit matrix is ​​composed of multiple combinations of values ​​of the multiple bits;

[0038] The calculation module is used to calculate multiple coding coefficients based on the bit matrix and the multiple phases;

[0039] The encoding module encodes the multiple phases using the multiple encoding coefficients.

[0040] In one example of the second aspect, when the number of the plurality of phases is 2 N At this time, the encoding of the 2 N The number of bits required for each phase is N.

[0041] In one possible implementation of the second aspect, the generation module can specifically be used for:

[0042] Generate a first-order term for each bit, wherein the first-order term can be the bit itself;

[0043] Each bit is multiplied by itself to obtain higher-order terms ranging from second-order to N-order; where N is the number of bits, and higher-order terms of any order can include multiplication terms of the bits, and the bits in the same multiplication term are all different.

[0044] When generating higher-order terms, the generation module can also be used to: determine the order of the higher-order terms to be generated; determine the number of terms in the higher-order terms of the order; and multiply each bit by itself according to the number of terms to obtain the higher-order terms of the order.

[0045] In one example of the second aspect, when the number of the plurality of bits is N and the order is X, the number of higher-order terms of the order is item.

[0046] In one possible implementation of the second aspect, the construction module may specifically be used to: construct a system of linear equations based on the plurality of phases, the first-order terms, and the higher-order terms; and determine the bit matrix based on the system of linear equations.

[0047] The linear equation system contains an equal number of equations to the number of phases. The expressions of the phases on one side of the equal sign of the equations are different from each other. The expressions of the first-order terms and the higher-order terms on the other side of the equal sign of the equations are the same. The first-order terms and the higher-order terms in each equation have coefficients, which constitute the coding coefficients.

[0048] In another possible implementation of the second aspect, the building module can also be used to: extract the higher-order terms of the odd-numbered terms if the rotation angles of the plurality of phases are equally spaced; and construct the linear equation system based on the plurality of phases and the higher-order terms of the first-order terms and the odd-numbered terms.

[0049] In another possible implementation of the second aspect, the construction module can also be used to: determine the value of any one bit; generate the values ​​of other bits based on the value of the one bit, to obtain multiple combinations of the values ​​of the multiple bits, and the multiple combinations of the values ​​constitute the bit matrix.

[0050] In one example of the second aspect, the value of any one bit and the other bits is 1 or -1.

[0051] In one possible implementation of the second aspect, the calculation module may specifically be used to: determine the phase vector formed by the plurality of phases; calculate the product of the transpose of the phase vector and the inverse of the bit matrix to obtain the transpose of the coefficient vector formed by the plurality of coding coefficients; and determine the plurality of coding coefficients based on the transpose of the coefficient vector.

[0052] The linear equation system can be represented in matrix form, i.e.:

[0053] S N C T =P T

[0054] Among them, S N A bit matrix, a vector Vector C is a coefficient vector composed of multiple coding coefficients, and vector P is a phase vector composed of multiple phases to be encoded. T and P T These are the transposes of the coefficient vector C and the phase vector P, respectively.

[0055] The expression for the coding coefficients can be obtained through matrix calculations:

[0056] C T =S N -1 P T

[0057] Among them, S N -1 For bit matrix S N The inverse matrix.

[0058] A third aspect of this application provides a communication device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the phase encoding method as described in any of the first aspects above.

[0059] It should be understood that communication equipment may include any one of base stations, smart reflectors, or routers.

[0060] A fourth aspect of this application provides a computer-readable storage medium storing computer instructions that, when executed on a computer device, cause the computer device to perform the aforementioned method steps to implement the phase encoding method described in any of the first aspects. The aforementioned computer device may include, but is not limited to, communication devices.

[0061] A fifth aspect of this application provides a computer program product that, when run on a computer device, causes the computer device to perform the aforementioned related steps to implement the phase encoding method described in any of the first aspects.

[0062] A sixth aspect of this application provides a chip including a memory and a processor, the processor executing a computer program stored in the memory to implement the phase encoding method as described in any of the first aspects above.

[0063] It is understood that the beneficial effects of the second to sixth aspects mentioned above can be found in the relevant descriptions in the first aspect mentioned above, and will not be repeated here. Attached Figure Description

[0064] Figure 1 This is a schematic diagram of an amplitude-phase encoding method in the prior art;

[0065] Figure 2 This is a schematic diagram of a beamforming process provided in an embodiment of this application;

[0066] Figure 3 This is a schematic diagram of a phase encoding method provided in an embodiment of this application;

[0067] Figure 4 This is a phase diagram of an antenna vibrator provided in an embodiment of this application;

[0068] Figure 5 This is a schematic flowchart of a phase encoding method provided in an embodiment of this application;

[0069] Figure 6 This is a schematic diagram of a base station system architecture provided in an embodiment of this application;

[0070] Figure 7 This is a schematic diagram of the system architecture of an intelligent reflective surface provided in an embodiment of this application;

[0071] Figure 8 This is a schematic diagram of a beamforming result provided in an embodiment of this application;

[0072] Figure 9 This is a schematic diagram of a phase encoding device provided in an embodiment of this application. Detailed Implementation

[0073] To facilitate a clear description of the technical solutions in the embodiments of this application, the terms "first" and "second" are used in the embodiments of this application to distinguish identical or similar items with essentially the same function and effect. For example, "first phase," "second phase," etc., are merely used to distinguish different phases and do not limit their quantity or execution order.

[0074] It should be noted that in the embodiments of this application, the words "exemplarily" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design scheme described as "exemplarily" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the words "exemplarily" or "for example" is intended to present the relevant concepts in a specific manner.

[0075] The business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0076] In this application embodiment, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0077] The steps involved in the phase encoding method provided in this application are merely examples. Not all steps are mandatory, and not all content in each step is required. They can be added or removed as needed during use.

[0078] In this application, the same step or a step or message with the same function can be referenced and learned from each other in different embodiments.

[0079] As antenna sizes have increased from hundreds to thousands, pure phase optimization in weight optimization has become a key research focus because it can better save communication costs compared to simultaneous amplitude and phase optimization.

[0080] Among algorithms for solving weight optimization problems, the holographic algorithm is relatively fast. This analytical algorithm solves continuous optimization problems. However, in real-world communication scenarios, the limitations of phase shifters in antenna equipment cause the antenna phase to exhibit discrete characteristics. Applying the holographic algorithm to convert the continuous optimization results to discrete values ​​introduces additional errors, significantly reducing the optimization effect. Another algorithm for solving weight optimization problems is the genetic algorithm, which solves unidirectional beamforming problems by iteratively selecting, crossovering, and mutating in a population formed by all weight combinations. However, optimizing a thousand-level antenna array using a genetic algorithm often takes several days. Faced with the ever-increasing scale of antenna arrays, the optimization speed of the genetic algorithm cannot meet the actual communication needs. Furthermore, both the holographic and genetic algorithms can only perform unidirectional beamforming and cannot support multi-directional enhancement and suppression in the spatial domain. Currently, some research is beginning to use quantum computing to solve such optimization problems. Correspondingly, classical algorithms inspired by quantum computing, i.e., quantum-heuristic algorithms, are also entering the research field, becoming a potential algorithm for quickly solving arbitrary beamforming problems. However, whether applying quantum computing or quantum heuristic algorithms, the phase must first be encoded, and the encoding method used will directly affect the solution quality of the optimization algorithm.

[0081] Quadrature amplitude modulation (QAM) is a common base station weighting method, whose encoding process includes encoding the antenna amplitude and phase. For example... Figure 1 The diagram shown is a schematic of amplitude-phase encoding in the prior art, where I represents the real part and Q represents the imaginary part. Figure 1 Any point in the array represents a discrete signal. According to... Figure 1The encoding method shown requires equal-interval encoding of the real part I and the imaginary part Q, so the base station weights satisfy y = I + Qj. Taking 16-QAM with 16 weights as an example, this encoding method uses two bits to encode the real part and the imaginary part respectively. According to the intervals ΔI and ΔQ in the directions of the real part I and the imaginary part Q, the overall encoding can be expressed as follows (1):

[0082]

[0083] Where s1 and s2 represent two bits used to encode the real part, and s3 and s4 represent two bits used to encode the imaginary part.

[0084] Because amplitude-phase encoding uses separate encoding for the real and imaginary parts, applying this encoding method to simple phase encoding will result in a large amount of redundant encoding when the number of phases exceeds four. This necessitates adding extra bits during weight optimization. Furthermore, the redundant encoding generated by this method will introduce numerous constraints into the optimization process, severely impacting both the speed and quality of optimization.

[0085] To address the aforementioned problems, embodiments of this application provide a phase encoding method, which is a method for converting N bits to 2... N The phase mapping coding method constructs a coding scheme with the minimum number of bits without redundancy or constraints to facilitate rapid optimization of subsequent algorithms and improve the algorithm's ability to solve beamforming problems.

[0086] like Figure 2 The diagram shown is a schematic flowchart of a beamforming process provided in an embodiment of this application. Figure 2 The illustrated process shows that a complete beamforming operation typically includes four steps: encoding, modeling, optimization, and beamforming. The encoding step can complete N bits [s1,…,s…]. N The mapping from the antenna element weights to the phase of the antenna element involves encoding the antenna element weights into N-bit spins. Here, the weights refer to the phase of the antenna element, and each bit s can take a value of ±1. After encoding, the electromagnetic field energy in a specific direction in space can be calculated based on the actual application scenario, completing the modeling of the beamforming task and obtaining the expression H(s1,…,s) for the electromagnetic field energy in the target direction with respect to the bits. NModeling tasks can include beam enhancement or suppression in a specific direction, multi-beam multi-zero lines, etc. Then, in the optimization step, optimization algorithms can be applied to calculate the values ​​of each bit, maximizing or minimizing the value of the aforementioned function H. Practical optimization algorithms can include quantum computing, quantum heuristics, etc. Finally, the weights of each antenna element in the antenna array can be determined based on the optimized bit values. By applying these weights to practical application scenarios, the final beamforming can be completed. Application scenarios requiring beamforming generally include base stations, reconfigurable intelligent surfaces (RIS), and routers, etc. The phase coding method provided in this application embodiment can be applied to... Figure 2 The coding steps of the beamforming process shown are as follows.

[0087] The phase encoding method of this application will now be described in conjunction with specific embodiments.

[0088] Reference Figure 3 The diagram illustrates a phase encoding method provided in an embodiment of this application. This method may specifically include the following steps:

[0089] S301. Generate all first-order and higher-order terms according to the number of bits required for encoding.

[0090] This method can be applied to communication devices, including base stations, RIS (Real-Time Interchange) systems, routers, etc., meaning that this method can be used to encode phases within these devices. Before encoding, the number of bits required for encoding can be determined first. The number of bits can be determined based on the number of phases to be encoded.

[0091] In one example, if the number of phases to be encoded is 2 N If there are 1, then the number of bits required to encode the aforementioned 1 phase is N. That is, by applying the phase encoding method provided in the embodiments of this application, N bits can be used to encode 2 phases. N Encode each target phase to be encoded. 2 N The target phase to be encoded can be used as a vector. mark.

[0092] After determining the number of bits required for encoding, we can first generate all first-order and higher-order terms for N bits.

[0093] Among them, the first-order term of N bits can be the N bits themselves.

[0094] For example, if the N bits are s1, s2, ..., s N Then all the first-order terms are s1, s2, ..., s N .

[0095] A higher-order term of N bits can include all higher-order terms from second-order to Nth-order multiplication terms. A higher-order term of any order can include multiplication terms of multiple bits, and each bit in the same multiplication term must be distinct.

[0096] For example, if the N bits are s1, s2, ..., s N Then its second-order terms can include s i s j (i≠j). For example, s1s2, s1s3, s1s4, ..., s1s N s2s3, s2s4, ..., s2s N , ..., s N-1 s N The total number of these second-order terms is... indivual.

[0097] Third-order terms can include s i s j s k (i≠j≠k). For example, s1s2s3, s1s2s4, s1s2s5, ..., s1s2s N ,s2s3s4,s2s3s5,…,s2s3s N , ..., s N-2 s N-1 s N The total number of these third-order terms is... indivual.

[0098] Similarly, Nth-order terms can include s1s2…s N The number of terms of order N is 1, that is... indivual.

[0099] Therefore, when the number of bits is N and the order is X, the number of terms in the higher-order terms of that order is: item.

[0100] All first-order and higher-order terms of N bits total 2 N item.

[0101] S302. Construct a bit matrix based on all first-order and higher-order terms.

[0102] After generating all first-order and higher-order terms of N bits, a bit matrix can be constructed, which can be composed of multiple combinations of bit values.

[0103] In one possible implementation, all first-order and higher-order terms can be combined, utilizing 2 NA system of linear equations is constructed using 10 coefficients c, and the bit matrix is ​​determined based on this system of linear equations.

[0104] The linear equation system constructed in this embodiment may include multiple equations, the number of which is equal to the number of phases to be encoded. For example, if the number of phases to be encoded is 2... N If there are 2, then the constructed system of linear equations contains 2 N Equations.

[0105] For example, by 2 N A system of linear equations consisting of 3 equations can be represented as follows:

[0106]

[0107] As can be seen from equation (2) above, the expressions for the phases to be encoded, located on the same side of the equal sign of multiple equations, are all different. That is, the right side of the equal sign of each equation in the linear system of equations is an expression for one phase. arrive The expressions for all first-order and higher-order terms, which are located on the other side of the equals sign in multiple equations, are all the same. These first-order and higher-order terms also have coefficients, namely c1,…,c 2N All coefficients constitute the coding coefficients used for subsequent coding.

[0108] In this embodiment, a bit matrix S can be constructed using N bits in a total of 10 possible combinations. N The values ​​of this matrix can be formed by various combinations of multiple bit values. Specifically, the combinations of N bit values ​​constitute the rows [s1, s2, ..., s1s2...s...] of the bit matrix. N Correspondingly, each column of the bit matrix corresponds to the value of a higher-order or first-order term of N bits.

[0109] Since each column of the bit matrix is ​​linearly independent, the final bit matrix is ​​a full-rank square matrix.

[0110] S303. Perform matrix operations on the bit matrix to obtain the coding coefficients.

[0111] Formula (2) in the previous step can be expressed in the form of matrix calculation, i.e., the following formula (3):

[0112] S N C T =P T ……(3)

[0113] Among them, S N A bit matrix, a vector Vector C is a coefficient vector composed of multiple coding coefficients, and vector P is a phase vector composed of multiple phases to be encoded. T and P T These are the transposes of the coefficient vector C and the phase vector P, respectively.

[0114] By processing equation (3) above, the expression for the coding coefficients can be obtained as follows:

[0115] C T =S N -1 P T ……(4)

[0116] Among them, S N -1 For bit matrix S N The inverse matrix.

[0117] S304. Phase coding is performed using coding coefficients.

[0118] The calculated coding coefficients can be used to encode the phases to be encoded. Specifically, the calculated coding coefficients can be substituted into the linear equation system (2) to complete the encoding of each phase.

[0119] In this embodiment, by introducing higher-order terms to construct the encoding, the coefficient matrix of the linear equation system to be solved can be a full-rank square matrix, realizing the conversion of N bits to 2. N One-to-one encoding of each phase. Applying this method avoids generating a large amount of redundant encoding during the encoding process, which is beneficial for subsequent optimization algorithms. Secondly, the phase encoding method provided in this application can minimize the number of bits required for encoding; compared to the use of QAM for pure phase encoding in the prior art, it can reduce the number of bits by at least half.

[0120] To facilitate understanding, a specific example will be used to introduce the phase encoding method provided in the embodiments of this application.

[0121] like Figure 4 The image shown is a phase diagram of an antenna vibrator provided in an embodiment of this application. Figure 4 The phase to be encoded shown is an 8-phase, that is Figure 4 Any marker point A0, ..., A7 represents a phase to be encoded. Figure 4 It can be seen that the rotation angle of each phase is equally spaced.

[0122] If the rotation angles of multiple phases to be encoded are equally spaced, then half of the phase can be obtained by rotating the other half by 180°, that is, multiplying half of the phase by -1 to obtain the other half. For example, by rotation... Figure 4 A0 phase is 180°, which yields A4 phase. Therefore, since the rotation angles of multiple phases are equally spaced, a simplified calculation method can be used to extract only the odd-numbered higher-order terms during the generation of higher-order terms.

[0123] Below, in order to Figure 4 Taking the encoding of eight phases as an example, we will introduce the phase encoding method of this application embodiment.

[0124] Since the number of phases to be encoded is 8, that is, 2 3 Since there are 3 phases, the number of bits required for encoding is 3. Therefore, this example describes a 3-bit, 8-phase encoding process. Combined with... Figure 4 These 8 phases to be encoded can be represented as The angle θ can be expressed as:

[0125]

[0126] According to the encoding process described in the aforementioned embodiment, it is first necessary to generate all first-order and higher-order terms of 3 bits. Since this example only needs to extract the higher-order terms of odd-numbered terms, only all first-order and third-order terms are needed in actual encoding. The third-order term can be represented as s1s3s. s .

[0127] Then, construct the bit matrix S. N The linear equation constructed according to the encoding process described in the foregoing embodiments can be expressed as:

[0128]

[0129] There are a total of 8 possible combinations of bit values. Because Figure 4 Half of the phase can be obtained by multiplying the other half of the phase by -1, and in this process only all odd-numbered multiplication terms are taken, so the general 2... described in the previous embodiment... N In this system of equations, only half are linearly independent. Therefore, we can fix the value of one bit to generate a bit matrix S. N .

[0130] For example, assuming s1 = 1, the corresponding bit matrix can be obtained as follows:

[0131]

[0132] Of course, s1 can also take other values, for example, if s1 = -1, the resulting bit matrix can be represented as:

[0133]

[0134] For angle θ, we take the angle values ​​when i = 0, 1, 2, 3, that is, we take the following angle values:

[0135]

[0136] In this way, the phase vector P can be generated as follows:

[0137]

[0138] According to formula (4), the coefficient vector used for encoding can be calculated as follows:

[0139]

[0140] By substituting the result of equation (11) into equation (6), the phase encoding process is completed.

[0141] In conjunction with the foregoing embodiments, such as Figure 5 The diagram shows a flowchart of a phase encoding method provided in an embodiment of this application. The method may specifically include the following steps:

[0142] S501. Determine the number of bits required to encode the multiple phases based on the multiple phases to be encoded.

[0143] This method can be applied to communication devices; that is, the execution subject of this application embodiment can be a communication device. For example, the communication device may include a base station, RIS, router, etc., and this application embodiment does not limit the specific type of communication device.

[0144] The number of phases to be encoded can be determined based on actual communication needs. Generally, the number of phases to be encoded can be 2 to the power of N, i.e., 2^N. N 2. N The target phase to be encoded can be used as a vector. mark.

[0145] In this embodiment of the application, when the number of phases to be encoded is 2 N At this time, code 2 N The number of bits required for each phase is N. N bits can be represented as s1, s2, ..., s N .

[0146] S502, Generate the first-order and higher-order terms of the plurality of bits.

[0147] In the embodiments of this application, the first-order and higher-order terms of multiple bits can be generated separately. The first-order term of each bit can be the bit itself. For example, if N bits are s1, s2, ..., s... NThen all the first-order terms are s1, s2, ..., s N .

[0148] For higher-order terms, all higher-order terms, from second-order to N-order, can be obtained by multiplying each bit by itself. Among them, higher-order terms of any order can include multiplication terms of multiple bits, and the bits in the same multiplication term are all different.

[0149] For example, for the N bits s1,s2,…,s in the aforementioned example N Its second-order terms may include s i s j (i≠j); third-order terms include s i s j s k (i≠j≠k); Nth-order terms may include s1s2…s N .

[0150] In a practical implementation, the order of the higher-order terms to be generated can be determined first, and then the number of terms of the higher-order terms of that order can be determined. Thus, each bit can be multiplied by the number of terms to obtain all the higher-order terms of the corresponding order.

[0151] S503. Based on the multiple phases, the first-order term, and the higher-order term, a bit matrix is ​​constructed, wherein the bit matrix is ​​composed of multiple combinations of the values ​​of the multiple bits.

[0152] The bit matrix in this embodiment may be the bit matrix S in the foregoing embodiments. N A system of linear equations can be constructed based on the multiple phases to be encoded and all first-order and higher-order terms of the multiple bits. Then, the bit matrix S can be determined based on this system of linear equations. N .

[0153] In this embodiment of the application, the number of equations in the linear equation system is equal to the number of multiple phases. The expressions of the phases to be encoded located on one side of the equal sign of the multiple equations are different from each other. The expressions of all first-order terms and higher-order terms of the multiple bits located on the other side of the equal sign of the multiple equations are the same. The first-order terms and higher-order terms in each equation have coefficients, and all coefficients constitute the coding coefficients used for subsequent encoding.

[0154] In one possible implementation of this application, if the rotation angles of the multiple phases to be encoded are equally spaced, half of the phase can be obtained by rotating the other half by 180°, that is, by multiplying half of the phase by -1. Therefore, if the rotation angles of the multiple phases to be encoded are equally spaced, when actually generating higher-order terms, the higher-order terms of the odd-numbered terms can be extracted, and then a system of linear equations can be constructed based on the multiple phases to be encoded and all first-order terms and the higher-order terms of the odd-numbered terms of the multiple bits, thereby simplifying the calculation process.

[0155] In the embodiments of this application, when determining the bit matrix according to the linear equation system, the value of any one bit can be determined first, and then the values ​​of other bits can be generated based on the value of any one bit, thereby obtaining multiple combinations of values ​​for multiple bits. The multiple combinations of values ​​for multiple bits together constitute the bit matrix.

[0156] In one possible implementation of this application embodiment, the value of any one bit and the other bits can be 1 or -1.

[0157] S504. Calculate multiple coding coefficients based on the bit matrix and the multiple phases.

[0158] In this embodiment of the application, in order to calculate the coding coefficients, a phase vector consisting of multiple phases to be encoded can first be determined. Exemplarily, the phase vector can be represented as a vector. Then calculate the transpose P of the phase vector P. T With bit matrix S N The inverse matrix S N -1 The product of S N -1 P T This yields the transpose of a coefficient vector consisting of multiple coding coefficients. For example, if the vector C = [c1, ..., c...]... 2N If ] represents a coefficient vector, then there exists an expression C. T =S N -1 P T According to the transpose C of the coefficient vector T Multiple coding coefficients can be determined.

[0159] S505. Encode the multiple phases using the multiple coding coefficients.

[0160] The calculated coding coefficients can be used to encode the phase to be encoded.

[0161] The phase encoding method provided in this application can be applied to various communication scenarios. For example, this method can be used for phase encoding in various communication devices that require beamforming. For instance, this method can be used for encoding during beamforming of base stations, smart reflectors, or routers. Alternatively, this method can be used for encoding in any communication scenario where the signal is a discrete value. Furthermore, this method can be used in any other scenario, including but not limited to communication scenarios, where it is necessary to encode discrete values. For example, this method can be applied to any scenario where the object to be encoded is a discrete value. That is, the phase encoding method provided in this application can be applied not only to communication scenarios but also to non-communication scenarios; it can encode not only phases but also other discrete objects.

[0162] like Figure 6 The diagram shown is a schematic representation of a base station system architecture provided in an embodiment of this application. Based on Figure 6 The base station with the system architecture shown can be phase-coded using the phase coding method provided in the embodiments of this application. Compared to traditional base stations, Figure 6 The base station shown adds an encoder / decoder between the transmitter of the transmitted signal and the modulator of the modulated signal. The encoder / decoder's encoding function can be used to complete phase encoding. The encoder / decoder can also calculate the phase distribution of the phase-encoded bits and decode it into phase, which is then applied to the transmitted signal. Correspondingly, considering the future needs of dynamic beamforming optimization, a decoder can be introduced at the base station's receiver to obtain the initial value of the bit spin distribution for subsequent rapid tracking of the target user and beamforming.

[0163] like Figure 7 The diagram shown is a schematic representation of a RIS system architecture provided in an embodiment of this application. Based on Figure 7 The RIS system architecture shown can also be phase-encoded using the phase encoding method provided in this application embodiment. Specifically, based on the optimization of the original RIS codebook, Figure 7 The RIS shown introduces an encoder, decoder, and corresponding optimization modules at the transceiver end, and achieves fast and accurate beamforming by adding dynamic optimization of the transmitter phase.

[0164] Encoding using the phase encoding method provided in the embodiments of this application can achieve good results in subsequent beamforming tasks. For example... Figure 8 The diagram shown illustrates a beamforming result provided in an embodiment of this application. Figure 8The image shows the optimized beamforming result in one direction calculated using a quantum heuristic algorithm after encoding the phase using this method. Figure 8 Figure (a) shows the distribution of spatial electromagnetic field energy at the control direction angle, where θ and φ are three-dimensional spatial angles, and θ is the angle between the radiation direction and the z-axis. Figure 8 In (a) of the diagram, the target forming direction is θ = 90° and φ = 60°. Figure 8 Based on (a) in the middle, Figure 8 (b) shows slice views in the directions of φ = 60° and φ = 120°. From Figure 8 It can be seen that applying this method for encoding can achieve better shaping results in the target direction.

[0165] Furthermore, combining the phase encoding method provided in this application with a quantum heuristic algorithm allows for weight optimization of arrays with a scale of thousands in just a few seconds. Table 1 below shows the time required to optimize the number of oscillators and the number of bits per antenna oscillator for four different array sizes.

[0166] Table 1:

[0167]

[0168] Where m and n represent the number of elements in the vertical and horizontal directions, respectively, sn represents the number of bits in a single antenna element, and the optimization time t is in seconds (s).

[0169] This application embodiment can divide the communication device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or one or more functions can be integrated into a single functional module. The integrated module can be implemented in hardware or as a software functional module. It should be noted that the module division in this application embodiment is illustrative and only represents one logical functional division; other division methods may be used in actual implementation. The following description uses the example of dividing each function into a separate functional module.

[0170] Corresponding to the above embodiments, refer to Figure 9 This diagram illustrates a structural block diagram of a phase encoding device provided in an embodiment of this application. This device can be applied to the communication devices described in the foregoing embodiments. Specifically, the device may include the following modules: a determining module 901, a generating module 902, a constructing module 903, a calculating module 904, and an encoding module 905, wherein:

[0171] The determining module 901 is used to determine the number of bits required to encode the multiple phases based on the multiple phases to be encoded;

[0172] Generation module 902 is used to generate first-order and higher-order terms of the plurality of bits;

[0173] The construction module 903 is used to construct a bit matrix based on the multiple phases, the first-order term, and the higher-order term, wherein the bit matrix is ​​composed of multiple combinations of values ​​of the multiple bits;

[0174] Calculation module 904 is used to calculate multiple coding coefficients based on the bit matrix and the multiple phases;

[0175] The encoding module 905 uses the multiple encoding coefficients to encode the multiple phases.

[0176] In one possible implementation of this application embodiment, when the number of the plurality of phases is 2 N At this time, the encoding of the 2 N The number of bits required for each phase is N.

[0177] In one possible implementation of this application embodiment, the generation module 902 may specifically be used for:

[0178] Generate a first-order term for each bit, wherein the first-order term can be the bit itself;

[0179] Each bit is multiplied by itself to obtain higher-order terms ranging from second-order to N-order; where N is the number of bits, and higher-order terms of any order can include multiplication terms of the bits, and the bits in the same multiplication term are all different.

[0180] In this embodiment of the application, the generation module 902 can also be used to: determine the order of the higher-order term to be generated; determine the number of terms of the higher-order term of the order; and multiply each bit by itself according to the number of terms to obtain the higher-order term of the order.

[0181] In this embodiment of the application, when the number of the plurality of bits is N and the order is X, the number of higher-order terms of the order is item.

[0182] In one possible implementation of this application embodiment, the construction module 903 may be specifically used to: construct a system of linear equations based on the plurality of phases, the first-order terms, and the higher-order terms; and determine the bit matrix based on the system of linear equations.

[0183] The linear equation system contains an equal number of equations to the number of phases. The expressions of the phases on one side of the equal sign of the equations are different from each other. The expressions of the first-order terms and the higher-order terms on the other side of the equal sign of the equations are the same. The first-order terms and the higher-order terms in each equation have coefficients, which constitute the coding coefficients.

[0184] In this embodiment of the application, the construction module 903 can also be used to: extract the higher-order terms of the odd-numbered terms if the rotation angles of the plurality of phases are equally spaced; and construct the linear equation system based on the plurality of phases and the higher-order terms of the first-order terms and the odd-numbered terms.

[0185] In this embodiment of the application, the construction module 903 can also be used to: determine the value of any one bit; generate the values ​​of other bits according to the value of the one bit, and obtain multiple combinations of the values ​​of the multiple bits, wherein the multiple combinations of the values ​​constitute the bit matrix.

[0186] In one possible implementation of this application embodiment, the value of any one bit and the other bits is 1 or -1.

[0187] In one possible implementation of this application embodiment, the calculation module 904 may be specifically used to: determine the phase vector composed of the plurality of phases; calculate the product of the transpose of the phase vector and the inverse of the bit matrix to obtain the transpose of the coefficient vector composed of the plurality of coding coefficients; and determine the plurality of coding coefficients based on the transpose of the coefficient vector.

[0188] It should be noted that all relevant content of each step involved in the above method embodiments can be referenced from the functional description of the corresponding functional module, and will not be repeated here.

[0189] This application also provides a chip, which includes a processor, which can be a general-purpose processor or a dedicated processor. The processor is used to support the communication device in performing the aforementioned steps to implement the phase encoding method in the various embodiments described above.

[0190] Optionally, the chip also includes a transceiver, which is used to receive control from the processor to support the communication device in performing the aforementioned steps to implement the phase encoding method in the above embodiments.

[0191] Optionally, the chip may also include a storage medium.

[0192] It should be noted that the chip can be implemented using the following circuits or devices: one or more field programmable gate arrays (FPGAs), programmable logic devices (PLDs), controllers, state machines, gate logic, discrete hardware components, any other suitable circuits, or any combination of circuits capable of performing the various functions described throughout this application.

[0193] Finally, it should be noted that the above description is only a specific implementation of this application, but the protection scope of this application is not limited thereto. Any changes or substitutions within the technical scope disclosed in this application should be covered within the protection scope of this application.

Claims

1. A phase encoding method, characterized in that, include: Based on the multiple phases to be encoded, determine the number of bits required to encode the multiple phases; Generate first-order and higher-order terms for the plurality of bits; Based on the multiple phases, the first-order term, and the higher-order term, a bit matrix is ​​constructed, wherein the bit matrix is ​​composed of multiple combinations of values ​​of the multiple bits; Calculate multiple coding coefficients based on the bit matrix and the multiple phases; The multiple phases are encoded using the multiple coding coefficients.

2. The method according to claim 1, characterized in that, Determining the number of bits required to encode the multiple phases based on the multiple phases to be encoded includes: When the number of the plurality of phases is 2 N At this time, the encoding of the 2 N The number of bits required for each phase is N.

3. The method according to claim 1, characterized in that, The generation of the first-order and higher-order terms of the plurality of bits includes: Generate a first-order term for each bit, wherein each first-order term is the bit itself; Each bit is multiplied by itself to obtain higher-order terms ranging from second-order to N-order; where N is the number of bits, and any higher-order term includes the multiplication of the bits, with each bit in the same multiplication term being distinct.

4. The method according to claim 3, characterized in that, The step of multiplying each bit by itself to obtain higher-order terms, from second-order to Nth-order multiplication terms, includes: Determine the order of the higher-order terms to be generated; Determine the number of higher-order terms of the given order; By multiplying each bit by the number of terms one by one, we obtain the higher-order terms of the order.

5. The method according to claim 4, characterized in that, Determining the number of higher-order terms of the order includes: When the number of bits is N and the order is X, the number of higher-order terms of the order is: item.

6. The method according to any one of claims 1 to 5, characterized in that, The construction of the bit matrix based on the multiple phases, the first-order term, and the higher-order term includes: Based on the multiple phases, the first-order terms, and the higher-order terms, a system of linear equations is constructed. The bit matrix is ​​determined based on the system of linear equations. The linear equation system contains an equal number of equations to the number of phases. The expressions of the phases on one side of the equal sign of the equations are different from each other. The expressions of the first-order terms and the higher-order terms on the other side of the equal sign of the equations are the same. The first-order terms and the higher-order terms in each equation have coefficients, which constitute the coding coefficients.

7. The method according to claim 6, characterized in that, The construction of a system of linear equations based on the multiple phases, the first-order terms, and the higher-order terms includes: If the rotation angles of the multiple phases are equally spaced, extract the higher-order terms of the odd-numbered terms; The linear equation system is constructed based on the multiple phases and the higher-order terms of the first-order and odd-numbered terms.

8. The method according to claim 6, characterized in that, Determining the bit matrix based on the system of linear equations includes: Determine the value of any single bit; Based on the value of any one bit, the values ​​of the other bits are generated, resulting in multiple combinations of the values ​​of the multiple bits, which constitute the bit matrix.

9. The method according to claim 8, characterized in that, The value of any one bit and all the other bits is 1 or -1.

10. The method according to any one of claims 1 to 5 or 7 to 9, characterized in that, The calculation of multiple coding coefficients based on the bit matrix and the multiple phases includes: Determine the phase vector formed by the plurality of phases; Calculate the product of the transpose of the phase vector and the inverse of the bit matrix to obtain the transpose of the coefficient vector composed of the plurality of coding coefficients; The plurality of coding coefficients are determined based on the transpose of the coefficient vector.

11. A communication device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the phase encoding method as described in any one of claims 1 to 10.

12. The communication device according to claim 11, characterized in that, The communication device includes any one of a base station, a smart reflector, or a router.

Images