Communication method and apparatus
By using the first sequence of the equiangular tightening frame (ETF) sequence group in NOMA communication, the problem of interference between users is solved, and the quality and efficiency of signal transmission are improved.
Patent Information
- Application Number
- PCT/CN2024/135252
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-12-15
- Filing Date
- 2024-11-28
- Publication Date
- 2025-06-19
AI Technical Summary
The prior art is difficult to effectively reduce interference between users at NOMA receiver.
By using an isogonal tight frame (ETF) sequence group, the first sequence is determined to send a signal, thereby reducing interference between users. The characteristics of ETF sequence groups make the maximum interference between multiple users lower than the maximum interference when other sequence groups.
When the user uses the first sequence of the ETF sequence group to transmit signals, it is realized that interference between users is reduced and the quality and efficiency of signal transmission is improved.
Smart Images

Figure CN2024135252_19062025_PF_FP_ABST
Abstract
Description
Communication method and device
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application claims priority to the Chinese patent application filed with the Intellectual Property Office of the People's Republic of China on December 15, 2023, with application number 202311735352.7 and invention name "A Communication Method and Device", the entire contents of which are incorporated by reference into this application. Technical Field
[0003] The present application relates to the field of mobile communication technologies, and in particular to a communication method and device. Background Art
[0004] Non-orthogonal multiple access (NOMA) is a key research topic within the 3rd Generation Partnership Project (3GPP) protocol. Compared to traditional orthogonal multiple access (OMA) solutions, NOMA can provide network services to more users. NOMA's potential benefits include, but are not limited to, large connections, large uplink packets, and grant-free transmission scenarios. However, inter-user interference is unavoidable at the NOMA receiver.
[0005] Currently, how to reduce interference between users is an urgent problem to be solved in the field of communications. Summary of the Invention
[0006] The present application provides a communication method and apparatus for reducing interference between users in communications.
[0007] In a first aspect, a communication method is provided. The method can be implemented by a first communication device. The first communication device can be used to send a signal. For example, the first communication device can be a terminal device or an access network device (or replaced by a network device, such as a base station). The first communication device can also be a component in the terminal device or a component in the access network device. Among them, the components in the present application may include, for example, at least one of a chip, a chip system, a processor, a transceiver, a processing unit, or a transceiver unit. Taking the execution subject as the first communication device as an example, the communication method provided in the present application may include the following steps: the first communication device obtains indication information of a first sequence, and the sequence set corresponding to the first sequence satisfies: the maximum value of the square of the inner product of any two sequences in the sequence set is equal to a first value, and the first value is associated with N and K, where N represents the number of sequences in the sequence set and K represents the length of the sequence in the sequence set; the first signal is transmitted between the first communication device and the second communication device, and the first signal corresponds to the first sequence.
[0008] Based on the method shown in the first aspect, the first communication device can determine the first sequence according to the indication information of the first sequence, and send the first signal corresponding to the first sequence. The first sequence corresponds to a sequence set, and the sequence set that meets the above conditions can be an equiangular tight frame (ETF) sequence group. For example, the first sequence can be a sequence determined according to the ETF sequence group; for example, the first sequence can be a sequence in the ETF sequence group, such as an ETF sequence. According to the characteristics of the ETF sequence group, when multiple users respectively use different sequences in the ETF sequence group to send signals, the maximum value of the interference between the multiple users is lower than the maximum value of the interference between the users when the multiple users respectively use other sequences. Therefore, when the user uses the first sequence corresponding to the ETF sequence group to transmit the signal, the interference between the users can be reduced. Therefore, it can be said that this communication method can reduce the transmission interference between users.
[0009] Optionally, the first communication device may send the first signal to the second communication device, or the second communication device may send the first signal to the first communication device.
[0010] In one possible implementation, any sequence in the sequence set corresponds to a column of elements in a first matrix; wherein the first matrix is composed of K rows of elements in a second matrix, the second matrix is an N-order discrete Fourier transform (DFT) matrix, K and N are both positive integers, N is greater than 1, and K is less than or equal to N; wherein the K rows of elements satisfy: the difference between any two indices in the second matrix and the modulus of N constitute a second sequence, the values in the second sequence are positive integers greater than or equal to 1 and less than N; and the number of each positive integer greater than or equal to 1 and less than N in the second sequence is the same.
[0011] Based on this implementation, the first matrix can be obtained by extracting K rows of elements from the second matrix. Each column of the first matrix serves as a sequence in the sequence set, thereby accurately determining the sequence set. The indices of the K rows of elements in the second matrix constitute a difference set.
[0012] In one possible implementation, the first sequence is a column of elements in the first matrix, or a sequence in the sequence set. Based on this implementation, the first sequence may be a sequence in the ETF sequence group, in which case inter-user interference is minimized. Optionally, the first sequence may be obtained by performing sequence normalization on a column of elements in the first matrix. During sequence normalization, each element may be multiplied by a sequence normalization coefficient.
[0013] In one possible implementation, the first sequence is a column of elements in a third matrix, the third matrix is obtained by performing a tensor product operation on the first matrix and a fourth matrix, and the fourth matrix satisfies the Welch bound condition. Alternatively, any sequence in the sequence set corresponds to a column of elements in the first matrix, the first sequence is a sequence in the second sequence set, and any sequence in the second sequence set is a column of elements in the third matrix. Based on this implementation, the third matrix can be obtained by performing a tensor product operation on an ETF matrix (i.e., the first matrix) and a matrix that meets the Welch bound (which can be called a WBE matrix) (i.e., the fourth matrix), and the first sequence can be a sequence consisting of a column of elements in the third matrix. The number of rows in the third matrix is at least twice the number of rows in the first matrix, thereby allowing the length of the sequence to be extended to accommodate different transmission rate requirements. Furthermore, the extended sequence is at least a sequence in the WBE sequence group, meaning that the extended sequence satisfies the Welch bound condition and still has low inter-user interference. Optionally, the first sequence can be obtained by performing sequence normalization on a column of elements in the third matrix.
[0014] In a possible implementation, the fourth matrix is an orthogonal matrix, so that efficient sequence length extension can be achieved. For example, the fourth matrix is
[0015] In a possible implementation, the first value is equal to When the first value is When the sequence set is an ETF sequence group, the inter-user interference reduction effect can be optimized. It is understood that the present application does not limit the first value to be expressed in other forms, such as by appropriately modifying the above expression, such as adding a constant term and / or multiplying by a coefficient.
[0016] In a possible implementation, the first matrix is an ETF matrix, and the sequence set is an ETF sequence group, so that the effect of reducing inter-user interference can be optimized.
[0017] In a possible implementation, when K=2 and N=3, the indexes of the K-row elements in the second matrix are 2 and 3; or,
[0018] When K=3 and N=7, the indices of the K-row elements in the second matrix are 2, 3, and 5 respectively; or,
[0019] When K=4 and N=13, the indices of the K rows of elements in the second matrix are 1, 2, 4 and 10 respectively; or,
[0020] When K=5 and N=11, the indices of the K rows of elements in the second matrix are 2, 4, 5, 6 and 10 respectively; or,
[0021] When K=7 and N=15, the indices of the K rows of elements in the second matrix are 1, 2, 3, 5, 6, 9 and 11 respectively; or,
[0022] When K=9 and N=19, the indices of the K rows of elements in the second matrix are 2, 5, 6, 7, 8, 10, 12, 17 and 18 respectively; or,
[0023] When K=11 and N=23, the indices of the K rows of elements in the second matrix are 2, 3, 4, 5, 6, 9, 10, 13, 14, 17 and 19 respectively; or,
[0024] When K=13 and N=40, the indices of the K rows of elements in the second matrix are 1, 2, 4, 6, 10, 16, 23, 26, 27, 28, 35, 36 and 39 respectively; or,
[0025] When K=5 and N=21, the indices of the K rows of elements in the second matrix are 4, 7, 8, 13 and 15 respectively; or,
[0026] When K=6 and N=31, the indices of the K rows of elements in the second matrix are 2, 6, 12, 25, 26 and 28 respectively; or,
[0027] When K=9 and N=37, the indices of the K rows of elements in the second matrix are 2, 8, 10, 11, 13, 17, 27, 34 and 35 respectively; or,
[0028] When K=8 and N=57, the indices of the K rows of elements in the second matrix are 2, 7, 8, 10, 20, 39, 43 and 50 respectively; or,
[0029] When K=9 and N=73, the indices of the K rows of elements in the second matrix are 18, 34, 35, 46, 54, 60, 64, 67 and 69 respectively; or,
[0030] When K=10 and N=91, the indices of the K rows of elements in the second matrix are 1, 9, 12, 25, 29, 34, 35, 71, 73 and 85 respectively; or,
[0031] When K=12 and N=133, the indices of the K rows of elements in the second matrix are 2, 11, 12, 14, 28, 32, 69, 76, 84, 111, 116 and 122 respectively.
[0032] Based on this implementation, K rows of elements can be extracted from the second matrix as the first base station according to their indices in the second matrix, thereby achieving accurate and efficient determination of the sequence set and the first sequence.
[0033] In a possible implementation, when K=2 and N=3, the sequence set includes the following sequences 1 to 3:
[0034] When K=3 and N=7, the sequence set includes the following sequences 1 to 7:
[0035] When K=4 and N=13, the sequence set includes the following sequences 1 to 13:
[0036] When K=6 and N=31, the sequence set includes the following sequences 1 to 31:
[0037] Based on this implementation, the sequence set and / or the first sequence can be determined by looking up a table according to the values of K and N, so as to achieve accurate and efficient determination of the first sequence.
[0038] In a possible implementation manner, the indication information of the first sequence includes an index of the first sequence in the sequence set.
[0039] Based on this implementation, the first sequence can be flexibly and efficiently indicated through the sequence index. Accordingly, the first communication device can determine the first sequence from the sequence set according to the index.
[0040] In a possible implementation manner, the first communication device may further obtain indication information of the sequence combination.
[0041] Based on this implementation, flexible and efficient indication of sequence sets can be achieved through the indication information index of the sequence sets.
[0042] In a possible implementation manner, the indication information of the sequence set includes the N and the K.
[0043] Based on this implementation, the indication information of the sequence set can be the N and the K. When there are multiple sequence sets, there is no need to uniformly number the sequence sets, which reduces management complexity. In addition, there is no need to use a unified number to indicate the sequence sets, which can reduce the overhead of sequence set indication.
[0044] In a second aspect, a communication method is provided. The method can be implemented by a second communication device. The second communication device can be used to receive signals. For example, the second communication device can be a terminal device or an access network device (or replaced by a network device, such as a base station). The second communication device can also be a component in the terminal device or a component in the access network device. Among them, the components in the present application may include, for example, at least one of a chip, a chip system, a processor, a transceiver, a processing unit, or a transceiver unit. Taking the execution subject as the second communication device as an example, the communication method provided in the present application may include the following steps: the second communication device obtains indication information of a first sequence, and the sequence set corresponding to the first sequence satisfies: the maximum value of the square of the inner product of any two sequences in the sequence set is equal to a first value, and the first value is associated with N and K, where N represents the number of sequences in the sequence set and K represents the length of the sequence in the sequence set; the second communication device transmits a first signal to the first communication device, and the first signal corresponds to the first sequence.
[0045] The possible implementations of the second aspect can refer to the corresponding possible implementations of the first aspect, and the repeated parts will be omitted.
[0046] In a third aspect, a communication device is provided. The device can implement the method described in any possible implementation of any of the first and second aspects. The device has the functions of the first or second communication device described above. The device can be, for example, a terminal device, a functional module in a terminal device, a network device, or a functional module in a network device.
[0047] In an optional implementation, the device may include a module corresponding to the method / operation / step / action described in any possible implementation of any aspect of the first to second aspects, and the module may be a hardware circuit, or software, or a hardware circuit combined with software. In an optional implementation, the device includes a processing unit (sometimes also referred to as a processing module) and a communication unit (sometimes also referred to as a transceiver module, a communication module, etc.). The transceiver unit can implement a sending function and a receiving function. When the transceiver unit implements the sending function, it can be called a sending unit (sometimes also referred to as a sending module). When the transceiver unit implements the receiving function, it can be called a receiving unit (sometimes also referred to as a receiving module). The sending unit and the receiving unit can be the same functional module, which is called a transceiver unit, and the functional module can implement a sending function and a receiving function; or, the sending unit and the receiving unit can be different functional modules, and the transceiver unit is a general term for these functional modules.
[0048] Exemplarily, when the apparatus is used to execute the method described in any one of the first aspect to the second aspect, the apparatus may include a communication unit and a processing unit.
[0049] In a fourth aspect, an embodiment of the present application also provides a communication device, comprising a processor for executing a computer program (or computer-executable instructions) stored in a memory. When the computer program (or computer-executable instructions) is executed, the device executes the method described in any possible implementation of any one of the first to second aspects.
[0050] In one possible implementation, the processor and memory are integrated;
[0051] In another possible implementation, the memory is located outside the communication device.
[0052] The communication device also includes a communication interface, which is used for the communication device to communicate with other devices, such as sending or receiving data and / or signals. Exemplarily, the communication interface can be a transceiver, circuit, bus, module or other type of communication interface.
[0053] In a fifth aspect, a computer-readable storage medium is provided, which is used to store computer programs or instructions. When the computer-readable storage medium is executed, the method described in any possible implementation of any aspect from the first to the second aspect and the method shown in any possible implementation thereof are implemented.
[0054] In a sixth aspect, a computer program product comprising instructions is provided, which, when executed on a computer, enables the method described in any possible implementation of any one of the first to second aspects to be implemented.
[0055] In a seventh aspect, an embodiment of the present application further provides a communication device for executing the method described in any possible implementation of any one of the first to second aspects above.
[0056] In an eighth aspect, a chip system is provided, which includes a logic circuit (or it can be understood that the chip system includes a processor, and the processor may include a logic circuit, etc.), and may also include an input and output interface. The input and output interface can be used to input messages and can also be used to output messages. The input and output interfaces can be the same interface, that is, the same interface can implement both the sending function and the receiving function; or, the input and output interfaces include an input interface and an output interface, the input interface is used to implement the receiving function, that is, for receiving messages; the output interface is used to implement the sending function, that is, for sending messages. The logic circuit can be used to perform the operations other than the sending and receiving functions in the method described in any possible implementation of any one of the first to second aspects above; the logic circuit can also be used to transmit messages to the input and output interface, or receive messages from other communication devices from the input and output interface. The chip system can be used to implement the method described in any possible implementation of any one of the first to second aspects above. The chip system can be composed of a chip, or it can include a chip and other discrete devices.
[0057] Optionally, the chip system may further include a memory, which may be used to store instructions, and the logic circuit may call the instructions stored in the memory to implement corresponding functions.
[0058] In the ninth aspect, a communication method is provided, which may include the method implemented by the first communication device as shown in the first aspect and any possible implementation thereof, and the method implemented by the second communication device as shown in the second aspect and any possible implementation thereof.
[0059] In a tenth aspect, a communication system is provided, which may include a first communication device and a second communication device. The first communication device may be used to implement the method of the first aspect and any possible implementation thereof, and the second communication device may be used to implement the method of the second aspect and any possible implementation thereof.
[0060] The technical effects brought about by the above third to tenth aspects can be found in the description of the beneficial effects of the corresponding schemes in the above first to second aspects, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS
[0061] FIG1 is a schematic diagram of the architecture of a wireless communication system provided in an embodiment of the present application;
[0062] FIG2 is a schematic diagram of a sequence usage method in a NOMA scenario provided in an embodiment of the present application;
[0063] FIG3 is a flow chart of a communication method provided in an embodiment of the present application;
[0064] FIG4 is a schematic structural diagram of a communication device provided in an embodiment of the present application;
[0065] FIG5 is a schematic structural diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0066] To facilitate understanding of the embodiments of the present application, the application scenarios used in the present application are described using the communication system architecture shown in FIG1 as an example. FIG1 is a schematic diagram illustrating a possible, non-limiting system. As shown in FIG1 , a communication system 1000 includes a radio access network (RAN) 100 and a core network (CN) 200. The RAN 100 includes at least one network device (such as 110a and 110b in FIG1 , collectively referred to as 110) and at least one terminal device (such as 120a-120j in FIG1 , collectively referred to as 120). The RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in FIG1 ). The terminal device 120 is wirelessly connected to the network device 110. The network device 110 is wirelessly or wiredly connected to the core network 200. The core network device in the core network 200 and the network device 110 in the RAN 100 may be different physical devices, or they may be the same physical device that integrates the core network logical functions and the radio access network logical functions.
[0067] The RAN 100 may be a cellular system related to the Third Generation Partnership Project (3GPP), such as a fourth generation (4G) or fifth generation (5G) mobile communication system, or an evolved system after 5G (such as a sixth generation (6G) mobile communication system). The RAN 100 may also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN 100 may also be a communication system that integrates two or more of the above systems.
[0068] The apparatus provided in the embodiment of the present application can be applied to the network device 110 or to the terminal device 120. It is understood that FIG1 only shows a possible communication system architecture to which the embodiment of the present application can be applied, and in other possible scenarios, the communication system architecture may also include other devices.
[0069] Another communication system used in the embodiment of the present application may include a first communication device and a second communication device.
[0070] In one implementation method, the first communication device is a network device or a module for a network device, and the second communication device is a terminal device or a module for a terminal device, wherein the network device is, for example, an access network device. The first communication device and the second communication device communicate via an air interface.
[0071] In another implementation method, the first communication device is a terminal device or a module for a terminal device, and the second communication device is a network device or a module for a network device. The first communication device and the second communication device communicate with each other via an air interface.
[0072] In another implementation method, the first communication device is a network device or a module for a network device, and the second communication device is a network device or a module for a network device. The first communication device and the second communication device communicate with each other via an air interface or a wired manner.
[0073] In another implementation method, the first communication device is a terminal device or a module for a terminal device, and the second communication device is a terminal device or a module for a terminal device. The first communication device and the second communication device communicate with each other via an air interface.
[0074] Of course, the first communication device and the second communication device in the embodiment of the present application can also be other types of devices. For example, the first communication device can also be a cloud device or a cloud server and the second communication device can be a cloud device or a cloud server. This application does not limit this.
[0075] In the implementation of this application, a terminal device is a device with wireless transceiver capabilities, and may specifically refer to user equipment (UE), access terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device. The terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on water (such as ships); and can also be deployed in the air (such as aircraft, balloons, and satellites). The terminal device can be a cellular phone, a mobile phone, a tablet computer (pad), a wireless data card, a wireless modem, a satellite terminal, a vehicle (e.g., a car, a bicycle, an electric car, an airplane, a ship, a train, a high-speed rail, etc.) onboard equipment, a robotic arm, a workshop equipment, a wearable device (e.g., a smart watch, a smart bracelet, a pedometer, etc.), a drone, a robot, a smart point of sale (POS) machine, a customer-premises equipment (CPE), a computer with a wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a terminal device in industrial control, a terminal device in self-driving, a terminal device in remote medical care, a terminal device in a smart grid, a terminal in transportation safety, a terminal device in a smart city, a terminal in a smart home (e.g., a refrigerator, a television, an air conditioner, an electric meter, and other smart home devices). The terminal device can also be other devices with terminal functions. The embodiments of this application do not limit the device form factor of the terminal. The device used to implement the functions of the terminal device can be the terminal device; it can also be a device that supports the terminal device to implement the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In the embodiments of this application, the chip system can be composed of chips or include chips and other discrete devices.
[0076] In the implementation of this application, the network device is a device with wireless transceiver functions, which is used to communicate with the terminal device or other network devices; it can also be a device that can access the terminal device to the wireless network, such as a radio access network (RAN) device or node. The network devices in the embodiments of the present application may include various forms of base stations, such as: base stations, evolved NodeBs (eNodeBs), next generation NodeBs (gNBs), macro base stations, micro base stations (also known as small stations), relay stations, access points, devices that implement base station functions in communication systems evolved after the fifth generation (5G) technology, access points (APs) in wireless local area networks (WLAN) systems, integrated access and backhaul (IAB) nodes, transmission points (TRPs), transmitting points (TPs), mobile switching centers, and devices that perform base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, etc., and may also include network devices in non-terrestrial network (NTN) communication systems, that is, they can be deployed on high-altitude platforms or satellites. In some possible scenarios, different network devices implement part of the functions of the base station respectively. For example, the network device can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU can be set separately, or they can be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).It is understood that the network device may be a CU node, a DU node, or a device including a CU node and a DU node. In addition, the CU may be classified as a network device in the access network RAN, or may be classified as a network device in the core network CN, without limitation herein.
[0077] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in an open access network (open RAN, ORAN) system, CU may also be called O-CU (open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.
[0078] In the embodiments of the present application, the form of the network device is not limited. The device used to implement the function of the network device can be a network device; it can also be a device that can support the network device to implement the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device.
[0079] It can be understood that the network devices and terminal devices, the network devices and the network devices, and the terminal devices in this application can communicate through authorized spectrum, can communicate through unauthorized spectrum, or can communicate through both authorized spectrum and unauthorized spectrum. In addition, the network devices and the terminal devices, the network devices and the network devices, and the terminal devices can communicate through spectrum below 6 gigahertz (GHz), for example, through 700 / 900 megahertz (MHz), 2.1 / 2.6 / 3.5GHz frequency bands, or through spectrum above 6GHz, for example, through millimeter waves, terahertz (THz) waves, and can also use spectrum below 6GHz and spectrum above 6GHz for communication at the same time. The embodiments of this application do not limit the spectrum resources used for wireless communication.
[0080] In the embodiments of the present application, the functions of the network device may also be performed by a module (such as a chip) in the network device, or by a control subsystem that includes the network device functions. The control subsystem that includes the network device functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal device may also be performed by a module (such as a chip or a modem) in the terminal device, or by a device that includes the terminal device functions.
[0081] Throughout the evolution of communication systems, high throughput and a large number of connections have always been core challenges for wireless communication networks. To address these challenges, 5G communications have proposed applications such as enhanced mobile broadband (eMBB), ultra-reliable and low-latency communication (URLLC), and massive machine-type communication (mMTC) as technical goals. The 6G communication system, which will evolve after 5G, will inevitably evolve towards higher throughput, lower latency, higher reliability, a larger number of connections, and greater spectrum utilization.
[0082] In wireless communications, data is sent from one device to another via wireless resources. Physically speaking, wireless resources are divided into two categories: time and frequency. When serving multiple users at the same time, due to the limited freedom of physical wireless resources, the question arises of how to allocate physical wireless resources among multiple users. This problem is called the problem of multiple access (MA). From the perspective of resource reuse, MA technology can be divided into OMA and NOMA. In this application, "orthogonal" means that each user has independent freedom in at least one resource domain (such as time domain, frequency domain, code domain, spatial domain, etc.), that is, the data transmission of a user will not be affected by other users in at least one resource domain.
[0083] Typical NOMA technologies include sparse code multiple access (SCMA), multi-user shared access (MUSA), resource spread multiple access (RSMA), pattern division multiple access (PDMA), interleave-grid multiple access (IGMA), interleave division multiple access (IDMA), and non-orthogonal coded multiple access (NCMA). These technologies use codebooks, spreading sequences, sparse mapping sequences, etc. as signatures, and correspondingly adopt different bit-level operations and / or symbol-level operations at the NOMA transmitter. Bit-level processing includes user-specific bit-level encoding, scrambling, and interleaving (for example, IDMA uses bit-level interleaving as a signature to distinguish users); symbol-level processing includes user-specific symbol-level spreading, modulation, scrambling, and interleaving.
[0084] For example, FIG2 is a schematic diagram of a dense spread spectrum scheme, in which the modulation symbol corresponding to the information to be transmitted is multiplied by the sequence. n It represents the n-length sequence in the NOMA scenario, through which the modulation symbols i1, i2, ...i corresponding to the user's information to be transmitted can be represented. n Mapped to the transmission resources corresponding to the sequence.
[0085] Since NOMA communication technology has non-orthogonal characteristics, there will inevitably be inter-user interference at the NOMA receiver. It is understood that the use scenarios of the communication method of the present application include but are not limited to NOMA scenarios, and can also be applied to other transmission scenarios where inter-user interference exists.
[0086] How to reduce interference between users is a technical problem that needs to be solved urgently in the field of communications.
[0087] To solve the above technical problems, the present application provides a communication method. The communication method can be implemented by a first communication device and a second communication device. The first communication device can serve as a signal sending end, and the second communication device can serve as a signal receiving end. That is, the first communication device can be used to send signals, and the second communication device can be used to receive signals. As an example, during uplink communication, the first communication device can be a terminal device, or can be a module or chip or other component in the terminal device, and the second communication device can be a network device, or can be a module or chip or other component in the network device, and the network device can be, for example, a RAN or other access network device. As another example, during downlink communication, the first communication device can be a network device, or can be a module or chip or other component in the network device, and the second communication device can be a terminal device, or can be a module or chip or other component in the terminal device. Similarly, it can also be considered that the first communication device can serve as a signal receiving end, and the second communication device can serve as a signal sending and receiving end.
[0088] The method is described below with reference to the process shown in FIG3 .
[0089] S101: A first communication device and a second communication device respectively obtain indication information of a first sequence.
[0090] The first communication device may determine the first sequence based on the indication information of the first sequence. For example, the indication information of the first sequence may be an index of the sequence in a sequence codebook, or the indication information may include the first sequence. The sequence codebook may be indicated by the network device through configuration information. Accordingly, when the first sequence needs to be indicated, the network device may indicate the index of the first sequence through the indication information of the first sequence.
[0091] In this application, the sequence set corresponding to the first sequence satisfies:
[0092] The maximum value of the square of the inner product of any two sequences in the sequence set is equal to a first value, and the first value is associated with N and K. N represents the number of sequences in the sequence set, and K represents the length of the sequences in the sequence set.
[0093] Optionally, the first value may satisfy Expression 1: For example, the first value is equal to
[0094] It is understood that the first value may also be expressed by other formulas. For example, based on the numerator, denominator, or entirety of the above expression, one or more constants may be added or subtracted, and / or multiplied or divided by a certain coefficient to achieve similar effects.
[0095] If expressed in formula, the sequences in the sequence set can satisfy:
[0096] Among them, x i is the i-th sequence in the sequence set, x j is the jth sequence in the sequence set. That is, the sequence x i and x j The inner product of .
[0097] Alternatively, the above sequence set is an ETF sequence group, which can also be called an ETF sequence set. The maximum interference between sequences in an ETF sequence group is minimized. Specifically, when multiple users transmit signals using different sequences in the ETF sequence group, the maximum interference between the users is lower than the maximum inter-user interference when the users transmit signals using other sequences. Therefore, when different terminal devices use different sequences in the same ETF sequence group, mutual interference between the different terminal devices can be minimized.
[0098] Therefore, the first sequence in the present application may be a sequence in the ETF sequence group, or the first sequence may be a sequence determined according to the ETF sequence group.
[0099] Optionally, in uplink transmission and / or downlink transmission, the network device may send indication information of the first sequence to the terminal device, that is, the network device may indicate the first sequence to the terminal device. The indication information of the first sequence may be included in a radio resource control (RRC) message, a medium access control (MAC) control element (CE) or downlink control information (DCI) sent by the network device to the terminal device. For example, the network device may configure a sequence codebook to the terminal device through an RRC message or a MAC CE, and send indication information of the first sequence to the terminal device through DCI. At this time, the indication information of the first sequence may be an index of the sequence, which is used to indicate the sequence from the sequence codebook. In the present application, the first communication device may be a terminal device, and the second communication device may be a network device, so the second communication device may send indication information of the first sequence to the first communication device. Alternatively, the first communication device may be a network device, and the second communication device may be a terminal device, so the first communication device may send indication information of the first sequence to the second communication device.
[0100] In addition, the sequence code book can also be stored in the local configuration of the terminal device, that is, the network device does not need to configure the sequence code book to the terminal device. For example, the terminal device can obtain the sequence code book according to the factory configuration or based on the configuration related to the communication protocol.
[0101] As an example, in uplink transmission, a first sequence of indication information may be sent by a network device to a terminal device. At this time, the terminal device may serve as a first communication device, the network device may serve as a second communication device, and the first sequence of indication information may be sent by the network device to the terminal device. Therefore, in uplink transmission, the first communication device obtaining the first sequence of indication information may refer to: the first communication device receiving the first sequence of indication information from the second communication device. The second communication device obtaining the first sequence of indication information may refer to: the second communication device generating the first sequence of indication information after allocating the first sequence to the first communication device, or the network device reading the generated first sequence of indication information.
[0102] As another example, in downlink transmission, the network device can still send the first sequence of indication information to the terminal device. In this case, the network device can serve as the first communication device, and the terminal device can serve as the second communication device. Therefore, in downlink transmission, the first communication device obtaining the first sequence of indication information can mean that the first communication device generates indication information for indicating the first sequence after allocating the first sequence to the second communication device, or the network device reads the generated first sequence of indication information; the second communication device obtaining the first sequence of indication information can mean that the second communication device receives the first sequence of indication information from the first communication device.
[0103] In addition, in communication between terminal devices, the first communication device and the second communication device may be different terminal devices. In this case, the first communication device may send the first sequence of indication information to the second communication device, or the second communication device may send the first sequence of indication information to the first communication device. In addition, in communication between terminal devices, the first sequence may also be configured by the network device. In this case, as an implementation of S101, the first communication device and the second communication device may each receive the first sequence of indication information from the network device.
[0104] S102: The first communication device and the second communication device transmit a first signal according to a first sequence of indication information.
[0105] The first signal corresponds to the first sequence. For example, the first signal may be a signal obtained by performing spread spectrum processing on information to be transmitted by the first communication device according to the first sequence based on a dense spread spectrum scheme.
[0106] It can be understood that the first signal can be transmitted between the first communication device and the second communication device via the air interface.
[0107] For example, both the first communication device and the second communication device have air interface transmission capabilities, such as both the first communication device and the second communication device have wireless transceivers such as antennas, then the first communication device can send the first signal through the wireless transceiver, and accordingly, the second communication device can receive the first signal through the wireless transceiver, and demodulate and process the first signal to obtain the information carried by the first signal.
[0108] In addition, the first communication device and / or the second communication device may be a device or apparatus that does not have air interface communication capabilities, such as a chip. The first communication device and / or the second communication device may communicate via an external antenna or other wireless transceiver. For example, in a case where neither the first communication device nor the second communication device has air interface communication capabilities, the first communication device may output a first signal to the antenna via an interface between the first communication device and the antenna, and the antenna may be used to transmit the first signal via the air interface. Correspondingly, the antenna connected to the second communication device may be used to receive the first signal transmitted via the air interface and transmit the signal to the second communication device via the interface between the antenna and the second communication device. The second communication device may then perform demodulation or other processing on the received signal to obtain the information carried by the first signal.
[0109] Based on the process shown in Figure 3, the first communication device can determine the first sequence based on the indication information of the first sequence and transmit a first signal corresponding to the first sequence. The first sequence corresponds to a sequence set, and the sequence set that satisfies the above conditions can be an ETF sequence group. For example, the first sequence can be a sequence determined based on the ETF sequence group; in another example, the first sequence can be a sequence in the ETF sequence group, such as an ETF sequence. According to the characteristics of the ETF sequence group, when multiple users transmit signals using different sequences in the ETF sequence group, the maximum interference between the multiple users is lower than the maximum inter-user interference when the multiple users use other sequences. Therefore, when users transmit signals using the first sequence corresponding to the ETF sequence group, interference between users can be reduced. Therefore, it can be said that this communication method can reduce interference between users.
[0110] The following describes a method for determining a sequence set corresponding to the first sequence.
[0111] In this application, an ETF sequence set can be constructed based on a difference set.
[0112] Among them, the difference set u={u1,u2,…,u K} is Z N= a subset of {1, 2, ..., N}, the difference between the two elements in the difference set and the modulus of N form a second sequence, and the values in the second sequence are all positive integers greater than or equal to 1 and less than N. Moreover, among all the positive integers greater than or equal to 1 and less than N in the second sequence, the number of each positive integer in the second sequence is the same. k ∈{0,1,2…,N-1},k=1,2,…,K, the kth element u in the difference set k Corresponding to Z N u in k +1 element.
[0113] If the formula is used, the value in the second sequence can be expressed as: (u k -u l ) mod N, k ≠ l. Where k, l = 1, 2, ..., K. For example, N = 7, K = 3, and u = {1, 2, 4}.
[0114] When constructing a sequence set, Z N As row indices of an N-order DFT matrix (referred to as the second matrix), the K elements in the difference set u can represent the indices of K rows of elements in the second matrix. Therefore, based on the difference set u, K rows of elements can be extracted from the second matrix. The K rows of elements can form a K×N matrix, which is then used as the first matrix. Each column of the first matrix can be considered an ETF sequence, meaning the first matrix can be considered a matrix consisting of N ETF sequences, each of length K. In other words, these N sequences can be sequences in the sequence set.
[0115] It is understood that the present application does not limit the method for determining the N-order DFT matrix (i.e., the second matrix). For example, the N-order DFT matrix can be generated by a network device, or the second matrix can be configured through a communication protocol or configuration information of a communication device, without specific limitation.
[0116] The following describes how to determine the difference set using Method 1 and Method 2.
[0117] Z N = a set of K differences in {1, 2, …, N}. Therefore, we can extract the K rows of elements with row number u from the N-order second matrix to obtain a K×N first matrix. This K×N matrix forms an ETF codebook, which contains N spreading codes, each of length K. A spreading code is a sequence.
[0118] It is understood that there are multiple numerical options for ω, and different numerical options may correspond to different difference sets. The difference sets shown in this application are examples of some possible difference sets.
[0119] That is, the indexes of the K rows of elements constitute a first set, which satisfies: {t+1:0≤t<N, trace(α t )=0};
[0120] in, Right now Representing a finite field Any element ω relative to the base domain The trace of α represents a finite field Generator of the multiplicative group, d is a positive integer greater than or equal to 2, q = p r , t and r are integers.
[0121] Alternatively, if d=2 is selected, then in method 1, N=p can be obtained. 2 +p+1 and K=p+1. Therefore OF represents the overload factor. Therefore, as p increases, OF can approach the theoretical limit of ETF. Therefore, when d = 2, the sequence constructed in Method 1 is suitable for scenarios with high OF demand.
[0122] Method 2: Take a prime number to the power q = p r ≡3 mod 4, then the set It's Z N ={1,2,…,N} contains The difference set of elements, t and r are integers. ≡ represents congruence, q=p r ≡3 mod 4 means that q-3 is divisible by 4. Therefore, we can extract the K rows of elements numbered u from the N-order second matrix to obtain the K×N first matrix. This K×N matrix forms an ETF codebook, which contains N spreading codes, each of length K. A spreading code is a sequence. The OF of the sequence set constructed using method 2 is around 2.
[0123] For example, Table 1 shows the difference sets obtained under different values of N and K based on Mode 1 or Mode 2.
[0124] Table 1
[0125] The difference sets shown in Table 1 are examples of some possible difference sets, and the present application is not limited to the difference sets shown in Table 1. For example, a set corresponding to a difference set of N and K after cyclic shift of the elements is also a difference set.
[0126] As described above, the elements in the difference set are the indices of the K rows of elements extracted from the N-order DFT matrix (i.e., the second matrix) in the second matrix. Therefore, when determining the sequence set, based on the difference set shown in Table 1, a first matrix consisting of K rows of elements whose indices belong to the difference set can be extracted from the second matrix. The first matrix is the matrix consisting of the sequences in the sequence set. Among them, the kth element u in the difference set is k Corresponding to Z N u in k +1 element, so the uth element in the second matrix can be extracted based on the difference set k +1 row elements form the first matrix, k = 1, 2, ..., K. For example, when N = 7 and K = 3, the difference set is {1, 2, 4}, so the elements of the 2nd, 3rd, and 5th rows can be extracted from the 7th-order DFT matrix to form the first matrix, that is, the indices of the K-row elements in the second matrix are 2, 3, and 5, respectively.
[0127] For example, Tables 2-1 to 2-4 are examples of sequence sets. The first sequence can be any sequence in the first matrix shown in the table. When K=2 and N=3, the sequence set includes the sequences shown in Table 2-1.
[0128] Table 2-1
[0129] When K=3 and N=7, the sequence set includes the sequences shown in Table 2-2. In the sequences shown in this application, i represents an imaginary unit, that is, the sequence can be composed of one or more complex elements.
[0130] Table 2-2
[0131] When K=4 and N=13, the sequence set includes the sequences shown in Table 2-3.
[0132] Table 2-3
[0133] When K=6 and N=31, the sequence set includes the sequences shown in Table 2-4.
[0134] Table 2-4
[0135] The sequences and sequence sets shown in Tables 2-1 to 2-4 are just some possible implementation examples, and the sequences and sequence sets protected by this application are not limited thereto.
[0136] Optionally, the sequence sets shown in Tables 2-1 to 2-4 can be obtained by extracting K rows of elements from the second matrix based on the difference set. For example, when K = 2 and N = 3, the elements in the second and third rows of Table 2-1 can be used as the first matrix. In this case, the first matrix can be expressed as:
[0137] It will be appreciated that Tables 2-1 to 2-4 are exemplary representations of the correspondence between K, N, and the sequence set. The network device may determine the sequence set and / or the first sequence based on the values of K and N by looking up the table, thereby achieving accurate and efficient determination of the first sequence. This application does not limit the representation or storage of the correspondence between K, N, and the sequence set in any form other than the above tables.
[0138] Optionally, the matrices shown in Tables 2-1 to 2-4 may be formed by extracting K rows of elements from an N-order DFT matrix (i.e., the second matrix) based on the difference set. For example, the N-order DFT matrix may satisfy:
[0139] Among them, a mn Represents the element value in the m-th row and n-th column of the N-th order DFT matrix.
[0140] In a possible embodiment, the first sequence may be a column of elements in the above first matrix. In other words, the first sequence corresponds to a column of elements in the first matrix. For example, the first sequence may be obtained according to a column of elements in the first matrix.
[0141] Optionally, in the process of obtaining a sequence based on a column of elements in the first matrix, a sequence normalization process can be performed on any column of elements in the first matrix, that is, by enlarging or shrinking the length of the vector composed of the column of elements to be 1, or in other words, the modulus of the column of elements to be 1, and the processed sequence can be used as the first sequence. For example, in the process of sequence normalization, each element in any column of the first matrix can be multiplied by the sequence normalization coefficient, and the elements after the sequence normalization process can be used as the first sequence. The sequence normalization coefficient can satisfy
[0142] Taking sequence 1 in Table 2-1 as an example, when K = 2 and N = 3, the sequence normalization coefficient is The first sequence obtained according to sequence 1 is expressed as
[0143] It is understandable that in some cases, sequence normalization processing is not required. For example, the first matrix itself satisfies that the length of the vector formed by a column of elements in the matrix is 1.
[0144] In this embodiment, the sequence set may serve as the sequence codebook in which the first sequence is located.
[0145] In another possible embodiment, the first sequence may be a sequence determined according to the sequence set in S101. For example, the sequence set may be used to determine a third matrix, and the first sequence may be a column of elements in the third matrix. The third matrix may be a matrix obtained by performing a tensor product operation on the first matrix and the fourth matrix. The fourth matrix is a matrix that satisfies the Welch bound condition, or in other words, the fourth matrix is a WBE matrix. Based on the tensor product operation, the length of the column vector of the third matrix, that is, the length of the sequence contained in the third matrix, is a multiple of the length of the column vector of the first matrix. Therefore, a length-extended sequence can be obtained based on the ETF sequence to meet the sequence length requirements of transmission scenarios with different transmission rates.
[0146] Any column element in the WBE matrix can be considered a sequence, and multiple columns of the WBE matrix can form a WBE sequence group. A WBE sequence group can also be called a WBE sequence set. A WBE sequence group can be considered a sequence group that minimizes the sum of the interference between each user in the sequence group.
[0147] For example, for any N sequences of length 1 {x1, x2, ..., x N}, if the following equation is satisfied, then this set of sequences can be called a WBE sequence set:
[0148] As an example of one way to obtain the third matrix, the third matrix can be expressed as in, represents the first matrix, Represents the fourth matrix. Represents a tensor product operation.
[0149] For example, if Among them, [a 11 ,…,a n1 ] to [a 1n ,…,a nn ] are respectively one of the sequences in the WBE sequence group, then the third matrix can satisfy:
[0150] It can be seen that the length of the column vector of the third matrix is n times the length of the column vector of the first matrix.
[0151] As an example, the orthogonal matrix can be a WBE matrix, that is, the fourth matrix can be an orthogonal matrix. For example, the fourth matrix is Therefore, the third matrix can be expressed as in, represents the first matrix. In this case, each column of the third matrix can be used as a sequence. For example, as a first sequence, its length is twice the length of the ETF sequence in the first matrix. Longer sequences are suitable for low-speed transmission scenarios. The set of sequences formed by all columns in the third matrix can be called a second sequence set. That is, the first sequence can be a sequence in the second sequence set. In this case, the second sequence set can serve as the sequence codebook containing the first sequence.
[0152] Optionally, a sequence normalization process can be performed on any column element in the third matrix, that is, by enlarging or shrinking the length of the vector composed of the elements in a column to be 1, or in other words, making the modulus of the elements in a column to be 1, and the processed sequence is used as the first sequence. For example, during the sequence normalization process, each element in any column of the third matrix can be multiplied according to the sequence normalization coefficient, and the elements after the sequence normalization process can be used as the first sequence. For example, the sequence normalization coefficient is, for example, n is the number of rows of the third matrix.
[0153] It can be understood that in some cases, sequence normalization processing is not required. For example, the third matrix itself satisfies that the length of the vector composed of a column of elements in the matrix is 1.
[0154] As an example, the first matrix The sequence and the third matrix in The sequences in the first matrix can be used to transmit data at different rates. For example, if terminal device 1 and terminal device 2 each transmit data at different rates, they can indicate to the network device their respective required transmission rates or transmission quantities. For example, the transmission rate required by terminal device 1 is greater than the transmission quantity required by terminal device 2. Accordingly, the network device can indicate the sequence in the first matrix to terminal device 1, causing terminal device 1 to use the sequence in the first matrix for data transmission. The network device can also indicate the sequence in the third matrix to terminal device 2, causing terminal device 2 to use the sequence in the third matrix for data transmission.
[0155] Specifically, if in a certain scenario, terminal device A and terminal device B need to transmit uplink data to the network device. Among them, terminal device A and terminal device B are respectively allocated 12 time-frequency resources. Terminal device A needs to transmit i on these 12 time-frequency resources. A1 and i A2 Two messages, and terminal device B needs to transmit i on these 12 resources B That is, the transmission rate required by terminal device A is greater than the transmission rate required by terminal device B.
[0156] As shown in Table 4, the network device can configure a sequence of length 6 to terminal device A and a sequence of length 12 to terminal device B. The sequence of length 6 can be the first matrix The sequence in length 12 can be the third matrix obtained according to the first matrix sequence in .
[0157] It can be understood that the i in Table 4 A and i B Respectively represent the information of terminal device A and terminal device B. In addition, as described in the full text, i A1 and i A2 These are two pieces of information of terminal device A. A (k) represents a sequence of length 6 assigned by the network device to the terminal A, k = 1, 2, ..., 6. B (l) represents a sequence of length 12 allocated by the network device to the terminal device B, where l=1, 2, ..., 12.
[0158] As an example of the indication information of the first sequence, the indication information of the first sequence may be an index of the first sequence in a sequence codebook, wherein the sequence codebook may be, for example, a sequence set corresponding to the first matrix or a second sequence set corresponding to the third matrix.
[0159] Optionally, the first communication device and / or the second communication device may further obtain indication information of a sequence combination, wherein the indication information of a sequence set may be used to indicate a sequence set.
[0160] For example, the indication information of a sequence set may be an index of the sequence set. For example, a network device may indicate one or more sequence sets and their indexes to a terminal device. The network device may also indicate one of the sequence sets using the sequence set index and further indicate a first sequence from the sequence set using the indication information of the first sequence.
[0161] For another example, the indication information of a sequence set may include the number N of sequences in the sequence set and the length K of the sequences in the sequence set. For example, the network device may indicate one or more sequence sets and the corresponding N and K of the sequence sets to the terminal device. The network device may also indicate one of the sequence sets using N and K, and further indicate a first sequence from the sequence set using the indication information of the first sequence.
[0162] As another example of the indication information of the first sequence, the first information may carry the first sequence. For example, taking sequence 1 in Table 2-1 as an example, when K=2 and N=3, the information element in the first information carries Used to indicate the first sequence.
[0163] It is understandable that in order to realize the functions in the above embodiments, the communication device provided by the present application may include hardware structures and / or software modules corresponding to the functions of the first communication device and / or the second communication device. Those skilled in the art should easily realize that, in combination with the units and method steps of each example described in the embodiments disclosed in this application, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application scenario and design constraints of the technical solution. Network equipment
[0164] Figures 4 and 5 are schematic diagrams of the structures of possible communication devices provided by embodiments of the present application. These communication devices can be used to implement the functions of the first communication device and / or the second communication device in the above-mentioned method embodiment, and thus can also achieve the beneficial effects possessed by the above-mentioned method embodiment. Among them, the first communication device and / or the second communication device can be used as a terminal or a network device, respectively. In an embodiment of the present application, the communication device can be a terminal or a network device as shown in Figure 1, or it can be a module (such as a chip) applied to a terminal or a network device.
[0165] As shown in Figure 4, the communication device 400 includes a processing unit 410 and a transceiver unit 420. The communication device 400 is used to implement the functions of the transmitting end or the receiving end in the method embodiment shown in Figure 3 above.
[0166] When the communication device 400 is used to implement the functions of the first communication device or the second communication device in the method embodiment shown in FIG3 , the processing unit 410 or the transceiver unit 420 may be used to obtain the first sequence of indication information. The transceiver unit 620 may be used to transmit the first signal.
[0167] In addition, the processing unit 410 or the transceiver unit 420 may be configured to obtain indication information of a sequence set.
[0168] For a more detailed description of the actions involved in the above-mentioned processing unit 410 and the transceiver unit 420, reference may be made to the relevant description in the method embodiment shown in FIG. 3 .
[0169] As shown in Figure 5, communication device 500 includes a processor 510 and an interface circuit 520. Processor 510 and interface circuit 520 are coupled to each other. It is understood that interface circuit 520 can be a transceiver or an input / output interface. Optionally, communication device 500 may also include a memory 530 for storing instructions executed by processor 510, input data required by processor 510 to execute instructions, or data generated after processor 510 executes instructions.
[0170] When the communication device 500 is used to implement the method shown in FIG. 3 , the processor 510 is used to implement the functions of the processing unit 410 , and the interface circuit 520 is used to implement the functions of the transceiver unit 420 .
[0171] When the above-mentioned communication device is a module or chip applied to the first communication device or the second communication device, the module or chip implements the functions of the first communication device or the second communication device in the above-mentioned method embodiment. The module or chip receives information through other modules (such as a radio frequency module or antenna), and the information can be received by the other modules over the air interface and then transmitted to the module or chip; or the module or chip sends information to other modules (such as a radio frequency module or antenna), and is used by the other modules to send the information over the air interface.
[0172] When the above-mentioned communication device is a module or chip applied to an access network device (such as a base station), the communication device implements the functions of the first communication device or the second communication device in the above-mentioned method embodiment. The module or chip can be used to receive information from other modules (such as a radio frequency module or antenna), and the information is received by other modules through the air interface; or, the module or chip sends information to other modules (such as a radio frequency module or antenna), and is used for other modules to send the information through the air interface. The module or chip here can be a baseband chip, or a CU, DU or other module, or a device under the O-RAN architecture, such as an open CU, open DU and other devices.
[0173] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.
[0174] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions that can be executed by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a base station or an O-RAN. The processor and the storage medium can also exist as discrete components in a base station or an O-RAN.
[0175] The present application also provides a computer-readable storage medium that stores instructions, which may also be referred to as a computer program, computer program code, etc. The instructions are executed on a computer, causing the computer to execute the method shown in FIG. 3 of the above method embodiment and in various embodiments of the present application.
[0176] An embodiment of the present application further provides a computer program product, including a computer program or instructions. When the computer program or instructions are executed on a computer, the method shown in FIG. 3 and various embodiments of the present application is implemented.
[0177] An embodiment of the present application further provides a chip, which includes a processor coupled to a memory, and the processor is configured to execute a computer program or instruction stored in the memory, so that the method shown in FIG3 and the various embodiments of the present application is implemented. For example, taking the chip implementing the functions of an access network device as an example, the chip can receive information from other modules of the access network device (such as a radio frequency or antenna, etc.), and the information can be sent by a terminal to the access network device. Alternatively, the chip can send information to other modules in the access network device (such as a radio frequency or antenna, etc.), and the information is sent by the access network device to the terminal, etc.
[0178] The embodiment of the present application further provides a communication system, including a first communication device and a second communication device. The first communication device and the second communication device can be used to implement the functions of the first communication device and the second communication device in the present application, respectively.
[0179] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video disk; or a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.
[0180] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.
[0181] In this application, "at least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship; in the formula of this application, the character " / " indicates that the previous and next associated objects are in a "division" relationship. "Including at least one of A, B and C" can mean: including A; including B; including C; including A and B; including A and C; including B and C; including A, B and C.
[0182] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.
Claims
1. A sequence indication method, characterized in that: include: Obtain indication information of a first sequence, where a sequence set corresponding to the first sequence satisfies: The maximum value of the square of the inner product of any two sequences in the sequence set is equal to a first value, and the first value is associated with N and K, where N represents the number of sequences in the sequence set, and K represents the length of the sequence in the sequence set; A first signal is transmitted, the first signal corresponding to the first sequence.
2. The method according to claim 1, characterized in that Any sequence in the sequence set corresponds to a column of elements in the first matrix; The first matrix is composed of K rows of elements in the second matrix, the second matrix is an N-order discrete Fourier transform DFT matrix, K and N are both positive integers, N is greater than 1, and K is less than or equal to N; The K row elements satisfy: the difference between the two indices in the second matrix and the modulus of N constitute a second sequence, and the values in the second sequence are positive integers greater than or equal to 1 and less than N; and among the positive integers greater than or equal to 1 and less than N, the number of each positive integer in the second sequence is the same.
3. The method according to claim 2, characterized in that The first sequence is a column of elements in the first matrix; or, The first sequence is a column of elements in a third matrix, the third matrix is a matrix obtained by performing a tensor product operation on the first matrix and a fourth matrix, and the fourth matrix is a matrix that satisfies the Welch bound condition.
4. The method according to claim 1, characterized in that The first sequence is a sequence in the sequence set; or, Any sequence in the sequence set corresponds to a column of elements in the first matrix, the first sequence is a sequence in the second sequence set, any sequence in the second sequence set is a column of elements in a third matrix, the third matrix is a matrix obtained by performing a tensor product operation on the first matrix and a fourth matrix, and the fourth matrix is a matrix that satisfies the Welch bound condition; the first matrix is composed of K rows of elements in the second matrix, the second matrix is an N-order DFT matrix, K and N are both positive integers, N is greater than 1, and K is less than or equal to N; The K row elements satisfy: the difference between the two indices in the second matrix and the modulus of N constitute a second sequence, and the values in the second sequence are positive integers greater than or equal to 1 and less than N; and among the positive integers greater than or equal to 1 and less than N, the number of each positive integer in the second sequence is the same.
5. The method according to claim 3 or 4, characterized in that The fourth matrix is an orthogonal matrix.
6. The method according to any one of claims 1 to 5, characterized in that: The first value is equal to 7. The method according to any one of claims 1 to 6, characterized in that: The first matrix is an equiangular tight frame ETF matrix.
8. The method according to claim 2 or 3, characterized in that: When K=2 and N=3, the indexes of the K-row elements in the second matrix are 2 and 3; or, When K=3 and N=7, the indexes of the K-row elements in the second matrix are 2, 3 and 5 respectively; or, When K=4 and N=13, the indexes of the K-row elements in the second matrix are 1, 2, 4 and 10 respectively; or, When K=5 and N=11, the indexes of the K-row elements in the second matrix are 2, 4, 5, 6 and 10 respectively; or, When K=7 and N=15, the indexes of the K-row elements in the second matrix are 1, 2, 3, 5, 6, 9 and 11 respectively; or, When K=9 and N=19, the indexes of the K-row elements in the second matrix are 2, 5, 6, 7, 8, 10, 12, 17 and 18 respectively; or, When K=11 and N=23, the indexes of the K-row elements in the second matrix are 2, 3, 4, 5, 6, 9, 10, 13, 14, 17 and 19 respectively; or, When K=13 and N=40, the indexes of the K-row elements in the second matrix are 1, 2, 4, 6, 10, 16, 23, 26, 27, 28, 35, 36 and 39 respectively; or, When K=5 and N=21, the indexes of the K-row elements in the second matrix are 4, 7, 8, 13 and 15 respectively; or, When K=6 and N=31, the indexes of the K-row elements in the second matrix are 2, 6, 12, 25, 26 and 28 respectively; or, When K=9 and N=37, the indexes of the K-row elements in the second matrix are 2, 8, 10, 11, 13, 17, 27, 34 and 35 respectively; or, When K=8 and N=57, the indexes of the K-row elements in the second matrix are 2, 7, 8, 10, 20, 39, 43 and 50 respectively; or, When K=9 and N=73, the indexes of the K-row elements in the second matrix are 18, 34, 35, 46, 54, 60, 64, 67 and 69 respectively; or, When K=10 and N=91, the indexes of the K-row elements in the second matrix are 1, 9, 12, 25, 29, 34, 35, 71, 73 and 85 respectively; or, When K=12 and N=133, the indexes of the K-row elements in the second matrix are 2, 11, 12, 14, 28, 32, 69, 76, 84, 111, 116 and 122 respectively.
9. The method according to any one of claims 1 to 8, characterized in that: When K=2 and N=3, the sequence set includes the following sequence 1 to sequence 3: When K=3 and N=7, the sequence set includes the following sequence 1 to sequence 7: When K=4 and N=13, the sequence set includes the following sequence 1 to sequence 13: When K=6 and N=31, the sequence set includes the following sequence 1 to sequence 31:
10. The method according to any one of claims 1 to 9, characterized in that: The indication information of the first sequence includes an index of the first sequence in the sequence set.
11. The method according to any one of claims 1 to 10, characterized in that: The method further comprises: Obtaining information indicating the sequence combination.
12. The method according to claim 11, characterized in that The indication information of the sequence set includes the N and the K.
13. A communication device, characterized in that: include: The processing module is configured to obtain indication information of a first sequence, where a sequence set corresponding to the first sequence satisfies: The maximum value of the square of the inner product of any two sequences in the sequence set is equal to a first value, and the first value is associated with N and K, where N represents the number of sequences in the sequence set, and K represents the length of the sequence in the sequence set; The communication module is used to transmit a first signal, where the first signal corresponds to the first sequence.
14. The device according to claim 13, characterized in that Any sequence in the sequence set corresponds to a column of elements in the first matrix; The first matrix is composed of K rows of elements in the second matrix, the second matrix is an N-order discrete Fourier transform DFT matrix, K and N are both positive integers, N is greater than 1, and K is less than or equal to N; The K row elements satisfy: the difference between the two indices in the second matrix and the modulus of N constitute a second sequence, and the values in the second sequence are positive integers greater than or equal to 1 and less than N; and among the positive integers greater than or equal to 1 and less than N, the number of each positive integer in the second sequence is the same.
15. The device according to claim 14, characterized in that The first sequence is a column of elements in the first matrix; or, The first sequence is a column of elements in a third matrix, the third matrix is a matrix obtained by performing a tensor product operation on the first matrix and a fourth matrix, and the fourth matrix is a matrix that satisfies the Welch bound condition.
16. The device according to claim 13, characterized in that The first sequence is a sequence in the sequence set; or, Any sequence in the sequence set corresponds to a column of elements in the first matrix, the first sequence is a sequence in the second sequence set, any sequence in the second sequence set is a column of elements in a third matrix, the third matrix is a matrix obtained by performing a tensor product operation on the first matrix and a fourth matrix, and the fourth matrix is a matrix that satisfies the Welch bound condition; the first matrix is composed of K rows of elements in the second matrix, the second matrix is an N-order DFT matrix, K and N are both positive integers, N is greater than 1, and K is less than or equal to N; The K row elements satisfy: the difference between the two indices in the second matrix and the modulus of N constitute a second sequence, and the values in the second sequence are positive integers greater than or equal to 1 and less than N; and among the positive integers greater than or equal to 1 and less than N, the number of each positive integer in the second sequence is the same.
17. The device according to claim 15 or 16, characterized in that The fourth matrix is an orthogonal matrix.
18. The device according to any one of claims 13 to 17, characterized in that The first value is equal to 19. The device according to any one of claims 13 to 18, characterized in that: The first matrix is an equiangular tight frame ETF matrix.
20. The device according to claim 18 or 19, characterized in that When K=2 and N=3, the indexes of the K-row elements in the second matrix are 2 and 3; or, When K=3 and N=7, the indexes of the K-row elements in the second matrix are 2, 3 and 5 respectively; or, When K=4 and N=13, the indexes of the K-row elements in the second matrix are 1, 2, 4 and 10 respectively; or, When K=5 and N=11, the indexes of the K-row elements in the second matrix are 2, 4, 5, 6 and 10 respectively; or, When K=7 and N=15, the indexes of the K-row elements in the second matrix are 1, 2, 3, 5, 6, 9 and 11 respectively; or, When K=9 and N=19, the indexes of the K-row elements in the second matrix are 2, 5, 6, 7, 8, 10, 12, 17 and 18 respectively; or, When K=11 and N=23, the indexes of the K-row elements in the second matrix are 2, 3, 4, 5, 6, 9, 10, 13, 14, 17 and 19 respectively; or, When K=13 and N=40, the indexes of the K-row elements in the second matrix are 1, 2, 4, 6, 10, 16, 23, 26, 27, 28, 35, 36 and 39 respectively; or, When K=5 and N=21, the indexes of the K-row elements in the second matrix are 4, 7, 8, 13 and 15 respectively; or, When K=6 and N=31, the indexes of the K-row elements in the second matrix are 2, 6, 12, 25, 26 and 28 respectively; or, When K=9 and N=37, the indexes of the K-row elements in the second matrix are 2, 8, 10, 11, 13, 17, 27, 34 and 35 respectively; or, When K=8 and N=57, the indexes of the K-row elements in the second matrix are 2, 7, 8, 10, 20, 39, 43 and 50 respectively; or, When K=9 and N=73, the indexes of the K-row elements in the second matrix are 18, 34, 35, 46, 54, 60, 64, 67 and 69 respectively; or, When K=10 and N=91, the indexes of the K-row elements in the second matrix are 1, 9, 12, 25, 29, 34, 35, 71, 73 and 85 respectively; or, When K=12 and N=133, the indexes of the K-row elements in the second matrix are 2, 11, 12, 14, 28, 32, 69, 76, 84, 111, 116 and 122 respectively.
21. The device according to any one of claims 13 to 20, characterized in that When K=2 and N=3, the sequence set includes the following sequence 1 to sequence 3: When K=3 and N=7, the sequence set includes the following sequence 1 to sequence 7: When K=4 and N=13, the sequence set includes the following sequence 1 to sequence 13: When K=6 and N=31, the sequence set includes the following sequence 1 to sequence 31:
22. The device according to any one of claims 13 to 21, characterized in that The indication information of the first sequence includes an index of the first sequence in the sequence set.
23. The device according to any one of claims 13 to 22, characterized in that The processing module is also used for: Obtaining information indicating the sequence combination.
24. The device according to claim 23, characterized in that The indication information of the sequence set includes the N and the K.
25. A communication device, characterized in that: The method comprises a processor configured to execute a computer program or an instruction to implement the method according to any one of claims 1 to 12.
26. A chip, characterized in that: The chip comprises a logic circuit, and the logic circuit is used to execute the method according to any one of claims 1-12.
27. A computer-readable storage medium, characterized in that: The storage medium stores a computer program or an instruction. When the computer program or the instruction is executed by the communication device, the method according to any one of claims 1 to 12 is implemented.
28. A computer program product, characterized in that When the computer program product is executed by a computer, the computer executes the method according to any one of claims 1 to 12.
29. A communication device, characterized in that: The method comprises a unit or a module for executing the method according to any one of claims 1 to 12.
Citation Information
Patent Citations
Forward compatible design for non-orthogonal UE signature sequences
CN111670549A
Communication system and method for achieving high data rates using modified nearly-equiangular tight frame (NETF) matrices
US10735062B1
Welch bound signature sequence design for noma
WO2019158691A1