CN112449438B - Random access method and device - Google Patents
Random access method and device Download PDFInfo
- Publication number
- CN112449438B CN112449438B CN202010219752.2A CN202010219752A CN112449438B CN 112449438 B CN112449438 B CN 112449438B CN 202010219752 A CN202010219752 A CN 202010219752A CN 112449438 B CN112449438 B CN 112449438B
- Authority
- CN
- China
- Prior art keywords
- sequence
- sequences
- candidate
- terminal
- processor
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 165
- 238000012545 processing Methods 0.000 claims description 71
- 238000004891 communication Methods 0.000 claims description 56
- 230000015654 memory Effects 0.000 claims description 39
- 230000008569 process Effects 0.000 claims description 34
- 238000005259 measurement Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 9
- 125000004122 cyclic group Chemical group 0.000 claims description 9
- 238000001514 detection method Methods 0.000 abstract description 10
- 230000000875 corresponding effect Effects 0.000 description 114
- 230000006870 function Effects 0.000 description 55
- 238000013461 design Methods 0.000 description 15
- 230000011664 signaling Effects 0.000 description 14
- 238000010586 diagram Methods 0.000 description 9
- 238000004422 calculation algorithm Methods 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 7
- 230000003993 interaction Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 239000004065 semiconductor Substances 0.000 description 4
- 238000003491 array Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000014509 gene expression Effects 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 229910044991 metal oxide Inorganic materials 0.000 description 3
- 150000004706 metal oxides Chemical class 0.000 description 3
- 229910000577 Silicon-germanium Inorganic materials 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 2
- 230000001276 controlling effect Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000007781 pre-processing Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 239000000126 substance Substances 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- JBRZTFJDHDCESZ-UHFFFAOYSA-N AsGa Chemical compound [As]#[Ga] JBRZTFJDHDCESZ-UHFFFAOYSA-N 0.000 description 1
- LEVVHYCKPQWKOP-UHFFFAOYSA-N [Si].[Ge] Chemical compound [Si].[Ge] LEVVHYCKPQWKOP-UHFFFAOYSA-N 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000010304 firing Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/002—Transmission of channel access control information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application provides a random access method and a random access device. The method comprises the following steps: and selecting a plurality of base sequences according to the corresponding relation between the lead code set and the base sequence (orthogonal sequence or quasi-orthogonal sequence) set to generate or calculate the lead code, wherein the candidate lead code in the lead code set and the candidate base sequence in the base sequence set meet the corresponding relation, so that the capacity of the lead code can be expanded in limited physical resources, excellent undetected probability and false detection probability are ensured, and the requirement of accessing a large number of terminals into a network is met.
Description
The present application claims priority of chinese patent application with application number 201910822354.7 entitled "random access method and apparatus" filed by the chinese intellectual property office in 2019, 9, month 2, the entire contents of which are incorporated herein by reference.
Technical Field
The present application relates to the field of communications technologies, and in particular, to a random access method and apparatus.
Background
In a wireless communication network, due to reasons such as power saving of users and limited radio resources, when a terminal is inactive for a long time, a network device may disconnect an air interface connection with the terminal. Therefore, when an inactive terminal needs to retransmit data, the terminal first needs to establish a connection with a network device, and the terminal may send a preamble to the network device to initiate a random access procedure when attempting to access the wireless network. However, the physical resource capable of carrying the preamble is limited, which results in insufficient capacity of the preamble and fails to satisfy the requirement of a large number of terminals to access the network. Therefore, how to expand the capacity of the preamble in the limited physical resources becomes a problem to be solved urgently.
Disclosure of Invention
The embodiment of the application provides a communication method and device.
In a first aspect, an embodiment of the present application provides a communication method, which may be performed by a terminal or a component (e.g., a processor, a chip, or a system-on-chip) of the terminal, including: a first sequence { x (N), N =0,1, \ 8230;, N-1} (abbreviated: { x (N) }), and outputting the first sequence { x (N) }, wherein the first sequence { x (N) } is associated with d second sequences { { s) } 1 (n),n＝0,1,…,N-1},{s 2 (n),n＝0,1,…,N-1},…,{s d (N), N =0,1, \ 8230;, N-1} } (abbreviated: { { s: { } 1 (n)},{s 2 (n)},…,{s d (n) }). The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is an integer greater than M.
Wherein the K candidate first sequences and the M candidate second sequences satisfy a first condition described below:
the first condition is that: any s candidate first sequences in the K candidate first sequences correspond to d × s candidate second sequences, at least d × (1-epsilon) × s candidate second sequences different from each other exist in the d × s candidate second sequences, epsilon is a real number larger than 0 and smaller than 1, and s is an integer larger than 1 and smaller than K. It is to be understood that this first condition may also be expressed as the (s; d; epsilon) -expander criterion for convenience of description.
By the method, d second sequences are selected according to the corresponding relation between the K candidate first sequences and the M candidate second sequences to generate or calculate the first sequences, wherein the candidate first sequences and the candidate second sequences meet the corresponding conditions, and the capacity of the sequences corresponding to the terminal signals is increased, so that the capacity of the sequences corresponding to the terminal signals can be expanded in limited physical resources, and the requirements of a large number of terminals for accessing a network or transmitting signals are met. In addition, because the first sequence and the second sequence in the method have low cross-correlation characteristics, the capacity of the sequence corresponding to the terminal signal can be expanded, and meanwhile, the sequence corresponding to the terminal signal can be ensured to have good detection performance.
With reference to the first aspect, in some embodiments of the first aspect, the corresponding relationship may be implemented in a form of a table, may also be implemented in a form of a function, and may also be implemented in other data structures, for example, may be implemented in an array, a queue, a container, a stack, a linear table, a pointer, a linked list, a tree, a graph, a structure, a class, a heap, a hash table, or a hash table.
With reference to the first aspect, in certain embodiments of the first aspect, configuration information is obtained that configures the d second sequences { { s { (S) } 1 (n)},{s 2 (n)},…,{s d (n) }, or the configuration information configures a first sequence { x (n) } and d second sequences { { s) } 1 (n)},{s 2 (n)},…,{s d (n) }. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of: system information, radio Resource Control (RRC) signaling, medium Access Control (MAC) Control Element (CE), or a control channel.
With reference to the first aspect, in certain embodiments of the first aspect, the d second sequences { { s ] are obtained according to the configuration information 1 (n)},{s 2 (n)},…,{s d (n)}}。
With reference to the first aspect, in certain embodiments of the first aspect, a correspondence between the K candidate first sequences and the M candidate second sequences is obtained, and the d second sequences { { s) are obtained according to the correspondence 1 (n)},{s 2 (n)},…,{s d (n)}}。
With reference to the first aspect, in certain embodiments of the first aspect, d second sequences { { s ] are provided according to the description above 1 (n)},{s 2 (n)},…,{s d (n) generating or calculating the first sequence { x (n) }.
With reference to the first aspect, in certain embodiments of the first aspect, the first sequence is one of: a sequence of a preamble signal, a sequence of a demodulation reference signal (DMRS), a sequence of a Phase Tracking Reference Signal (PTRS), a sequence of a Sounding Reference Signal (SRS), a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. The signal may be a signal transmitted by a terminal to a network device, or may be a signal transmitted by one terminal to one or more other terminals. Optionally, when the first sequence is a sequence of a preamble, a value of M may be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4,k may be 640, 512, 320, 256, 160, or 128, but the application does not limit other values of N and M. Optionally, when the first sequence is a sequence of DMRS, a value of M may be 6, 8, 12, 16, 18, 24, or 32, and a value of k may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.
With reference to the first aspect, in certain embodiments of the first aspect, the second sequence is a ZC sequence or a sequence obtained by subjecting a ZC sequence to a first process, and the first process includes one or more of: discrete fourier transform, DFT, or cyclic shift.
By configuring the parameters related to the first sequence by the above-mentioned configuration method, it is possible to reduce interference between devices by configuring different devices to use different parameters of the first sequence.
In a second aspect, embodiments of the present application provide a communication method, which may be performed by a network device or a component (e.g., a processor, a chip, or a system-on-chip) of the network device. The method comprises the following steps: a first sequence x (N), N =0,1, \ 8230;, N-1} is received (abbreviated: { x (N) }), and processing the first sequence { x (N) }, wherein the first sequence { x (N) } is associated with d second sequences { { s) } 1 (n),n＝0,1,…,N-1},{s 2 (n),n＝0,1,…,N-1},…,{s d (N), N =0,1, \8230;, N-1} } (abbreviation: { { s: { } s) 1 (n)},{s 2 (n)},…,{s d (n) }). The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is an integer greater than M.
Wherein the K candidate first sequences and the M candidate second sequences satisfy a first condition described below:
the first condition is that: any s candidate first sequences in the K candidate first sequences correspond to d x s candidate second sequences, at least d x (1-epsilon) x s candidate second sequences which are different from each other exist in the d x s candidate second sequences, epsilon is a real number which is more than 0 and less than 1, and s is an integer which is more than 1 and less than K. It is to be understood that this first condition may also be expressed as the (s; d; epsilon) -expander criterion for convenience of description.
Through the method, d second sequences are selected according to the corresponding relation between the K candidate first sequences and the M candidate second sequences to generate or calculate the first sequences, wherein the candidate first sequences and the candidate second sequences meet the corresponding conditions, and the capacity of the sequences corresponding to the terminal signals is increased, so that the capacity of the sequences corresponding to the terminal signals can be expanded in limited physical resources, and the requirements of a large number of terminals for accessing a network or sending signals are met. In addition, because the first sequence and the second sequence in the method have low cross-correlation characteristics, the capacity of the sequence corresponding to the terminal signal can be expanded, and meanwhile, the sequence corresponding to the terminal signal can be ensured to have good detection performance.
With reference to the second aspect, in some embodiments of the second aspect, the corresponding relationship may be implemented in a form of a table, may also be implemented in a form of a function, and may also be implemented in other data structures, for example, may be implemented in an array, a queue, a container, a stack, a linear table, a pointer, a linked list, a tree, a graph, a structural body, a class, a heap, a hash table, or a hash table.
In certain embodiments of the second aspect, in combination with the second aspect, the method further comprises: sending configuration information to the terminal, wherein the configuration information configures the d second sequences { { s { { S { (S) } 1 (n)},{s 2 (n)},…,{s d (n) }, or the configuration information configures the first sequence { s (n) } and the d second sequences { { s (n) } 1 (n)},{s 2 (n)},…,{s d (n) }. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of: system information, RRC signaling, MAC CE, or control channel.
With reference to the second aspect, in certain embodiments of the second aspect, the first sequence is one of: a preamble sequence, a DMRS sequence, a PTRS sequence, an SRS sequence, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. Optionally, when the first sequence is a preamble sequence, a value of M may be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, k may be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a sequence of a DMRS, a value of M may be 6, 8, 12, 16, 18, 24, or 32, a value of k may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.
With reference to the second aspect, in some embodiments of the second aspect, the second sequence is a ZC sequence or a sequence obtained by subjecting a ZC sequence to a first process, and the first process includes one or more of: discrete fourier transform, DFT, or cyclic shift.
By configuring the parameters related to the first sequence by the method for sending the configuration information to the terminal, different devices can use different parameters of the first sequence through configuration, and the interference among the devices is reduced.
In a third aspect, an embodiment of the present application provides a communication apparatus, which includes a module or a unit for implementing the communication method in the first aspect or any one of the possible implementation manners of the first aspect. The apparatus comprises corresponding units or means for performing the above-described method. The means comprised by the apparatus may be implemented by software and/or hardware. The communication means may be a terminal device or a component (chip or circuit) for a terminal device.
In a fourth aspect, an embodiment of the present application provides a communication apparatus, which includes a module or a unit configured to implement the communication method in the second aspect or any one of the possible implementation manners of the second aspect. The apparatus comprises corresponding units or means for performing the above-described method. The means comprising may be implemented by software and/or hardware means. The communication device may be, for example, a network device (e.g., a base station), or a chip, a chip system, a processor, or the like that can support the network device to implement the method.
In a fifth aspect, the present application provides an apparatus comprising: a processor coupled to a memory, the memory storing a program or instructions that, when executed by the processor, cause the apparatus to perform the method of the first aspect or any one of the possible implementations of the first aspect.
In a sixth aspect, the present application provides an apparatus comprising: a processor coupled to a memory, the memory being configured to store a program or instructions that, when executed by the processor, cause the apparatus to perform the method of the second aspect described above, or any one of the possible embodiments of the second aspect.
In a seventh aspect, the present application provides a storage medium having stored thereon a computer program or instructions which, when executed, cause a computer to perform the method of the first aspect, or any one of the possible implementations of the first aspect.
In an eighth aspect, the present application provides a storage medium having stored thereon a computer program or instructions which, when executed, cause a computer to perform the method of the second aspect described above, or any one of the possible embodiments of the second aspect.
In a ninth aspect, an embodiment of the present application provides a communication system, including: the apparatus of the third aspect above, and/or the apparatus of the fourth aspect above.
In a tenth aspect, an embodiment of the present application provides a communication system, including: the apparatus of the fifth aspect, and/or the apparatus of the sixth aspect.
Drawings
Fig. 1 is a schematic diagram of a communication system applied to an embodiment provided in the present application;
fig. 2 shows an exemplary architecture of a communication system;
fig. 3 is an interaction diagram illustrating a communication method according to an embodiment of the present application;
fig. 4A illustrates a schematic flowchart of obtaining a correspondence between a candidate first sequence and a candidate second sequence according to an embodiment of the present application;
fig. 4B illustrates another flowchart for obtaining a correspondence between a candidate first sequence and a candidate second sequence according to the embodiment of the present application;
fig. 5 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a terminal according to an embodiment of the present application;
fig. 7 is a schematic diagram of another communication device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
The term "and/or" in the present application is only one kind of association relationship describing the associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in this application generally indicates that the preceding and following associated objects are in an "or" relationship.
In addition, it should be noted that the terms "exemplary" or "such as" and the like in this application are used to indicate examples, illustrations or illustrations and are intended to present relevant concepts in a concrete manner. Any embodiment described herein as "exemplary" or "for example" is not necessarily to be construed as preferred or advantageous over other embodiments, nor is it to be construed as limited by the context of such embodiments.
First, a communication system to which the technical solution provided in the present application is applicable will be described.
The technical scheme of the embodiment of the application can be applied to various communication systems, for example: long Term Evolution (LTE) system, or fifth generation (5) th generation, 5G) communication system, or wireless-fidelity (wireless-fidelity,WiFi), or a New Radio (NR) system, or a system in which multiple communication systems are converged, or a future-evolution communication system, and other network systems that can be used to provide communication services, which are not limited herein.
Fig. 1 schematically shows a possible communication system architecture. The communication system includes at least one network device (network device 100 and network device 110 are shown), and one or more terminals connected to the network device. Terminals 101 and 102 are shown in fig. 1 as communicating with network device 100, and terminals 111 and 112 are shown as communicating with network device 110. It is to be understood that network devices and terminals may also be referred to as communication devices.
Fig. 2 shows an exemplary schematic diagram of a possible architecture of a communication system, such as a base station (e.g., a gNodeB or a gNB) of a Centralized Unit (CU) and a Distributed Unit (DU) separated architecture in a Radio Access Network (RAN) shown in fig. 2. The RAN may be connected to a core network (e.g., LTE core network, 5G core network, etc.). CU and DU can be understood as the division of the base stations from a logical functional point of view. CUs and DUs may be physically separate or deployed together. A plurality of DUs can share one CU. A DU may also connect multiple CUs (not shown). The CU and the DU may be connected via an interface, for example, an F1 interface.
Alternatively, the CUs and DUs may be partitioned according to the protocol layers of the wireless network. Functions such as Radio Resource Control (RRC), service Data Adaptation Protocol (SDAP), and Packet Data Convergence Protocol (PDCP) layers are provided in the CU, and functions such as Radio Link Control (RLC), medium Access Control (MAC) layer, physical (PHY) layer, etc. are provided in the DU. It should be understood that the division of the CU and DU processing functions according to such protocol layers is only an example, and may be performed in other manners.
Alternatively, a CU or DU may also be partitioned into parts of the processing function with the protocol layer. In one possible design, some of the functions of the RLC layer and the functions of the protocol layers above the RLC layer are set in the CU, and the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer are set in the DU. In another possible design, the functions of the CU or the DU may also be divided according to the service type or other system requirements, for example, by time delay, and the function that processing time needs to meet the delay requirement is set in the DU, and the function that does not need to meet the delay requirement is set in the CU. The network architecture shown in fig. 2 may be applied to a 5G communication system, which may also share one or more components or resources with an LTE system. In another design, a CU may also have one or more functions of the core network. One or more CUs may be centrally located or separately located. For example, the CUs may be located on the network side to facilitate centralized management. The DU may have multiple rf functions, or may set the rf functions remotely.
Alternatively, the functionality of a CU may be implemented by one entity or by different entities. For example, the functionality of a CU may be further split, e.g. by separating the Control Plane (CP) and the User Plane (UP), i.e. the CU control plane (CU-CP) and the CU user plane (CU-UP). For example, the CU-CP and CU-UP may be implemented by different functional entities, which may be coupled with the DUs to collectively perform the functions of a base station. In one possible mode, the CU-CP is responsible for control plane functions, mainly including RRC and PDCP control plane (PDCP-C), where the PDCP-C is mainly responsible for encryption and decryption of control plane data, integrity protection, sequence number maintenance, data transmission, and the like; CU-UP is responsible for user plane functions, mainly including SDAP and PDCP user plane (PDCP-U), where the SDAP is mainly responsible for processing data of the core network and mapping data flows (flows) to bearers. The PDCP-U is mainly responsible for encryption and decryption of a data plane, integrity protection, header compression, sequence number maintenance, data transmission and the like, wherein the CU-CP and the CU-UP are connected through an E1 interface.
It is understood that the embodiments provided in the present application are also applicable to an architecture in which CU and DU are not separated.
In this application, the network device may be any device having a wireless transceiving function. Including but not limited to: an evolved Node B (NodeB or eNB or e-NodeB) in LTE, a base station (gnnodeb or gNB) or a Transmission Reception Point (TRP) in NR, an access Node in WiFi system, a wireless relay Node, a wireless backhaul Node, and the like. The base station may be: macro base stations, micro base stations, pico base stations, small stations, relay stations, or balloon stations, etc. Multiple base stations may support the same technology network as mentioned above, or different technologies networks as mentioned above. The base station may contain one or more co-sited or non co-sited TRPs. The network device may also be a wireless controller, CU, and/or DU in a Cloud Radio Access Network (CRAN) scenario. The network device may also be a server, a wearable device, or a vehicle mounted device, etc. The following description will take a network device as an example of a base station. The multiple network devices may be base stations of the same type or different types. The base station may communicate with the terminal, or may communicate with the terminal through the relay station. The terminal may communicate with multiple base stations of different technologies, for example, the terminal may communicate with a base station supporting an LTE network, may communicate with a base station supporting a 5G network, and may support dual connectivity with the base station of the LTE network and the base station of the 5G network.
A terminal may be a User Equipment (UE), or an access terminal, or a subscriber unit, or a subscriber station, or a mobile station, or a remote terminal, or a mobile device, or a user terminal, or a wireless terminal device, or a user agent or a user equipment. The terminal may also be a cellular phone, a cordless phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA) device, a handheld device with wireless communication capability, a computing device or other processing device connected to a wireless modem, a mobile phone (mobile phone), a tablet (Pad), a computer with wireless transceiving capability, a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control (industrial control), a vehicle-mounted terminal device, a wireless terminal in self driving (self driving), a wireless terminal in remote medical (remote medical), a wireless terminal in smart grid (smart grid), a wireless terminal in transportation security, a wireless terminal in city (smart), a wireless terminal in smart phone, a wireless terminal in home (smart phone), a future evolution device in a home network G, or the like. The terminals may also be fixed or mobile, and the terminals may be deployed on land, in water, or in the air.
In addition, in the embodiment of the present application, the terminal may also be a terminal device in an internet of things (IoT) system, the IoT is an important component of future information technology development, and the main technical feature of the present application is to connect an article with a network through a communication technology, so as to implement an intelligent network of human-computer interconnection and article-object interconnection. The terminal in the embodiment of the present application may also be a terminal device in Machine Type Communication (MTC). The terminal of the present application may also be an on-board module, an on-board component, an on-board chip, or an on-board unit built into a vehicle as one or more components or units, and the vehicle may implement the method of the present application through the built-in on-board module, on-board component, on-board chip, or on-board unit. Therefore, the embodiment of the application can be applied to vehicle networking, such as vehicle to outside (V2X), long term evolution (LTE-V) for vehicle to vehicle communication, V2V, and the like. The embodiment of the application does not limit the application scenario of the terminal.
In a wireless communication network, a terminal may initiate random access to establish a connection required for communication with a network device. The terminal may send a random access preamble (preamble) to the network device to initiate a random access process, where the random access preamble may also be referred to as a preamble, a preamble signal, or a preamble, and the name of the random access preamble is not limited in this application. However, when a large number of terminals need to access the network, the capacity of the preamble is short due to the physical resource capable of carrying the preamble, and the requirement of a large number of terminals for accessing the network cannot be met. Therefore, how to expand the capacity of the preamble in the limited physical resources becomes a problem to be solved urgently.
In the method provided by the embodiment of the application, a plurality of base sequences are selected according to the corresponding relation between the lead code set and the base sequence (orthogonal sequence or quasi-orthogonal sequence) set to generate or calculate the lead code, wherein the candidate lead code in the lead code set and the candidate base sequence in the base sequence set meet the corresponding relation, so that the capacity of the lead code can be expanded in limited physical resources, meanwhile, excellent missed detection probability and false detection probability are ensured, and the requirement of a large number of terminals for accessing the network is met.
The physical resources in this application may include one or more of time domain resources, frequency domain resources, code domain resources, or space domain resources. For example, the time domain resource included in the physical resource may include at least one frame, at least one sub-frame, at least one slot (slot), at least one mini-slot (mini-slot), at least one time unit, or at least one time domain symbol. For example, the frequency domain resources included in the physical resources may include at least one carrier (carrier), at least one Component Carrier (CC), at least one bandwidth part (BWP), at least one Resource Block Group (RBG), at least one physical resource block group (PRG), at least one Resource Block (RB), or at least one subcarrier (sub-carrier, SC), and the like. For example, the spatial domain resources included in the physical resources may include at least one beam, at least one port, at least one antenna port, or at least one layer/spatial layer, etc. For example, the code domain resource included in the physical resource may include at least one Orthogonal Cover Code (OCC), at least one non-orthogonal multiple access (NOMA) code, and the like.
It is to be understood that the physical resources described above may be physical resources of a baseband, which may be used by a baseband chip. The physical resources may also be physical resources of the air interface. The physical resource may also be an intermediate frequency or radio frequency physical resource.
For ease of understanding the embodiments in the present application, some concepts or terms referred to in the present application will be first briefly described.
{q r (h) H =0,1, \ 8230;, H-1} represents a sequence { q ] of length H r (0),q r (1),…,q r (H-1), H is an integer greater than 1 and can be abbreviated as { q } r (h) And (4) the balance of the measured time. Wherein q is r (h) Represents an element in the sequence (which can also be understood as an object in the sequence), the value of the element in the sequence can be a real number or a complex number, r can be understood as the number or index of the sequence, and r can be omitted without affecting the understanding.
{{q r (h) H =0,1, \8230;, H-1}, R =0, \8230;, R-1} represents a set { { q } comprising R sequences of length H 0 (h),h＝0,1,…,H-1},{q 1 (h),h＝0,1,…,H-1},…,{q R-1 (h) H =0,1, \8230;, H-1} }, which may be abbreviated as { { q { [ q ] } 0 (h)},{q 1 (h)},…,{q R-1 (h) R is an integer greater than 1, R is understood to be the number or index of the sequence, R is an integer less than R.
Fig. 3 is an interaction diagram of a communication method 300 according to an embodiment of the present application. The communication method is illustrated in fig. 3 by taking a terminal and a network device as an example of the execution subject of the interaction schematic, but the application is not limited to the execution subject of the interaction schematic, for example, the execution subject of the interaction schematic may also be one terminal and another terminal. For another example, the network device in fig. 3 may be a chip, a system on chip, or a processor that supports the network device to implement the method, and the terminal in fig. 3 may be a chip, a system on chip, or a processor that supports the terminal to implement the method. As shown in FIG. 3, the method 300 of this embodiment may include:
operation 310: the terminal obtains a first sequence { x (N), N =0,1, \ 8230;, N-1} (abbreviated: { x (N) }), the first sequence { x (N) } with d second sequences { { s {(s) 1 (n),n＝0,1,…,N-1},{s 2 (n),n＝0,1,…,N-1},…,{s d (N), N =0,1, \ 8230;, N-1} } (abbreviated: { { s: { } 1 (n)},{s 2 (n)},…,{s d (n) }). The first sequence may also be denoted as x k (n), where k can be understood as the first sequence x k (n) a second sequence may be represented as s m (n), where m is understood to be the second sequence s m (n) number or index.
Operation 320: and the terminal sends the first sequence to the network equipment, and the network equipment receives the first sequence.
There are a number of different understandings that the first sequence may be transmitted in this application.
Transmitting the first sequence may be understood as outputting the first sequence, wherein "outputting" may be understood as outputting in baseband processing, as well as in intermediate frequency or radio frequency processing, and as outputting in air interface processing.
Transmitting the first sequence may also be understood as preprocessing the first sequence, including one or more of scrambling, modulation, layer mapping, precoding, power adjustment, or physical resource mapping. For example, transmitting the first sequence may be understood as transmitting a signal corresponding to the first sequence (e.g., the preamble signal, the demodulation reference signal (DMRS), the Phase Tracking Reference Signal (PTRS), the Sounding Reference Signal (SRS), the synchronization signal, the measurement reference signal, or the discovery signal described above), and optionally the signal may be a signal obtained by preprocessing the first sequence.
Operation 330: the network device processes the first sequence. It will be appreciated that the network device may receive the one or more first sequences in operation 320 because of the scenario in which the one or more terminals send the first sequences to the network device. Alternatively, the network device may receive a plurality of first sequences at the same time, where "receiving a plurality of first sequences at the same time" may be understood as receiving a plurality of first sequences at the same time point, may also be understood as receiving a plurality of first sequences in a period of time, or may be understood as receiving a plurality of first sequences in the same sequence processing cycle.
The embodiments of the present application may have a variety of different understandings for processing the first sequence.
Processing the first sequence may be understood as the network device receiving the first sequence.
Processing the first sequence may also be understood as the network device receiving the first sequence and performing a cross-correlation operation (e.g., convolution in the time domain or dot multiplication in the frequency domain) on the first sequence using each second sequence in the set of second sequences to obtain a cross-correlation sequence corresponding to each second sequence in the set of second sequences.
Processing the first sequence may also be understood as receiving the first sequence using an algorithm (e.g., a compressed sensing algorithm), or obtaining relevant parameter information (e.g., the first sequence numbering described above) for the first sequence using an algorithm (e.g., a compressed sensing algorithm).
The network device processing the first sequence may also be understood as the network device communicating with the terminal based on one or more of the first sequences described above. For example, if the first sequence is a sequence of preamble signals, the network device may transmit an access response (may also be referred to as a random access response) to the terminal based on the sequence of preamble signals. For another example, if the first sequence is a DMRS sequence, the network device may demodulate data from the terminal according to the DMRS sequence. It is to be understood that the present application is not limited to the particular form in which the network device communicates with the terminal based on the first sequence.
By the method, the plurality of second sequences are selected according to the corresponding relation between the plurality of candidate first sequences and the plurality of candidate second sequences to generate or calculate the first sequences, wherein the candidate first sequences and the candidate second sequences meet the corresponding conditions, and the capacity of the sequences corresponding to the terminal signals is increased, so that the capacity of the sequences corresponding to the terminal signals can be expanded in limited physical resources, and the requirements of a large number of terminals for accessing a network or transmitting signals are met. In addition, because the first sequence and the second sequence in the method have low cross-correlation characteristics, the capacity of the sequence corresponding to the terminal signal can be expanded, and meanwhile, the sequence corresponding to the terminal signal can be ensured to have good detection performance.
In operation 310, the terminal may obtain the first sequence in a number of different ways.
In a possible implementation of obtaining the first sequence, the first sequence { x (n) } is predefined, and the terminal may obtain the predefined first sequence. For example, the elements in the first sequence (e.g., values of the elements in the first sequence) may be pre-stored in a corresponding device (e.g., a memory, a cache, a storage medium, or other devices capable of storing data), and the terminal reads the elements in the first sequence from the device, so as to obtain the first sequence.
In another possible implementation of obtaining the first sequence, the first sequence may be configured for the terminal by the network device. For example, the first sequence is configured by the network device for the terminal through higher layer signaling (e.g., RRC signaling or Media Access Control (MAC) Control Element (CE)), and the terminal can obtain the first sequence by receiving the higher layer signaling.
In yet another possible implementation of obtaining the first sequence described above, the method shown in fig. 3 may further include an optional operation 302: the terminal obtains d second sequences, and the terminal generates or calculates the first sequence according to the d second sequences.
The terminal may obtain the d second sequences in a variety of different manners. It is easy to understand that the terminal may also generate or calculate the first sequence according to the d second sequences in a plurality of different manners, and specific implementation manners may refer to subsequent descriptions and are not described herein again.
In the embodiments of the present application, there are various different understandings that "the first sequence is related to d second sequences". For example, "a first sequence is related to d second sequences" may be understood as that the first sequence corresponds to the d second sequences, that is, there is a correspondence between the first sequence and the d second sequences. The d second sequences are included in the M candidate second sequences, the first sequence is included in the K candidate first sequences, d is an integer greater than 1, M is an integer greater than or equal to d, and K is an integer greater than M. Optionally, the K candidate first sequences are included in the first sequence set. Optionally, the M candidate second sequences are included in the second sequence set.
The above "there is a correspondence between the first sequence and the d second sequences" may also be understood as that there is a correspondence between the K candidate first sequences and the M candidate second sequences, that is, one candidate first sequence in the K candidate first sequences corresponds to d candidate second sequences in the M candidate second sequences, that is, one candidate first sequence corresponds to d candidate second sequences. Wherein the K candidate first sequences and the M candidate second sequences satisfy a first condition described below:
the first condition is that: any s candidate first sequences in the K candidate first sequences correspond to d × s candidate second sequences, at least d × (1-epsilon) × s candidate second sequences different from each other exist in the d × s candidate second sequences, epsilon is a real number larger than 0 and smaller than 1, and s is an integer larger than 1 and smaller than K. It is to be understood that this first condition may also be expressed as the (s; d; epsilon) -expander criterion for convenience of description.
Optionally, the first sequence is one of the following: a preamble sequence, a DMRS sequence, a PTRS sequence, an SRS sequence, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. The signal may be a signal transmitted by a terminal to a network device, or may be a signal transmitted by one terminal to one or more other terminals.
Alternatively, the second sequence may be referred to as a base sequence, and the second sequence set may be referred to as a base sequence set. Optionally, the second sequence is a Zadoff-Chu (ZC) sequence or a sequence obtained by performing a first process on the ZC sequence, where the first process includes Discrete Fourier Transform (DFT) and/or Cyclic Shift (CS). Alternatively, the second sequence may be a pseudo-random noise (PN) sequence or an m-sequence.
In operation 302, the terminal may obtain the d second sequences in a plurality of different manners.
In one possible implementation of obtaining the d second sequences, the d second sequences are predefined, and the terminal may obtain the predefined d second sequences. For example, the d second sequences may be pre-stored in a corresponding device (e.g., a memory, a buffer, a storage medium, or other devices capable of storing data), and the terminal reads the d second sequences from the device to obtain the d second sequences.
In another possible implementation of obtaining the d second sequences, the method shown in fig. 3 may further include an optional operation 301: and the network equipment sends configuration information to the terminal, the configuration information configures the d second sequences, and the terminal receives the configuration information and obtains the d second sequences according to the configuration information. Optionally, the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.
In yet another possible implementation manner of obtaining the d second sequences, the terminal obtains a correspondence between the K candidate first sequences and the M candidate second sequences (which may also be understood as a correspondence between one (or any one) candidate first sequence of the K candidate first sequences and d candidate second sequences of the M candidate second sequences), and the terminal obtains the d second sequences according to the correspondence. For example, the terminal may obtain the d second sequences according to the identification information (such as a number or an index) of the first sequence and the corresponding relationship. It will be appreciated that the K candidate first sequences and the M candidate second sequences satisfy the aforementioned first condition.
In operation 302, the terminal may obtain the correspondence between the K candidate first sequences and the M candidate second sequences in various manners, and it may be understood that the terminal may obtain the correspondence between each candidate first sequence in the K candidate first sequences and d candidate second sequences in the M candidate second sequences, or the terminal may also obtain the correspondence between each candidate first sequence in a part of the candidate first sequences in the K candidate first sequences and d candidate second sequences in the M candidate second sequences.
In a possible implementation manner of obtaining the correspondence between the K candidate first sequences and the M candidate second sequences, the correspondence is predefined, and the terminal may obtain the predefined correspondence. For example, the corresponding relationship may be pre-stored in a corresponding device (for example, a memory, a cache, a storage medium, or another device capable of storing data), and the terminal reads the corresponding relationship from the device, so as to obtain the corresponding relationship.
In another possible implementation manner of obtaining the correspondence between the K candidate first sequences and the M candidate second sequences, the method shown in fig. 3 may further include an optional operation 301: the network equipment sends configuration information to the terminal, the configuration information configures the corresponding relation, and the terminal receives the configuration information and obtains the corresponding relation according to the configuration information. Optionally, the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.
It is understood that there are many different implementations of this correspondence. For example, the correspondence may be implemented in the form of a table, a function, or other data structures, for example, arrays, queues, containers, stacks, linear tables, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables.
For example, the correspondence between K candidate first sequences and M candidate second sequences may be shown in table 1.
TABLE 1
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | … | k | … | K-1 |
| m 0,1 | m 1,1 | m 2,1 | m 3,1 | m 4,1 | m 5,1 | m 6,1 | m 7,1 | … | m k,1 | … | m K-1,1 |
| m 0,2 | m 1,2 | m 2,2 | m 3,2 | m 4,2 | m 5,2 | m 6,2 | m 7,2 | … | m k,2 | … | m K-1,2 |
| … | … | … | … | … | … | … | … | … | … | … | … |
| m 0,d | m 1,d | m 2,d | m 3,d | m 4,d | m 5,d | m 6,d | m 7,d | … | m k,d | … | m K-1,d |
In Table 1, the first sequence { x ] is a candidate k The number of (N), N =0,1, \ 8230;, N-1} is represented by k, k being greater thanAn integer equal to 0 and less than K, the candidate first sequence with the number of K corresponds to d candidate second sequences, and the numbers of the d candidate second sequences are m respectively k,1 ,m k,2 ,…,m k,d . As shown in table 1, the content corresponding to the first row in table 1 is the number K of the K candidate first sequences, the content corresponding to the 2 nd to d +1 th rows in table 1 is the number of the candidate second sequences, and the content corresponding to the K +1 th column in table 1 is: d candidate second sequences corresponding to the candidate first sequence with the number of k, wherein the numbers of the d candidate second sequences are m respectively k,1 ，m k,2 …m k,d . Understandably, the number m k,l Is the second sequence candidate of
m k,l Is an integer of 0 to less than M, and l is an integer of d or less.
Exemplarily, taking K =640, M =64, and d =2 as an example, the correspondence between the K candidate first sequences and the M candidate second sequences may be shown in table 2.
TABLE 2
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | … | 639 |
| 9 | 14 | 14 | 40 | 12 | 47 | 52 | 22 | 19 | … | 17 |
| 31 | 46 | 62 | 61 | 58 | 48 | 59 | 55 | 57 | … | 53 |
The first row of table 2 corresponds to a candidate first sequence number or index k (k ranges from 0 to 639 for exemplary purposes only), and the second row and the third row of table 2 correspond to a candidate second sequence number or index kNumbering of sequences (m) k,1 And m k,2 Where the value of k corresponds to the index k) of the candidate first sequence. For example, the candidate first sequence with number k of 1 corresponds to number 14 (m) 1,1 = 14) and number 46 (m) 1,2 = 46). The candidate first sequence with number k of 2 corresponds to number 14 (m) 2,1 = 14) and number 62 (m) 2,2 = 62). Table 2 is merely an exemplary illustration of one possible expression of the above correspondence, and the embodiment of the present application is not limited to adopt only the correspondence shown in table 2.
Alternatively, the correspondence relationship may also be realized in the form of a function that satisfies the aforementioned first condition. Exemplarily, taking the value of d as 2 as an example, that is, one candidate first sequence corresponds to 2 candidate second sequences, and the function f is used to determine the second sequence 1 (k) And f 2 (k) Resulting in the numbers or indices of the two candidate second sequences. K in the function is the number or index of the candidate first sequence, taking the value of k as 1 (corresponding to the candidate first sequence with number 1) as an example, and the numbers of the two corresponding candidate second sequences are 14 (f) 1 (k) = 14) and 46 (f) 2 (k) = 46). The implementation of obtaining d second sequences by means of a function is more simplified. It should be noted that the present application is not limited to other functions that can implement the above correspondence relationship or other implementation manners of the functions.
Illustratively, the embodiments of the present application propose several possible implementation manners for calculating, through a function, a correspondence between a candidate first sequence with a number or index of k and M candidate second sequences.
In one possible implementation, for example, when d =2, the number f of the candidate first sequence with number or index k is 1 (k) With number f of candidate second sequence with number or index k 2 (k) Can be calculated by the following function:
f 1 (k)＝q+(p-1)·2 x ，
wherein the content of the first and second substances,
z＝k+1-M 0 ·(2 x-1 +y-2)；/>
q＝z-(p-1)·2 x-1 ；
M 0 half of the number M of candidate second sequences comprised in the second set of sequences,
is a vector +>
Represents->
Q (q =1,2,3, \ 8230; 2) x-1 ) And (4) each element. />
By>
Is obtained by element replacement and is selected>
The s1 th element in (a) is->
S2 th element of (1) =2, s2 = s2+ T (i) -2 · ((s 2-1) mod T (i) +1, T (i) =2 ii+1 And ii is the number of prime factors 2 obtained by factoring i. In particular, is>
As will be readily appreciated, the present invention,the implementation mode exemplarily shows that 1 (k) And f 2 (k) The calculation method of (2) is not limited, and other functions or other implementation methods of the functions can implement the correspondence relationship. In this implementation manner, d =2 is taken as an example, d may also take other integer values greater than 1 and smaller than M, and the embodiment of the present application is not limited.
In yet another possible implementation, for example, when d =2, the number f of the candidate first sequence with the number or index k is 1 (k) With number f of candidate second sequence with number or index k 2 (k) The following function can be used for calculation:
f 1 (k)＝q+p·2 x+1 ，
wherein the content of the first and second substances,
z＝k-M 0 ·(2 x +y-1)；/>
q＝z-p·2 x ；
M 0 half of the number M of candidate second sequences comprised in the second set of sequences,
is a vector, is>
Represents->
Q (q =0,1,2, \ 8230; 2) x -1) elements. />
By>
Is obtained by element replacement, is>
The s1 th element in (a) is->
S2 th element of (a), s1= s2+ T (i) -2 · (s 2 mod T (i)) -1,t (i) =2, ii+1 and ii is the number of prime factors 2 obtained by factoring i. In particular, is>
It is easily understood that d =2 is taken as an example in this implementation manner, d may also be another integer value greater than 1 and smaller than M, and the embodiment of the present application is not limited.
In operation 302, the terminal may obtain the d second sequences according to the corresponding relationship in various ways.
In a possible implementation manner of obtaining the d second sequences according to the correspondence, the terminal randomly selects a number or index k, and obtains the numbers or indexes of the d second sequences corresponding to the first sequence with the number or index k according to the correspondence. D second sequences are obtained from the M candidate second sequences according to the numbers or indexes of the d second sequences.
Exemplarily, the terminal randomly selects one number k =1, and obtains the numbers or indexes of d =2 second sequences corresponding to the first sequence with the number or index k =1 according to the correspondence, wherein the numbers or indexes are m respectively 1,1 =14 and m 1,2 =46, the terminal obtains two second sequences numbered 14 and 46 from the M candidate second sequences.
In another possible implementation manner of obtaining the d second sequences according to the correspondence relationship, the number or index k of the first sequence may be configured by the network device for the terminal. For example, the number or index k of the first sequence is configured by the network device through a higher layer signaling (for example, RRC signaling or MAC CE) for the terminal, and the terminal can obtain the number or index k of the first sequence by receiving the higher layer signaling. And the terminal obtains the numbers or indexes of d second sequences corresponding to the first sequence with the number or index of k according to the corresponding relation, and obtains d second sequences from M candidate second sequences according to the numbers or indexes of the d second sequences.
In operation 310, the first sequence may be generated or calculated from the d second sequences in a variety of different ways.
In a possible implementation manner of generating or calculating the first sequence according to the d second sequences, the terminal obtains the first sequence according to the sum of the d second sequences.
For example, one possible way of summing d second sequences to obtain the first sequence in the embodiments of the present application can be shown as follows. D second sequences corresponding to the first sequence with the number or index of k acquired by the terminal are respectively
(can be abbreviated as:
the first sequence { x with number or index k can be obtained by summing k (N), N =0,1, \8230;, N-1}, (abbreviated as: { x k (n)})：
Wherein, the first and the second end of the pipe are connected with each other,
is numbered M in the M candidate second sequences k,l Candidate second sequence of (1), m k,l Is an integer of 0 or more and M-1 or less, l is an integer of less than d, and b is an integer of more than 0.
For example, d =2 second sequences corresponding to the first sequence with the terminal acquisition number or index k =1 are { s } s, respectively 14 (n) } and { s } 46 (n) }, canTo obtain a first sequence { x } numbered or indexed by k =1 by the following addition 1 (n)}：
In another possible implementation manner of generating or calculating the first sequence according to the d second sequences, the d second sequences corresponding to the first sequence with the number or index k obtained by the terminal are respectively
The first sequence { x } numbered or indexed by k may be obtained by the following calculation 1 (n)}：
Wherein b and c are each an integer greater than 0.
In another possible implementation manner of generating or calculating the first sequence according to the d second sequences, the d second sequences corresponding to the first sequence with the number or index k acquired by the terminal are respectively
The first sequence { x } numbered or indexed by k may be obtained by the following calculation 1 (n)}：
Wherein w k,1 ,w k,2 ,…,w k,d Complex numbers are to be understood as the weighting parameters when generating the first sequence.It should be understood that the calculation method in this embodiment is only an example, and the present application does not limit other possible calculation methods.
In one possible implementation of operation 320, the terminal transmits the first sequence on different time domain resources, in other words, the terminal transmits one part of the first sequence on one part of the time domain resources and transmits another part of the first sequence on another part of the time domain resources. In the embodiment of the present application, the first sequence { x } is transmitted on an Orthogonal Frequency Division Multiplexing (OFDM) symbol (OS) k (n) for example, the first sequence is sent to the network device on different time domain resources, but the application is not limited to the type of the time domain resource, for example, the time domain resource may also be one or more time slots, one or more subframes, or one or more radio frames.
First sequence { x k (n) and d second sequences
Correspondingly, for example, the d second sequences may be obtained from the M candidate second sequences according to the above correspondence relationship.
The first sequence is transmitted on a different OS, i.e. a part of the first sequence is transmitted on one OS and the other part of the first sequence is transmitted on the other OS. For example, a first sequence is transmitted over T (T is an integer greater than 1) OSs, the first OS transmitting { x } k1 (n) }, second OS transmission { x } k2 (n) }, the Tth OS transmits { x } kT (n) }, in which { x } k1 (n)}，{x k2 (n)},…,{x kT (n) constitutes said first sequence { x } k (n) }. It is understood that a portion of the first sequence transmitted on the first OS { x } k1 (n) may be formed from the first sequence { x } k (n) are generated or calculated for ones of the d second sequences. Exemplary, { x } k1 (n) } one possible generation or calculation method is:
wherein b is an integer greater than 0.
The network device receives the various parts of the first sequence ({ x) over the T OSs k1 (n)}，{x k2 (n)},…,{x kT (n), using any one of the M candidate second sequences, and performing cross-correlation operation (for example, performing convolution in a time domain or performing dot multiplication in a frequency domain) on the part of the first sequence on the OS corresponding to the candidate second sequence to obtain a cross-correlation sequence corresponding to any one of the M candidate second sequences. The received first sequence number may then be obtained using an algorithm, such as a compressed sensing algorithm.
Exemplarily, a first sequence { x, numbered k =1 1 (n) corresponds to d =4 second sequences
Selecting to transmit the first sequence { x } over T =2 OSs 1 (n) }. Transmitting { x over a first OS 11 (n), transmitting { x } on the second OS 12 (n) }, it being understood that { x } 11 (n) } and { x 12 (n) are the first sequence { x, respectively 1 (n) and { x) } a part of 11 (n) } and { x } 12 (n) constitutes said first sequence { x } 1 (n)}。
Exemplary, { x } 11 (n) } and { x } 12 (n) } satisfies:
it is to be understood that, the time domain resources for transmitting the first sequence on the plurality of time domain resources, i.e. for transmitting the respective portions of the first sequence, are not identical. The number d of the second sequences included in the first sequence and the number of the time domain resources used for transmitting the first sequence are not limited in the embodiments of the present application.
In one possible implementation of operation 320, the terminal transmits the first sequence on a different physical resource (e.g., one or more of a time domain resource, a frequency resource, or a code domain resource). This implementation is similar to the above-described terminal sending the first sequence on different time domain resources, and is not described here again.
In various embodiments of obtaining the first sequence, the values of K and M may be related to the signal type corresponding to the first sequence.
In embodiments where the first sequence is a preamble, M may be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, k may be 640, 512, 320, 256, 160, or 128.
In embodiments where the first sequence is a DMRS sequence, M may take on a value of 6, 8, 12, 16, 18, 24, or 32, k may take on a value of 24, 32, 48, 64, 96, or 128.
Optional operation 301 may be included in the method shown in fig. 3, that is, the network device sends configuration information to the terminal, and the terminal obtains the configuration information.
The terminal may obtain relevant parameters of the first sequence through the configuration information, and the parameters may include one or more of the following: the first sequence, d second sequences, candidate first sequences, a parameter d, the number K of candidate first sequences, the number M of candidate second sequences, the number K of first sequences, the number of d second sequences, and a parameter epsilon.
Optionally, the configuration information is carried by one or more of: system information, RRC, MAC CE, or control channel. It can be understood that, in the embodiment of the present application, the number of the configuration information in operation 301 is not limited, in other words, the configuration information in operation 301 may be one piece of configuration information, or may be multiple pieces of configuration information.
By configuring the parameters related to the first sequence by the above-mentioned configuration method, the interference between the devices can be reduced by configuring the parameters enabling different devices to use different first sequences.
In another embodiment of the present application, a method for obtaining the correspondence between M candidate second sequences and K candidate first sequences under the condition that the M candidate second sequences are known is described, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first condition.
The correspondence between the M candidate second sequences and the K candidate first sequences includes a correspondence between one candidate first sequence of the K candidate first sequences and d candidate second sequences of the M candidate second sequences. For convenience of description, the correspondence relationship between one candidate first sequence and d candidate second sequences is referred to as a set of correspondence relationships. For example, a set of correspondences may be expressed in which the candidate first sequence numbered k corresponds to the number of the d candidate second sequences, e.g., see table 1 or table 2.
The embodiment of the present application mainly introduces how to generate the K-group correspondence, that is, how to obtain the correspondence between the K candidate first sequences and the M candidate second sequences. Fig. 4A is a schematic flowchart of a process for obtaining a correspondence between a candidate second sequence and a candidate first sequence in this application embodiment, and a specific description will be given below, with reference to fig. 4A in this application embodiment, how to generate the above correspondence from M candidate second sequences and satisfy the above first condition. It can be understood that, the method, the terminal and the network side described in this embodiment may be implemented, and in this embodiment, the terminal is taken as an example for description, and the method illustrated in fig. 4A includes:
operation 410: the terminal determines parameters of the candidate first sequence and the candidate second sequence. The parameters include: the number K of sets of correspondence relationships that need to be generated (which may also be understood as the number of candidate first sequences), the number M of candidate second sequences, the number d of candidate second sequences corresponding to one candidate first sequence, a parameter s, and a probability P. Optionally, the parameters may be predefined, or may be configured for the terminal by the network device.
ε is initialized to 0, and the number of sets k of generated correspondences is initialized to 0. And for the generated group number k of the corresponding relations, the k candidate first sequences and the M candidate second sequences in the corresponding relations of the k groups have the aforementioned first condition.
In operation 420: it is determined whether K has reached K, if not operation 430 is performed, and if so, the flow ends.
Operation 430: the size S of the unused candidate correspondence set is reset according to the value of k (for example:
). The set of unused candidate correspondences is the number k of groups excluding generated correspondences in the set of all possible correspondences. Illustratively, the candidate correspondence set is composed of all possible permutation combinations of d candidate sequences arbitrarily chosen from the M candidate second sequences (all possible permutation combinations are co ÷ based on>
One), the one "permutation and combination" is recorded as one candidate correspondence. Exemplary, a @>
Represents the number of all possible permutation combinations of d arbitrarily selected from M. Unused candidate correspondences are limited, e.g. for the case of M =100, d =2, the candidate correspondences are always jointly = £ h>
When k =50, that is, when 50 correspondences satisfying the first condition have been generated, 4900 unused candidate correspondences remain, and the size of the unused candidate relationship set ≧ based on the number of candidates remaining>
It is easy to understand that one correspondence is generated and the unused set of candidate correspondences is reduced in size by 1. The embodiments of the present application do not limit other ways of calculating S.
Operation 440: selecting one candidate corresponding relation from the S unused candidate corresponding relation sets, wherein the corresponding S = S-1.
It is understood that a candidate corresponding relationship is selected in operation 440, and in the subsequent operation 450, it is determined whether k +1 sequences (k candidate first sequences and a sequence generated according to the candidate corresponding relationship selected in operation 440) and M candidate second sequences satisfy the aforementioned first condition, and if so, the number of candidate first sequences is updated to k +1.
Operation 450: and judging whether the first condition is met. The number of sets of correspondences that have been generated is min (0, k), that is, min (0, k) (k >0 time min (0, k) = k) candidate first sequences and M candidate second sequences satisfy the aforementioned first condition.
Using the candidate correspondence relationship, the candidate first sequence with the number k corresponds min (s, k + 1) candidate first sequences in the k +1 candidate first sequences to d × min (s, k + 1) candidate second sequences, and it is determined whether or not a probability that at least d × (1- ∈) × min (s, k + 1) candidate second sequences exist in the d × min (s, k + 1) candidate second sequences is equal to or greater than P. If the probability satisfies P or more, k = k +1, and the process proceeds to operation 420. If the probability does not satisfy P or greater, operation 460 is carried over.
Operation 460: it is determined whether the size S of the unused candidate set of correspondences is greater than 0, and if so, operation 440 is performed. If not greater than 0, ε is set to ε + 1/(dxs) and operation 430 proceeds. Where S is not greater than 0 in operation 460, it may be understood that the unused candidate correspondences have been traversed and none satisfy the aforementioned first condition.
It is easily understood that the terminal may obtain the correspondence between the M candidate second sequences and the K candidate first sequences according to the method described in the method 400, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first condition. It is understood that the network device may also obtain the correspondence between the M candidate second sequences and the K candidate first sequences according to the method described in the method 400, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first condition.
Fig. 4B is a schematic flowchart of another process for obtaining a correspondence between a candidate second sequence and a candidate first sequence in this application embodiment, and how to generate the above correspondence according to M candidate second sequences and satisfy the above first condition will be specifically described below with reference to fig. 4B in this application embodiment. It can be understood that, the method, the terminal and the network side described in this embodiment can be implemented, and in this embodiment, the terminal is taken as an execution subject for example, and the method illustrated in fig. 4B includes:
operation 810: parameters of the first sequence and the second sequence are determined. The parameters include: the first sequence set comprises the number K of candidate first sequences, the second sequence set comprises the number M of candidate second sequences, and the number d of candidate second sequences corresponding to the candidate first sequences. Optionally, the parameter may be predefined or may be specified, for example, by the configuration information of operation 310 in fig. 3.
The maximum allowable gap g is initialized to 1 and the number k of determined candidate first sequences is initialized to 0.
Operation 820: it is determined whether K has reached K, if not operation 830 is performed, and if so, the flow ends.
Operation 830: resetting the size of unused candidate correspondence sets
And resetting the size of the unused candidate corresponding relation set according to the value of k. The set of unused candidate correspondences comprises correspondences of all possible correspondences that are not used by the determined k first sequences. It should be noted that the unused candidate correspondences are limited, and for example, in the case of M =100, d =2, the candidate correspondences are always jointly = £>
When k =50, that is, when 0 to 49 correspondences satisfying the condition have been used, 4900 unused candidate correspondences remain, and the size of the unused candidate relationship set ÷ is larger than or equal to ÷ smaller than or equal to +>
It is readily understood that each time a candidate correspondence is used, the unused candidate correspondence set size is reduced by 1.
Operation 840: selecting one candidate corresponding relation from S unused candidate corresponding relation sets, wherein the corresponding S = S-1.
Operation 850: it is determined whether the candidate correspondence selected in operation 840 satisfies the condition.
Let the candidate first sequence with the number k use the candidate correspondence to count the total number of times each candidate second sequence is corresponded in the candidate first sequences with the numbers 0 to k. The difference between the maximum value and the minimum value of the total number of times the candidate second sequence is corresponded to is calculated. If the difference is less than or equal to g, k +1, proceeds to operation 820. If the difference is greater than g, then operation 860 is entered.
Operation 860: it is determined whether the size S of the unused candidate set of correspondences is greater than 0, and if so, operation 840 is performed. If not, g is set to g +1 and operation 830 proceeds.
It is easily understood that the terminal may obtain the correspondence between the M candidate second sequences and the K candidate first sequences according to the method described in the method 800, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first condition. It is understood that the network device may also obtain the correspondence between the M candidate second sequences and the K candidate first sequences according to the method described in the method 800, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first condition.
Corresponding to the method provided by the above method embodiment, the embodiment of the present application further provides a corresponding apparatus, which includes a module for executing the above embodiment. The module may be software, hardware, or a combination of software and hardware.
Fig. 5 shows a schematic diagram of a device. The apparatus 500 may be a network device, a terminal device, a chip system, or a processor that supports the network device to implement the method, or a chip, a chip system, or a processor that supports the terminal device to implement the method. The apparatus may be configured to implement the method described in the method embodiment, and refer to the description in the method embodiment.
The apparatus 500 may comprise one or more processors 501, where the processors 501 may also be referred to as processing units and may implement certain control functions. The processor 501 may be a general purpose processor or a special purpose processor, etc. For example, a baseband processor or a central processor. The baseband processor may be configured to process communication protocols and communication data, and the central processor may be configured to control a communication device (e.g., a base station, a baseband chip, a terminal chip, a DU or CU, etc.), execute a software program, and process data of the software program.
In an alternative design, the processor 501 may also store instructions and/or data 503, and the instructions and/or data 503 may be executed by the processor, so that the apparatus 500 performs the method described in the above method embodiment.
In an alternative design, processor 501 may include a transceiver unit to perform receive and transmit functions. The transceiving unit may be, for example, a transceiving circuit, or an interface circuit. The transmit and receive circuitry, interfaces or interface circuitry used to implement the receive and transmit functions may be separate or integrated. The transceiver circuit, the interface circuit or the interface circuit may be used for reading and writing code/data, or the transceiver circuit, the interface circuit or the interface circuit may be used for transmitting or transferring signals.
In yet another possible design, the apparatus 500 may include circuitry that may implement the functionality of transmitting or receiving or communicating in the foregoing method embodiments.
Optionally, the apparatus 500 may include one or more memories 502, on which instructions 504 may be stored, and the instructions may be executed on the processor, so that the apparatus 500 performs the methods described in the above method embodiments. Optionally, the memory may further store data therein. Optionally, instructions and/or data may also be stored in the processor. The processor and the memory may be provided separately or may be integrated together. For example, the correspondence described in the above method embodiments may be stored in a memory or in a processor.
Optionally, the apparatus 500 may further comprise a transceiver 505 and/or an antenna 506. The processor 501, which may be referred to as a processing unit, controls the apparatus 500. The transceiver 505 may be referred to as a transceiving unit, a transceiver, a transceiving circuit, a transceiving device, or a transceiving module, etc., for implementing transceiving functions.
Optionally, the apparatus 500 in this embodiment of the present application may be used to perform the method described in fig. 3 in this embodiment of the present application.
In a possible design, the apparatus 500 may correspond to the terminal device in the foregoing method embodiment, and may also correspond to a chip, a chip system, or a processor or the like supporting the terminal device to implement the method.
In one possible implementation, the apparatus 500 includes a processor 501 and a transceiver 505. Processor 501 is configured to obtain a first sequence { x (N), N =0,1, \8230;, N-1} (abbreviated: { x (N) }), and a transceiver 505 for outputting the first sequence { x (N) }, wherein the first sequence { x (N) } is associated with d second sequences { { s {(s) } 1 (n),n＝0,1,…,N-1},{s 2 (n),n＝0,1,…,N-1},…,{s d (N), N =0,1, \ 8230;, N-1} } (abbreviated: { { s: { } 1 (n)},{s 2 (n)},…,{s d (n) }). The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is an integer greater than M.
Wherein the K candidate first sequences and the M candidate second sequences satisfy a first condition described below:
the first condition is that: any s candidate first sequences in the K candidate first sequences correspond to d × s candidate second sequences, at least d × (1-epsilon) × s candidate second sequences different from each other exist in the d × s candidate second sequences, epsilon is a real number larger than 0 and smaller than 1, and s is an integer larger than 1 and smaller than K. It is to be understood that this first condition may also be expressed as the (s; d; epsilon) -expander criterion for convenience of description.
The apparatus 500 selects d second sequences according to the correspondence between the K candidate first sequences and the M candidate second sequences to generate or calculate the first sequence, wherein the candidate first sequences and the candidate second sequences satisfy the correspondence condition, and the capacity of the sequence corresponding to the terminal signal is increased, so that the capacity of the sequence corresponding to the terminal signal can be expanded in the limited physical resources, and the requirements of a large number of terminals for accessing the network or transmitting signals are met. In addition, because the first sequence and the second sequence in the method have low cross-correlation characteristics, the capacity of the sequence corresponding to the terminal signal can be expanded, and meanwhile, the sequence corresponding to the terminal signal can be ensured to have good detection performance.
In some possible embodiments of the apparatus 500, the correspondence may be implemented in the form of a table, a function, or other data structures, for example, an array, a queue, a container, a stack, a linear table, a pointer, a linked list, a tree, a graph, a structure, a class, a heap, a hash table, or a hash table.
In some possible embodiments of the apparatus 500 described above, the transceiver 505 is further configured to receive configuration information configuring the d second sequences { { s { { S { (S) } 1 (n)},{s 2 (n)},…,{s d (n) }, or the configuration information configures the first sequence { x (n) } and the d second sequences { { s) } 1 (n)},{s 2 (n)},…,{s d (n) }. Optionally, the configuration information is predefined or carried by one or more of: system information, RRC signaling, MAC CE, or control channel.
In some possible embodiments of the apparatus 500, the processor 501 is further configured to obtain d second sequences { { s } according to the configuration information received by the transceiver 505 1 (n)},{s 2 (n)},…,{s d (n)}}。
In some possible embodiments of the apparatus 500, the transceiver 505 and/or the processor 501 are further configured to obtain the K candidate first sequencesThe processor 501 is further configured to obtain the d second sequences { { s {(s) }according to the corresponding relationship between the column and the M candidate second sequences 1 (n)},{s 2 (n)},…,{s d (n)}}。
In some possible embodiments of the apparatus 500, the processor 501 is further configured to { { s } according to the d second sequences 1 (n)},{s 2 (n)},…,{s d (n) generating or calculating the first sequence { x (n) }.
In some possible embodiments of the apparatus 500, the first sequence is one of the following: a preamble sequence, a DMRS sequence, a PTRS sequence, an SRS sequence, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. Optionally, when the first sequence is a sequence of a preamble, a value of M may be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4,k may be 640, 512, 320, 256, 160, or 128, but the application does not limit other values of N and M. Optionally, when the first sequence is a sequence of a DMRS, a value of M may be 6, 8, 12, 16, 18, 24, or 32, a value of k may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.
In some possible embodiments of the apparatus 500, the second sequence is a ZC sequence or a sequence obtained by subjecting a ZC sequence to a first process, where the first process includes one or more of the following: discrete fourier transform, DFT, or cyclic shift.
Optionally, the apparatus 500 in this embodiment of the present application may be used to perform the method described in fig. 4A in this embodiment of the present application.
In one possible implementation, the apparatus 500 includes a processor 501. The processor 501 is further configured to determine parameters of the candidate first sequence and the candidate second sequence. The parameters include: the number K of sets of correspondence relationships that need to be generated (which may also be understood as the number of candidate first sequences), the number M of candidate second sequences, the number d of candidate second sequences corresponding to one candidate first sequence, a parameter s, and a probability P. Optionally, the apparatus 500 may comprise a memory 502, and the above parameters may be predefined in the memory 502. Or, alternatively, apparatus 500 may include transceiver 505, and the parameters may be received by transceiver 505 from a network device.
Optionally, the processor 501 is further configured to initialize epsilon to 0, and initialize the number k of generated sets of the corresponding relationship to 0.
Optionally, processor 501 is further configured to determine whether K has reached K, and if not perform operation 430, end the process if it has.
Optionally, the processor 501 is further configured to reset the size S of the unused candidate correspondence set according to the value of k
Optionally, the processor 501 is further configured to select a candidate corresponding relationship from the S unused candidate corresponding relationship sets, where the corresponding S = S-1.
Optionally, the processor 501 is further configured to determine whether the aforementioned first condition is satisfied. . If the probability satisfies P or more, k = k +1, and the process proceeds to operation 420. If the probability does not satisfy P or more, operation 460 is entered.
Optionally, the processor 501 is further configured to determine whether the size S of the unused candidate correspondence set is greater than 0. If greater than 0, proceed to operation 440. If not greater than 0, then ε is set to ε + 1/(d × s) and operation 430 proceeds.
Optionally, the apparatus 500 in this embodiment of the present application may be used to perform the method described in fig. 4B in this embodiment of the present application.
In one possible implementation, the apparatus 500 includes a processor 501. The processor 501 is further configured to determine parameters of the candidate first sequence and the candidate second sequence. The parameters include: the number of sets K of correspondence relations (which may also be understood as the number of candidate first sequences) that need to be generated, the number M of candidate second sequences, and the number d of candidate second sequences corresponding to one candidate first sequence. Optionally, the apparatus 500 may comprise a memory 502, and the above parameters may be predefined in the memory 502. Or, alternatively, apparatus 500 may include transceiver 505, and the parameters may be received by transceiver 505 from a network device.
Optionally, the processor 501 is further configured to initialize g to 1, and initialize the number k of the generated sets of the corresponding relationship to 0.
Optionally, processor 501 is further configured to determine whether K has reached K, and if operation 830 is not performed, end the process if it has.
Optionally, the processor 501 is further configured to reset the size S of the unused candidate correspondence set according to the value of k
Optionally, the processor 501 is further configured to select a candidate corresponding relationship from S unused candidate corresponding relationship sets, where S = S-1 correspondingly.
Optionally, the processor 501 is further configured to determine whether the aforementioned first condition is satisfied. The difference between the maximum value and the minimum value of the total number of times the candidate second sequence is corresponded to is calculated. If the difference is less than or equal to g, k = k +1, and operation 820 is continued. If the difference is greater than g, then operation 860 is entered.
Optionally, the processor 501 is further configured to determine whether the size S of the unused candidate correspondence set is greater than 0. If greater than 0, operation 840 is entered. If not, g is set to g +1 and operation 830 is entered.
In one possible design, the apparatus 500 may correspond to the network device in the above method embodiment, and may also correspond to a component of the network device (e.g., an integrated circuit, a chip, a processor, or the like).
In one possible implementation, the apparatus 500 includes a transceiver 505 and a processor 501. The transceiver 505 is configured to receive a first sequence { x (N), N =0,1, \ 8230;, N-1}, (abbreviated: { x (N) }), and a processor 501 for processing the first sequence { x (N) }, wherein the first sequence { x (N) } is associated with d second sequences { { s {(s) } 1 (n),n＝0,1,…,N-1},{s 2 (n),n＝0,1,…,N-1},…,{s d (N), N =0,1, \ 8230;, N-1} } (abbreviated: { { s: { } 1 (n)},{s 2 (n)},…,{s d (n) }). The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is an integer greater than M.
Wherein the K candidate first sequences and the M candidate second sequences satisfy a first condition described below:
the first condition is that: any s candidate first sequences in the K candidate first sequences correspond to d x s candidate second sequences, at least d x (1-epsilon) x s candidate second sequences which are different from each other exist in the d x s candidate second sequences, epsilon is a real number which is more than 0 and less than 1, and s is an integer which is more than 1 and less than K. It is to be understood that this first condition may also be expressed as the (s; d; epsilon) -expander criterion for convenience of description.
Through the apparatus 500, d second sequences are selected according to the correspondence between the K candidate first sequences and the M candidate second sequences to generate or calculate the first sequences, wherein the candidate first sequences and the candidate second sequences satisfy the correspondence condition, and the capacity of the sequences corresponding to the terminal signals is increased, so that the capacity of the sequences corresponding to the terminal signals can be expanded in limited physical resources, and the requirements of a large number of terminals for accessing the network or transmitting the signals are met. In addition, because the first sequence and the second sequence in the method have low cross-correlation characteristics, the capacity of the sequence corresponding to the terminal signal can be expanded, and meanwhile, the sequence corresponding to the terminal signal can be ensured to have good detection performance.
In some possible embodiments of the apparatus 500, the correspondence may be implemented in the form of a table, a function, or other data structures, for example, an array, a queue, a container, a stack, a linear table, a pointer, a linked list, a tree, a graph, a structure, a class, a heap, a hash table, or a hash table.
In some possible embodiments of the apparatus 500, the transceiver 505 is further configured to send configuration information to the terminal, the configuration information configuring the d second sequences { { s {(s) } 1 (n)},{s 2 (n)},…,{s d (n) }, or the configuration information configures a first sequence { x (n) } and d second sequences { { s) } 1 (n)},{s 2 (n)},…,{s d (n) }. Optionally, the configuration information is predefined or carried by one or more of: system information, RRC signaling, MAC CE, or control channel.
In some possible embodiments of the apparatus 500, the first sequence is one of the following: a preamble sequence, a DMRS sequence, a PTRS sequence, an SRS sequence, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. Optionally, when the first sequence is a preamble sequence, a value of M may be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, k may be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a sequence of DMRS, a value of M may be 6, 8, 12, 16, 18, 24, or 32, and a value of k may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.
In some possible embodiments of the apparatus 500, the second sequence is a ZC sequence or a sequence obtained by subjecting a ZC sequence to a first process, and the first process includes one or more of the following: discrete fourier transform, DFT, or cyclic shift.
By configuring the apparatus 500 to configure the first sequence related parameters to the terminal, interference between devices can be reduced by configuring different devices to use different first sequence parameters.
In one possible design, the apparatus 500 may correspond to the network device in the above method embodiment, and may also correspond to a component (e.g., an integrated circuit, a chip, a processor, or the like) of the network device for executing the method described in fig. 4A or 4B in the embodiment of the present application.
The processors and transceivers described herein may be implemented on Integrated Circuits (ICs), analog ICs, radio Frequency Integrated Circuits (RFICs), mixed signal ICs, application Specific Integrated Circuits (ASICs), printed Circuit Boards (PCBs), electronic devices, and the like. The processor and transceiver may also be fabricated using various IC process technologies, such as Complementary Metal Oxide Semiconductor (CMOS), N-type metal oxide semiconductor (NMOS), P-type metal oxide semiconductor (PMOS), bipolar Junction Transistor (BJT), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), and the like.
The apparatus in the description of the above embodiment may be a network device or a terminal device, but the scope of the apparatus described in the present application is not limited thereto, and the structure of the apparatus may not be limited by fig. 5. The apparatus may be a stand-alone device or may be part of a larger device. For example, the apparatus may be:
(1) A stand-alone integrated circuit IC, or chip, or system-on-chip or subsystem;
(2) Having a set of one or more ICs, which may optionally also include storage means for storing data and/or instructions;
(3) An ASIC, such as a modem (MSM);
(4) A module that may be embedded within other devices;
(5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handsets, mobile units, in-vehicle devices, network devices, cloud devices, artificial intelligence devices, and the like;
(6) Others, and so forth.
Fig. 6 provides a schematic structural diagram of a terminal. The terminal device may be adapted to the scenario shown in fig. 1. For convenience of explanation, fig. 6 shows only main components of the terminal device. As shown in fig. 6, the terminal apparatus 600 includes a processor, a memory, a control circuit, an antenna, and an input-output device. The processor is mainly used for processing communication protocols and communication data, controlling the whole terminal, executing software programs and processing data of the software programs. The memory is used primarily for storing software programs and data. The radio frequency circuit is mainly used for converting baseband signals and radio frequency signals and processing the radio frequency signals. The antenna is mainly used for receiving and transmitting radio frequency signals in the form of electromagnetic waves. Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly used for receiving data input by users and outputting data to the users.
When the terminal device is started, the processor can read the software program in the storage unit, analyze and execute the instruction of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor carries out baseband processing on the data to be sent and then outputs baseband signals to the radio frequency circuit, and the radio frequency circuit processes the baseband signals to obtain radio frequency signals and sends the radio frequency signals to the outside in an electromagnetic wave mode through the antenna. When data is transmitted to the terminal device, the radio frequency circuit receives a radio frequency signal through the antenna, the radio frequency signal is further converted into a baseband signal, the baseband signal is output to the processor, and the processor converts the baseband signal into the data and processes the data.
For ease of illustration, fig. 6 shows only one memory and processor. In an actual terminal device, there may be multiple processors and memories. The memory may also be referred to as a storage medium or a storage device, and the like, which is not limited in this respect in the embodiment of the present invention.
As an alternative implementation manner, the processor may include a baseband processor and a central processing unit, the baseband processor is mainly used for processing the communication protocol and the communication data, and the central processing unit is mainly used for controlling the whole terminal device, executing the software program, and processing the data of the software program. The processor in fig. 6 integrates the functions of the baseband processor and the central processing unit, and those skilled in the art will understand that the baseband processor and the central processing unit may also be independent processors, and are interconnected through a bus or the like. Those skilled in the art will appreciate that the terminal device may include a plurality of baseband processors to accommodate different network formats, the terminal device may include a plurality of central processors to enhance its processing capability, and various components of the terminal device may be connected by various buses. The baseband processor can also be expressed as a baseband processing circuit or a baseband processing chip. The central processing unit can also be expressed as a central processing circuit or a central processing chip. The function of processing the communication protocol and the communication data may be built in the processor, or may be stored in the storage unit in the form of a software program, and the processor executes the software program to realize the baseband processing function.
In one example, the antenna and the control circuit with transceiving functions can be regarded as the transceiving unit 611 of the terminal device 600, and the processor with processing function can be regarded as the processing unit 612 of the terminal device 600. As shown in fig. 6, the terminal apparatus 600 includes a transceiving unit 611 and a processing unit 612. A transceiver unit may also be referred to as a transceiver, a transceiving device, etc. Optionally, a device for implementing the receiving function in the transceiving unit 611 may be regarded as a receiving unit, and a device for implementing the transmitting function in the transceiving unit 611 may be regarded as a transmitting unit, that is, the transceiving unit 611 includes a receiving unit and a transmitting unit. For example, the receiving unit may also be referred to as a receiver, a receiving circuit, etc., and the sending unit may be referred to as a transmitter, a transmitting circuit, etc. Optionally, the receiving unit and the sending unit may be an integrated unit, or may be multiple units independent of each other. The receiving unit and the transmitting unit can be in one geographical position or can be dispersed in a plurality of geographical positions.
As shown in fig. 7, yet another embodiment of the present application provides an apparatus 700. The device may be a terminal or a component of a terminal (e.g., an integrated circuit, a chip, etc.). Alternatively, the apparatus may be a network device or a component of a network device (e.g., an integrated circuit, a chip, etc.). The apparatus may also be another communication module, which is configured to implement the method in the embodiment of the method of the present application. The apparatus 700 may include a processing module 702 (processing unit). Optionally, a transceiver module 701 (transceiver unit) and a storage module 703 (storage unit) may also be included.
In one possible design, one or more of the modules in FIG. 7 may be implemented by one or more processors or by one or more processors and memory; or by one or more processors and transceivers; or by one or more processors, memories, and transceivers, which are not limited in this application. The processor, the memory and the transceiver can be arranged independently or integrated.
The apparatus has a function of implementing the terminal described in the embodiment of the present application, for example, the apparatus includes a module or a unit or means (means) corresponding to the terminal performing the steps related to the terminal described in the embodiment of the present application, and the function or the unit or the means (means) may be implemented by software or hardware, or may be implemented by hardware executing corresponding software, or may be implemented by a combination of software and hardware. Reference may be made in detail to the respective description of the corresponding method embodiments hereinbefore. Or, the apparatus has a function of implementing the network device described in the embodiment of the present application, for example, the apparatus includes a module, a unit, or a means (means) corresponding to the step of executing the network device described in the embodiment of the present application by the network device, and the function, the unit, or the means (means) may be implemented by software, or by hardware executing corresponding software, or by a combination of software and hardware. Reference may further be made in detail to the corresponding description in the corresponding method embodiments hereinbefore described.
Optionally, the apparatus 700 in this embodiment of the present application may be used to perform the method described in fig. 3 in this embodiment of the present application.
In a possible design, the apparatus 700 may correspond to the terminal device in the foregoing method embodiment, for example, the apparatus may be a terminal device, or a chip, a chip system, or a processor supporting the terminal device to implement the foregoing method.
In one possible implementation, the apparatus 700 includes a processing module 702 and a transceiver module 701. The processing module 702 is configured to obtain a first sequence { x (N), N =0,1, \8230;, N-1}, (abbreviated as: { x (N) }), and a transceiver module 701 for outputting the first sequence { x (N) }, wherein the first sequence { x (N) } and d second sequences { { s {(s) } 1 (n),n＝0,1,…,N-1},{s 2 (n),n＝0,1,…,N-1},…,{s d (N), N =0,1, \8230;, N-1} } (abbreviation: { { s: { } s) 1 (n)},{s 2 (n)},…,{s d (n) }). The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is an integer greater than M.
Wherein the K candidate first sequences and the M candidate second sequences satisfy a first condition described below:
the first condition is that: any s candidate first sequences in the K candidate first sequences correspond to d x s candidate second sequences, at least d x (1-epsilon) x s candidate second sequences which are different from each other exist in the d x s candidate second sequences, epsilon is a real number which is more than 0 and less than 1, and s is an integer which is more than 1 and less than K. It is to be understood that this first condition may also be expressed as the (s; d; epsilon) -expander criterion for convenience of description.
The apparatus 700 selects d second sequences according to the correspondence between the K candidate first sequences and the M candidate second sequences to generate or calculate the first sequence, wherein the candidate first sequences and the candidate second sequences satisfy the correspondence condition, and the capacity of the sequence corresponding to the terminal signal is increased, so that the capacity of the sequence corresponding to the terminal signal can be expanded in the limited physical resource, and the requirement of a large number of terminals for accessing the network or transmitting signals is satisfied. In addition, because the first sequence and the second sequence in the method have low cross-correlation characteristics, the capacity of the sequence corresponding to the terminal signal can be expanded, and meanwhile, the sequence corresponding to the terminal signal can be ensured to have good detection performance.
In some possible embodiments of the apparatus 700, the correspondence may be implemented in a form of a table, a form of a function, or other data structures, for example, arrays, queues, containers, stacks, linear tables, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables.
In some possible embodiments of the apparatus 700, the transceiver module 701 is further configured to receive configuration information configuring the d second sequences { { s { (S) } 1 (n)},{s 2 (n)},…,{s d (n) }, or the configuration information configures the first sequence { x (n) } and the d second sequences { { s) } 1 (n)},{s 2 (n)},…,{s d (n) }. Optionally, the configuration information is predefined or carried by one or more of: system information, RRC signaling, MAC CE, or control channel。
In some possible embodiments of the apparatus 700, the processing module 702 is further configured to obtain d second sequences { { s } according to the configuration information received by the transceiver module 701 1 (n)},{s 2 (n)},…,{s d (n)}}。
In some possible embodiments of the apparatus 700, the transceiver module 701 and/or the processing module 702 are further configured to obtain a correspondence relationship between the K candidate first sequences and the M candidate second sequences, and the processing module 702 is further configured to obtain the d second sequences { { s {(s) } according to the correspondence relationship 1 (n)},{s 2 (n)},…,{s d (n)}}。
In some possible embodiments of the apparatus 700 described above, the processing module 702 is further configured to { { s } according to the d second sequences described above 1 (n)},{s 2 (n)},…,{s d (n) generating or calculating the first sequence { x (n) }.
In some possible embodiments of the apparatus 700, the first sequence is one of: a preamble sequence, a DMRS sequence, a PTRS sequence, an SRS sequence, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. Optionally, when the first sequence is a sequence of a preamble, a value of M may be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4,k may be 640, 512, 320, 256, 160, or 128, but the application does not limit other values of N and M. Optionally, when the first sequence is a sequence of DMRS, a value of M may be 6, 8, 12, 16, 18, 24, or 32, and a value of k may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.
In some possible embodiments of the apparatus 700, the second sequence is a ZC sequence or a sequence obtained by performing a first process on the ZC sequence, where the first process includes one or more of the following: discrete fourier transform, DFT, or cyclic shift.
Optionally, the apparatus 700 in this embodiment of the present application may be used to perform the method described in fig. 4A in this embodiment of the present application.
In one possible implementation, the apparatus 700 includes a processing module 702. The processing module 702 is configured to determine parameters of the candidate first sequence and the candidate second sequence. The parameters include: the number K of sets of correspondence relations (which may also be understood as the number of candidate first sequences) to be generated, the number M of candidate second sequences, the number d of candidate second sequences corresponding to one candidate first sequence, a parameter s, and a probability P. Optionally, the apparatus 700 includes a storage module 703, and the parameter may be predefined in the storage module 703. Or, optionally, the apparatus 700 includes the transceiver module 701, and the parameter may be received by the transceiver module 701 from a network device.
Optionally, the processing module 702 is further configured to initialize epsilon to 0, and initialize the number k of the generated sets of the corresponding relationship to 0.
Optionally, the processing module 702 is further configured to determine whether K has reached K, and if not perform operation 430, end the flow if it has.
Optionally, the processing module 702 is further configured to reset the size S of the unused candidate correspondence set according to the value of k
Optionally, the processing module 702 is further configured to select one candidate corresponding relationship from the S unused candidate corresponding relationship sets, where the corresponding S = S-1.
Optionally, the processing module 702 is further configured to determine whether the first condition is satisfied. . If the probability satisfies P or more, k = k +1, and the process proceeds to operation 420. If the probability does not satisfy P or more, operation 460 is entered.
Optionally, the processing module 702 is further configured to determine whether the size S of the unused candidate correspondence set is greater than 0. If greater than 0, proceed to operation 440. If not greater than 0, ε is set to ε + 1/(dxs) and operation 430 proceeds.
Optionally, the apparatus 700 in this embodiment of the present application may be used to perform the method described in fig. 4B in this embodiment of the present application.
In one possible implementation, the apparatus 700 includes a processing module 702. The processing module 702 is configured to determine parameters of the candidate first sequence and the candidate second sequence. The parameters include: the number of sets K of correspondence relations (which may also be understood as the number of candidate first sequences) that need to be generated, the number M of candidate second sequences, and the number d of candidate second sequences corresponding to one candidate first sequence. Optionally, the apparatus 700 includes a storage module 703, and the parameter may be predefined in the storage module 703. Or, optionally, the apparatus 700 includes the transceiver module 701, and the parameter may be received by the transceiver module 701 from the network device.
Optionally, the processing module 702 is further configured to initialize g to 1, and initialize the number k of the generated sets of the corresponding relationship to 0.
Optionally, the processing module 702 is further configured to determine whether K has reached K, and if not perform operation 830, end the flow if it has.
Optionally, the processing module 702 is further configured to reset the size S of the unused candidate correspondence set according to the value of k
Optionally, the processing module 702 is further configured to select one candidate corresponding relationship from the S unused candidate corresponding relationship sets, where the corresponding S = S-1.
Optionally, the processing module 702 is further configured to determine whether the first condition is satisfied. The difference between the maximum value and the minimum value of the total number of times the candidate second sequence is corresponded to is calculated. If the difference is less than or equal to g, k = k +1, and operation 820 is continued. If the difference is greater than g, then operation 860 is entered.
Optionally, the processing module 702 is further configured to determine whether the size S of the unused candidate correspondence set is greater than 0. If greater than 0, operation 840 is entered. If not, g is set to g +1 and operation 830 proceeds.
In one possible design, the apparatus 700 may correspond to the network device in the above method embodiment, and may also correspond to a component of the network device (e.g., an integrated circuit, a chip, a processor, or the like).
In one possible implementation, the apparatus 700 includes a transceiver module 701 and a processing module 702. Transceiver module 701 is further configured to receive a first sequence { x (N), N =0,1, \ 8230;, N-1}, (abbreviated as: { x (N) }), and a processing module 702 for processing the first sequence { x (N) }, wherein the first sequence { x (N) } is associated with d second sequences { (c)s 1 (n),n＝0,1,…,N-1},{s 2 (n),n＝0,1,…,N-1},…,{s d (N), N =0,1, \ 8230;, N-1} } (abbreviated: { { s: { } 1 (n)},{s 2 (n)},…,{s d (n) }). The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is an integer greater than M.
Wherein the K candidate first sequences and the M candidate second sequences satisfy a first condition described below:
a first condition: any s candidate first sequences in the K candidate first sequences correspond to d × s candidate second sequences, at least d × (1-epsilon) × s candidate second sequences different from each other exist in the d × s candidate second sequences, epsilon is a real number larger than 0 and smaller than 1, and s is an integer larger than 1 and smaller than K. It is to be understood that this first condition may also be expressed as the (s; d; epsilon) -expander criterion for convenience of description.
Through the apparatus 700, d second sequences are selected according to the correspondence between the K candidate first sequences and the M candidate second sequences to generate or calculate the first sequences, wherein the candidate first sequences and the candidate second sequences satisfy the correspondence condition, and the capacity of the sequences corresponding to the terminal signals is increased, so that the capacity of the sequences corresponding to the terminal signals can be expanded in limited physical resources, and the requirements of a large number of terminals for accessing the network or transmitting the signals are met. In addition, because the first sequence and the second sequence in the method have low cross-correlation characteristics, the capacity of the sequence corresponding to the terminal signal can be expanded, and meanwhile, the sequence corresponding to the terminal signal can be ensured to have good detection performance.
In some possible embodiments of the apparatus 700, the correspondence may be implemented in the form of a table, a function, or other data structures, for example, an array, a queue, a container, a stack, a linear table, a pointer, a linked list, a tree, a graph, a structure, a class, a heap, a hash table, or a hash table.
In some possible embodiments of the above-described apparatus 700The transceiver module 701 is further configured to send configuration information to the terminal, where the configuration information configures the d second sequences { { s {(s) } according to the configuration information 1 (n)},{s 2 (n)},…,{s d (n) }, or the configuration information configures the first sequence { x (n) } and the d second sequences { { s) } 1 (n)},{s 2 (n)},…,{s d (n) }. Optionally, the configuration information is predefined or carried by one or more of: system information, RRC signaling, MAC CE, or control channel.
In some possible embodiments of the apparatus 700, the first sequence is one of: a preamble sequence, a DMRS sequence, a PTRS sequence, an SRS sequence, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. Optionally, when the first sequence is a preamble sequence, a value of M may be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, k may be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a sequence of DMRS, a value of M may be 6, 8, 12, 16, 18, 24, or 32, and a value of k may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.
In some possible embodiments of the apparatus 700, the second sequence is a ZC sequence or a sequence obtained by performing a first process on the ZC sequence, where the first process includes one or more of the following: discrete fourier transform, DFT, or cyclic shift.
By configuring the first sequence related parameters to the terminal through the apparatus 700, it is possible to reduce interference between devices by configuring different devices to use different first sequence parameters.
In one possible design, the apparatus 700 may correspond to the network device in the above method embodiment, and may also correspond to a component (e.g., an integrated circuit, a chip, a processor, or the like) of the network device for executing the method described in fig. 4A or 4B in the embodiment of the present application.
It can be understood that some optional features in the embodiments of the present application may be implemented independently without depending on other features in some scenarios, for example, a scheme based on which the optional features are currently implemented, so as to solve corresponding technical problems and achieve corresponding effects, or may be combined with other features according to requirements in some scenarios. Accordingly, the apparatuses provided in the embodiments of the present application may also implement these features or functions, which are not described herein again.
Those skilled in the art will also appreciate that the various illustrative logical blocks and steps (step) set forth in the embodiments of the present application may be implemented in electronic hardware, computer software, or combinations of both. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the embodiments of the present application.
In the various embodiments and implementations of the present application, unless otherwise specified or logically conflicting, terms and/or descriptions between different embodiments, different implementations have consistency and may be mutually cited, and technical features in different embodiments and implementations may be combined to form a new embodiment or a new implementation according to their inherent logical relationships.
It should be understood that the processor in the embodiments of the present application may be an integrated circuit chip having signal processing capability. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The processor may be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, or discrete hardware components.
The techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination of hardware and software. For a hardware implementation, the processing units used to perform these techniques at a communication device (e.g., a base station, terminal, network entity, or chip) may be implemented in one or more general-purpose processors, DSPs, digital signal processing devices, ASICs, programmable logic devices, FPGAs, or other programmable logic devices, discrete gate or transistor logic, discrete hardware components, or any combinations of the above. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
It will be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), SLDRAM (synchronous DRAM), and direct rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
The present application also provides a computer-readable medium having stored thereon a computer program which, when executed by a computer, performs the functions of any of the method embodiments described above.
The present application also provides a computer program product which, when executed by a computer, implements the functionality of any of the above-described method embodiments.
In the above embodiments, all or part of the implementation may be realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. 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 one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a Digital Video Disk (DVD)), or a semiconductor medium (e.g., a Solid State Disk (SSD)), among others.
Those of ordinary skill in the art will understand that: various numbers of the first, second, etc. mentioned in this application are only for convenience of description and distinction, and are not used to limit the scope of the embodiments of this application, and also represent a sequence order.
The correspondence shown in the tables in the present application may be configured or predefined. The values of the information in each table are only examples, and may be configured to other values, which is not limited in the present application. When the correspondence between the information and each parameter is configured, it is not always necessary to configure all the correspondences indicated in each table. For example, in the table in the present application, the correspondence shown in some rows may not be configured. For another example, appropriate modification adjustments, such as splitting, merging, etc., can be made based on the above tables. The names of the parameters in the tables may be other names understandable by the communication device, and the values or the expression of the parameters may be other values or expressions understandable by the communication device. When the above tables are implemented, other data structures may be used, for example, arrays, queues, containers, stacks, linear tables, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables may be used.
Predefinition in this application may be understood as defining, predefining, storing, pre-negotiating, pre-configuring, curing, or pre-firing.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It can be clearly understood by those skilled in the art that, for convenience and simplicity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The same or similar parts between the various embodiments in this application may be referred to each other. In the embodiments and the implementations/implementation methods in the embodiments in the present application, unless otherwise specified or conflicting in terms of logic, terms and/or descriptions between different embodiments and between the implementations/implementation methods in the embodiments have consistency and may be mutually cited, and technical features in different embodiments and implementations/implementation methods in the embodiments may be combined to form a new embodiment, implementation method, or implementation method according to the inherent logic relationship. The above-described embodiments of the present application do not limit the scope of the present application.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application.
Claims (25)
1. A method of communication, comprising:
obtaining a first sequence, the first sequence being related to d second sequences;
the d second sequences are included in M candidate second sequences, d is an integer greater than 1, and M is an integer greater than or equal to d;
the first sequence is included in K candidate first sequences, K being an integer greater than M;
and outputting the first sequence;
wherein s candidate first sequences in the K candidate first sequences correspond to d × s candidate second sequences, at least d × (1-epsilon) × s candidate second sequences different from each other exist in the d × s candidate second sequences, epsilon is a real number greater than 0 and less than 1, and s is an integer greater than 1 and less than K.
2. The method of claim 1, further comprising: and acquiring configuration information, wherein the configuration information configures the d second sequences, or configures the corresponding relation between the first sequence and the d second sequences.
3. The method of claim 2, further comprising: and obtaining the d second sequences according to the configuration information.
4. The method according to any of claims 1 to 3, characterized in that the first sequence is a sequence of a preamble signal.
5. The method of claim 4, wherein M equals 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4 and K equals 640, 512, 320, 256, 160, or 128.
6. The method according to any one of claims 1 to 3, wherein the first sequence is a sequence of a demodulation reference signal (DMRS).
7. The method of claim 6, wherein M is equal to 6, 8, 12, 16, 18, 24, or 32 and K is equal to 24, 32, 48, 64, 96, or 128.
8. The method according to any one of claims 1 to 3, wherein the first sequence is a sequence of a Phase Tracking Reference Signal (PTRS), a sequence of a Sounding Reference Signal (SRS), a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal.
9. A method according to any one of claims 1 to 3, wherein the second sequence is a ZC sequence or a sequence obtained by subjecting a ZC sequence to a first process comprising one or more of: discrete fourier transform, DFT, or cyclic shift.
10. A method of communication, comprising:
receiving a first sequence, the first sequence being related to d second sequences;
the d second sequences are included in M candidate second sequences, d is an integer greater than 1, and M is an integer greater than or equal to d;
the first sequence is included in K candidate first sequences, K being an integer greater than M;
and, processing the first sequence;
wherein s candidate first sequences in the K candidate first sequences correspond to d × s candidate second sequences, at least d × (1-epsilon) × s candidate second sequences different from each other exist in the d × s candidate second sequences, epsilon is a real number greater than 0 and less than 1, and s is an integer greater than 1 and less than K.
11. The method of claim 10, further comprising: and sending configuration information, wherein the configuration information configures the d second sequences, or the configuration information configures the corresponding relation between the first sequence and the d second sequences.
12. The method according to claim 10 or 11, wherein the first sequence is a sequence of a preamble signal.
13. The method of claim 12, wherein M equals 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, and wherein K equals 640, 512, 320, 256, 160, or 128.
14. The method according to claim 10 or 11, wherein the first sequence is a sequence of a demodulation reference signal, DMRS.
15. The method of claim 14, wherein M equals 6, 8, 12, 16, 18, 24, or 32, and wherein K equals 24, 32, 48, 64, 96, or 128.
16. The method of claim 10 or 11, wherein the first sequence is a sequence of a Phase Tracking Reference Signal (PTRS), a sequence of a Sounding Reference Signal (SRS), a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal.
17. A method according to claim 10 or 11, wherein the second sequence is a ZC sequence, or a sequence obtained from a ZC sequence by a first process comprising one or more of: discrete fourier transform, DFT, or cyclic shift.
18. An apparatus, characterized in that the apparatus is configured to perform the method of any of claims 1 to 9.
19. An apparatus, characterized in that the apparatus is configured to perform the method according to any of claims 10 to 17.
20. An apparatus, comprising: a processor coupled with a memory, the memory to store a program or instructions that, when executed by the processor, cause the apparatus to perform the method of any of claims 1 to 9.
21. An apparatus, comprising: a processor coupled with a memory, the memory to store a program or instructions that, when executed by the processor, cause the apparatus to perform the method of any of claims 10 to 17.
22. A computer-readable storage medium having stored thereon a computer program or instructions, which when executed cause a computer to perform the method of any one of claims 1 to 9.
23. A computer-readable storage medium on which is stored a computer program or instructions, characterized in that the computer program or instructions, when executed, cause a computer to perform the method of any of claims 10 to 17.
24. A communication system, comprising: the apparatus as claimed in claim 18, and/or the apparatus as claimed in claim 19.
25. A communication system, comprising: the apparatus as claimed in claim 20, and/or the apparatus as claimed in claim 21.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2020/111766 WO2021043059A1 (en) | 2019-09-02 | 2020-08-27 | Random access method and device |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910822354 | 2019-09-02 | ||
| CN2019108223547 | 2019-09-02 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112449438A CN112449438A (en) | 2021-03-05 |
| CN112449438B true CN112449438B (en) | 2023-04-07 |
Family
ID=74733279
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010219752.2A Active CN112449438B (en) | 2019-09-02 | 2020-03-25 | Random access method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112449438B (en) |
| WO (1) | WO2021043059A1 (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107113261A (en) * | 2014-12-29 | 2017-08-29 | 瑞典爱立信有限公司 | Method and apparatus for generating and detecting random access guiding |
| CN107852757A (en) * | 2015-07-27 | 2018-03-27 | 英特尔公司 | Designed for 5G CIOT (honeycomb Internet of Things) enhancing RACH (RACH) |
| CN108259065A (en) * | 2017-12-28 | 2018-07-06 | 中国信息通信研究院 | A kind of method for improving random access channel capacity |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103929825A (en) * | 2014-04-30 | 2014-07-16 | 电子科技大学 | Multi-user detection method based on ZC sequence |
| CN105376009A (en) * | 2014-08-27 | 2016-03-02 | 华为技术有限公司 | Uplink data transmission method and device |
| US9992800B2 (en) * | 2016-05-13 | 2018-06-05 | Qualcomm Incorporated | Techniques for performing a random access procedure in an unlicensed spectrum |
| CN109152042B (en) * | 2017-06-16 | 2022-11-29 | 北京紫光展锐通信技术有限公司 | Preamble configuration and identification method, base station, terminal and readable storage medium |
-
2020
- 2020-03-25 CN CN202010219752.2A patent/CN112449438B/en active Active
- 2020-08-27 WO PCT/CN2020/111766 patent/WO2021043059A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107113261A (en) * | 2014-12-29 | 2017-08-29 | 瑞典爱立信有限公司 | Method and apparatus for generating and detecting random access guiding |
| CN107852757A (en) * | 2015-07-27 | 2018-03-27 | 英特尔公司 | Designed for 5G CIOT (honeycomb Internet of Things) enhancing RACH (RACH) |
| CN108259065A (en) * | 2017-12-28 | 2018-07-06 | 中国信息通信研究院 | A kind of method for improving random access channel capacity |
Non-Patent Citations (1)
| Title |
|---|
| "Random Access Preamble Sequence Length for E-UTRA";Texas Instruments;《3GPP TSG RAN WG1 #49 R1-072191》;20070502;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021043059A1 (en) | 2021-03-11 |
| CN112449438A (en) | 2021-03-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10645688B2 (en) | Time-frequency resource allocation method and apparatus | |
| CN108988978B (en) | Scrambling code sequence generation method and device | |
| CN112311514B (en) | Control information transmission method and device | |
| CN110351032B (en) | Resource allocation method and device | |
| CN114667685B (en) | Communication method and device | |
| CN112449438B (en) | Random access method and device | |
| CN114424463A (en) | Method and device for joint scheduling | |
| CN114175775A (en) | Method, device and system for receiving and transmitting control information | |
| CN113366904B (en) | Time domain resource allocation method and device thereof | |
| CN115735350A (en) | Information determination method/device/equipment and storage medium | |
| CN112134660B (en) | Communication method and device | |
| CN110062473B (en) | Random access method, terminal equipment and network equipment | |
| CN116636272A (en) | System information transmission method, communication device and related equipment | |
| WO2024065196A1 (en) | Data transmission method and apparatus | |
| WO2023130332A1 (en) | Multi-user orthogonal frequency division multiplexing (ofdm) subcarrier allocation method and apparatus | |
| US20220159680A1 (en) | Control channel transmission method and apparatus | |
| WO2022226847A1 (en) | Resource multiplexing method and device thereof for direct distance measurement | |
| WO2023206565A1 (en) | Sounding reference signal (srs) transmission method, srs resource configuration method, and apparatus thereof | |
| WO2024021130A1 (en) | Channel estimation method and apparatus | |
| CN112584514B (en) | Communication method, device and system | |
| CN109152015B (en) | Communication method, base station and terminal equipment | |
| CN107623932A (en) | A kind of cut-in method and device of system information area or network area | |
| CN114902773A (en) | Method and device for sending direct-connection ranging signal | |
| CN115039373A (en) | Transmission method and device for demodulation reference signal (DMRS) | |
| CN115885559A (en) | Method and device for configuring time slot structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |