WO2021027691A1 - Procédé et dispositif de transmission de mot de code - Google Patents

Procédé et dispositif de transmission de mot de code Download PDF

Info

Publication number
WO2021027691A1
WO2021027691A1 PCT/CN2020/107558 CN2020107558W WO2021027691A1 WO 2021027691 A1 WO2021027691 A1 WO 2021027691A1 CN 2020107558 W CN2020107558 W CN 2020107558W WO 2021027691 A1 WO2021027691 A1 WO 2021027691A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
codewords
codeword
vertex
bipartite graph
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2020/107558
Other languages
English (en)
Chinese (zh)
Inventor
骆喆
丁梦颖
汪凡
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of WO2021027691A1 publication Critical patent/WO2021027691A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver

Definitions

  • the embodiments of the present application relate to the field of communication technologies, and in particular, to a method and device for transmitting codewords.
  • the terminal accesses the network through network equipment to communicate.
  • the terminal accesses the network by initiating a random access procedure to the network equipment.
  • the terminal sends a random access preamble to the network equipment, and the network equipment distinguishes different terminals through the random access preamble.
  • the embodiments of the present application provide a codeword transmission method and device, which are used to reduce the probability of false alarms of network equipment in the bloom filer (BF) codeword technology.
  • BF bloom filer
  • a codeword transmission method includes: sending one or more codewords in a codeword set to a network device; wherein, the codeword set includes M codewords, and M is a positive integer .
  • one of the M codewords is determined by the first sequence in the first sequence set and the second sequence in the second sequence set.
  • the M codewords include some or all of the codewords shown in Table 1 or Table 3.
  • Table 1 or Table 3 m represents the number of the codeword, x m,1 represents the number of the first sequence, and x m,2 represents the number of the second sequence.
  • the value of M is 424, and the M codewords in the codeword set are the 424 codewords shown in Table 3.
  • one codeword in the M codewords is determined by 4 sequences, and the 4 sequences include a third sequence, a fourth sequence, a fifth sequence, and a sixth sequence.
  • the M codewords include some or all of the codewords shown in Table 2 or Table 4.
  • m represents the code word number
  • x m,1 represents the number of the third sequence
  • x m,2 represents the number of the fourth sequence
  • x m,3 represents the number of the fifth sequence
  • x m, 4 represents the number of the sixth sequence.
  • the codeword corresponding to each number corresponds to 4 sequences.
  • the value of M is 424, and the M codewords in the codeword set are the 424 codewords shown in Table 4.
  • one of the M codewords is determined by the first sequence in the first sequence set and the second sequence in the second sequence set, and the first sequence set and the second sequence
  • the second sequence set is used to determine the first vertex set and the second vertex set of the first bipartite graph respectively, and the first sequence is between the first vertex corresponding to the first bipartite graph and the second sequence
  • One of the M codewords can be any codeword.
  • the first sequence set and the second sequence set are respectively used to determine the first vertex set and the second vertex set of the first bipartite graph, for example, multiple first sequences and first vertices in the first sequence set.
  • the multiple first vertices in the set have a one-to-one correspondence
  • the multiple second sequences in the second sequence set have a one-to-one correspondence with the multiple second vertices in the second vertex set.
  • the first threshold may be a number greater than 0 and equal to and less than 1.
  • the first vertex set includes first vertices A and B
  • the second vertex set includes second vertices C and D.
  • the codeword A is determined by the sequence a corresponding to the first vertex A and the corresponding second sequence c of the second vertex C, and the codeword is determined by the sequence b corresponding to the first vertex B and the corresponding second sequence d of the second vertex D B. Since the first vertex and the second vertex are in the bipartite graph with other vertices in multiple vertices, the probability of the existence of a cycle is less than or equal to the first threshold, then the codeword set will not include A, B, C and D form codewords determined by combinations other than AC and BD. For example, the codeword set will not include codewords determined by AD and codewords determined by BC. Therefore, the network device will not detect the wrong code word, which helps to avoid the problem of false alarms.
  • the first bipartite graph meets the following characteristics. K vertices are randomly selected from the first vertex set and the second vertex set of the first bipartite graph, and there is a circle between the selected K vertices The probability is less than or equal to the first threshold, and the first threshold is represented by ⁇ , so that when K sequences are transmitted at the same time, the probability that the network device can successfully recognize is greater than or equal to 1- ⁇ . ⁇ is a number greater than or equal to 0 and less than 1.
  • the first sequence is determined by a third sequence in a third sequence set and a fourth sequence in a fourth sequence set, and the third sequence set and the fourth sequence set are respectively Used to determine the third vertex set and the fourth vertex set of the second bipartite graph, the third sequence in the second bipartite graph corresponds to the third vertex and the fourth sequence in the second bipartite graph There are edges between the fourth vertices corresponding to the graph; the probability of multiple vertices in the third vertex set and the fourth vertex set having a circle is less than or equal to the second threshold. In this way, when one codeword in the codeword set is determined by more than two sequences, it can also help avoid the problem of false alarms.
  • the second sequence is determined by the fifth sequence in the fifth sequence set and the sixth sequence in the sixth sequence set, and the fifth sequence set and the sixth sequence set are respectively used
  • the fifth sequence at the fifth vertex corresponding to the third bipartite graph and the sixth sequence at the third bipartite graph There are edges between the corresponding sixth vertices; the probability of multiple vertices in the fifth vertex set and the sixth vertex set having a circle is less than the third threshold.
  • the first threshold, the second threshold, and the third threshold can all be set according to actual conditions, for example, can be a number greater than or equal to 0 and less than 1.
  • the configuration information of the M1 codewords in the codeword set is received from the network device, where the configuration information of the M1 codewords is used to indicate all of the M codewords.
  • the M1 codewords for example, the configuration information is the index number or serial number of the M1 codewords; then, the sending of one or more codewords in the codeword set to the network device can be understood as sending all the codewords to the network device.
  • One or more of the M1 codewords For example, if the codeword is a preamble, a preamble can be randomly selected from M1 preambles and sent.
  • the information of the first time-frequency resource and the second time-frequency resource may also be received from the network device, and the information is used to indicate the location of the first time-frequency resource and the second time-frequency resource; then
  • the network device sending one or more codewords in the codeword set can be understood as sending the first sequence of the one or more codewords on the first time-frequency resource. Sending the second sequence of the one or more codewords on the frequency resource.
  • the sequences in the first sequence set can all be sent on the first time-frequency resource
  • the sequences in the second sequence set can all be sent on the second time-frequency resource, and the network device can recognize that the received sequences belong to Which sequence collection.
  • the first time-frequency resource and the second time-frequency resource can jointly belong to a transmission resource (such as a PO) used to define a certain number of preambles, or they can belong to different PO.
  • a transmission resource such as a PO
  • the codeword includes a preamble or a demodulation reference signal DMRS.
  • the number or index number corresponding to the one or more codewords may also be received from the network device.
  • M codewords have a one-to-one correspondence with M index numbers.
  • the first codeword in the M codewords has a corresponding relationship with the first index number in the M index numbers; the first codeword is composed of the first index number and The first function is determined.
  • the calculation parameter of the first function is also received from the network device.
  • the codeword is represented by the index number and the function, which can simplify the standardization workload. In the standard, there is no need to define the specific design of the codeword, but only the function and function parameters need to be defined.
  • a codeword transmission method comprising: receiving one or more codewords in a codeword set from a terminal device.
  • the design of the codeword can refer to the corresponding description in the first aspect, which will not be repeated here.
  • the configuration information of M1 codewords in the codeword set is sent to the terminal device, and the configuration information of the M1 codewords is used to indicate the M1 codes in the M codewords.
  • the configuration information is the index number or serial number of M1 codewords; then, receiving one or more codewords in the codeword set from the terminal device can be understood as: receiving the M1 codewords from the terminal device One or more of the codewords.
  • the information of the first time-frequency resource and the second time-frequency resource is sent to the terminal device, and the information is used to indicate the positions of the first time-frequency resource and the second time-frequency resource; wherein, the The first time-frequency resource is used to carry the first sequence of the one or more codewords, and the second time-frequency resource is used to carry the second sequence of the one or more codewords.
  • the first time-frequency resource and the second time-frequency resource can jointly belong to a transmission resource (such as a PO) used to define a certain number of preambles, or they can belong to different PO.
  • a transmission resource such as a PO
  • the codeword includes a preamble and a demodulation reference signal DMRS.
  • the serial number or index corresponding to the one or more codewords may also be sent to the terminal device.
  • M codewords have a one-to-one correspondence with M index numbers.
  • the first codeword in the M codewords has a corresponding relationship with the first index number in the M index numbers; the first codeword is composed of the first index number and The first function is determined.
  • the calculation parameters of the first function may also be sent to the aforementioned terminal device.
  • a device in a third aspect, may be a terminal device, or a device in a terminal device, or a device that can be matched and used with the terminal device.
  • the device may include modules that perform one-to-one correspondence of the methods/operations/steps/actions described in the first aspect.
  • the modules may be hardware circuits, software, or hardware circuits combined with software.
  • the device may include a processing module and a communication module. Illustratively:
  • Processing module used to determine one or more codewords in the codeword set
  • the communication module is used to send one or more codewords in the codeword set; wherein the codeword set includes M codewords, and M is a positive integer.
  • the design of the codeword can refer to the corresponding description in the first aspect, which will not be repeated here.
  • the communication module is further configured to receive configuration information of M1 codewords in the codeword set from the network device, where the configuration information of the M1 codewords is used for Indicates the M1 codewords among the M codewords.
  • the communication module is also used to send one or more codewords of the M1 codewords to the network device.
  • the communication module is further configured to receive information about the first time-frequency resource and the second time-frequency resource from the network device; and to send all information on the first time-frequency resource. Sending the first sequence of one or more codewords on the second time-frequency resource.
  • the codeword includes a preamble or a demodulation reference signal.
  • an embodiment of the present application provides a device that includes a communication interface and a processor, and the communication interface is used for communication between the device and other devices, for example, data or signal transmission and reception.
  • the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface; other devices may be network devices.
  • the processor is used to execute the method described in the first aspect above.
  • the device may also include a memory for storing instructions called by the processor. The memory is coupled with the processor, and when the processor executes the instructions stored in the memory, the method described in the first aspect can be implemented.
  • the device includes:
  • a processor configured to determine one or more codewords in a codeword set; wherein the codeword set includes M codewords, and M is a positive integer;
  • the communication interface is used to send one or more codewords in the codeword set.
  • the design of the codeword can refer to the corresponding description in the first aspect, which will not be repeated here.
  • the communication interface is further configured to receive configuration information of M1 codewords in the codeword set from the network device, where the configuration information of the M1 codewords is used for Indicates the M1 codewords among the M codewords. And it is used to send one or more of the M1 codewords to the network device.
  • the communication interface is also used to receive information about a first time-frequency resource and a second time-frequency resource from the network device; and to send all information on the first time-frequency resource. Sending the first sequence of one or more codewords on the second time-frequency resource.
  • the codeword includes a preamble or a demodulation reference signal.
  • a device in a fifth aspect, may be a network device, a device in a network device, or a device that can be matched and used with the network device.
  • the device may include modules that perform one-to-one correspondence of the methods/operations/steps/actions described in the second aspect.
  • the modules may be hardware circuits, software, or hardware circuits combined with software.
  • the device may include a processing module and a communication module. Illustratively:
  • the communication module is configured to receive one or more codewords in a codeword set from a terminal device; wherein the codeword set includes M codewords, and M is a positive integer.
  • the design of the codeword can refer to the corresponding description in the second aspect, which will not be repeated here.
  • a processing module is used to process the received codeword.
  • the communication module is further configured to send configuration information of M1 codewords in the codeword set to the terminal device, and the configuration information of the M1 codewords is used to indicate that among the M codewords
  • the M1 codewords for example, the configuration information is the index number or serial number of the M1 codewords; the communication module is specifically configured to receive one or more codewords of the M1 codewords from the terminal device.
  • the processing module is further configured to send information about the first time-frequency resource and the second time-frequency resource to the terminal device, and the information is used to indicate the location of the first time-frequency resource and the second time-frequency resource ;
  • the first time-frequency resource is used to carry the first sequence of the one or more codewords
  • the second time-frequency resource is used to carry the second sequence of the one or more codewords.
  • the first time-frequency resource and the second time-frequency resource can jointly belong to a transmission resource (such as a PO) used to define a certain number of preambles, or they can belong to different PO.
  • a transmission resource such as a PO
  • the codeword includes a preamble and a demodulation reference signal DMRS.
  • the communication module is also used to send a serial number or index number corresponding to the one or more codewords to the terminal device.
  • M codewords have a one-to-one correspondence with M index numbers.
  • the first codeword in the M codewords has a corresponding relationship with the first index number in the M index numbers; the first codeword is composed of the first index number and The first function is determined.
  • the communication module is further configured to send calculation parameters of the first function to the terminal device.
  • an embodiment of the present application provides an apparatus, the apparatus includes a communication interface and a processor, and the communication interface is used for communication between the apparatus and other devices, for example, data or signal transmission and reception.
  • the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface; other devices may be terminal devices.
  • the processor is used to execute the method described in the second aspect.
  • the device may also include a memory for storing instructions called by the processor. The memory is coupled with the processor, and when the processor executes the instructions stored in the memory, the method described in the second aspect can be implemented.
  • the device includes:
  • the processor is configured to receive one or more codewords in the codeword set from the terminal device by using the communication interface; wherein the codeword set includes M codewords, and M is a positive integer.
  • the design of the codeword can refer to the corresponding description in the second aspect, which will not be repeated here.
  • the processor is also used to process the received codeword.
  • the processor is further configured to use a communication interface to send configuration information of M1 codewords in the codeword set to a terminal device, and the configuration information of the M1 codewords is used to indicate the M
  • the M1 codewords in the codeword for example, the configuration information is the index number or serial number of the M1 codewords; the processor is specifically configured to receive one or more of the M1 codewords from the terminal device using a communication interface Codewords.
  • the processor is further configured to send information about the first time-frequency resource and the second time-frequency resource to the terminal device, where the information is used to indicate the location of the first time-frequency resource and the second time-frequency resource ;
  • the first time-frequency resource is used to carry the first sequence of the one or more codewords
  • the second time-frequency resource is used to carry the second sequence of the one or more codewords.
  • the first time-frequency resource and the second time-frequency resource can jointly belong to a transmission resource (such as a PO) used to define a certain number of preambles, or they can belong to different PO.
  • a transmission resource such as a PO
  • the codeword includes a preamble and a demodulation reference signal DMRS.
  • the processor may also use a communication interface to send a serial number or index corresponding to the one or more codewords to the terminal device.
  • M codewords have a one-to-one correspondence with M index numbers.
  • the first codeword in the M codewords has a corresponding relationship with the first index number in the M index numbers; the first codeword is composed of the first index number and The first function is determined.
  • the processor may also use a communication interface to send the calculation parameters of the first function to the foregoing terminal device.
  • the embodiments of the present application also provide a computer-readable storage medium.
  • the computer-readable storage medium stores computer-readable instructions.
  • the computer can execute The method described in one aspect or any possible design of the first aspect.
  • an embodiment of the present application also provides a computer-readable storage medium, including instructions, which when run on a computer, cause the computer to execute as described in the second aspect or any of the possible designs in the second aspect The method described.
  • the embodiments of the present application also provide a computer program product, including instructions, which when run on a computer, cause the computer to execute the design described in the first aspect or any one of the possible designs in the first aspect Method, or implement the method as described in the second aspect or any one of the possible designs of the second aspect.
  • an embodiment of the present application provides a chip system that includes a processor and may also include a memory for implementing the method described in the first aspect or any one of the possible designs in the first aspect .
  • the chip system can be composed of chips, or can include chips and other discrete devices.
  • an embodiment of the present application provides a chip system.
  • the chip system includes a processor and may also include a memory for implementing the above-mentioned first aspect or any one of the possible designs of the first aspect. method.
  • the chip system can be composed of chips, or can include chips and other discrete devices.
  • an embodiment of the present application provides a system that includes the terminal device described in the third aspect or the fourth aspect and the network device described in the fifth aspect or the sixth aspect.
  • Figure 1 is a schematic diagram of a communication system architecture in an embodiment of the application
  • Figure 2 is a schematic diagram of the first bipartite graph in an embodiment of the application.
  • FIG. 3 is a schematic diagram of the second bipartite graph and the third bipartite graph in an embodiment of the application;
  • FIG. 4 is a schematic diagram of the first bipartite graph generation method in an embodiment of this application.
  • Fig. 5 is a schematic diagram of a second bipartite graph generation method in an embodiment of the application.
  • FIG. 6 is a schematic flowchart of a codeword transmission method in an embodiment of the application.
  • Fig. 7 is a schematic diagram of a resource grid in an embodiment of the application.
  • FIG. 8 is a schematic diagram of the fourth bipartite diagram in an embodiment of the application.
  • FIG. 9 is a schematic structural diagram of a device in an embodiment of the application.
  • Fig. 10 is a schematic structural diagram of another device in an embodiment of the application.
  • the embodiments of the present application provide a codeword transmission method and device, which are used to reduce the probability of codeword false alarms on the basis of expanding the codeword capacity.
  • the method and the device are based on the same technical idea. Since the principles of the method and the device to solve the problem are similar, the implementation of the device and the method can be referred to each other, and the repetition will not be repeated.
  • "and/or" describes the association relationship of the associated objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A alone exists, and both A and B exist at the same time. There are three cases of B.
  • the character "/" between Chinese characters generally indicates that the associated objects before and after are an "or” relationship.
  • At least one involved in the embodiments of the present application refers to one or more; multiple refers to two or more than two.
  • words such as “first” and “second” are only used for the purpose of distinguishing description, and cannot be understood as indicating or implying relative importance, nor can it be understood as indicating Or imply the order.
  • a ⁇ b or a ⁇ b or a*b means multiplying two numbers, a/b or a ⁇ b means a divided by b, and a mod b means modulo operation, Represents the largest integer not greater than (or described as: less than or equal to) a.
  • the codeword transmission method provided in the embodiments of the present application can be applied to a long term evolution (LTE) system, a fifth generation (5G) communication system, or various future communication systems, for example, the sixth generation (6th generation, 6G) communication system.
  • LTE long term evolution
  • 5G fifth generation
  • 6G sixth generation
  • 5G can also be called new radio (NR).
  • FIG. 1 shows the architecture of a possible communication system to which the codeword transmission method provided in an embodiment of the present application is applicable.
  • the communication system 100 may include a network device 110 and a terminal device 101 to a terminal device 106. It should be understood that the communication system 100 may include more or fewer network devices or terminal devices.
  • the network device or terminal device can be hardware, software that is functionally divided, or a combination of the two.
  • the terminal device 104 to the terminal device 106 may also form a communication system.
  • the terminal device 105 may send downlink data to the terminal device 104 or the terminal device 106.
  • the network device and the terminal device can communicate with other devices or network elements.
  • the network device 110 can perform data transmission with the terminal device 101 to the terminal device 106, for example: the network device 110 can send downlink data to the terminal device 101 to the terminal device 106, and can also receive uplink data sent by the terminal device 101 to the terminal device 106; and /Or, the terminal device 101 to the terminal device 106 may also send uplink data to the network device 110, and may also receive downlink data sent by the network device 110.
  • the network device 110 is a node in a radio access network (radio access network, RAN), which may also be referred to as a base station or a RAN node (or device).
  • Network equipment can also be called network-side equipment.
  • examples of some network equipment 101 are: gNB/NR-NB, transmission reception point (TRP), evolved Node B (evolved Node B, eNB), radio network controller (RNC) , Node B (Node B, NB), base station controller (BSC), base transceiver station (base transceiver station, BTS), home base station (for example, home evolved NodeB, or home Node B, HNB), baseband Unit (base band unit, BBU), wireless fidelity (wireless fidelity, Wifi) access point (AP), or 5G communication system or network side equipment in a possible future communication system, etc.
  • TRP transmission reception point
  • eNB evolved Node B
  • RNC radio network controller
  • Node B Node B
  • BSC base station controller
  • the device used to implement the function of the network device may be a network device; it may also be a device capable of supporting the network device to implement the function, such as a chip system, and the device may be installed in the network device.
  • the device for implementing the functions of the network equipment is a network device or a base station as an example to describe the technical solutions provided by the embodiments of the present application.
  • the terminal device 101 to the terminal device 106 may also be referred to as terminals.
  • the terminal can be a user equipment (UE), a mobile station (MS), or a mobile terminal (MT), etc. It is a device that provides users with voice or data connectivity, or it can be a physical device. Networking equipment.
  • the terminal device 101 to the terminal device 106 include handheld devices and vehicle-mounted devices with wireless connection functions.
  • the terminal device 101 to the terminal device 106 can be a device with wireless transceiver function, which can be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; or on the water (such as ships, etc.); Deploy in the air (for example, on airplanes, balloons, satellites, etc.).
  • the terminal device may be a user equipment (UE), where the UE includes a handheld device with a wireless communication function, a vehicle-mounted device, a wearable device, or a computing device.
  • the UE may be a mobile phone, a tablet computer, or a computer with wireless transceiver function.
  • Terminal equipment can also be virtual reality (VR) terminal equipment, augmented reality (augmented reality, AR) terminal equipment, wireless terminals in industrial control, wireless terminals in unmanned driving, wireless terminals in telemedicine, and smart Wireless terminals in power grids, wireless terminals in smart cities, wireless terminals in smart homes, and so on.
  • VR virtual reality
  • AR augmented reality
  • Wireless terminals in power grids, wireless terminals in smart cities, wireless terminals in smart homes, and so on.
  • the device used to implement the function of the terminal may be a terminal; it may also be a device capable of supporting the terminal to implement the function, such as a chip system, and the device may be installed in the terminal.
  • the chip system may be composed of chips, or may include chips and other discrete devices.
  • the device for implementing the functions of the terminal is a terminal (collectively referred to as terminal equipment in the following description) or a UE as an example to describe the technical solutions provided by the embodiments of the present application.
  • the term “communication” can also be described as “data transmission”, “information transmission” or “transmission”, such as the transmission of codewords.
  • This technical solution can be used for wireless communication between a scheduling entity and a subordinate entity.
  • Those skilled in the art can use the technical solution provided by the embodiments of this application to perform wireless communication between other scheduling entities and subordinate entities, such as macro base stations and micro base stations. Wireless communication between, for example, the wireless communication between the first terminal and the second terminal.
  • the codeword described in the embodiment of the present application can be understood as an uplink signal sent by a terminal device to a network device to distinguish between different terminal devices, different channels, or different connections.
  • the codeword may be a preamble or a reference signal, such as a demodulation reference signal (DMRS), a sounding reference signal (SRS), or other types of reference signals.
  • DMRS demodulation reference signal
  • SRS sounding reference signal
  • the terminal sends a preamble to the network device during the random access process, and the network device uses different preambles to distinguish or identify the terminal device that initiates the access.
  • the preamble may also be referred to as a random access preamble, a random access preamble, or another name, which is not limited in this embodiment of the application.
  • DMRS is usually used for the related demodulation of physical uplink shared channel (PUSCH) and physical uplink control channel (PUCCH).
  • Network equipment can also distinguish or identify different DMRS according to different DMRS. Terminal equipment or different channels.
  • the same shared DMRS can be set for PUSCH and PUCCH, or separate DMRS can be set for PUSCH and PUCCH, which is not limited in the embodiment of this application.
  • a codeword is generated by a sequence. For example, when the codeword is a preamble, a codeword is used to represent a terminal device. Due to the limited random access resources, the number of random access preambles that can be sent is limited, so the number of terminals distinguished by random access preambles is also limited.
  • a structured codeword can be used.
  • This method can also be called the preamble technology of bloom filer (BF).
  • BF bloom filer
  • a ZC sequence set includes 64 ZC sequences.
  • the 64 ZC sequences can distinguish 64 different terminals.
  • any terminal can select 2 ZC sequences from 64 ZC sequences to generate and send the preamble.
  • the selection methods are as follows: It can be considered that a new set of ZC sequences is generated, including 2016 new ZC sequences, and the length of the new ZC sequence is twice the length of the original ZC sequence.
  • the aforementioned "terminal selects multiple ZC sequences from the ZC sequence set" can also be described as: the terminal selects a new ZC sequence from the new ZC sequence set.
  • the collection of 2016 new ZC sequences can be distinguished Different terminals. In this way, the capacity of the preamble can be increased.
  • the network device After the network device receives two ZC sequences from the terminal, it identifies the terminal according to the two ZC sequences. However, when multiple terminals send multiple ZC sequences, it will cause a relatively high false alarm probability, and the network equipment will not be able to identify. For example, terminal a selects ZC sequence 1 and ZC sequence 2 from the ZC sequence set to send, and terminal b selects ZC sequence 3 and ZC sequence 4 from the ZC sequence set to send.
  • the network device After the network device receives ZC sequence 1, ZC sequence 2, ZC sequence 3 and ZC sequence 4, it may form ⁇ ZC sequence 1, ZC sequence 2 ⁇ , ⁇ ZC sequence 3, ZC sequence 4 ⁇ , ⁇ ZC sequence 1, ZC Sequence 3 ⁇ , ⁇ ZC sequence 2, ZC sequence 4 ⁇ these four new ZC sequences. In this way, the network device cannot recognize terminal a and terminal b.
  • the embodiment of the present application designs a structured codeword, and a codeword is determined by multiple sequences.
  • a codeword is determined by two, three, or four sequences.
  • the terminal device sends codewords determined by multiple sequences to the network device, and the network device can distinguish the terminal device, channel, or connection according to the received codeword.
  • the capacity of the codeword can be enlarged, which means that more terminal devices, channels or connections can be distinguished.
  • the description can be made by taking the codeword used to distinguish terminal devices as an example, and those skilled in the art can extend it to distinguish other technical features, such as channels and connections.
  • the embodiment of the application determines a preferred codeword set according to multiple sequence sets.
  • the codewords in the codeword set can reduce the false alarm probability.
  • a preferred set of codewords is determined based on two sequence sets.
  • the two sequence sets are represented by the first sequence set and the second sequence set.
  • M is a positive integer.
  • positive integers include integers of 1, 2, 3, 4 or greater, which are not limited in the embodiments of the present application.
  • the codeword is determined by the first sequence and the second sequence.
  • the first sequence is a sequence in the first sequence set
  • the second sequence is a sequence in the second sequence set.
  • the first sequence set includes X1 sequences
  • the second sequence set includes X2 sequences.
  • the number M of codewords included in the preferred codeword set in the embodiment of the present application is less than X1*X2.
  • X1 and X2 are positive integers
  • X1 and X2 may be the same or different, which is not limited in the embodiment of the present application. In this way, when the terminal device sends the codewords in the preferred codeword set to the network device, it can help reduce the probability of false alarms by the network device.
  • the false alarm probability and the missed detection probability of the network device can be converted mutually, so the method provided in the embodiment of the present application can also reduce the missed detection probability of the codeword detection to a certain extent.
  • the technical effect description of the embodiments of the present application is mainly described by taking as an example to reduce the false alarm probability of network equipment.
  • a bipartite graph includes two vertex sets, which are usually represented by a left vertex set and a right vertex set, or represented by an upper vertex set and a lower vertex set, or a first vertex set and a second vertex set.
  • the illustration in the embodiment of the present application uses an upper vertex set and a lower vertex set to represent two vertex sets of a bipartite graph.
  • the bipartite graph described in the embodiment of this application conforms to the characteristics of graph theory.
  • the preferred set of codewords is determined by the bipartite graph, which is assumed to be the first bipartite graph.
  • the first sequence set and the second sequence set are respectively used to determine the first vertex set and the second vertex set of the first bipartite graph.
  • One of the M codewords included in the codeword set is determined by the first sequence in the first sequence set and the second sequence in the second sequence set, that is, the one codeword is determined by the first bipartite graph Is determined by the first vertex in the first vertex set and the second vertex in the second vertex set.
  • the first sequence corresponds to the first vertex
  • the second sequence corresponds to the second vertex. There is an edge between the first vertex and the second vertex in the first bipartite graph.
  • “Edge” is the line between two vertices in a bipartite graph.
  • the codeword set determined by the first bipartite graph includes M codewords, and the first bipartite graph includes M edges. Starting from a vertex, there may be edges between this vertex and one other vertex, and there may be edges between this vertex and multiple other vertices.
  • the vertices in the two vertex sets conform to the following characteristics: the probability of the existence of a circle in multiple vertices (all or part of the vertices) in the vertices of the two vertex sets is less than or equal to the first threshold a.
  • K1 can be equal to the number of vertices in the group of multiple vertices.
  • the two vertex sets include 64 vertices, and each vertex set includes 32 vertices.
  • Three vertices are randomly selected from each of the two vertex sets, for a total of six vertices.
  • the above-mentioned multiple vertices are 6 vertices.
  • Share A different approach can be described as a total of 4960 groups of 6 vertices in the two vertex sets. Assuming that there are cycles with a length less than or equal to 6 in the 6 vertices in 4 ways, then the probability of a cycle with a length less than or equal to 6 in the 6 vertices in the two vertices set is If there is a circle in 6 vertices, it may be that 6 vertices form a circle, then the length of the circle is equal to 6. It may also be that some of the 6 vertices form a circle, for example, 4 of the 6 vertices Form a circle, then the length of the circle is equal to 4.
  • a circle refers to a closed path from the selected vertex as the starting point, along the non-repeated edges, passing through the non-repeating vertices, and then back to the starting point.
  • the number of edges passed is the length of the circle.
  • the probability of multiple vertices in a set of two vertices in the bipartite graph having a circle is less than or equal to the first threshold.
  • the first bipartite graph is illustrated below.
  • the first vertex set of the first bipartite graph includes 64 first vertices
  • the second vertex set includes 64 second vertices.
  • the 64 first vertices in the first vertex set correspond to 64 first sequences
  • the 64 second vertices in the second vertex set correspond to 64 second sequences.
  • one of the M codewords in the codeword set is determined by the first sequence and the second sequence.
  • the first sequence and the second sequence may be ZC sequences.
  • a preamble is generated by two ZC sequences, and the two ZC sequences are the sequence corresponding to the first vertex in the first vertex set and the sequence corresponding to the second vertex in the second vertex set. If the first vertex to the second vertex have edges in the first bipartite graph, the codewords determined by the first sequence corresponding to the first vertex and the second sequence corresponding to the second vertex are codewords in the preferred codeword set.
  • the first bipartite graph shown in FIG. 2 meets the following characteristics: the probability that a circle with a length less than or equal to K1 exists in the multiple vertices of the bipartite graph is less than or equal to a threshold.
  • the threshold is a number greater than or equal to 0 and less than 1.
  • the K1 and threshold described in the feature will affect the process of generating the bipartite graph.
  • the codewords in the preferred codeword set may consist of multiple sequences, and "multiple" can be any positive integer greater than 1 (such as 2, 3, 4, 5, or 6, etc.), optionally Can be a multiple of 2.
  • a codeword consists of two sequences, the two sequences are the above-mentioned first sequence and second sequence.
  • the method for determining the preferred codeword set can be obtained according to the above-described scheme. If a codeword consists of 4 sequences, based on the method described above, before the first sequence and the second sequence determine the codeword, the first sequence and the second sequence are determined by two sequences respectively.
  • the first sequence is determined according to the third sequence and the fourth sequence
  • the second sequence is determined according to the fifth sequence and the sixth sequence
  • the codewords in the preferred codeword set are determined according to the first sequence and the second sequence.
  • the third sequence is a sequence in the third sequence set
  • the fourth sequence is a sequence in the fourth sequence set.
  • the third sequence set and the fourth sequence set are respectively used to determine the two vertex sets of the second bipartite graph: the third vertex set and the fourth vertex set.
  • the third sequence is the third vertex and the fourth vertex corresponding to the second bipartite graph.
  • the four sequence has an edge between the fourth vertices corresponding to the second bipartite graph; the vertices in the third vertex set and the fourth vertex set conform to: in the second bipartite graph, there are cycles of length less than K2 among multiple vertices
  • the probability is less than or equal to the second threshold.
  • K2 is an even number
  • the method for determining the first sequence according to the third sequence and the fourth sequence is similar to the method for determining the codewords in the preferred codeword set according to the first sequence and the second sequence, and reference may be made to the related description above.
  • the difference is that the structures of the second bipartite graph and the first bipartite graph may be the same or different.
  • the number of vertices in a vertex set may be different, and which vertices have edges may be different.
  • the process of determining the bipartite graph may be different.
  • the fifth sequence is a sequence in the fifth sequence set
  • the sixth sequence is a sequence in the sixth sequence set.
  • the fifth sequence set and the sixth sequence set are used to determine the two vertex sets of the third bipartite graph: the fifth vertex set and the sixth vertex set.
  • the fifth sequence is at the fifth vertex and the first vertex corresponding to the third bipartite graph.
  • the six sequence has an edge between the sixth vertices corresponding to the third bipartite graph; the vertices in the fifth vertex set and the sixth vertex set match: the probability that there is a circle with a length less than or equal to K3 among multiple vertices, which is less than or equal to the third threshold .
  • K3 is an even number
  • the method for determining the second sequence according to the fifth sequence and the sixth sequence is similar to the method for determining the codewords in the preferred codeword set according to the first sequence and the second sequence, and reference may be made to the related description above. The difference is that the structure of the third bipartite graph and the first bipartite graph may be the same or different. For example, the number of vertices in a vertex set may be different, and which vertices have edges may be different. The process of determining the bipartite graph may be different.
  • the various thresholds described in the embodiments of the present application and K1, K2, and K3 may be set according to actual conditions, and may be set the same or different. Any two or more of the first threshold, the second threshold, and the third threshold may be the same or different. Any two or more of K1, K2, and K3 may be the same or different.
  • the second bipartite graph and the third bipartite graph may also be the same or different.
  • first bipartite graph as the bipartite graph shown in FIG. 2 as an example, the possible forms of the second bipartite graph and the third bipartite graph are introduced below.
  • the third vertex set includes 16 third vertices
  • the fourth vertex set includes 16 fourth vertices.
  • the 16 third vertices correspond to the 16 third sequences in the third sequence set
  • the 16 fourth vertices correspond to the 16 fourth sequences in the fourth sequence set. If there is an edge between the third vertex and the fourth vertex in the bipartite graph shown in FIG. 3, the third sequence corresponding to the third vertex and the fourth sequence corresponding to the fourth vertex can determine a first sequence.
  • Each first sequence in the first sequence set is determined by a third sequence in the third sequence set and a fourth sequence in the fourth sequence set, and each second sequence in the second sequence set is Determined by a fifth sequence in the fifth sequence set and a sixth sequence in the sixth sequence set.
  • one codeword among the M codewords in the preferred codeword set is determined by a total of four sequences, the third sequence, the fourth sequence, the fifth sequence, and the sixth sequence.
  • one codeword in the codeword set can also be determined by 3 or more than 4 sequences, and the determination method is similar.
  • each first sequence in the first sequence set is determined by the third sequence in the third sequence set and the fourth sequence in the fourth sequence set.
  • one of the M codewords in the preferred codeword set is determined by a total of 3 sequences in the third sequence, the fourth sequence, and the second sequence in the second sequence set.
  • each second sequence in the second sequence set is determined by the fifth sequence in the fifth sequence set and the sixth sequence in the sixth sequence set, which can be understood as the preferred codeword set
  • One codeword in the M codewords is determined by a total of 3 sequences in the fifth sequence, the sixth sequence, and the first sequence in the first sequence set.
  • the preferred codeword set in the embodiment of the present application refers to a subset of the full codeword set.
  • the preferred codeword set provided in the embodiments of the present application when multiple terminal devices select and send multiple codewords in the preferred codeword set, when the network device receives multiple codewords at the same time, it helps the network The device correctly decodes multiple code words, which helps reduce the probability of false alarms.
  • the method of determining the preferred codeword set from the two sequence sets can be achieved by means of a bipartite graph.
  • Two sequences corresponding to two vertices with edges in the bipartite graph can form a codeword in the preferred codeword set.
  • the generated bipartite graph needs to meet some characteristics. Here's how to generate a bipartite graph through two sequence sets.
  • the optional first bipartite graph generation method is as follows.
  • the meaning of degree is the number of edges connected by a vertex.
  • the initial bipartite graph has only vertices and no edges. Gradually generate edges through the following process until the target number E is reached.
  • the value of i can be traversed first, and then the value of j can be traversed.
  • the value of i is taken from 1 to X1
  • the value of j is taken from 1 to X2.
  • the value of j can be traversed first, and then the value of i, for example, for an i value, the value of j is taken from 1 to X2, and then the value of i is taken from 1 to X1.
  • the degree of vertex i does not exceed F1
  • the vertex The degree of j does not exceed F2
  • the probability that any number of vertices in the bipartite graph has a circle with a length less than K1 is less than or equal to the first threshold, where the length of the circle refers to the number of sides that constitute the circle. If it is (it can be guaranteed), it is determined to add an edge to the bipartite graph between vertex i in the first vertex set and vertex j in the second vertex set; otherwise, this edge is not added to the bipartite graph.
  • the judgment condition of this step in FIG. 4 is illustrated by taking the probability that any number of vertices in the bipartite graph has a circle with a length less than or equal to K1 being less than or equal to the first threshold.
  • This method can be used to generate other bipartite graphs in the embodiments of the present application, such as the second bipartite graph and the third bipartite graph.
  • the optional second bipartite graph generation method is as follows.
  • the threshold is 1%
  • the probability that the network device can correctly solve the codeword is greater than 99%.
  • the maximum degree currently allowed by the vertices in the first vertex set is represented by D1
  • the maximum degree currently allowed by the vertices in the second vertex set is represented by D2.
  • D1 and D2 can increase with increasing edges, D1 is initialized to 1, and D2 is initialized to 1.
  • D1 and D2 The purpose of introducing D1 and D2 is to limit the maximum degree currently allowed, so that when adding edges, it is possible to add edges as much as possible between vertices with small degrees.
  • S502 Determine whether the number of edges in the bipartite graph has reached the target number E, if not, execute S503, and if it reaches, end the process.
  • the value of i can be traversed first, and then the value of j can be traversed.
  • the value of i is taken from 1 to X1
  • the value of j is taken from 1 to X2.
  • the value of j can be traversed first, and then the value of i, for example, for an i value, the value of j is taken from 1 to X2, and then the value of i is taken from 1 to X1.
  • the degree of the vertices in the first set of vertices is equal to D1
  • D1 is increased by 1.
  • D2 increases by 1.
  • This method can be used to generate other bipartite graphs in the embodiments of the present application, such as the second bipartite graph and the third bipartite graph.
  • the first bipartite graph generation method and the second bipartite graph generation method are two optional methods for generating the bipartite graph. In the embodiment of the present application, other methods may also be used to generate the bipartite graph for determining the preferred codeword set. Both the first bipartite graph generation method and the second bipartite graph generation method can be applied to any sequence set size. Moreover, when one codeword in the preferred codeword set is generated by three or more sequences, the two methods can also be used in combination. For example, the bipartite graph shown in FIG. 3 is generated according to the second bipartite graph generation method, and the second bipartite graph and the third bipartite graph are both the bipartite graph shown in FIG. 3.
  • the third sequence set and the fourth sequence set both include 16 sequences.
  • the first sequence is generated from the third sequence in the third sequence set and the fourth sequence in the fourth sequence set to obtain the preferred first sequence set (the method is similar To determine the preferred codeword set), the first sequence set has a total of 64 sequences.
  • the fifth sequence set and the sixth sequence set both include 16 sequences.
  • the second sequence is generated from the fifth sequence in the fifth sequence set and the sixth sequence in the sixth sequence set to obtain the preferred second sequence set (the method is similar To determine the preferred codeword set), the second sequence set has a total of 64 sequences.
  • the first bipartite graph is the bipartite graph shown in FIG. 2 and is generated by the first bipartite graph generation method.
  • the first sequence set corresponds to the first vertex set of the bipartite graph shown in FIG. 2, and there are 64 sequences in total.
  • the second set of sequences corresponds to the second set of vertices of the bipartite graph shown in FIG. 2, and has 64 sequences in total.
  • a codeword is determined by the first sequence in the first sequence set and the second sequence in the second sequence set, and a total of M codewords are obtained, and the value of M can be set.
  • the second bipartite graph shown in FIG. 3 is generated according to the second bipartite graph generation method.
  • the third sequence set and the fourth sequence set both include 16 sequences.
  • the first sequence is generated from the third sequence in the third sequence set and the fourth sequence in the fourth sequence set to obtain the preferred first sequence set (the method is similar To determine the preferred codeword set), the first sequence set has a total of 64 sequences.
  • the second sequence set includes 64 second sequences.
  • the first bipartite graph is the bipartite graph shown in FIG. 2 and is generated by the first bipartite graph generation method.
  • the first sequence set corresponds to the first vertex set of the bipartite graph shown in FIG. 2, and there are 64 sequences in total.
  • the second set of sequences corresponds to the second set of vertices of the bipartite graph shown in FIG. 2, and has 64 sequences in total.
  • a codeword is determined by the first sequence in the first sequence set and the second sequence in the second sequence set, and a total of M codewords are obtained, and the value of M can be set.
  • the preferred codeword set can be determined online or offline. If it is determined in an offline manner, the preferred codeword set may be specified by the protocol, or the generation parameters and/or generation mode of the preferred codeword set may be specified by the protocol.
  • the preferred codeword set can be determined according to the protocol, or can be notified by the network device. For example, if a codeword set includes M codewords, the network device may notify the terminal device of M codewords, or may notify the terminal device of part of the codewords in the M codewords, for example, the number of partial codewords is represented by M1.
  • the network device can determine the preferred codeword set according to the protocol, or the network device can also generate the preferred codeword set online.
  • both the network device and the terminal device may also generate the preferred codeword set online.
  • any parameter used to generate the preferred codeword set such as any parameter in S401 and S501, and/or the traversal mode of i and j in S402 and S504, may be predefined or network equipment Instructed to the UE through signaling.
  • the network may also indicate to the terminal device that the codeword generation mode is the first bipartite graph generation mode or the second bipartite graph generation mode.
  • the signaling may be system messages, broadcast messages, radio resource control (radio resource control, RRC) signaling, media access control (MAC) control element (CE), Or one or a combination of physical layer control signaling, which is not limited in the embodiment of the present application.
  • RRC radio resource control
  • MAC media access control
  • CE control element
  • the codeword transmission method provided by the embodiment of the present application is as follows.
  • the following steps can form a solution independently, or can be combined with one or more other steps to form a solution.
  • S602 can form the solution of the embodiment of the present application alone, so S601 is an optional step.
  • the network device sends configuration information to the terminal device, and the terminal device receives the configuration information from the network device.
  • the configuration information may also be referred to as configuration, instruction, or instruction information.
  • the configuration information includes configuration information of M1 codewords in the codeword set.
  • the codeword set includes M codewords, and one codeword in the M codewords is determined by the first sequence in the first sequence set and the second sequence in the second sequence set.
  • M1 is an integer less than or equal to M. If a code is determined by 4 sequences, the first sequence can also be determined by the third sequence in the third sequence set and the fourth sequence in the fourth sequence set, and the second sequence can also be determined by the fifth sequence in the fifth sequence set. The sequence and the sixth sequence in the sixth sequence set are determined.
  • the configuration information of the M1 codewords is used to indicate the M1 codewords among the M codewords, for example, to indicate the index of the M1 codewords.
  • the index can also be described as a number, an identification, etc.; each codeword in the M codewords has a unique index, for example, the indexes of the M codewords are 0 to M-1, or 1 to M, respectively. .
  • the configuration information further includes information about the first time-frequency resource and the second time-frequency resource.
  • the first time-frequency resource is used to carry the first sequence in the first sequence set
  • the second time-frequency resource is used to carry the second sequence in the second sequence set.
  • the first time-frequency resource and the second time-frequency resource may be the same or different.
  • the configuration information may only need to indicate the same time-frequency resource.
  • the network device can assign a dedicated preamble to each terminal device through signaling.
  • the standard defines all the preambles in the codeword set
  • the network device configures the terminal device with the number of the preamble of the terminal device
  • the terminal device determines the preamble assigned to the terminal device from the codeword set according to the number.
  • the terminal device obtains the sequence corresponding to the codeword according to the number, for example, it may be two ZC sequences or four ZC sequences.
  • the terminal device sends one or more codewords in the codeword set to the network device, and the network device receives the one or more codewords in the codeword set from the terminal device.
  • the one or more codewords are codewords among the M1 codewords.
  • the configuration information sent by the network device to the terminal device includes information about the first time-frequency resource and the second time-frequency resource.
  • the terminal device sends a codeword
  • the first sequence used to determine this codeword is carried on the first On the time-frequency resource
  • the second sequence used to determine this codeword is carried on the second time-frequency resource.
  • the preferred codeword set conforms to some characteristics of the bipartite graph.
  • the codeword set can be expressed in a table. Code words can be represented by numbers.
  • the table is only an expression form of the correspondence between codewords and sequences, and the correspondence between codewords and sequences can be expressed in other forms. The details are as follows.
  • the code word set is expressed in the form of a table. One number corresponds to one codeword, and one codeword corresponds to multiple sequences.
  • one codeword corresponds to two sequences.
  • m represents the number of the codeword
  • x m,1 represents the number of the first sequence
  • x m,2 represents the number of the second sequence.
  • Each numbered codeword corresponds to two sequences.
  • the codeword with number m is determined by the first sequence with number 1 and the second sequence with number 1.
  • the preferred codeword set provided by the embodiment of this application may include at least one codeword in Table 1, or it may be described that the preferred codeword set provided by the embodiment of this application may include part or all of the 9 codes in Table 1 word. In the embodiments of the present application, at least one may be one, two, three, or more, which is not limited in the embodiments of the present application.
  • one codeword corresponds to 4 sequences.
  • m represents the number of the codeword
  • x m,1 represents the number of the third sequence
  • x m,2 represents the number of the fourth sequence
  • x m,3 represents the number of the fifth sequence
  • x m,4 represents the number of the sixth sequence .
  • the codeword corresponding to each number corresponds to 4 sequences.
  • the codeword with the number m is determined by the third sequence with the number 1, the fourth sequence with the number 1, the fifth sequence with the number 1, and the sixth sequence with the number 1.
  • the codeword with number m is determined by the third sequence numbered 1, the fourth sequence numbered 1, the fifth sequence numbered 2, and the sixth sequence numbered 3.
  • the preferred codeword set provided by the embodiment of this application may include at least one codeword in Table 2, or it may be described that the preferred codeword set provided by the embodiment of this application may include some or all of the 9 codes in Table 2 word.
  • one codeword corresponds to two sequences.
  • m represents the number of the codeword
  • x m,1 represents the number of the first sequence
  • x m,2 represents the number of the second sequence.
  • Each numbered codeword corresponds to two sequences.
  • the codeword with number m is determined by the first sequence with number 1 and the second sequence with number 1.
  • a preferred codeword set is determined based on two sequence sets including 64 sequences, and the number of codewords in the set is 424.
  • the preferred codeword set provided by the embodiment of this application may include at least one codeword in Table 3, or it may be described that the preferred codeword set provided by the embodiment of this application may include some or all of the 424 codes in Table 3 word.
  • one codeword corresponds to 4 sequences.
  • m represents the number of the codeword
  • x m,1 represents the number of the third sequence
  • x m,2 represents the number of the fourth sequence
  • x m,3 represents the number of the fifth sequence
  • x m,4 represents the number of the sixth sequence .
  • the codeword corresponding to each number corresponds to 4 sequences.
  • the codeword with number m is determined by the third sequence numbered 1, the fourth sequence numbered 1, the fifth sequence numbered 1, and the sixth sequence numbered 1.
  • the codeword with the number m being 6 is determined by the third sequence with the number 1, the fourth sequence with the number 1, the fifth sequence with the number 2, and the sixth sequence with the number 3.
  • the preferred codeword set determined according to the sequence set of 4 ZC sequences, the number of codewords in the set is 424.
  • the preferred codeword set provided by the embodiment of this application may include at least one codeword in Table 4, or it may be described that the preferred codeword set provided by the embodiment of this application may include some or all of the 424 codes in Table 4 word.
  • the network device can configure the terminal device with the number of the codeword.
  • the terminal device determines multiple sequences corresponding to the number through the number of the codeword and the corresponding relationship similar to that described in the above table.
  • the codeword in the embodiment of the present application may be a preamble, or a demodulation reference signal, or other signals that can be used to distinguish different terminal devices, different channels, or different connections.
  • the codeword is used as the preamble or the demodulation reference signal as an example, and the codeword transmission method provided in the present application will be described in further detail.
  • the codeword is the preamble.
  • the preamble is the code word that the terminal device sends to the network device during the random access process.
  • the network device can distinguish different terminal devices according to the received preamble.
  • Applying the preferred codeword set provided in the embodiments of the present application it is assumed that multiple terminal devices send a preamble to the network device in the same time period, and the preamble is a codeword selected from the codeword set.
  • the network equipment decodes the received multiple codewords at the same time and can solve them with a high probability. The probability of solving depends on the characteristics of the codeword set, such as the value of K1 when the bipartite graph corresponding to the codeword set is generated.
  • PO physical random access channel transmission opportunity
  • the PO represents a piece of air interface resource used to transmit the preamble.
  • the air interface resource is a time-frequency resource
  • the PO includes a continuous subcarrier in the frequency domain and one or more time-domain symbols in the time domain.
  • the air interface resources are other types of resources, such as spreading codes and airspace resources
  • the PO in the method provided in the embodiment of the present application can also be replaced with the other type of resources, thereby applying the method provided in the embodiment of the present application.
  • network equipment and terminal equipment can perform data transmission through time-frequency resources.
  • the time-frequency resource used for data transmission can be represented as a resource grid.
  • Figure 7 shows an example of the resource grid.
  • a resource element (resource element, RE) is a resource unit used for data transmission, or a resource unit used for resource mapping of data to be sent.
  • an RE corresponds to a time domain symbol in the time domain, such as orthogonal frequency division multiplexing (OFDM) symbols or discrete fourier transform orthogonal frequency division multiplexing (discrete fourier transform spread) orthogonal frequency division multiplexing (DFT-s-OFDM) symbols, the frequency domain corresponds to a subcarrier.
  • OFDM orthogonal frequency division multiplexing
  • DFT-s-OFDM discrete fourier transform spread orthogonal frequency division multiplexing
  • One RE can be used to map a complex symbol, such as a complex symbol obtained through modulation, or a complex symbol obtained through precoding, which is not limited in this application.
  • the preamble is generated based on the ZC sequence.
  • the preamble is carried on a physical random access channel (PRACH) channel.
  • PRACH physical random access channel
  • the ZC sequence is carried by N 0 REs, where N 0 is a positive integer, and the frequency domain signal y u,v (n) mapped on the nth RE among the N 0 REs for:
  • formula (1) is the ZC sequence of DFT spread spectrum
  • formula (2) is the ZC sequence.
  • u represents the root of the ZC sequence
  • v represents the cyclic shift number (non-negative integer, such as 0, 1, 2, 3,...)
  • C v represents the corresponding cyclic shift value
  • C v v ⁇ N cs
  • N cs Represents the cyclic shift interval
  • C v can be an integer greater than or equal to 0 or less than N 0
  • N 0 is the length of the ZC sequence
  • j is an imaginary unit
  • the square of j is equal to -1
  • ⁇ represents the circumference of the circle.
  • ⁇ is the power factor
  • n 0 is the starting subcarrier number of PO
  • t l is the starting time of the OFDM symbol with index 1
  • ⁇ f is the subcarrier interval of the OFDM symbol
  • j is the imaginary unit
  • the square of j is equal to -1
  • ⁇ represents the circumference of the circle.
  • l is an integer, such as 0, 1, 2, or other integers.
  • the preamble capacity (the size of the preamble set) of a PO is 64, and the 64 ZC sequences can be carried on the PO at the same time.
  • the number of ZC sequences defined on each PO can also be other positive integers, such as 32, 128, and so on.
  • the terminal device in order to meet the system's demand for more preamble capacity, can select two different ZC sequences from the 64 ZC sequences of a PO to generate a new preamble, and place a new preamble on that PO. Send the two different ZC sequences to the network device, so that the new preamble can be sent to the network device on one PO. Or, the terminal device can select a ZC sequence on each of the two POs to generate a new preamble, and send a ZC sequence corresponding to each PO to the network device on the two POs, so as to realize the The new preamble is sent to the network device.
  • the new preamble combination manner in the embodiment of the present application is deleted, and the preferred preamble set is selected.
  • One codeword in the preferred preamble set is composed of two ZC sequences, and the expression of each ZC sequence is as the above formula (1) to formula (3), which is equivalent to the above first sequence and second sequence.
  • One codeword in the preferred preamble set may also consist of 4 ZC sequences, and the 4 ZC sequences are equivalent to the third sequence, the fourth sequence, the fifth sequence, and the sixth sequence above.
  • Each of the two POs can carry 64 ZC sequences, and the two POs are represented as the first PO and the second PO.
  • the 64 ZC sequences on the first PO constitute the first sequence set
  • the 64 ZC sequences on the second PO constitute the second sequence set.
  • the 64 ZC sequences defined on two POs can be recorded as two sets: The subscript indicates the number of the ZC sequence in the set. Specifically, for the ZC sequence of the i-th PO On the OFDM symbol to which the PRACH is mapped, the ZC sequence is carried by N 0 REs, and the frequency domain signal mapped on the nth RE among the N 0 REs is As described in formula (1) or (2).
  • the ZC sequences on the two POs can also be independently configured. In this case of independent configuration, the actual configuration values of the ZC sequences on the two POs can be the same or different.
  • the ZC sequence on the two POs can be configured to be the same.
  • the ZC sequence on the two POs can be configured to be different.
  • a preamble in the codeword set can be considered as with Generated.
  • the terminal device sends a preamble in the set of codewords, which can be from the set on the first PO Select a ZC sequence Transfer, from the collection on the second PO Select ZC sequence transmission.
  • Each preamble in the codeword set can be recorded as Or (x 1 ,x 2 ),x i ⁇ 1,2,...,64 ⁇ .
  • the preferred preamble set is recorded as ⁇ (x m,1 ,x m,2 )
  • m 1, 2,...,M ⁇ , where M is the number of preambles in the preamble set, and m is the number of the preamble.
  • the corresponding relationship between the preamble and multiple sequences can be as shown in Table 1, Table 2, Table 3 or Table 4.
  • the network device can assign one or more preambles to the terminal device through signaling. If one is allocated, the allocated preamble is a dedicated preamble for the terminal device. If multiple ones are allocated, the plurality are candidate preambles for the terminal, and the terminal can randomly select one of the multiple preambles to initiate random Access.
  • a network device allocates a dedicated preamble to a terminal device through signaling, one of the manifestations of signaling can be the following example, and an element in the signaling can be called an information element (IE):
  • IE information element
  • SBF-Preamble-Configure represents the preamble configuration information
  • SBF is the abbreviation of structured BF
  • SEQUENCE ⁇ represents a sequence composed of elements in curly brackets
  • SEQUENCE(SIZE()) represents a sequence with a size given by SIZE()
  • INTEGER() represents an integer whose value range is given in parentheses
  • sbf-PreambleIndex represents the preamble index, that is, the preamble number, corresponding to m in Table 1 and Table 2
  • ra-OccasionList represents two preambles used to transmit The number of the PO.
  • the network device configures a preamble for the terminal device, and configures it on the first PO Configure on the second PO
  • the second form of signaling can be the following example:
  • SBF-Preamble-Configure represents the preamble configuration information
  • ra-OccasionList represents the numbers of the two POs used to transmit the preamble
  • zc-PreambleIndex represents the sequence numbers or numbers of the two sequences for transmitting the preamble on the two POs.
  • each PO transmits a sequence.
  • the expression form of the above-mentioned signaling can be extended to any form of codeword, not just the preamble.
  • the foregoing signaling form can be applied to any scenario where multiple sequence sets determine a preferred codeword set, for example, two sequences determine one codeword, or four sequences determine one codeword. It can also be applied to the scenario of transmitting codewords on any PO, and only the corresponding IE needs to be modified accordingly (for example, the number is modified).
  • the terminal device sends ZC sequences corresponding to the configured numbers on the two POs according to the preamble configured by the network device.
  • the first PO is used to carry 64 ZC sequences in the first sequence set
  • the second PO is used to carry 64 ZC sequences in the second sequence set.
  • the preferred set of codewords corresponds to the characteristics of the bipartite graph
  • the 64 ZC sequences in the first sequence set correspond to the first vertex set of the bipartite graph
  • the 64 ZC sequences in the second sequence set correspond to the second vertex set of the bipartite graph.
  • a possible example of a bipartite graph is shown in FIG. 2.
  • the first vertex set and the second vertex set each include 64 vertices and meet the preferred characteristics by other generation methods.
  • the preferred feature means that the probability of a circle having a length less than K1 among any number of vertices is less than a threshold.
  • the network device detects the preamble on the first PO and the second PO respectively, and identifies the received preamble.
  • Network devices can identify terminal devices based on the bipartite graph. For example, the network device receives the ZC preamble on the first PO ZC preamble received on the second PO The network device recognizes the preamble versus Was sent. Another example is that the network device receives the ZC preamble on the first PO ZC preamble received on the second PO The network device recognizes the preamble versus Was sent.
  • the preferred codeword set is determined based on two sequence sets including 64 ZC sequences.
  • the number of codewords in the set can be 424, which is a distinguishable code The number of words is large enough.
  • the preferred codeword set is determined according to two sequence sets including 64 ZC sequences, and the number of codewords in the set is large enough so that the network device can configure a dedicated preamble for each terminal device. Moreover, because the codeword set conforms to the characteristics of the bipartite graph, there is no circle in any 4 vertices, or the probability of the circle is less than the threshold, when any two terminal devices use different preambles to transmit at the same time, the network device can be 100% Or the two terminal devices sending the preamble can be identified with great probability.
  • terminal a selects ZC sequence 1 and ZC sequence 2 from the ZC sequence set to send, and terminal b selects ZC sequence 3 and ZC sequence 4 from the ZC sequence set to send.
  • the network device receives ZC sequence 1, ZC sequence 2, ZC sequence 3 and ZC sequence 4, it may form ⁇ ZC sequence 1, ZC sequence 2 ⁇ , ⁇ ZC sequence 3, ZC sequence 4 ⁇ , ⁇ ZC sequence 1, ZC Sequence 3 ⁇ , ⁇ ZC sequence 2, ZC sequence 4 ⁇ these four preambles.
  • ⁇ ZC sequence 1, ZC sequence 2 ⁇ , ⁇ ZC sequence 3, ZC sequence 4 ⁇ , ⁇ ZC sequence 1, ZC sequence 3 ⁇ , ⁇ ZC sequence do not appear in the codeword set at the same time 2.
  • ZC sequence 4 ⁇ these 4 kinds of code words, the network equipment will not recognize the preamble code outside the code word set as the received preamble, therefore, the network equipment will not mistake for ⁇ ZC sequence 1, ZC sequence 3 ⁇ , ⁇ ZC sequence 2, ZC sequence 4 ⁇ are also transmitted.
  • the two POs in the foregoing embodiment of this application can be considered as two air interface resources (for example, two time-frequency resources).
  • Each of the two time-frequency resources carries a sequence set, and the two sequence sets determine the preferred codeword set. It is understandable that two time-frequency resources can also be on the same PO.
  • the one PO can be regarded as the first time-frequency resource or the second time-frequency resource.
  • 64 ZCs are defined on one PO Sequence
  • the first time-frequency resource and the second time-frequency resource can each carry 32 ZC sequences. Two sequence sets including 32 ZC sequences do not intersect. Therefore, the foregoing embodiment of transmitting the preamble on two POs can be extended to a solution for transmitting the preamble on two time-frequency resources.
  • the description of the first PO can be replaced with the first time-frequency resource
  • the second PO The description can be replaced with a second time-frequency resource.
  • the multiple sequence sets used to determine the codeword set do not intersect, no matter how many POs are defined.
  • the ZC sequence defined on one PO can be divided into 4 sequence sets. It is also possible to divide the ZC sequences defined on two POs into 4 sequence sets, and divide the ZC sequences defined on each PO into 2 sequence sets. More generally, aside from the concept of PO, the idea of the embodiments of this application is to divide a set of ZC sequences into multiple disjoint sequence sets, and select a sequence in each sequence set, which is determined by the selected multiple sequences One codeword, get the codeword set.
  • any two sequences in the multiple sequences may be sent on the same time-frequency resource, or may be sent on different time-frequency resources, which is not limited in the embodiment of the present application.
  • one ZC sequence set can be expanded into multiple ZC sequence sets, and the multiple ZC sequence sets can be multiple disjoint sequence sets respectively.
  • a sequence is selected from each sequence set, and a codeword is determined by the selected multiple sequences to obtain a codeword set.
  • any two sequences in the multiple sequences may be sent on the same time-frequency resource, or may be sent on different time-frequency resources, which is not limited in the embodiment of the present application.
  • a preamble in the preferred codeword set consists of the set ⁇ S 1 ,...,S 16 ⁇ , ⁇ S 17 ,...,S 32 ⁇ ⁇ S 33 ,...,S 48 ⁇ and ⁇ S 49 ,...,S 64 ⁇ is determined by selecting a ZC sequence each, a preamble in the codeword set can be expressed as: Transmit the polynomial combination or weighted summation of 4 selected ZC sequences on a PO, for example, transmit Specifically, for example, the frequency domain signal mapped on the nth RE among the N 0 REs is Where 1/2 is the energy normalization parameter.
  • the frequency domain signal mapped on the nth RE in the N 0 REs is That is, the weighted sum of 4 ZC sequences is used to reduce the peak-to-average power ratio (PAPR) and cubic metric (CM), where ⁇ i is a complex number, such as ⁇
  • ⁇ i may be pre-defined or notified by the network equipment to the terminal through signaling.
  • a preamble in the codeword set can also be expressed as (x 1 , x 2 , x 3 , x 4 ), x i ⁇ ⁇ 1,2,...,16 ⁇ .
  • the preamble set determined by the 4 sequence sets is denoted as ⁇ (x m,1 ,x m,2 ,x m,3 ,x m,4 )
  • m 1, 2,...,M ⁇ , where M is the code
  • M is the code
  • the number of preambles in the word set, m is the number of the preamble.
  • the codeword set can be specified in the standard. For example, the standard provides the corresponding relationship between the codeword number and the four sequences. When the corresponding relationship is represented by a table, it can be as shown in Table 2 or Table 4.
  • the codeword set of the preamble determined by the 4 sequence sets can be determined in the following manner. First obtain the preferred codeword set ⁇ (x m,1 ,x m,2 )
  • m 1,2,...,M 1 ⁇ and ⁇ (x m,3 ,x m,4 )
  • m 1,2,...,M 2 ⁇ (m is the number), and then obtain the preferred codeword set determined by the 4 sequence sets according to the two preferred codeword sets determined by the 2 sequence sets.
  • Each edge in the bipartite graph corresponds to a codeword in the first set, for example Corresponding vertices and The corresponding vertex has an edge, then (x 1 , x 2 ) belongs to the first set.
  • the second set ⁇ (x m,3 ,x m,4 )
  • m 1,2,...,M 2 ⁇ also conforms to the bipartite graph feature shown in Fig.
  • the bipartite graph shown in Figure 3 has the following characteristics: in the set of vertices on both sides of the bipartite graph, 2 vertices are randomly selected with equal probability, and the probability of a circle between these vertices is 0.
  • the bipartite graph shown in Figure 2 determines the preferred codeword set of the preamble determined by the 4 sequence sets ⁇ (x m,1 ,x m,2 ,x m,3 ,x m,4 )
  • m 1,2,...,M ⁇ .
  • the bipartite graph shown in Figure 2 has 64 first vertices (upper vertices), corresponding to the elements in the first set.
  • first vertices upper vertices
  • one-to-one correspondence can be made according to the number of the first vertex and the number of the elements in the first set.
  • the numbers of the second vertices can correspond to the numbers of the elements in the second set. If there is a first vertex with number m1 in the bipartite graph With a second vertex number m2 If there is an edge, the preamble which is In the preferred codeword set of the preamble determined by the 4 sequence sets, otherwise the preamble Not in the set of codewords.
  • the codeword set of the preamble includes 424 preambles.
  • the network device When the terminal device sends the preamble selected by itself, the network device will detect the preamble on the PO and identify the transmitted preamble. The network device identifies the terminal device that sends the preamble or the preamble sent by the terminal device according to the correspondence between the preamble and the ZC sequence. For example, the network device can identify the transmitted preamble according to the bipartite graphs shown in FIG. 2 and FIG. 3. Specifically, the network device first uses the bipartite graph shown in FIG. 3 to identify the sent elements in the first set and the sent elements in the second set respectively; then the network device uses the bipartite graph shown in FIG.
  • the network device receives the ZC sequence ⁇ S 1 , S 17 , S 33 , S 49 , S 50 ⁇ on the PO, the network device first identifies the sent element (S 1 , S 17 ) in the first set, and The transmitted elements (S 33 , S 49 ) and (S 33 , S 50 ) in the second set; then the network equipment recognizes the transmitted preamble (S 1 , S 17 , S 33 ,S 49 ) and (S 1 , S 17 , S 33 , S 50 ), where (S 1 , S 17 ) corresponds to the vertex No.
  • (S 33 , S 49 ) and ( S 33 , S 50 ) correspond to vertices 1 and 2 of the lower side of the bipartite graph shown in Figure 2.
  • the network device receives the ZC sequence ⁇ S 1 , S 17 , S 18 , S 33 , S 35 , S 49 , S 51 ⁇ on the PO, the network device first identifies the sent element in the first set (S 1 , S 17 ) and (S 1 , S 18 ), and the sent elements (S 33 , S 49 ) and (S 35 , S 51 ) in the second set; then the network device recognizes the sent elements (S 33 , S 49 ) and (S 35 , S 51 ); Preambles (S 1 , S 17 , S 33 , S 49 ) and (S 1 , S 18 , S 35 , S 51 ) determined by a sequence set, where (S 1 , S 17 ) and (
  • the network device and the terminal device can improve the recognition accuracy on the basis of increasing the code word capacity through the preferred code word set.
  • the codeword set conforms to the characteristics of the bipartite graph.
  • the codeword set includes the correspondence between a codeword and multiple sequences, and a codeword is determined by multiple sequences.
  • the corresponding relationship between the codeword and multiple sequences can be expressed in the form of a table, of course, it can also be expressed in other forms.
  • the following introduces a method of expressing the corresponding relationship through a formula.
  • the codewords in the codeword set are determined by an index number, that is, a number, and a function.
  • the network device can configure an index number to the terminal device.
  • the terminal device determines the codeword configured by the network device and the corresponding number according to the index number and function. Sequences.
  • the network device can also configure the calculation parameters of the function to the terminal device. Both the function and the calculation parameter can be specified by the standard, or the function can be specified by the standard, and the calculation parameter is configured by the network device to the terminal device through signaling.
  • Each preamble can be recorded as Or (x 1 , x 2 , x 3 , x 4 ), x i ⁇ ⁇ 1,2,...,64 ⁇ , that is, a preamble is determined by 4 sequences.
  • m 1,2,...,M ⁇ , where M is the number of preambles in the set, m is the number of the preamble, and f(m,( ⁇ 1 , ⁇ 2 )) is the integer m
  • f(m,( ⁇ 1 , ⁇ 2 )) and ( ⁇ 1 , ⁇ 2 ) can be given in the standard.
  • f(m, ( ⁇ 1 , ⁇ 2 )) is given in the standard, and ( ⁇ 1 , ⁇ 2 ) is configured by the network device to the terminal device.
  • the network device can assign a specific preamble number to each terminal device through signaling.
  • a specific preamble number to each terminal device through signaling.
  • the signaling sent to the terminal equipment includes the following:
  • SBF-Preamble-Configure represents preamble configuration information
  • ra-OccasionList represents the numbers of 4 POs used to transmit the preamble.
  • the function-Parameter represents the calculation parameter, namely the parameter ( ⁇ 1 , ⁇ 2 ), which is optional.
  • sbf-PreambleIndex represents the index number or number of the preamble, corresponding to the number m of the preceding preamble.
  • the terminal device substitutes the function f(m,( ⁇ 1 , ⁇ 2 )) according to the assigned preamble number m, and calculates (x m,1 ,x m,2 ,x m,3 ,x m,4 ).
  • the terminal device needs to establish a connection with the network device, it sends the corresponding assigned ZC sequence to the network device on the four POs. Used to initiate the process of establishing a connection.
  • the preamble numbered m constitutes a preferred codeword set, and the preferred codeword set includes 6400 preambles in total.
  • the preamble in the preferred codeword set is determined by the first sequence in the first sequence set and the second sequence in the second sequence set, and the first sequence is determined by the third sequence and the fourth sequence set in the third sequence set The fourth sequence in is determined.
  • the second sequence is determined by the fifth sequence in the fifth sequence set and the sixth sequence in the sixth sequence set.
  • the preamble in the preferred codeword set is determined by four sequences. The sizes of the third sequence set, the fourth sequence set, the fifth sequence set, or the sixth sequence set are all 64.
  • the size of either the first sequence set or the second sequence set is 320.
  • the size of each sequence set for generating the preferred codeword set is only an example, and the size of the preferred codeword set is also only an example. In practical applications, the size of the preferred codeword set or the size of each sequence set can also have other values , And used in the modification of the above function formula.
  • the preamble determined by the 4 sequences can be regarded as a concatenation based on two codewords determined by the 2 sequences.
  • 64 is the size of the third sequence set, the fourth sequence set, the fifth sequence set, or the sixth sequence set.
  • 320 is the size of the first sequence set or the second sequence set.
  • f, h, or g are all used to represent functions.
  • the specific value of each calculation parameter in the f, h, or g function is not limited.
  • G and M are the parameters of the h function, and the specific values are not limited.
  • m 1,...,6400 ⁇ when m 1 ,m There is an edge between 2 , that is, the preamble determined by 4 sequences formed by splicing codewords numbered m1 and m2 determined by 2 sequences belongs to the preferred codeword set.
  • (m 1 , m 2 ) is a combination generated by a certain m value.
  • 3 vertices are randomly selected with equal probability (a total of 6 vertices), and the probability of a circle between these vertices is less than 3.0%.
  • the corresponding bipartite graph For a codeword set determined by two sequences, such as the first set, the corresponding bipartite graph has 64 upper and lower vertices, corresponding to x 1 , x 2 , if and only if (x 1 , x 2 ) ⁇ ⁇ h(g(m 1 , ⁇ 2 ,64),64)
  • m 1 1,...,320 ⁇ There is an edge between x 1 and x 2 , that is, (x 1 ,x 2 ) is a certain m 1
  • 3 vertices are randomly selected with equal probability (6 vertices in total), and the probability of a circle between these vertices is less than 3.5%.
  • the bipartite graph corresponding to the second set is similar to that corresponding to the first set, and will not be repeated here.
  • the network device recognizes the preamble sent by the terminal device according to the two bipartite graphs corresponding to the function.
  • the two bipartite graphs include the bipartite graph corresponding to the preferred codeword set of the preamble determined by 4 sequences and the bipartite graph corresponding to the codeword set determined by the 2 sequences.
  • network equipment and terminal equipment use a preferred codeword set for codeword transmission, so that any three terminal equipment uses different preambles at the same time During transmission, the network device can identify the three terminal devices sent with a high probability, which helps to avoid false alarms.
  • formulas to express the correspondence between codewords and multiple sequences can simplify the workload of standardization. Only functions and function parameters need to be defined in the standard. If the preamble is transmitted on 4 POs, it can provide 6400 preambles that can be identified with high or full probability.
  • the codeword is a demodulation reference signal (DMRS).
  • DMRS demodulation reference signal
  • the number of uplink DMRS defined on each OS can also be other positive integers, such as 12, 36, etc., which is not limited in the embodiment of the present application.
  • the ZC sequence of the i-th OS On the mapped OFDM symbol is carried by N 0 REs, and the frequency domain signal mapped on the nth RE among the N 0 REs is
  • the ZC sequence is as shown in formula (1) or formula (2).
  • an uplink DMRS is composed of A ZC sequence and set in One of the ZC sequences is determined.
  • the transmission of an uplink DMRS by the terminal equipment is equivalent to the slave set on the first OS Select ZC sequence Transfer, slave collection on the second OS Select ZC sequence transmission.
  • Each uplink DMRS can be recorded as Or (x 1 , x 2 ), x i ⁇ ⁇ 1,2,...,24 ⁇ , that is, the uplink DMRS is determined by two sequences.
  • a set of preferred codeword sets (ie, uplink DMRS) is denoted as ⁇ (x m,1 ,x m,2 )
  • m 1,2,...,M ⁇ , where M is the number of uplink DMRS in the set, m Is the number of the uplink DMRS.
  • the network device can assign each terminal device a specific uplink DMRS through signaling.
  • the uplink DMRS of different terminal devices may be the same or different, which is not limited in the embodiment of the present application.
  • the uplink DMRS in the preferred codeword set is predefined in the standard.
  • the uplink DMRS may be called a candidate uplink DMRS.
  • the network device configures the terminal device with the number of the uplink DMRS of the terminal device from the candidate uplink DMRS. , The terminal device obtains the corresponding uplink DMRS on each OS according to the number.
  • the set of uplink DMRS is given in the standard.
  • One uplink DMRS corresponds to one number
  • one uplink DMRS corresponds to multiple ZC sequences. Table 5 takes one uplink DMRS corresponding to two ZC sequences as an example.
  • one uplink DMRS corresponds to two ZC sequences.
  • m represents the number of the uplink DMRS
  • x m,1 represents the number of the first ZC sequence
  • x m,2 represents the number of the second ZC sequence.
  • Each numbered uplink DMRS corresponds to two ZC sequences.
  • the ZC sequence is also indicated by number.
  • the codeword with number m is determined by the first ZC sequence with number 1 and the second ZC sequence with number 1.
  • the code word with the number m 7 is determined by the first ZC sequence with the number 2 and the second ZC sequence with the number 3.
  • the network device can allocate one or more uplink DMRS to the terminal device through signaling.
  • One of the manifestations of signaling can be as follows:
  • SBF-DMRS-UplinkConfig represents uplink DMRS configuration information.
  • dmrs-Position represents the position of the OS used to transmit DMRS
  • dmrs-ZC-Config represents the configuration of the ZC sequence set on the two OSs.
  • sbf-DMRS-Index represents the index number or number of the DMRS, corresponding to the number m, for example, the first sequence and the second sequence can be indexed according to the value of m in Table 5.
  • DMRS-ZC-Config represents the configuration information of the ZC sequence set.
  • root represents the root u of the ZC sequence
  • cyclicShift-Gap corresponds to N cs in the ZC sequence.
  • the network device configures a ZC sequence for the terminal device, and configures it on the first OS Configure on the second OS
  • network equipment allocates DMRS to terminal equipment through signaling.
  • the second form of signaling can be as follows:
  • SBF-DMRS-UplinkConfig represents the configuration information of the uplink DMRS.
  • dmrs-Position represents the position of the OS used to transmit DMRS
  • dmrs-ZC-Config represents the configuration of the ZC sequence set on the two OSs.
  • zc-DMRSIndex represents the index number or number of the ZC sequence on the two OSs.
  • cyclicShift-Gap corresponds to N cs in the ZC sequence.
  • the terminal device When the terminal device transmits data on the PUSCH, it sends the corresponding allocated DMRS on the two OSs as a demodulation reference signal.
  • the preferred codeword set of the uplink DMRS in this embodiment can be determined by the bipartite graph shown in FIG. 8.
  • the bipartite graph has 24 upper vertices, corresponding to 24 ZC sequences sent in the first OS, and 24 lower vertices, corresponding to 24 ZC sequences sent in the second OS.
  • the bipartite graph shown in Figure 8 has the following characteristics: the probability of the existence of cycles in any number of vertices of the bipartite graph is less than or equal to the threshold, or in other words, the vertices on both sides of the bipartite graph are randomly selected with equal probability.
  • the probability is less than or equal to the threshold.
  • 3 vertices are randomly selected with equal probability (6 vertices in total), and the probability of a circle between these vertices is less than 1%.
  • the network device When multiple terminal devices transmit their assigned uplink DMRS at the same time, the network device will perform ZC sequence detection on the first OS and the second OS respectively, and identify the transmitted ZC sequence, and then the network device will follow the bipartite diagram shown in Figure 8. Identify the DMRS sent.
  • the uplink DMRS given in this embodiment provides 108 identifiable uplink DMRS on 2 OSs, while the traditional DMRS technology is based on 24 ZC sequences defined on each OS, and it can only be used on 2 OSs. Provide 48 identifiable uplink DMRS signals. Compared with the traditional DMRS technology, the uplink DMRS provided in the embodiments of the present application can provide more identifiable uplink DMRS.
  • the network device can identify the three terminal devices sent with a high probability, and there will be no false alarm problem.
  • the network device cannot correctly identify any uplink DMRS.
  • the methods provided in the embodiments of the present application are respectively introduced from the perspective of network equipment, terminal equipment, and interaction between the network equipment and the terminal equipment.
  • the network device and the terminal device may include a hardware structure and/or software module, and the above functions are implemented in the form of a hardware structure, a software module, or a hardware structure plus a software module . Whether one of the above-mentioned functions is executed in a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application and design constraint conditions of the technical solution.
  • an embodiment of the present application further provides a device 900.
  • the device 900 may be a terminal device or a network device, or a device in a terminal device or a network device, or may be compatible with Terminal equipment or network equipment matching device.
  • the apparatus 900 may include modules that perform one-to-one correspondence of the methods/operations/steps/actions performed by the terminal equipment or network equipment in the foregoing method embodiments.
  • the modules may be hardware circuits, software, or It is realized by hardware circuit combined with software.
  • the device may include a processing module 901 and a communication module 902.
  • the processing module 901 is configured to determine one or more codewords in the codeword set
  • the communication module 902 is configured to send one or more codewords in the codeword set.
  • the codeword set is as described in the above method embodiment, and will not be repeated here.
  • the processing module 901 and the communication module 902 may also be used to execute other corresponding steps or operations performed by the terminal device in the foregoing method embodiment, which will not be repeated here.
  • the communication module 902 is configured to receive one or more codewords in the codeword set from the terminal device; the codeword set is as described in the above method embodiment, and will not be repeated here.
  • the processing module 901 is used to analyze the received codeword.
  • the processing module 901 and the communication module 902 may also be used to execute other corresponding steps or operations performed by the network device in the foregoing method embodiment, which will not be repeated here.
  • the division of modules in the embodiments of the present application is illustrative, and is only a logical function division. In actual implementation, there may be other division methods.
  • the functional modules in the various embodiments of the present application may be integrated into one process. In the device, it can also exist alone physically, or two or more modules can be integrated into one module.
  • the above-mentioned integrated modules can be implemented in the form of hardware or software functional modules.
  • an apparatus 1000 provided by an embodiment of this application is used to implement the functions of the terminal device or the network device in the foregoing method.
  • the device can be a network device, a device in a network device, or a device that can be matched and used with the network device.
  • the device may be a terminal device, a device in a terminal device, or a device that can be used in matching with the terminal device.
  • the device may be a chip system.
  • the chip system may be composed of chips, or may include chips and other discrete devices.
  • the apparatus 1000 includes at least one processor 1020, configured to implement the functions of the terminal device or the network device in the method provided in the embodiment of the present application.
  • the device 1000 may further include a communication interface 1010.
  • the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface, which is used to communicate with other devices through a transmission medium.
  • the communication interface 1010 is used for the device in the device 1000 to communicate with other devices.
  • the apparatus 1000 is a network device
  • the other device may be a terminal device.
  • the other device may be a network device.
  • the processor 1020 uses the communication interface 1010 to send and receive data, and is used to implement the method described in the foregoing method embodiment.
  • the processor 1020 when the function of the network device is realized, the processor 1020 is configured to use the communication interface to receive one or more codewords in the codeword set from the terminal device; when the function of the terminal device is realized, the processor 1020 is configured to use The communication interface sends one or more codewords in the codeword set to the network device. For details, see the detailed description in the method example, which is not repeated here.
  • the device 1000 may further include at least one memory 1030 for storing program instructions and/or data.
  • the memory 1030 and the processor 1020 are coupled.
  • the coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, and may be in electrical, mechanical or other forms, and is used for information exchange between devices, units or modules.
  • the processor 1020 may cooperate with the memory 1030 to operate.
  • the processor 1020 may execute program instructions stored in the memory 1030. At least one of the at least one memory may be included in the processor.
  • the embodiment of the present application does not limit the specific connection medium between the communication interface 1010, the processor 1020, and the memory 1030.
  • the memory 1030, the communication interface 1020, and the transceiver 1010 are connected by a bus 1040.
  • the bus is represented by a thick line in FIG. 10, and the connection mode between other components is only for schematic illustration. , Is not limited.
  • the bus can be divided into address bus, data bus, control bus, etc. For ease of representation, only one thick line is used to represent in FIG. 10, but it does not mean that there is only one bus or one type of bus.
  • the processor may be a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, and may implement or Perform the methods, steps, and logic block diagrams disclosed in the embodiments of the present application.
  • the general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed and completed by a hardware processor, or executed and completed by a combination of hardware and software modules in the processor.
  • the memory may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), etc., or a volatile memory (volatile memory), for example Random-access memory (random-access memory, RAM).
  • the memory is any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.
  • the memory in the embodiments of the present application may also be a circuit or any other device capable of realizing a storage function, for storing program instructions and/or data.
  • the methods provided in the embodiments of the present application may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software When implemented by software, it can be implemented in the form of a computer program product in whole or in part.
  • the computer program product includes one or more computer instructions.
  • the computer may be a general-purpose computer, a dedicated computer, a computer network, network equipment, user equipment, or other programmable devices.
  • the computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center.
  • 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 integrated with one or more available media.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, and a magnetic tape), an optical medium (for example, a digital video disc (digital video disc, DVD for short)), or a semiconductor medium (for example, SSD).
  • the embodiments can be mutually cited.
  • methods and/or terms between method embodiments can be mutually cited, such as functions and/or functions between device embodiments.
  • Or terms may refer to each other, for example, functions and/or terms between the device embodiment and the method embodiment may refer to each other.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un procédé et un dispositif de transmission de mot de code, qui sont utilisés pour réduire, sur la base de l'expansion de la capacité de mot de code, la probabilité qu'un dispositif de réseau émette une fausse alerte. Le procédé comprend : l'envoi d'au moins un mot de code parmi un ensemble de mots de code sur un dispositif de réseau ; l'ensemble de mots de code comprenant M mots de code, M étant un nombre entier positif, l'un des M mots de code est déterminé par une première séquence d'un premier ensemble de séquences et une seconde séquence d'un second ensemble de séquences, le premier ensemble de séquences et le second ensemble de séquences étant utilisés pour déterminer respectivement un premier ensemble de sommets et un second ensemble de sommets d'un premier graphe biparti, un bord est présent entre un premier sommet correspondant de la première séquence au niveau du premier graphe biparti et un second sommet correspondant de la seconde séquence au niveau du premier graphe biparti ; et la probabilité qu'il existe un cercle dans une pluralité de sommets du premier ensemble de sommets et du second ensemble de sommets est inférieure ou égale à un premier seuil.
PCT/CN2020/107558 2019-08-14 2020-08-06 Procédé et dispositif de transmission de mot de code Ceased WO2021027691A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910750449.2 2019-08-14
CN201910750449.2A CN112398608B (zh) 2019-08-14 2019-08-14 一种码字的传输方法及装置

Publications (1)

Publication Number Publication Date
WO2021027691A1 true WO2021027691A1 (fr) 2021-02-18

Family

ID=74570918

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/107558 Ceased WO2021027691A1 (fr) 2019-08-14 2020-08-06 Procédé et dispositif de transmission de mot de code

Country Status (2)

Country Link
CN (1) CN112398608B (fr)
WO (1) WO2021027691A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4240052A4 (fr) 2020-11-16 2023-11-29 Huawei Technologies Co., Ltd. Procédé et appareil d'envoi de séquences

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101827377A (zh) * 2010-02-09 2010-09-08 华为技术有限公司 一种虚警信息检测方法和用户设备
WO2016122055A1 (fr) * 2015-01-28 2016-08-04 Lg Electronics Inc. Procédé et appareil d'exécution d'une procédure d'accès aléatoire dans un système de communication sans fil
US20180077730A1 (en) * 2015-03-05 2018-03-15 Lg Electronics Inc. Method and apparatus for detecting rach preamble on basis of plurality of zero-correlation zones in wireless communication system
CN108631903A (zh) * 2017-03-22 2018-10-09 电信科学技术研究院 一种物理随机接入信道前导码序列确定方法及装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9876511B2 (en) * 2015-09-11 2018-01-23 Toshiba Memory Corporation Memory system and memory control method
US11043966B2 (en) * 2016-05-11 2021-06-22 Qualcomm Incorporated Methods and apparatus for efficiently generating multiple lifted low-density parity-check (LDPC) codes
US10657253B2 (en) * 2016-05-18 2020-05-19 The Governing Council Of The University Of Toronto System and method for determining correspondence and accountability between binary code and source code
KR102239527B1 (ko) * 2016-11-23 2021-04-13 프라운호퍼-게젤샤프트 추르 푀르데룽 데어 안제반텐 포르슝 에 파우 통신 네트워크에서의 재송신 프로세스를 개선하는 방법, 데이터 신호, 통신 네트워크, 송신기 및 수신기
CN109787640A (zh) * 2019-01-25 2019-05-21 北京航空航天大学 一种两阶段的低复杂度极化码构造方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101827377A (zh) * 2010-02-09 2010-09-08 华为技术有限公司 一种虚警信息检测方法和用户设备
WO2016122055A1 (fr) * 2015-01-28 2016-08-04 Lg Electronics Inc. Procédé et appareil d'exécution d'une procédure d'accès aléatoire dans un système de communication sans fil
US20180077730A1 (en) * 2015-03-05 2018-03-15 Lg Electronics Inc. Method and apparatus for detecting rach preamble on basis of plurality of zero-correlation zones in wireless communication system
CN108631903A (zh) * 2017-03-22 2018-10-09 电信科学技术研究院 一种物理随机接入信道前导码序列确定方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
INTEL CORPORATION: "Power saving signal for efeMTC", 3GPP DRAFT; R1-1717340, vol. RAN WG1, 30 September 2017 (2017-09-30), Prague, Czech Republic, pages 1 - 8, XP051351855 *

