Communication method and communication device

Abstract

The present application provides a communication method and a communication device, which relate to the field of communication technology. The communication method includes: a terminal device sends a first sequence to an access network device through M resources, the first sequence is used for random access, and the length of the first sequence satisfies: M×N, N is the length of the second sequence, M is the number of repetitions of the second sequence, M is a positive integer greater than or equal to 2, and N is a positive integer. Among them, the first resource in the M resources corresponds to the first information in the first sequence, the second resource corresponds to the second information in the first sequence, the first resource is different from the second resource, and the first information is different from the second information. In this way, by constructing a first sequence with a longer length and sending the first sequence through multiple resources, this can increase the transmission power of the first sequence, and thus can effectively improve the reliability of the terminal device accessing the network.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and more specifically, to a communication method and a communication device. Background Art

[0002] The terminal device can access the network through a contention-based random access process. For example, the terminal device sends a preamble code to the access network device, and the access network device sends a random access response (RAR) information corresponding to the received preamble code to the terminal device, and the RAR information includes scheduling information of message 3. The terminal device can send message 3 to the access network device according to the scheduling information of message 3, and the access network device then sends message 4 to the terminal device to indicate that the terminal device has successfully accessed.

[0003] However, when the terminal device is far away from the access network device and / or the surrounding environment is not conducive to information transmission, the power of the preamble code received by the access network device is likely to be less than the expected value, which may cause the terminal device to be unable to reliably access the network. Summary of the invention

[0004] The present application provides a communication method and a communication device, which can effectively improve the reliability of terminal equipment accessing a network.

[0005] In a first aspect, a communication method is provided, including: determining a first sequence, the first sequence is used for random access, the length of the first sequence satisfies: M×N, N is the length of a second sequence, M is the number of repetitions of the second sequence, M is a positive integer greater than 1, and N is a positive integer; sending the first sequence through M resources, a first resource among the M resources corresponds to first information in the first sequence, a second resource among the M resources corresponds to second information in the first sequence, the first resource is different from the second resource, and the first information is different from the second information.

[0006] The execution subject of the solution described in the first aspect may be a terminal device, or a chip or integrated circuit in the terminal device, etc., which is not limited. For ease of description, the following description is taken as an example of a terminal device.

[0007] In the above scheme, the embodiment of the present application can construct a first sequence whose length satisfies the relationship of M×N. Since the length of the first sequence is relatively long and the first sequence is sent through multiple resources, this can increase the transmission power of the first sequence, thereby effectively improving the reliability of the terminal device accessing the network.

[0008] In addition, for a given cyclic shift interval, a first sequence with a longer length can generate more preamble sequences, which can effectively improve user capacity. At the same time, the cross-correlation performance between different sequences formed by the first sequence with a longer length is better, that is, the cross-correlation coefficient between the preamble codes generated by different Zadoff-Chu (ZC) root sequences is smaller, so that the detection interference is smaller, thereby effectively improving the sequence correlation detection performance.

[0009] In a possible implementation, determining the first sequence includes: generating the first sequence according to K sequences, where the K sequences include at least one sequence that needs to be truncated, and K is a positive integer less than or equal to M.

[0010] In this way, the embodiment of the present application can construct a first sequence with a length satisfying M×N based on multiple sequences, thereby being able to increase the transmission power of the first sequence.

[0011] In a possible implementation manner, the length of each sequence in the K sequences is the same; or, the K sequences include at least two sequences with different lengths.

[0012] When the length of each of the K sequences is the same, the first sequence can be constructed by the same sequence, which can increase the possibility of selecting the K sequences. When the K sequences include at least two sequences of different lengths, the first sequence can be constructed by at least two different sequences, which can also increase the possibility of selecting the K sequences.

[0013] Through the above scheme, the present application can construct a first sequence with a length of M×N through multiple sequences, thereby increasing the transmission power of the first sequence.

[0014] A possible implementation manner is to determine the first sequence, including: cyclically extending the third sequence to obtain the first sequence, where the length of the third sequence is less than the length of the first sequence; or truncating the third sequence to obtain the first sequence, where the length of the third sequence is greater than the length of the first sequence.

[0015] In this way, the embodiment of the present application can cyclically extend or truncate a sequence to construct a first sequence with a length satisfying M×N, which can effectively reduce the difficulty of constructing the first sequence.

[0016] A possible implementation manner is to send a first sequence, including: splitting the first sequence to obtain G subsequences, where G is a positive integer greater than or equal to 2; performing discrete Fourier transformation (DFT) on the G subsequences to obtain G DFT sequences, and the G DFT sequences correspond to the G subsequences one-to-one; performing inverse fast Fourier transform (IFFT) of a first number of points on the G DFT sequences to obtain G symbols, and the G DFT sequences correspond to the G symbols one-to-one; adding a cyclic prefix (CP) to each of the G symbols; and sending the G symbols after the CP is added.

[0017] By splitting the first sequence, different parts of the first sequence can be sent in multiple symbols, so as to transmit a longer first sequence under the same subcarrier spacing and time-frequency domain resources.

[0018] A possible implementation method is to perform IFFT of a first number of points on G DFT sequences respectively to obtain G symbols, including: mapping the G DFT sequences to G consecutive frequency resource blocks in sequence, each frequency resource block including one frequency resource or multiple consecutive frequency resources; padding the unoccupied frequency domain resources in the corresponding frequency domain resource blocks of the G DFT sequences after resource mapping with zeros; and performing IFFT of a first number of points on the G DFT sequences after zero padding to obtain G symbols. The value of the first number of points is greater than or equal to the value of the length of the first sequence.

[0019] In this way, the spectrum of the received signals of the G DFT sequences is summed up at the directly corresponding points to obtain the spectrum of the complete sequence, which is convenient for detection.

[0020] A possible implementation method is to perform IFFT on G DFT sequences respectively to obtain G symbols, including: mapping the G DFT sequences respectively to the same frequency resource block, the same frequency resource block including one frequency resource or multiple continuous frequency resources, and padding the frequency domain resources not occupied by each DFT sequence in the G DFT sequences in the same frequency domain resource block with zeros; and performing IFFT of a first number of points on the G DFT sequences after zero padding to obtain G symbols. The value of the first number of points is greater than or equal to the value of the maximum length among the lengths corresponding to the G subsequences.

[0021] In this way, the spectrum occupied by the G DFT sequences is in the same position, and the spectrum resources are allocated regularly, making it convenient for the access network equipment to allocate the remaining spectrum to other services.

[0022] A possible implementation method is to send a first sequence, including: performing DFT on the first sequence to obtain a DFT sequence; splitting the DFT sequence to obtain G DFT subsequences, where G is a positive integer greater than or equal to 2; performing IFFT of a first number of points on the G DFT subsequences to obtain G symbols, and the G symbols correspond one-to-one to the G DFT subsequences; adding a CP to each of the G symbols; and sending the G symbols after the CP is added.

[0023] In this way, various parts of the first sequence can be sent on multiple symbols to achieve transmission of a longer first sequence under the same subcarrier spacing and time-frequency domain resources.

[0024] A possible implementation method is to perform IFFT of a first number of points on G DFT subsequences to obtain G symbols, including: mapping the G DFT subsequences to G consecutive frequency resource blocks in sequence, each frequency resource block including one frequency resource or multiple consecutive frequency resources; padding the unoccupied frequency domain resources of the G DFT subsequences after resource mapping with zeros in the corresponding frequency domain resource blocks; and performing IFFT of a first number of points on the G DFT sequences after zero padding to obtain G symbols. The value of the first number of points is greater than or equal to the value of the length of the first sequence.

[0025] In this way, the spectrum of the received signals of the G DFT sequences is summed up at the directly corresponding points to obtain the spectrum of the complete sequence, which is convenient for detection.

[0026] A possible implementation method is to perform IFFT of a first number of points on G DFT sequences respectively to obtain G symbols, including: mapping the G DFT sequences respectively to the same frequency resource block, the same frequency resource block including one frequency resource or multiple continuous frequency resources, and padding the frequency domain resources not occupied by each DFT sequence in the G DFT sequences in the same frequency domain resource block with zeros; and performing IFFT of a first number of points on the G DFT sequences after zero padding to obtain G symbols. The value of the first number of points is greater than or equal to the value of the maximum length among the lengths corresponding to the G subsequences.

[0027] In this way, the spectrum occupied by the G DFT sequences is in the same position, and the spectrum resources are allocated regularly, making it convenient for the access network equipment to allocate the remaining spectrum to other services.

[0028] In a possible implementation, the first sequence carries the third information, and the number of bits carried by the third information is related to the length of the first sequence. In this way, the number of bits carried by the information carried by the first sequence can be increased.

[0029] In a possible implementation manner, the first sequence is a sequence multiplied by a modulation symbol.

[0030] In this way, the amount of information carried by the first sequence can be further increased.

[0031] In a second aspect, a communication method is provided, including: receiving a first sequence through M resources, the first sequence is used for random access, the length of the first sequence satisfies: M×N, N is the sequence length of the second sequence, M is the number of repetitions of the second sequence, M is a positive integer greater than 1, N is a positive integer, a first resource among the M resources corresponds to first information in the first sequence, a second resource among the M resources corresponds to second information in the first sequence, the first resource is different from the second resource, and the first information is different from the second information; processing the first sequence.

[0032] The execution subject of the solution described in the second aspect may be an access network device, or a chip or integrated circuit in the access network device, etc., which is not limited. For ease of description, the following description is made by taking the access network device as an example.

[0033] In the above scheme, the embodiment of the present application can construct a first sequence whose length satisfies the relationship of M×N. Since the length of the first sequence is relatively long and the first sequence is sent through multiple resources, this can increase the transmission power of the first sequence, thereby effectively improving the reliability of the terminal device accessing the network.

[0034] In a possible implementation manner, the first sequence is generated according to K sequences, where the K sequences include at least one sequence that needs to be truncated, and K is a positive integer less than or equal to M.

[0035] In a possible implementation manner, the length of each sequence in the K sequences is the same; or, the K sequences include at least two sequences with different lengths.

[0036] In a possible implementation manner, the first sequence is obtained by cyclically extending the third sequence, and the length of the third sequence is smaller than the length of the first sequence.

[0037] In a possible implementation manner, the first sequence is obtained by truncating the third sequence, and the length of the third sequence is greater than that of the first sequence.

[0038] A possible implementation method, processing a first sequence, includes: performing CP removal processing on G symbols, the G symbols corresponding to the first sequence; performing fast Fourier transform (FFT) of a first number of points on the G symbols after the CP removal processing to obtain G FFT sequences, the G FFT sequences correspond one-to-one to the G symbols, and the value of the first number of points is greater than or equal to the value of the length of the G FFT sequences; performing inverse discrete Fourier transform (IDFT) on the G FFT sequences to obtain G IDFT sequences, the G IDFT sequences correspond one-to-one to the G FFT sequences; and determining the first sequence according to the G IDFT sequences.

[0039] Through the above process, the present application can complete the reception of the first sequence.

[0040] A possible implementation method is to receive a first sequence, including: performing CP removal processing on G symbols, the G symbols corresponding to the first sequence; performing FFT of a first number of points on the G symbols after the CP removal processing to obtain G FFT sequences, the G DFT sequences correspond to the G symbols one-to-one, and the value of the first number of points is greater than or equal to the value of the length of the G DFT sequences; obtaining a fourth sequence based on the G FFT sequences; performing IDFT on the fourth sequence to obtain a fifth sequence; and determining the first sequence based on the fifth sequence.

[0041] Through the above process, the present application can complete the reception of the first sequence.

[0042] A possible implementation method receives a first sequence, including: obtaining a first symbol based on G symbols, the first symbol being a symbol obtained after CP removal processing of the G symbols, the G symbols corresponding to the first sequence; performing FFT of a first point number on the first symbol to obtain a sixth sequence, the value of the first point number being greater than or equal to the value of the length of the sixth sequence; performing IDFT on the sixth sequence to obtain a seventh sequence; and determining the first sequence based on the seventh sequence.

[0043] Through the above process, the present application can complete the reception of the first sequence.

[0044] A possible implementation manner is to obtain a first symbol based on G symbols, including: performing CP removal processing on the G symbols; and combining the G symbols after the CP removal processing to obtain the first symbol.

[0045] A possible implementation method is to obtain a first symbol based on G symbols, including: combining the G symbols to obtain a second symbol; and performing CP removal processing on the second symbol to obtain the first symbol.

[0046] In a possible implementation manner, the first sequence carries third information, and the number of bits carried by the third information is related to the length of the first sequence.

[0047] In a possible implementation manner, the first sequence is a sequence multiplied by a modulation symbol.

[0048] In a third aspect, a communication device is provided. The communication device may be a network device, or may be a device or module for executing the functions of a network device.

[0049] In one possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the first aspect. The module or unit may be a hardware circuit, software, or a combination of a hardware circuit and software.

[0050] In a fourth aspect, a communication device is provided, which may be a terminal device, or a device or module for executing the functions of a terminal device.

[0051] In one possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the second aspect. The module or unit may be a hardware circuit, software, or a combination of a hardware circuit and software.

[0052] In a fifth aspect, a communication device is provided, comprising a processor, wherein the processor is used to enable the communication device to execute the method described in the first aspect and any possible method described in the first aspect by executing a computer program or instruction, or by a logic circuit; or to enable the communication device to execute the method described in the second aspect and any possible method described in the second aspect.

[0053] In a possible implementation manner, the communication device further includes a memory for storing the computer program or instruction.

[0054] In a possible implementation manner, the communication device further includes a communication interface, which is used to input and / or output signals.

[0055] In a sixth aspect, a communication device is provided, comprising a logic circuit and an input / output interface, the input / output interface being used to input and / or output signals, the logic circuit being used to execute the method described in the first aspect and any possible embodiment of the first aspect; or the logic circuit being used to execute the method described in the second aspect and any possible embodiment of the second aspect.

[0056] In the seventh aspect, a computer-readable storage medium is provided, on which a computer program or instruction is stored. When the computer program or the instruction is run on a computer, the method described in the first aspect and any possibility of the first aspect is executed; or, the method described in the second aspect and any possibility of the second aspect is executed.

[0057] In an eighth aspect, a computer program product is provided, comprising instructions, which, when executed on a computer, cause the method described in the first aspect and any possible method of the first aspect to be executed; or, cause the method described in the second aspect and any possible method of the second aspect to be executed.

[0058] The description of the advantageous effects of any of the second aspect to the eighth aspect etc. may refer to the description of the advantageous effects of the first aspect and the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0059] Figure 1 It is a schematic diagram of the architecture of a communication system 100 applicable to an embodiment of the present application.

[0060] Figure 2 FIG. 2 is a flow chart of contention-based random access 200 .

[0061] Figure 3 is a schematic diagram of a cyclic shift 300.

[0062] Figure 4 It is a schematic diagram of the interaction flow of the communication method 400 according to an embodiment of the present application.

[0063] Figure 5 It is a schematic diagram of the process of sending the first sequence 500 according to an embodiment of the present application.

[0064] Figure 6 It is a flowchart of sending the first sequence 600 according to an embodiment of the present application.

[0065] Figure 7 It is a flowchart of receiving the first sequence 700 according to an embodiment of the present application.

[0066] Figure 8 It is a flowchart of receiving the first sequence 800 according to an embodiment of the present application.

[0067] Fig. 9 It is a flowchart of receiving the first sequence 900 according to an embodiment of the present application.

[0068] Fig.10 It is a schematic block diagram of a communication device 1000 according to an embodiment of the present application.

[0069] Fig.11It is a schematic block diagram of a communication device 1100 according to an embodiment of the present application.

[0070] Fig.12 It is a schematic block diagram of a communication device 1200 according to an embodiment of the present application.

[0071] Fig.13 It is a schematic block diagram of a communication device 1300 according to an embodiment of the present application.

[0072] Fig.14 It is a schematic block diagram of a communication device 1400 according to an embodiment of the present application. DETAILED DESCRIPTION

[0073] The technical solution in this application will be described below in conjunction with the accompanying drawings.

[0074] In order to facilitate understanding of the embodiments of the present application, the following points are first explained.

[0075] 1. Unless otherwise specified, “plurality” means two or more.

[0076] 2. Unless otherwise specified or there is no logical conflict, the terms and / or descriptions between different embodiments of the present application are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form new embodiments based on their internal logical relationships.

[0077] 3. The various digital numbers involved in this application are only used for the convenience of description and are not used to limit the scope of protection of this application. The size of the serial numbers involved in this application does not mean the order of execution. The execution order of each process should be determined by its function and internal logic. For example, the terms "first", "second", "third", "fourth" and other various terminology labels (if any) in the specification and claims and drawings of this application are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. Among them, the data used in this way can be interchangeable where appropriate, so that the embodiments described here can be implemented in an order other than what is illustrated or described here.

[0078] At the same time, any embodiment or design described in the present application as "exemplary" or "for example" should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a concrete manner for ease of understanding.

[0079] 4. The terms "comprise", "include", "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus comprising a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such process, method, product or apparatus.

[0080] 5. In this application, "used to indicate" can be understood as "enable", and "enable" can include direct enablement and indirect enablement. When describing that a certain information is used to enable A, it can include that the information directly enables A or indirectly enables A, and it does not mean that the information must carry A.

[0081] The information enabled by the information is called information to be enabled. In the specific implementation process, there are many ways to enable the information to be enabled, such as but not limited to, the information to be enabled can be directly enabled, such as the information to be enabled itself or the index of the information to be enabled. The information to be enabled can also be indirectly enabled by enabling other information, wherein there is an association relationship between the other information and the information to be enabled. It is also possible to enable only a part of the information to be enabled, while the other parts of the information to be enabled are known or agreed in advance. For example, the enabling of specific information can also be achieved by means of the arrangement order of each piece of information agreed in advance (such as specified by the protocol), thereby reducing the enabling overhead to a certain extent. At the same time, the common parts of each piece of information can also be identified and enabled uniformly to reduce the enabling overhead caused by enabling the same information separately.

[0082] 6. In this application, "pre-configuration" may include pre-definition, such as protocol definition. Among them, "pre-definition" can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in a device (for example, including each network element), and this application does not limit its specific implementation method.

[0083] 7. The term "storage" or "saving" as used in this application may refer to saving in one or more memories. The one or more memories may be provided separately or integrated in an encoder or decoder, a processor, or a communication device. The one or more memories may also be partially provided separately and partially integrated in a decoder, a processor, or a communication device. The type of memory may be any form of storage medium, without limitation.

[0084] 8. The "protocol" referred to in this application may refer to a standard protocol in the field of communications, for example, the fourth generation (4 th generation, 4G) network, fifth generation (5 th generation, 5G) network protocol, NR protocol, 5.5G network protocol, sixth generation (6th The present application does not limit the network protocols used in future communication systems.

[0085] 9. The dotted arrows or boxes in the schematic diagrams of the drawings in the specification of this application represent optional steps or optional modules.

[0086] 10. Unless otherwise specified, “ / ” indicates that the objects associated with each other are in an “or” relationship. For example, A / B can represent A or B. The “and / or” in this application is only a description of the association relationship between the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.

[0087] First, a communication system to which the embodiments of the present application are applicable is described.

[0088] Figure 1 1 is a schematic diagram of a communication system 100 to which the present application embodiment is applicable. Figure 1 As shown, the communication system 100 includes: access network equipment and terminal equipment.

[0089] A terminal device is a device with wireless transceiver functions, which can refer to user equipment (UE), access terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user device.

[0090] The terminal device may also be a satellite phone, a cellular phone, a smart phone, a wireless data card, a wireless modem, a machine type communication device, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a customer-premises equipment (CPE), a smart point of sale (POS) machine, a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a communication device carried on a high-altitude aircraft, a wearable device, a drone, a robot, a terminal in device-to-device communication (D2D), a terminal in vehicle-to-everything (V2X), a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical, a smart grid (smart grid), etc. There is no restriction on wireless terminals in mobile grid, wireless terminals in transportation safety, wireless terminals in smart city, wireless terminals in smart home, or terminal devices in communication networks evolved after 5G.

[0091] The communication device for realizing the function of the terminal device can be a terminal device, or a device that can support the terminal device to realize the function, such as a chip system. The device can be installed in the terminal device or used in combination with the terminal device. In the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0092] Access network equipment is a device with wireless transceiver functions, used to communicate with terminal devices. Access network equipment can be a node in the radio access network (RAN), also known as a base station, or a RAN node. It can be an evolved Node B (eNB or eNodeB) of LTE; or a base station of a 5G network such as gNodeB (gNB) or a base station in a public land mobile network (PLMN) evolved after 5G, a broadband network service gateway (BNG), an aggregation switch or the 3rd Generation Partnership Project (3GPP) rd generation partnership project, 3GPP) access equipment, etc.

[0093] The above-mentioned RAN can be configured as a RAN defined by the 3GPP protocol, an open radio access network (O-RAN) or a cloud radio access network (C-RAN), etc. The access network equipment can also include various forms of base stations, such as: macro base stations, micro base stations (also called small stations), relay stations, transmission points (transmitting and receiving points, TRP), transmission points (transmitting points, TP), mobile switching centers, and devices that assume the function of base stations in device-to-device (D2D), vehicle-to-everything (V2X), machine-to-machine (M2M) communications, network equipment in non-terrestrial networks (NTN), etc., without specific limitation.

[0094] The access network equipment may also include network elements or modules that implement some functions of the base station, for example, one or more of the following: a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). Optionally, the CU can be further separated into a CU-control plane (CP) and a CU-user plane (UP). The functions of the CU and DU can be implemented by different network elements, or simultaneously by the baseband unit (BBU) of the base station. The function of the RU can be implemented by the radio frequency equipment of the base station. For example, the radio frequency equipment of the base station may be a remote radio unit (RRU), a pico remote radio unit (pRRU), an active antenna unit (AAU), or other units, modules or devices with radio frequency processing functions. The communication interface protocol between the BBU and the radio frequency equipment can be a common public radio interface (CPRI) interface protocol, an enhanced common public radio interface (eCPRI) interface protocol, or a fronthaul interface protocol between the DU and the RU in the O-RAN system, etc., without limitation.

[0095] The communication device for implementing the function of the access network device may be an access network device, or may be a device capable of supporting the access network device to implement the function, such as a chip system. The device may be installed in the access network device or used in conjunction with the access network device. The chip system in the embodiment of the present application may be composed of a chip, or may include a chip and other discrete devices.

[0096] In the communication system 100, the terminal device needs to access the network through a random access process, which can be seen in Figure 2 .

[0097] Figure 2 is a schematic diagram of a contention-based random access process 200. Figure 2 As shown, the random access process 200 includes:

[0098] S201. The terminal device sends a preamble code (which may also be message 1 (Msg1)) to the access network device via a physical random access channel (PRACH).

[0099] Correspondingly, the access network device receives the preamble code through the PRACH.

[0100] For example, the terminal device can randomly select a random access channel occasion (RACH occasion, RO) associated with the synchronization signal and physical broadcast channel block (SSB) index carried in the system message sent by the access network device. Further, the terminal device randomly selects a preamble code from the selected RO (up to 64 preamble codes can be transmitted simultaneously on one RO) for transmission.

[0101] It should be noted that when the system message carries the indexes of multiple SSBs, the terminal device can select the index of the SSB whose received signal reference power (RSRP) is greater than a threshold, or randomly select the index of an SSB, and there is no limitation on this.

[0102] S202. The access network device sends a random access response (RAR) to the terminal device (may be message 2 (Msg2)).

[0103] Correspondingly, the terminal device receives the RAR.

[0104] For example, the access network device may configure resources for transmitting the RAR, and send the RAR to the terminal device through the resources.

[0105] The RAR includes scheduling information of message 3 (Msg3), namely, RAR UL grant information.

[0106] S203. The terminal device sends message 3 (eg, Msg3) to the access network device via a physical uplink shared channel (PUSCH).

[0107] Correspondingly, the access network device receives message 3 via PUSCH.

[0108] For example, the terminal device can send message 3 to the access network device according to the resources indicated by the scheduling information of message 3.

[0109] S204. The access network device sends message 4 (Msg4) to the terminal device.

[0110] Correspondingly, the terminal device receives message 4.

[0111] Among them, message 4 can be used to indicate that the terminal device can access the network.

[0112] Through the above random access process, the terminal device can access the network. However, when the terminal device is far away from the access network and / or the surrounding environment is not conducive to information transmission, the power of the preamble received by the access network device is likely to be less than the expected value, which may cause the terminal device to be unable to reliably access the network.

[0113] In view of this, the present application provides a communication method and a communication device, which can effectively improve the reliability of terminal equipment accessing the network.

[0114] The following is a brief description of the technical terms involved in the embodiments of the present application.

[0115] Preamble: It can be used by the terminal device to establish an uplink synchronization relationship with the access network device and to request the access network device to allocate dedicated resources to the terminal device so that normal service transmission can be carried out.

[0116] The preamble code may include: cyclic prefix (CP), preamble sequence and guard interval (GI) in the time domain:

[0117] 1) CP: refers to the prefix of a symbol, which has a repeated end in an orthogonal frequency division multiplexing (OFDM) wireless system and can be used to combat the impact of multipath propagation.

[0118] 2) Preamble sequence: It is generated by cyclic shift of Zadoff-Chu (ZC) root sequence. The difference in its length and number of repetitions determines the demodulation performance of the preamble code.

[0119] 3) GI: related to the coverage radius of the cell. In general, the access network equipment needs to ensure that no other information is transmitted on the uplink resources where the preamble may be sent. In the initial access scenario, the access network equipment needs to consider the uncertainty of the preamble reception timing. The time when the central user and the edge user send the preamble to the access network device is different. The maximum allowable difference between the two is the GI.

[0120] The leading sequence can be generated in the following ways:

[0121] 1) Generate a ZC root sequence using prach-RootSequenceIndex.

[0122] 2) Generate 64 different preamble sequences by cyclically shifting the ZC root sequence.

[0123] The first ZC root sequence index of each cell can be indicated by prach-RootSequenceIndex. If the number of preamble sequences generated by cyclic shift of the ZC root sequence corresponding to the ZC root sequence index is less than 64, the ZC root sequence corresponding to the next ZC root sequence index can be used to continue generating preamble sequences until 64 preamble sequences are generated.

[0124] The formula for generating the ZC root sequence is as follows:

[0125]

[0126] μ: The index value of the ZC root sequence is related to the length of the leading sequence. For example, the length of the leading sequence is L RA is 839, the value of μ ranges from 1 to 838; or, the length of the leading sequence is L RA is 139, and the value of μ ranges from 1 to 138.

[0127] 3GPP TS 38.211 V15.7.0 defines the index table of ZC root sequence, which can be seen in Table 1. Table 1 is based on L RA =139 as an example.

[0128] Table 1

[0129]

[0130] As shown in Table 1, exemplarily, when prach-RootSequenceIndex indicates i=0, μ=1; when prach-RootSequenceIndex indicates i=1, μ=138.

[0131] Based on a specific ZC root sequence, more zero-correlation preamble sequences can be generated by cyclic shift. The so-called cyclic shift is to shift the ZC root sequence end to end by a certain number of bits. Figure 3 .

[0132] Figure 3 is a schematic diagram of a cyclic shift 300. Figure 3 As shown, the length L of the ZC root sequence RAThe root sequence is 10. The first and last bits are shifted by 3 and 6 bits respectively. Before the shift, the ZC root sequence is: {X1(0), X1(1), X1(2), X1(3), X1(4), X1(5), X1(6), X1(7), X1(8), X1(9)}. After shifting by three bits, the ZC root sequence is: {X1(3), X1(4), X1(5), X1(6), X1(7), X1(8), X1(9), X1(0), X1(1), X1(2)}. After shifting by another three bits, the ZC root sequence is: {X1(6), X1(7), X1(8), X1(9), X1(0), X1(1), X1(2), X1(3), X1(4), X1(5)}.

[0133] The formula for circular shift can be:

[0134]

[0135] Among them, N CS Indicates the cyclic shift length. Through the zeroCorrelationZoneConfig configuration, the access network device can send zeroCorrelationZoneConfig as a cell random access configuration to the terminal device. v indicates the number of leading sequences that a ZC root sequence can generate, which is equal to L RA / N CS Round down, such as L RA is 139, N CS is 19, then v=7.

[0136] Example of generating 64 preamble sequences:

[0137] 1) Calculate N based on the cell radius CS : Assuming the cell radius is set to R, calculate N CS The value is 19. According to 6.3.3.1-7 in 3GPPTS 38.211 V15.7.0, the corresponding zeroCorrelationZoneConfig is 10, as shown in Table 2.

[0138] Table 2

[0139] zeroCorrelationZoneConfig <![CDATA[N CS ]]> 0 0 1 2 2 4 3 6 4 8 5 10 6 12 7 13 8 15 9 17 10 19 11 23 12 27 13 34 14 46 15 69

[0140] 2) Determine the index of the first ZC root sequence: Assume that the length of the leading sequence is L RA is 139, the first ZC root sequence index is 0 (indicated by prach-RootSequenceIndex), and the terminal device obtains μ=1 by querying Table 1.

[0141] 3) Calculate the number of leading sequences generated by each root sequence: According to LRA=139 and N CS =19, a ZC root sequence can be calculated to generate A leading sequence.

[0142] 4) Calculate the number of root sequences to be used and the corresponding index: A cell requires 64 leading sequences, so There are 3 ZC root sequences with indices of 1, 138, 2, 137, 3, 136, 4, 135, 5, and 134.

[0143] 5) Generate 64 corresponding preamble sequences according to formula (1) and formula (2).

[0144] For ease of understanding and explanation, the following describes the communication method of the embodiment of the present application by taking the interaction between the terminal device and the access network device as an example, but this should not constitute any limitation on the execution subject of the communication method of the embodiment of the present application. For example, the terminal device can be replaced by a component configured in the terminal device (such as a circuit, a chip, or a chip system, etc.), and the access network device can be replaced by a component configured in the access network device (such as a circuit, a chip, or a chip system, etc.).