Also Published As

Publication number Publication date
CN112398608A (zh) 2021-02-23
CN112398608B (zh) 2022-03-29

Similar Documents

Publication Publication Date Title
US11937281B2 (en) Communications method and apparatus
US11363499B2 (en) Resource configuration method, apparatus, and system
WO2022022579A1 (fr) Procédé et appareil de communication
CN111629394B (zh) 随机接入方法和装置
US11996944B2 (en) Communication method and apparatus for communication of a control channel and data channel
WO2024027759A1 (fr) Procédé et appareil de génération de signal de référence de sondage
WO2018103558A1 (fr) Procédés de transmission et de détection d'informations de commande de liaison descendante, dispositif, station de base et terminal
US11258571B2 (en) Downlink control information transmission method, apparatus, and system
WO2021062872A1 (fr) Procédé et dispositif de communication
US12101747B2 (en) Communication method and apparatus
WO2022237623A1 (fr) Procédé et appareil de transmission de données
WO2020224512A1 (fr) Procédé et appareil permettant de détecter un canal de commande de liaison descendante
WO2020147694A1 (fr) Procédé et dispositif de communication
CN109803438B (zh) 随机接入方法、网络设备及终端
CN112398608B (zh) 一种码字的传输方法及装置
CN112385169B (zh) 频域位置确定方法、装置及设备
CN111294306B (zh) 一种参考信号的传输方法及装置
CN116686381A (zh) 随机接入方法及装置
CN110062473B (zh) 随机接入方法、终端设备和网络设备
CN108809579B (zh) 资源配置方法、装置和系统
CN111585731B (zh) 一种通信方法及装置
WO2021031874A1 (fr) Procédé de transmission de signaux et appareil de communication
CN111132318B (zh) 一种资源调度方法和装置
WO2025124080A1 (fr) Procédé et appareil de communication
WO2025124081A1 (fr) Procédé et appareil de communication

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20852368

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20852368

Country of ref document: EP

Kind code of ref document: A1