[0145] Figure 4 4 is a schematic diagram of the interaction flow of the communication method 400 of the embodiment of the present application. Figure 4 As shown, the method 400 includes:

[0146] S401. The terminal device determines a first sequence.

[0147] The first sequence can be used for random access. In other words, the first sequence corresponds to a preamble code, or the preamble code includes the first sequence. For example, the first sequence can be the aforementioned preamble sequence.

[0148] The length of the first sequence satisfies: M×N, where N is the length of the second sequence, M is the number of repetitions of the second sequence, M is a positive integer greater than 1, and N is a positive integer. For example, the length of the first sequence is equal to the total length corresponding to the repetition of the second sequence M times. In this way, the transmission power of the preamble code can be improved by constructing a longer sequence.

[0149] In a possible implementation, the terminal device determines the first sequence, which may include:

[0150] S1. Generate a first sequence according to K sequences, where the K sequences include at least one sequence that needs to be truncated, and K is a positive integer less than or equal to M.

[0151] For a description of S1, please refer to Table 3. The content shown in Table 3 is only used as an example description and is not a final limitation.

[0152] Table 3

[0153]

[0154]

[0155] As shown in Table 3, illustratively:

[0156] M=4, N=139, K sequences include: 4 151 sequences, one 151 sequence is the sequence that needs to be truncated;

[0157] M=8, N=139, K sequences include: 839 sequence and 2 139 sequences, 839 sequence is the sequence that needs to be truncated;

[0158] M=8, N=139, K sequences include: 2 571 sequences, one 571 sequence is the sequence that needs to be truncated;

[0159] M=12, N=139, K sequences include: 2 839 sequences, one 839 sequence is the sequence that needs to be truncated;

[0160] M=12, N=139, K sequences include: 3 571 sequences, one 571 sequence is the sequence that needs to be truncated;

[0161] M=16, N=139, K sequences include: 2 839 sequences and 571 sequence, 571 sequence is the sequence that needs to be truncated;

[0162] M=16, N=139, K sequences include: 4 571 sequences, one 571 sequence is the sequence that needs to be truncated;

[0163] M=24, N=139, K sequences include: 4 839 sequences, one 839 sequence is the sequence that needs to be truncated;

[0164] M=24, N=139, K sequences include: 6 571 sequences, one 571 sequence is the sequence that needs to be truncated;

[0165] M=32, N=139, K sequences include: 6 839 sequences, one 839 sequence is the sequence to be truncated;

[0166] M=32, N=139, K sequences include: 8 571 sequences, one 571 sequence is the sequence to be truncated;

[0167] M=48, N=139, K sequences include: 8 839 sequences, one 839 sequence is the sequence that needs to be truncated;

[0168] M=48, N=139, K sequences include: 12 571 sequences, one 571 sequence is the sequence that needs to be truncated;

[0169] M=96, N=139, K sequences include: 16 839 sequences, one 839 sequence is the sequence that needs to be truncated;

[0170] M=96, N=139, K sequences include: 24 571 sequences, and one 571 sequence is a sequence that needs to be truncated.

[0171] In the manner shown in Table 2, the present application can form a first sequence with a length of M×N through at least two sequences.

[0172] It should be noted that the number of sequences in the above K sequences may be less than or equal to M. For example, M=4, N=139, the K sequences include 4 151 sequences, and one 151 sequence needs to be truncated.

[0173] In a possible implementation, the length of each sequence in the K sequences may be the same, or the K sequences include at least two sequences with different lengths.

[0174] When the length of each of the K sequences is the same, the first sequence can be constructed by the same sequence, which can increase the possibility of selecting the K sequences. When the K sequences include at least two sequences of different lengths, the first sequence can be constructed by at least two different sequences, which can also increase the possibility of selecting the K sequences. In summary, through the above scheme, the present application can construct a first sequence with a length of M×N through multiple sequences, thereby increasing the transmission power of the first sequence.

[0175] It should be noted that the sequences listed in Table 2 may be sequences adopted by existing standards or sequences not adopted by existing standards, and this is not limited.

[0176] In a possible implementation, the terminal device determines the first sequence, which may include:

[0177] S2. Truncating the third sequence to obtain the first sequence, wherein the length of the third sequence is greater than the length of the first sequence.

[0178] For a description of S2, please refer to Table 4. The content shown in Table 4 is only used as an example description and is not a final limitation.

[0179] Table 4

[0180] 4*139＝556 571 truncated 6*139＝834 839 truncated

[0181] As shown in Table 4, illustratively:

[0182] M=4, N=139, the third sequence is a 571 sequence, and the 571 sequence is truncated to obtain a first sequence with a length of 556;

[0183] M=8, N=139, the third sequence is a 839 sequence, and the 839 sequence is truncated to obtain a first sequence with a length of 834.

[0184] In the manner shown in Table 4, the present application can obtain a first sequence whose length satisfies M×N by truncating a long sequence. In this way, the embodiment of the present application can construct a first sequence whose length satisfies M×N by truncating a sequence, which can effectively reduce the difficulty of constructing the first sequence.

[0185] In a possible implementation, the terminal device determines the first sequence, which may include:

[0186] S3. Perform cyclic extension on the third sequence to obtain the first sequence, wherein the length of the third sequence is less than the length of the first sequence.

[0187] For example, if the length of the first sequence is 4*139=556, the third sequence with a length of 553 may be cyclically extended, so that the length of the third sequence after cyclic extension may be 556.

[0188] In this way, the embodiment of the present application can perform cyclic extension on a sequence to construct a first sequence with a length satisfying M×N, which can effectively reduce the difficulty of constructing the first sequence.

[0189] In summary, the present application supports generating a first sequence with a length satisfying M×N through any one of S1, S2 and S3, which can not only effectively improve the transmission power of the first sequence, but also increase user capacity and sequence detection performance.

[0190] S402. The terminal device sends a first sequence to the access network device through M resources.

[0191] Correspondingly, the access network device receives the first sequence through M resources.

[0192] For example, M resources can be used to carry the first sequence, and each of the M resources can correspond to part of the information of the first sequence. Exemplarily, the first resource is used to transmit information corresponding to the first subsequence in the first sequence, and the second resource is used to transmit information corresponding to the second subsequence in the first sequence. The information corresponding to the first subsequence is the first information, and the information corresponding to the second subsequence is the second information. In this way, each resource can correspond to the information corresponding to the corresponding subsequence in the first sequence.

[0193] It is understandable that the terminal device needs to perform corresponding processing on the first sequence before sending the first sequence to the access network device. For example, the terminal device performs DFT and IFFT processing on the first sequence. The specific processing method can be referred to the existing technology and will not be repeated here.

[0194] It should be noted that each of the M resources may be an RO or a symbol, without limitation. Among them, an RO resource may include one or more symbols, without limitation. For ease of description, the following takes an RO including one symbol as an example, in other words, taking M resources as M symbols as an example for description.

[0195] It should also be noted that the terminal device needs to perform DFT and IFFT processing on the first sequence before sending it. The information or signal received by the access network device is a plurality of symbols corresponding to the first sequence. For details, see Figures 7 to 9 Description.

[0196] S403: The access network device processes the first sequence.

[0197] For the description of the access network device processing the first sequence, please refer to the description of S202 above, which will not be repeated here.

[0198] In the above scheme, the embodiment of the present application can construct a first sequence whose length satisfies the relationship of M×N. Since the length of the first sequence is relatively long and the first sequence is sent through multiple resources, this can increase the transmission power of the first sequence, thereby effectively improving the reliability of the terminal device accessing the network.

[0199] In addition, for a given cyclic shift interval, a first sequence with a longer length can generate more preamble sequences, which can effectively improve user capacity. At the same time, the cross-correlation performance between different sequences formed by the first sequence with a longer length is better, that is, the cross-correlation coefficient between the preamble codes generated by different ZC root sequences is smaller, so that the detection interference is smaller, thereby effectively improving the sequence correlation detection performance.

[0200] Combined with the following Figures 5 to 9 The sending and receiving of the first sequence is further described.

[0201] Figure 5 is a schematic diagram of the process of sending the first sequence 500 in an embodiment of the present application. Figure 5 As shown, the process includes:

[0202] S501. Split a first sequence to obtain G subsequences.

[0203] S502 . Perform DFT on the G subsequences respectively to obtain G DFT sequences, where the G DFT sequences correspond to the G subsequences one by one.

[0204] S503 , perform IFFT of a first number of points on the G DFT sequences respectively to obtain G symbols, where the G symbols correspond to the G DFT sequences one by one.

[0205] S504. Add CP to each of the G symbols.

[0206] S505: Send G symbols after adding CP.

[0207] Exemplarily, the terminal device can split the first sequence into G subsequences, and perform DFT and IFFT on each subsequence to obtain G symbols, and add CP to each of the G symbols, and finally send the G symbols with added CP through a digital analogue converter (DAC).

[0208] When each of the M resources is an RO, and one RO includes one symbol, M=G; or when each resource is an RO, and one RO includes two symbols, G=2M. The description of M and G also applies to the following and will not be repeated.

[0209] For ease of description, the following description is made by taking the first sequence as {a1, a2, a3, a4, a5, a6, a7, a8, a9, a10} and G=2 as an example.

[0210] The first sequence is divided into subsequence 1 {a1, a2, a3, a4, a5} and subsequence 2 {a6, a7, a8, a9, a10}. Subsequence 1 and subsequence 2 are subjected to DFT with a point number of 5, respectively, to obtain DFT sequence 1 {b1, b2, b3, b4, b5} and DFT sequence 2 {b6, b7, b8, b9, b10}. DFT sequence 1 corresponds to subsequence 1, and DFT sequence 2 corresponds to subsequence 2.

[0211] i. Map DFT sequence 1 and DFT sequence 2 to two consecutive frequency resource blocks: frequency resource block 1 {resource element (RE) 1, RE2, RE3, RE4, RE5} and frequency resource block 2 {RE6, RE7, RE8, RE9, RE10}. Assume there are 10 REs (numbered 1 to 10, with the first number being 10);

[0212] ii. Pad the unoccupied REs of DFT sequence 1 and DFT sequence 2 after resource mapping in the corresponding frequency domain resource blocks with zeros;

[0213] iii. Perform IFFT with 10 points on the zero-padded DFT sequence 1 (RE1 carries b1, RE2 carries b2, RE3 carries b3, RE4 carries b4, RE5 carries b5, and the rest of the REs carry 0 values) and DFT sequence 2 (RE6 carries b6, RE7 carries b7, RE8 carries b8, RE9 carries b9, RE10 carries b10, and the rest of the REs carry 0 values) to obtain symbol 1 and symbol 2. In this way, the spectrum of the received signal of the two DFT sequences is the spectrum of the complete sequence after the corresponding points are summed directly, which is convenient for detection.

[0214] or,

[0215] i. Map DFT sequence 1 and DFT sequence 2 to frequency resource block 1 in sequence: {RE1,RE2,RE3,RE4,RE5}. Assume there are 10 REs (numbered 1 to 10, and the number of IFFT points is 10);

[0216] ii. Pad the REs not occupied by DFT sequence 1 and DFT sequence 2 in frequency domain resource block 1 after resource mapping with zeros;

[0217] iii. Perform IFFT with a point number of 10 on the zero-padded DFT sequence 1 (RE1 carries b1, RE2 carries b2, RE3 carries b3, RE4 carries b4, RE5 carries b5, and the remaining REs carry 0 values) and DFT sequence 2 (RE1 carries b6, RE2 carries b7, RE3 carries b8, RE4 carries b9, RE5 carries b10, and the remaining REs carry 0 values) to obtain symbol 1 and symbol 2. In this way, the spectrum occupied by the two DFT sequences is the same, and the spectrum resources are allocated regularly, which facilitates the access network equipment to allocate the remaining spectrum to other services.

[0218] CP is added to symbol 1 and symbol 2 respectively to obtain symbol 1 {c7, c8, c9, c10, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10} after adding CP (taking adding four-point CP as an example to describe it) and symbol 2 {c17, c18, c19, c20, c11, c12, c13, c14, c15, c16, c17, c18, c19, c20} after adding CP (taking adding four-point CP as an example to describe it).

[0219] The symbol 1 and symbol 2 after adding the CP are converted by the DAC and sent.

[0220] It should be noted that each frequency domain resource block may include one frequency resource or multiple continuous frequency resources, and one frequency domain resource may be one or more REs or resource blocks (RBs), which are not limited to this. The description of the frequency domain resource block is also applicable to the following and will not be repeated.

[0221] It should also be noted that the lengths of subsequence 1 and subsequence 2 can be the same or different, and there is no limitation. For ease of description, the above takes the example that the lengths of each subsequence are the same, but the scenario where the lengths of different subsequences are different is not limited.

[0222] When the lengths of different subsequences in the G subsequences are different, the first number of points is greater than or equal to the value of the maximum length among the lengths corresponding to the G subsequences. In this way, IFFT processing can be completed for each subsequence.

[0223] It should also be noted that when the lengths of different subsequences in the G subsequences are different, the number of frequency domain resources in the corresponding continuous frequency domain resource blocks may also change accordingly, and this is not limited.

[0224] By splitting the first sequence, different parts of the first sequence can be sent in multiple symbols, so as to transmit a longer first sequence under the same subcarrier spacing and time-frequency domain resources.

[0225] It should be noted that, for further description of the DFT and IFFT processing of the first sequence, reference may be made to existing standards, which will not be described in detail herein.

[0226] Figure 6 600 is a flow chart of sending the first sequence 600 in an embodiment of the present application. Figure 6 As shown, the process includes:

[0227] S601. Perform DFT transformation on a first sequence to obtain a DFT sequence.

[0228] S602: Split the DFT sequence to obtain G DFT subsequences.

[0229] S603: Perform IFFT of the first number of points on the G DFT subsequences respectively to obtain G symbols.

[0230] S604. Add CP to each of the G symbols.

[0231] S605: Send G symbols after adding CP.

[0232] Exemplarily, the terminal device performs DFT on the first sequence to obtain a DFT sequence, divides the DFT sequence into G DFT subsequences, performs IFFT transform of the first number of points on the G DFT subsequences to obtain G symbols, adds CP to each of the G symbols, and finally sends the G symbols with CP added through DAC.

[0233] For ease of description, the following description is made by taking the first sequence as {a1, a2, a3, a4, a5, a6, a7, a8, a9, a10} and G=2 as an example.

[0234] Perform DFT on the first sequence to obtain a DFT sequence.

[0235] The DFT sequence is divided into DFT subsequence 1 {b1, b2, b3, b4, b5} and DFT subsequence 2 {b6, b7, b8, b9, b10}.

[0236] For more information about IFFT and subsequent processing of DFT subsequence 1 and DFT subsequence 2, see Figure 5 The description is not repeated here.

[0237] Through the above process, the present application can complete the sending of the first sequence.

[0238] Figure 7 FIG. 7 is a flow chart of receiving the first sequence 700 in an embodiment of the present application. Figure 7 As shown, the process includes:

[0239] S701. Perform CP removal processing on G symbols.

[0240] S702: Perform FFT of a first number of points on the G symbols after CP removal processing to obtain G FFT sequences.

[0241] S703 . Perform IDFT on the G FFT sequences respectively to obtain G IDFT sequences.

[0242] S704. Determine a first sequence according to G IDFT sequences.

[0243] Exemplarily, after receiving G symbols, the access network device processes each symbol as follows: remove CP, sample, downsample after low-pass filtering, FFT transform of the first number of points, de-subcarrier mapping and extract the frequency domain signal of the corresponding FFT sequence (discarding the RE for zero padding), and perform IDFT to obtain G IDFT sequences, and combine the G IDFT sequences in sequence to obtain the IDFT total sequence, and the local subsequences obtained by fractional or integer cyclic shift of the subsequences split from the IDFT total sequence and the ZC root sequence (length is 10) are combined in sequence to obtain the conjugate of the local total sequence, multiply and sum the elements one by one to obtain multiple correlation values, determine the local total sequence with the maximum correlation value, and then determine the first sequence.

[0244] For ease of description, the following description is made by taking G=2 as an example.

[0245] After receiving symbol 1 and symbol 2, CP removal is performed on symbol 1 and symbol 2 respectively (due to lack of uplink synchronization, there will be a delay in sampling time, and 10 sampling points are obtained from the third point as an example for description), and symbol 1 {c9, c10, c1, c2, c3, c4, c5, c6, c7, c8} and symbol 2 {c19, c20, c11, c12, c13, c14, c15, c16, c17, c18} after CP removal are obtained;

[0246] The symbol 1 after CP removal and the symbol 2 after CP removal are respectively subjected to FFT transformation with a point number of 10 to obtain FFT sequence 1 and FFT sequence 2. FFT sequence 1 corresponds to symbol 1, and FFT sequence 2 corresponds to symbol 2.

[0247] Perform IDFT transformation on FFT sequence 1 and FFT sequence 2 respectively to obtain IDFT sequence 1 {a5, a1, a2, a3, a4} and IDFT sequence 2 {a10, a6, a7, a8, a9}. IDFT sequence 1 corresponds to FFT sequence 1, and IDFT sequence 2 corresponds to FFT sequence 2.

[0248] Combine IDFT sequence 1 and IDFT sequence 2 to obtain the IDFT total sequence {a5, a1, a2, a3, a4, a10, a6, a7, a8, a9}. The IDFT total sequence needs to be combined with the subsequences {a1, a2, a3, a4, a5} and {a6, a7, a8, a9, a10} split from the ZC root sequence (length 10) after fractional or integer cyclic shift to obtain the local subsequences obtained by sequentially combining to obtain the conjugate of the local total sequence, and multiply and sum them element by element to obtain multiple correlation values, determine the local total sequence with the maximum correlation value, that is, {a5, a1, a2, a3, a4} and {a10, a6, a7, a8, a9}, and then determine the first sequence.

[0249] Through the above process, the present application can complete the reception of the first sequence.

[0250] It should be noted that Figure 7 In the solution shown, the number of IDFT points and the length of the corresponding FFT sequence are the same or meet a multiple relationship. In this way, the length of the sequence obtained after downsampling after IDFT can be kept consistent with the length of the local sequence.

[0251] Figure 8 FIG. 8 is a flow chart of receiving the first sequence 800 in an embodiment of the present application. Figure 8 As shown, the process includes:

[0252] S801. Perform CP removal processing on G symbols.

[0253] S802: Perform FFT of a first number of points on the G symbols after CP removal processing to obtain G FFT sequences.

[0254] S803. Obtain a fourth sequence according to the G FFT sequences.

[0255] S804. Perform IDFT on the fourth sequence to obtain a fifth sequence.

[0256] S805. Determine the first sequence according to the fifth sequence.

[0257] Exemplarily, after receiving G symbols, the access network device performs the following processing on each symbol: remove CP, sample, downsample after low-pass filtering, perform FFT transform of the first number of points, de-subcarrier mapping, extract the frequency domain signal of the corresponding FFT sequence (discard the zero-padded RE), combine the G FFT sequences in sequence to obtain the FFT total sequence (such as the fourth sequence), conjugate the FFT total sequence with the frequency domain signal of the ZC root sequence (length is 10), and multiply them element by element to obtain the frequency domain signal of the PDP of the same length, perform IDFT transform (the number of IDFT points is twice the length of the first sequence) to obtain the fifth sequence, and determine the first sequence based on the fifth sequence.

[0258] For ease of description, the following description is made by taking G=2 as an example.

[0259] After receiving symbol 1 and symbol 2, remove the CP of symbol 1 and symbol 2 respectively (due to lack of uplink synchronization, the sampling time will be delayed, and 10 sampling points are obtained from the third point as an example for description), and the CP-removed symbol 1 {c9, c10, c1, c2, c3, c4, c5, c6, c7, c8} and symbol 2 {c19, c20, c11, c12, c13, c14, c15, c16, c17, c18} are obtained;

[0260] After the CP is removed, the symbol 1 and the symbol 2 are respectively transformed by an FFT with a point number of 10 to obtain an FFT sequence 1 and an FFT sequence 2. The FFT sequence 1 corresponds to the symbol 1, and the FFT sequence 2 corresponds to the symbol 2.

[0261] The FFT sequence 1 and the FFT sequence 2 are combined to obtain a fourth sequence. Further, the fourth sequence is IDFT-transformed to obtain a fifth sequence.

[0262] The fifth sequence needs to be conjugated with the local total sequence obtained after the ZC root sequence is cyclically shifted by a fraction or integer, and multiplied element by element and summed to obtain multiple correlation values, determine the local total sequence with the maximum correlation value, and then determine the first sequence.

[0263] Through the above process, the present application can complete the reception of the first sequence.

[0264] It should be noted that Figure 8 In the solution shown, the number of IDFT points of the combined sequence is the same as or a multiple of the length of the combined sequence, so that the length of the sequence obtained after downsampling after IDFT can be kept consistent with the length of the local sequence.

[0265] Fig. 9 FIG. 9 is a flow chart of receiving a first sequence 900 according to an embodiment of the present application. Fig. 9 As shown, the process includes:

[0266] S901. Obtain a first symbol according to G symbols.

[0267] S902: Perform a first-point FFT on the first symbol to obtain a sixth sequence.

[0268] S903. Perform IDFT on the sixth sequence to obtain a seventh sequence.

[0269] S904. Determine a first sequence according to the seventh sequence.

[0270] It should be noted that the first symbol is a symbol obtained by removing the CP from the G symbols.

[0271] In a possible implementation, the access network device obtains the first symbol according to the G symbols, which may include:

[0272] S901a1, performing CP removal processing on G symbols;

[0273] S901a2. Combine the G symbols after CP removal to obtain a first symbol.

[0274] For example, the access network device first performs CP removal processing on each symbol, and then sums the sampling points corresponding to each symbol after the CP removal processing to obtain the first symbol.

[0275] For example, taking G=2 as an example, after the access network device receives symbol 1 {c7, c8, c9, c10, c1, c2, c3, c4, c5, c6} and symbol 2 {c17, c18, c19, c20, c11, c12, c13, c14, c15, c16}, it removes CPs for symbol 1 and symbol 2, respectively, and obtains symbol 1 {c7, c8, c9, c10, c1, c2, c3, c4, c5, c6} after CP removal (due to lack of uplink synchronization, the sampling time will be delayed, and 10 sampling points are obtained from the third point as an example for description). c9,c10,c1,c2,c3,c4,c5,c6,c7,c8} and symbol 2 {c19,c20,c11,c12,c13,c14,c15,c16,c17,c18,}, and combine the symbol 1 and symbol 2 after CP removal to obtain the first symbol {c9+c19,c10+c20,c1+c11,c2+c12,c3+c13,c4+c14,c5+c15,c6+c16,c7+c17,c8+c18}.

[0276] In a possible implementation manner, the access network device obtains the first symbol according to the G symbols, and further includes:

[0277] S901b1, combine G symbols to obtain a second symbol;

[0278] S901b2. Perform CP removal processing on the second symbol to obtain the first symbol.

[0279] For example, the access network device first combines G symbols to obtain a second symbol, and then removes the CP from the second symbol to obtain a first symbol.

[0280] For example, taking G=2 as an example, after the access network device receives symbol 1 {c7, c8, c9, c10, c1, c2, c3, c4, c5, c6} and symbol 2 {c17, c18, c19, c20, c11, c12, c13, c14, c15, c16}, it combines symbol 1 and symbol 2 to obtain a second symbol {c7+c17, c8+c18, c9+c19, c10+c20,c1+c11,c2+c12,c3+c13,c4+c14,c5+c15,c6+c16}, and remove the CP of the second symbol to obtain the first symbol {c9+c19,c10+c20,c1+c11,c2+c12,c3+c13,c4+c14,c5+c15,c6+c16,c7+c17,c8+c18}.

[0281] Exemplarily, after receiving G OFDM symbols, the access network device may perform an FFT transformation of a first number of points on a first symbol obtained from the G symbols to obtain a sixth sequence. Thereafter, the access network device may perform an IDFT transformation on the sixth sequence to obtain a seventh sequence, and determine the first sequence based on the seventh sequence.

[0282] For ease of description, the following description is made by taking G=2 as an example.

[0283] After receiving symbol 1 and symbol 2, the first symbol {c9+c19, c10+c20, c1+c11, c2+c12, c3+c13, c4+c14, c5+c15, c6+c16, c7+c17, c8+c18} is obtained according to symbol 1 and symbol 2, and the first symbol is subjected to an FFT transformation with a point number of 10 to obtain a sixth sequence. It should be noted that in the process of performing an FFT transformation on the first symbol, resource demapping (which is the inverse processing of the aforementioned resource mapping) may also be included to obtain the frequency domain resources actually occupied by each symbol;

[0284] The sixth sequence is de-subcarrier mapped, and the corresponding frequency domain signal is extracted (the value of the zero-filled RE is discarded) to obtain the total received sequence, and the conjugate of the frequency domain signal of the ZC root sequence (length is 10) is multiplied element by element to obtain the frequency domain signal of the PDP of the same length, and the sixth sequence is IFFT transformed (the number of points can be 20) to obtain the PDP, and the first sequence is determined according to the position of the detected PDP peak in the sequence.

[0285] Through the above process, the present application can complete the reception of the first sequence.

[0286] Through the above scheme, the embodiment of the present application can construct a first sequence whose length satisfies the M×N relationship. Since the length of the first sequence is relatively long, this can effectively improve the transmission power of the preamble code, so that the reliability of the terminal device accessing the network can be improved. In addition, for a given cyclic shift interval, a first sequence with a longer length can generate more preamble sequences, which can effectively improve the user capacity. At the same time, the mutual correlation performance between different sequences formed by sequences with longer lengths is better, that is, the mutual correlation coefficient between the preamble codes generated by different ZC root sequences is smaller, so that the detection interference is smaller, thereby effectively improving the sequence correlation detection performance.

[0287] In the embodiment of the present application, the first sequence can also be used for information transmission. For example, the first sequence carries the third information. Exemplarily, the length of the first sequence is 556, and the first sequence can generate at most 556 orthogonal ZC sequences, so it can carry at most 9 bits of information (556>512=2 9 ). In this way, the number of bits carried by the information carried by the first sequence can be increased.

[0288] It should be noted that the number of bits of the third information carried by the first sequence is related to the length of the first sequence. For example, if the first sequence is a sequence obtained by truncating the third sequence, the number of bits carried by the third information is related to the length of the first sequence, such as 2. The number of bits carried by the third information is less than or equal to the length of the first sequence; or, if the first sequence is a sequence obtained by truncating the third sequence, the number of bits carried by the third information is related to the length of the third sequence, such as 2. The number of bits carried by the third information is less than or equal to the length of the third sequence; for example, if the first sequence is a sequence obtained by cyclically extending the third sequence, the number of bits carried by the third information is related to the sequence length of the third sequence, such as 2. The number of bits carried by the third information is less than or equal to the length of the third sequence; for another example, if the first sequence is generated based on K sequences, the number of bits carried by the third information is related to the K sequences, such as 2. The number of bits carried by the third information is less than or equal to the product of the lengths of the K sequences, such as 2. The number of bits carried by the third information is less than or equal to the product of the lengths of different sequences in the K sequences, such as 2. The number of bits carried by the third information is less than or equal to the sum of the lengths of the K sequences, such as 2. The number of bits carried by the third information is less than or equal to the sum of the lengths of the K sequences.

[0289] In an embodiment of the present application, in a possible implementation, the first sequence is a sequence multiplied by a modulation symbol, so that the amount of information carried by the first sequence can be further increased.

[0290] Finally, the device embodiment of the embodiment of the present application is introduced.

[0291] In order to implement the functions in the method provided in this application, the terminal device and the access network device may include a hardware structure and / or a software module, and implement the above functions in the form of a hardware structure, a software module, or a hardware structure plus a software module. Whether one of the above functions is executed in the form of a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application and design constraints of the technical solution.

[0292] Fig.10 1 is a schematic block diagram of a communication device 1000 according to an embodiment of the present application. The communication device 1000 includes a processor 1010 and a communication interface 1020, and the processor 1010 and the communication interface 1020 may be interconnected via a bus 1030. The communication device 1000 may be a terminal device or an access network device.

[0293] Optionally, the communication device 1000 may further include a memory 1040. The memory 1040 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or a portable read-only memory (CD-ROM), and the memory 1040 is used for related instructions and data.

[0294] The processor 1010 may be one or more central processing units (CPUs). When the processor 1010 is a CPU, the CPU may be a single-core CPU or a multi-core CPU.

[0295] When the communication apparatus 1000 is a terminal device, exemplarily, the processor 1010 is used to perform the following operations: determine a first sequence; send the first sequence through M resources, etc.

[0296] When the communication apparatus 1000 is an access network device, illustratively, the processor 1010 is configured to perform the following operations: receiving a first sequence; processing the first sequence, etc.

[0297] The above contents are described as examples only. The communication device 1000 is a terminal device or an access network device, which is responsible for executing the methods or steps related to the terminal device or the access network device in the above method embodiments.

[0298] The above description is only an exemplary description. For specific content, please refer to the content shown in the above method embodiment. Fig.10 The implementation of each operation in can also refer to Figure 4-Figure 9 The corresponding description of the method embodiment shown.

[0299] Fig.11 1 is a schematic block diagram of a communication device 1100 according to an embodiment of the present application. The communication device 1100 may be a terminal device or an access network device, or may be a chip or module in the terminal device or the access network device, and is used to implement the method involved in the above embodiment.

[0300] The communication device 1100 includes a transceiver unit 1110 and a processing unit 1120. The transceiver unit 1110 may include a sending unit and a receiving unit. The sending unit is used to perform a sending action of the communication device, and the receiving unit is used to perform a receiving action of the communication device. For ease of description, the embodiment of the present application combines the sending unit and the receiving unit into one transceiver unit. A unified description is given here, and no further description is given later.

[0301] When the communication device 1100 is a terminal device, illustratively, the transceiver unit 1110 is used to send the first sequence through M resources, etc. The processing unit 1120 is used to execute the content of the terminal device involving processing, coordination, etc. For example, the processing unit 1120 is used to determine the first sequence, etc.

[0302] When the communication device 1100 is an access network device, illustratively, the transceiver unit 1110 is used to receive the first sequence. The processing unit 1120 is used to execute the content of the access network device involving processing, coordination, etc. For example, the processing unit 1120 is used to process the first sequence.

[0303] The above contents are described as examples only. The communication device 1100 is a terminal device or an access network device, which is responsible for executing the methods or steps related to the terminal device or the access network device in the above method embodiments.

[0304] Optionally, the communication device 1100 further includes a storage unit 1130, where the storage unit 1130 is used to store a program or code for executing the aforementioned method.

[0305] Fig.10 and Fig.11 The device embodiment shown is used to implement Figure 4-Figure 9 The content described. Fig.10 and Fig.11 The specific execution steps and methods of the device shown can refer to the contents described in the aforementioned method embodiment.

[0306] Fig.12 1 is a schematic block diagram of a communication device 1200 of an embodiment of the present application. The communication device 1200 is used to implement the functions of a terminal device or an access network device. The communication device 1200 may be a chip in a terminal device or an access network device.

[0307] The communication device 1200 includes: an input / output interface 1220 and a processor 1210. The input / output interface 1220 may be an input / output circuit. The processor 1210 may be a signal processor, a chip, or other integrated circuit that can implement the method of the present application. The input / output interface 1220 is used for inputting or outputting signals or data.

[0308] For example, when the communication device 1200 is a terminal device, the input / output interface 1220 is used to send the first sequence through M resources. The processor 1210 is used to determine the first sequence. The processor 1210 is also used to execute part or all of the steps of any method provided in the present application.

[0309] For example, the communication device 1200 is an access network device, and the input / output interface 1220 is used to receive a first sequence. The processor 1210 is used to execute part or all of the steps of any method provided in the present application, for example, to process the first sequence.

[0310] In one possible implementation, the processor 1210 implements the functions implemented by the terminal device or the access network device by executing instructions stored in the memory.

[0311] Optionally, the communication device 1200 also includes a memory.

[0312] Optionally, the processor and memory are integrated together.

[0313] Optionally, the memory is outside the communication device 1200 .

[0314] In a possible implementation, the processor 1210 may be a logic circuit, and the processor 1210 inputs / outputs messages or signals through the input / output interface 1220. The logic circuit may be a signal processor, a chip, or other integrated circuit that can implement the method of the embodiment of the present application.

[0315] The above description of the communication device 1200 is only used as an example. The communication device 1200 can be used to execute the method described in the above embodiment. The specific content can be found in the description of the above method embodiment, which will not be repeated here.

[0316] Fig.13 1 is a schematic block diagram of a communication device 1300 according to an embodiment of the present application. The communication device 1300 may be an access network device or a chip. The communication device 1300 is used to perform the above Figure 4-Figure 9 The operations in the method embodiment shown are performed by the access network device.

[0317] When the communication device 1300 is an access network device, for example, a base station. Fig.13A simplified schematic diagram of the base station structure is shown. The base station includes module 1310, module 1320 and module 1330. Module 1310 is mainly used for baseband processing, controlling the base station, etc.; module 1310 is usually the control center of the base station, which can be generally referred to as a processor, and is used to control the base station to perform the processing operations on the network device side in the above method embodiment. Module 1320 is mainly used to store computer program code and data. Module 1330 is mainly used for receiving and transmitting radio frequency signals and converting radio frequency signals into baseband signals; module 1330 can generally be referred to as a transceiver module, a transceiver, a transceiver circuit, or a transceiver, etc. The transceiver module of module 1330, which can also be referred to as a transceiver or a transceiver, etc., includes an antenna 1333 and a radio frequency circuit ( Fig.13 Not shown), wherein the RF circuit is mainly used for RF processing.

[0318] Optionally, the device for implementing the receiving function in the module 1330 may be regarded as a receiver, and the device for implementing the sending function may be regarded as a transmitter, that is, the module 1330 includes a receiver 1332 and a transmitter 1331. The receiver may also be referred to as a receiving module, a receiver, or a receiving circuit, etc., and the transmitter may be referred to as a transmitting module, a transmitter, or a transmitting circuit, etc.

[0319] Module 1310 and module 1320 may include one or more single boards, each of which may include one or more processors and one or more memories. The processor is used to read and execute the program in the memory to realize the baseband processing function and the control of the base station. If there are multiple single boards, each single board can be interconnected to enhance the processing capability. As an optional implementation, multiple single boards may share one or more processors, or multiple single boards may share one or more memories, or multiple single boards may share one or more processors at the same time.

[0320] For example, in one implementation, the transceiver module of module 1330 is used to perform Figure 4-Figure 9 In the embodiment shown, the access network device performs the related processes of sending and receiving. The processor of module 1310 is used to perform Figure 4-Figure 9 The illustrated embodiment is a process related to processing performed by the access network device.

[0321] Fig.13 This is only an example and not a limitation. The access network device including the processor, memory and transceiver may not rely on Figures 10 to 12 The structure shown.

[0322] When the communication device 1300 is a chip, the chip includes a transceiver, a memory, and a processor. The transceiver may be an input / output circuit or a communication interface; the processor may be a processor, a microprocessor, or an integrated circuit integrated on the chip. The sending operation of the access network device in the above method embodiment may be understood as the output of the chip, and the receiving operation of the access network device in the above method embodiment may be understood as the input of the chip.

[0323] Fig.14 1 is a schematic block diagram of a communication device 1400 of an embodiment of the present application. The communication device 1400 may be a terminal device, a processor or a chip of the terminal device. The communication device 1400 may be used to execute the operations performed by the terminal device in the above method embodiment.

[0324] When the communication device 1400 is a terminal device, Fig.14 FIG. 1 shows a simplified schematic diagram of the structure of a terminal device. Fig.14 As shown, the terminal device includes a processor, a memory, and a transceiver. The memory can store computer program codes, and the transceiver includes a transmitter 1431, a receiver 1432, and a radio frequency circuit ( Fig.14 Not shown), antenna 1433 and input / output device ( Fig.14 not shown).

[0325] The processor is mainly used to process communication protocols and communication data, as well as to control terminal devices, execute software programs, process software program data, etc. The memory is mainly used to store software programs and data. The radio frequency circuit is mainly used for converting baseband signals and radio frequency signals and processing radio frequency signals. The antenna is mainly used to send and receive radio frequency signals in the form of electromagnetic waves. Input and output devices. For example, touch screens, display screens, keyboards, etc. are mainly used to receive data input by users and output data to users. It should be noted that some types of terminal devices may not have input and output devices.

[0326] When data needs to be sent, the processor performs baseband processing on the data to be sent and outputs the baseband signal to the RF circuit. The RF circuit performs RF processing on the baseband signal and then sends the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the terminal device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor. The processor converts the baseband signal into data and processes the data.

[0327] For ease of explanation, Fig.14Only one memory, processor and transceiver are shown. In an actual terminal device product, there may be one or more processors and one or more memories. The memory may also be referred to as a storage medium or a storage device. The memory may be set independently of the processor or integrated with the processor, and the embodiments of the present application do not limit this.

[0328] In the embodiment of the present application, the antenna and the radio frequency circuit with transceiver functions can be regarded as the transceiver module of the terminal device, and the processor with processing function can be regarded as the processing module of the terminal device.

[0329] like Fig.14 As shown, the terminal device includes a processor 1410, a memory 1420, and a transceiver 1430. The processor 1410 may be referred to as a processing unit, a processing board, a processing module, a processing device, etc., and the transceiver 1430 may also be referred to as a transceiver unit, a transceiver, a transceiver device, etc.

[0330] Optionally, the device for implementing the receiving function in the transceiver 1430 may be regarded as a receiving module, and the device for implementing the sending function in the transceiver 1430 may be regarded as a sending module, that is, the transceiver 1430 includes a receiver and a transmitter. A transceiver may sometimes be referred to as a transceiver, a transceiver module, or a transceiver circuit, etc. A receiver may sometimes be referred to as a receiver, a receiving module, or a receiving circuit, etc. A transmitter may sometimes be referred to as a transmitter, a transmitting module, or a transmitting circuit, etc.

[0331] For example, in one implementation, the processor 1410 is used to execute Figure 4-Figure 9 In the embodiment shown, the terminal device performs the processing action, and the transceiver 1430 is used to perform Figure 4-Figure 9 The sending and receiving actions of the terminal device in the middle.

[0332] Fig.14 This is only an example and not a limitation. The terminal device including the transceiver module and the processing module may not rely on Figures 10 to 12 The structure shown.

[0333] When the communication device 1400 is a chip, the chip includes a processor, a memory and a transceiver. The transceiver may be an input / output circuit or a communication interface; the processor may be a processing module or a microprocessor or an integrated circuit integrated on the chip.

[0334] The sending operation of the terminal device in the above method embodiment can be understood as the output of the chip.

[0335] The receiving operation can be understood as the input of the chip.

[0336] The present application also provides a chip, including a processor, for calling and executing instructions stored in a memory from the memory, so that a communication device equipped with the chip executes the methods in the above examples.

[0337] The present application also provides another chip, including: an input interface, an output interface, and a processor, wherein the input interface, the output interface, and the processor are connected via an internal connection path, and the processor is used to execute the code in the memory, and when the code is executed, the processor is used to execute the method in each of the above examples. Optionally, the chip also includes a memory, and the memory is used to store computer programs or codes.

[0338] The present application also provides a processor, which is coupled to a memory and is used to execute the methods and functions involving a network device or a terminal device in any of the above-mentioned embodiments.

[0339] In another embodiment of the present application, a computer program product including instructions is provided. When the computer program product is run on a computer, the method of the above embodiment is implemented.

[0340] The present application also provides a computer program. When the computer program is executed in a computer, the method of the above embodiment is implemented.

[0341] In another embodiment of the present application, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a computer, the method described in the above embodiment is implemented.

[0342] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0343] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0344] In several embodiments provided in the present application, the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0345] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0346] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0347] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods of each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks, or optical disks.

[0348] The above are only specific implementations of the embodiments of the present application, but the protection scope of the embodiments of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or replacements within the technical scope disclosed in the embodiments of the present application, which should be included in the protection scope of the embodiments of the present application. Therefore, the protection scope of the embodiments of the present application shall be based on the protection scope of the claims.

Claims

1. A communication method, characterized in that: include: Determine a first sequence, where the first sequence is used for random access, and a length of the first sequence satisfies: M×N, where N is a length of a second sequence, M is a number of repetitions of the second sequence, M is a positive integer greater than 1, and N is a positive integer; The first sequence is sent through M resources, a first resource among the M resources corresponds to first information in the first sequence, a second resource among the M resources corresponds to second information in the first sequence, the first resource is different from the second resource, and the first information is different from the second information.

2. The method according to claim 1, characterized in that The determining of the first sequence comprises: The first sequence is generated according to K sequences, where the K sequences include at least one sequence that needs to be truncated, and K is a positive integer less than or equal to M.

3. The method according to claim 2, characterized in that The length of each sequence in the K sequences is the same; or, The K sequences include at least two sequences with different lengths.

4. The method according to claim 1, characterized in that: The determining of the first sequence comprises: Cyclic extension is performed on a third sequence to obtain the first sequence, wherein the length of the third sequence is less than the length of the first sequence; or, The third sequence is truncated to obtain the first sequence, and the length of the third sequence is greater than the length of the first sequence.

5. The method according to any one of claims 1 to 4, characterized in that The sending the first sequence comprises: Splitting the first sequence to obtain G subsequences, where G is a positive integer greater than or equal to 2; Performing discrete Fourier transform DFT on the G subsequences respectively to obtain G DFT sequences, where the G DFT sequences correspond one-to-one to the G subsequences; Performing an inverse fast Fourier transform IFFT of a first number of points on the G DFT sequences respectively to obtain G symbols, wherein the G DFT sequences correspond to the G symbols one by one; Adding a cyclic prefix CP to each of the G symbols; The G symbols to which the CP is added are transmitted.

6. The method according to claim 5, characterized in that The step of performing IFFT of a first number of points on the G DFT sequences to obtain G symbols comprises: Mapping the G DFT sequences to G consecutive frequency resource blocks in sequence, each frequency resource block including one frequency resource or multiple consecutive frequency resources; Filling zeros on unoccupied frequency domain resources in corresponding frequency domain resource blocks of the G DFT sequences after resource mapping; Performing IFFT of the first number of points on the G DFT sequences after zero padding, respectively, to obtain the G symbols; The value of the first point number is greater than or equal to the value of the length of the first sequence.

7. The method according to claim 5, characterized in that The performing IFFT on the G DFT sequences respectively to obtain G symbols comprises: Mapping the G DFT sequences to the same frequency resource block respectively, where the frequency resource block includes one frequency resource or multiple continuous frequency resources, and padding the frequency domain resources not occupied by each DFT sequence in the G DFT sequences in the frequency domain resource block with zeros; Performing IFFT of the first number of points on the G DFT sequences after zero padding, respectively, to obtain the G symbols; The value of the first point number is greater than or equal to the value of the maximum length among the lengths corresponding to the G subsequences.

8. The method according to any one of claims 1 to 4, characterized in that The sending the first sequence comprises: Performing DFT on the first sequence to obtain a DFT sequence; Splitting the DFT sequence to obtain G DFT subsequences, where G is a positive integer greater than or equal to 2; Performing IFFT of a first number of points on the G DFT subsequences respectively to obtain G symbols, where the G symbols correspond one-to-one to the G DFT subsequences; Adding a CP to each of the G symbols; The G symbols to which the CP is added are transmitted.

9. The method according to claim 8, characterized in that The step of performing IFFT of a first number of points on the G DFT subsequences to obtain G symbols comprises: Mapping the G DFT sub-blocks to G consecutive frequency resource blocks in sequence, each frequency resource block including one frequency resource or multiple consecutive frequency resources; Filling zeros on the frequency domain resources not occupied by the G DFT sub-subs in the corresponding frequency domain resource blocks after resource mapping; Performing IFFT with the first number of points on the G DFT sequences after zero padding, respectively, to obtain the G symbols; The value of the first point number is greater than or equal to the value of the length of the first sequence.

10. The method according to claim 8, characterized in that The step of performing IFFT of a first number of points on the G DFT sequences to obtain G symbols comprises: Mapping the G DFT sequences to the same frequency resource block respectively, where the frequency resource block includes one frequency resource or multiple continuous frequency resources, and padding the frequency domain resources not occupied by each DFT sequence in the G DFT sequences in the frequency domain resource block with zeros; Performing IFFT of the first number of points on the G DFT sequences after zero padding, respectively, to obtain the G symbols; The value of the first point number is greater than or equal to the value of the maximum length among the lengths corresponding to the G subsequences.

11. The method according to any one of claims 1 to 10, characterized in that The first sequence carries third information, and the number of bits carried by the third information is related to the length of the first sequence.

12. The method according to any one of claims 1 to 11, characterized in that The first sequence is a sequence multiplied by a modulation symbol.

13. A communication method, characterized in that: include: Receive a first sequence through M resources, where the first sequence is used for random access, and the length of the first sequence satisfies: M×N, where N is the sequence length of a second sequence, M is the number of repetitions of the second sequence, M is a positive integer greater than 1, and N is a positive integer. A first resource among the M resources corresponds to first information in the first sequence, and a second resource among the M resources corresponds to second information in the first sequence. The first resource is different from the second resource, and the first information is different from the second information. The first sequence is processed.

14. The method according to claim 13, characterized in that The first sequence is generated according to K sequences, where the K sequences include at least one sequence that needs to be truncated, and K is a positive integer less than or equal to M.

15. The method according to claim 14, characterized in that The length of each sequence in the K sequences is the same; or, The K sequences include at least two sequences with different lengths.

16. The method according to claim 13, characterized in that The first sequence is obtained by cyclically extending the third sequence, and the length of the third sequence is shorter than the length of the first sequence.

17. The method according to claim 13, characterized in that The first sequence is obtained by truncating the third sequence, and the length of the third sequence is greater than the length of the first sequence.

18. The method according to any one of claims 13 to 17, characterized in that The receiving the first sequence comprises: Performing CP removal processing on G symbols, where the G symbols correspond to the first sequence; Performing fast Fourier transform FFT of a first number of points on the G symbols after CP removal processing, respectively, to obtain G FFT sequences, the G FFT sequences correspond to the G symbols one by one, and the value of the first number of points is greater than or equal to the value of the length of the G FFT sequences; Performing inverse discrete Fourier transform IDFT on the G FFT sequences respectively to obtain G IDFT sequences, where the G IDFT sequences correspond one-to-one to the G FFT sequences; The first sequence is determined according to the G IDFT sequences.

19. The method according to any one of claims 13 to 17, characterized in that The receiving the first sequence comprises: Performing CP removal processing on G symbols, where the G symbols correspond to the first sequence; Performing FFT of a first number of points on the G symbols after CP removal processing to obtain G FFT sequences, the G DFT sequences correspond to the G symbols one-to-one, and the value of the first number of points is greater than or equal to the value of the length of the G DFT sequences; Obtain a fourth sequence according to the G FFT sequences; Performing IDFT on the fourth sequence to obtain a fifth sequence; The first sequence is determined according to the fifth sequence.

20. The method according to any one of claims 13 to 17, characterized in that The receiving the first sequence comprises: Obtain a first symbol according to the G symbols, where the first symbol is a symbol obtained after the G symbols are subjected to CP removal processing, and the G symbols correspond to the first sequence; Performing a first-point FFT on the first symbol to obtain a sixth sequence, where a value of the first point is greater than or equal to a value of a length of the sixth sequence; Performing IDFT on the sixth sequence to obtain a seventh sequence; The first sequence is determined according to the seventh sequence.

21. The method according to claim 20, characterized in that The obtaining a first symbol according to the G symbols comprises: Performing CP removal processing on the G symbols; The G symbols after CP removal processing are combined to obtain the first symbol.

22. The method according to claim 20, characterized in that The obtaining a first symbol according to the G symbols comprises: Combining the G symbols to obtain a second symbol; Perform CP removal processing on the second symbol to obtain the first symbol.

23. The method according to any one of claims 13 to 22, characterized in that The first sequence carries third information, and the number of bits carried by the third information is related to the length of the first sequence.

24. The method according to any one of claims 13 to 23, characterized in that The first sequence is a sequence multiplied by a modulation symbol.

25. A communication device, characterized in that: comprising a processor configured to, by executing a computer program or instructions, or, by means of a logic circuit, enabling the communication device to perform the method according to any one of claims 1 to 12; or, The communication device is enabled to execute the method according to any one of claims 13 to 24.

26. The communication device according to claim 25, characterized in that: The communication device further comprises a memory for storing the computer program or instructions.

27. The communication device according to claim 25 or 26, characterized in that: The communication device further comprises a communication interface, and the communication interface is used for inputting and / or outputting signals.

28. A communication device, characterized in that: It includes a logic circuit and an input / output interface, wherein the input / output interface is used to input and / or output signals. The logic circuit is used to execute the method according to any one of claims 1 to 12; or, The logic circuit is configured to execute the method according to any one of claims 13 to 24.

29. A computer-readable storage medium, characterized in that: The computer readable storage medium stores a computer program or instruction. When the computer program or instruction is executed on a computer, so that the method of any one of claims 1 to 12 is performed; or, The method according to any one of claims 13 to 24 is performed.

30. A computer program product, characterized in that Contains instructions that, when executed on a computer, so that the method of any one of claims 1 to 12 is performed; or, The method according to any one of claims 13 to 24 is performed.

Images