Communication method and communication apparatus

Abstract

The present application relates to the technical field of communications. Provided are a communication method and a communication apparatus. The communication method comprises: a terminal device transmitting a first sequence to an access network device by means of M resources, wherein the first sequence is used for random access, and the length of the first sequence satisfies: M×N, N being the length of a second sequence, M being the number of repetitions of the second sequence, M being a positive integer greater than or equal to 2, and N being a positive integer. Among the M resources, a first resource corresponds to first information in the first sequence, and a second resource corresponds to second information in the first sequence, wherein the first resource is different from the second resource, and the first information is different from the second information. Thus, by constructing a first sequence with a longer length and transmitting the first sequence by means of a plurality of resources, the transmission power of the first sequence can be increased, and thus the reliability of a terminal device accessing a network can be effectively improved.

Description

Communication method and communication device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on September 28, 2023, with application number 202311289994.9 and application name “Communication Method and Communication Device”, the entire contents of which are incorporated by reference into this application. Technical Field

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

[0003] 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. The RAR information includes the 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 a message 4 to the terminal device to indicate that the terminal device has successfully accessed.

[0004] 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.

[0005] Summary of the Invention

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

[0007] In a first aspect, a communication method is provided, including: determining a first sequence, where the first sequence is used for random access, and the length of the first sequence satisfies: M×N, where 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, where 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.

[0008] The execution subject of the solution described in the first aspect can be a terminal device, or a chip or integrated circuit in the terminal device, etc., without limitation. For ease of description, the following description takes the terminal device as an example.

[0009] In 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 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.

[0010] Furthermore, for a given cyclic shift interval, a longer first sequence can generate more preamble sequences, effectively increasing user capacity. Furthermore, longer first sequences provide better cross-correlation between different sequences. Specifically, the cross-correlation coefficients between preamble codes generated by different Zadoff-Chu (ZC) root sequences are smaller, resulting in less detection interference and effectively improving sequence correlation detection performance.

[0011] In a possible implementation, determining the first sequence includes generating the first sequence based on 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.

[0012] In this way, the embodiment of the present application can construct a first sequence with a length of M×N based on multiple sequences, thereby increasing the transmission power of the first sequence.

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

[0014] When each of the K sequences has the same length, the first sequence can be constructed from the same sequence, which can increase the likelihood of selecting the K sequences. When the K sequences include at least two sequences of different lengths, the first sequence can be constructed from at least two different sequences, which can also increase the likelihood of selecting the K sequences.

[0015] Through the above solution, 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.

[0016] In one possible implementation, determining the first sequence includes: 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.

[0017] 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.

[0018] A possible implementation manner includes sending 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 transform (DFT) on the G subsequences to obtain G DFT sequences, and the G DFT sequences correspond one-to-one to the G subsequences; 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 one-to-one to the G symbols; adding a cyclic prefix (CP) to each of the G symbols; and sending the G symbols after the CP is added.

[0019] 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.

[0020] In one possible implementation, performing an IFFT of a first number of points on each of G DFT sequences to obtain G symbols includes: sequentially mapping the G DFT sequences to G consecutive frequency resource blocks, each frequency resource block including one frequency resource or multiple consecutive frequency resources; padding the unoccupied frequency domain resources of the G DFT sequences after resource mapping with zeros in the corresponding frequency domain resource blocks; and performing an IFFT of a first number of points on each of the G zero-padded DFT sequences 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.

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

[0022] In one possible implementation, performing IFFT on G DFT sequences to obtain G symbols includes: mapping the G DFT sequences to a same frequency resource block, where the same frequency resource block includes one frequency resource or multiple consecutive frequency resources, and padding unoccupied frequency domain resources of each of the G DFT sequences in the same frequency domain resource block with zeros; and performing IFFT on the G zero-padded DFT sequences with a first number of points 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.

[0023] 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 easier for the access network equipment to allocate the remaining spectrum to other services.

[0024] A possible implementation method includes sending 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, where 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.

[0025] 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.

[0026] A possible implementation method includes performing an IFFT of a first number of points on each of G DFT subsequences to obtain G symbols, including: sequentially mapping the G DFT subsequences to G consecutive frequency resource blocks, each frequency resource block including one frequency resource or multiple consecutive frequency resources; padding unoccupied frequency domain resources in the corresponding frequency domain resource blocks of the G DFT subsequences after resource mapping with zeros; and performing an IFFT of a first number of points on each of the G zero-padded DFT sequences 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.

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

[0028] In one possible implementation, performing an IFFT of a first number of points on each of G DFT sequences to obtain G symbols includes: mapping the G DFT sequences to a same frequency resource block, where the same frequency resource block includes one frequency resource or multiple consecutive frequency resources, and padding unoccupied frequency domain resources of each of the G DFT sequences in the same frequency domain resource block with zeros; and performing an IFFT of the first number of points on each of the G zero-padded DFT sequences 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.

[0029] 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 easier for the access network equipment to allocate the remaining spectrum to other services.

[0030] In one possible implementation, 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. In this way, the number of bits carried by the information carried by the first sequence can be increased.

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

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

[0033] 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, the first resource among the M resources corresponds to the first information in the first sequence, the second resource among the M resources 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; processing the first sequence.

[0034] The execution subject of the solution described in the second aspect can be an access network device, or a chip or integrated circuit in the access network device, etc., which is not limited to this. For ease of description, the following description takes the access network device as an example.

[0035] In 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 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.

[0036] In a possible implementation, the first sequence is generated based on 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.

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

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

[0039] In a possible implementation, 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.

[0040] A possible implementation method for processing a first sequence includes: performing CP removal processing on G symbols, where the G symbols correspond to the first sequence; performing a fast Fourier transform (FFT) of a first number of points on the G symbols after the CP removal processing to obtain G FFT sequences, where 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 an inverse discrete Fourier transform (IDFT) on the G FFT sequences to obtain G IDFT sequences, where the G IDFT sequences correspond one-to-one to the G FFT sequences; and determining the first sequence based on the G IDFT sequences.

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

[0042] A possible implementation method includes receiving a first sequence, including: 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 the CP removal processing to obtain G FFT sequences, where the G DFT 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 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.

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

[0044] A possible implementation method includes receiving a first sequence, including: obtaining a first symbol based on G symbols, where the first symbol is a symbol obtained after CP removal processing is performed on the G symbols, and the G symbols correspond to the first sequence; performing an FFT of a first point number on the first symbol to obtain a sixth sequence, where the value of the first point number is greater than or equal to the value of the length of the sixth sequence; performing an IDFT on the sixth sequence to obtain a seventh sequence; and determining the first sequence based on the seventh sequence.

[0045] Through the above process, this application can complete the reception of the first sequence.

[0046] A possible implementation manner is to obtain the 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.

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

[0048] In a possible implementation, 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.

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

[0050] In a third aspect, a communication device is provided. The communication device may be a network device, or a device or module for performing the functions of a network 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 first aspect. The module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.

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

[0053] 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 hardware circuit and software.

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

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

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

[0057] In the 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.

[0058] 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 possible method of the first aspect is executed; or, the method described in the second aspect and any possible method of the second aspect is executed.

[0059] 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.

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

[0061] FIG1 is a schematic diagram of the architecture of a communication system 100 applicable to an embodiment of the present application.

[0062] FIG2 is a schematic diagram of a process of contention-based random access 200 .

[0063] FIG3 is a schematic diagram of a cyclic shift 300 .

[0064] FIG4 is a schematic diagram of an interaction flow of a communication method 400 according to an embodiment of the present application.

[0065] FIG5 is a schematic diagram of a process of sending a first sequence 500 according to an embodiment of the present application.

[0066] FIG6 is a schematic diagram of a process of sending a first sequence 600 according to an embodiment of the present application.

[0067] FIG7 is a schematic diagram of a process of receiving a first sequence 700 according to an embodiment of the present application.

[0068] FIG8 is a schematic diagram of a process of receiving a first sequence 800 according to an embodiment of the present application.

[0069] FIG9 is a schematic diagram of a process of receiving a first sequence 900 according to an embodiment of the present application.

[0070] FIG10 is a schematic block diagram of a communication device 1000 according to an embodiment of the present application.

[0071] FIG11 is a schematic block diagram of a communication device 1100 according to an embodiment of the present application.

[0072] FIG12 is a schematic block diagram of a communication device 1200 according to an embodiment of the present application.

[0073] FIG13 is a schematic block diagram of a communication device 1300 according to an embodiment of the present application.

[0074] FIG14 is a schematic block diagram of a communication device 1400 according to an embodiment of the present application. DETAILED DESCRIPTION

[0075] The technical solution in this application will be described below with reference to the accompanying drawings.

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

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

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

[0079] 3. The various numerical 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 order of execution 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.

[0080] At the same time, any embodiment or design described in this 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 the relevant concepts in a concrete manner to facilitate understanding.

[0081] 4. The terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus that includes 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.

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

[0083] 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. For example, 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 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, it is also possible to enable specific information with the help of the arrangement order of each piece of information agreed in advance (for example, stipulated by the protocol), thereby reducing the enabling overhead to a certain extent. At the same time, it is also possible to identify the common parts of each piece of information and enable them uniformly to reduce the enabling overhead caused by enabling the same information separately.

[0084] 6. In this application, "pre-configuration" may include pre-definition, such as protocol definition. "Pre-definition" may be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in a device (e.g., including each network element). This application does not limit the specific implementation method.

[0085] 7. "Storage" or "saving" as used in this application may refer to storage in one or more memories. The one or more memories may be provided separately or integrated into an encoder or decoder, a processor, or a communication device. The one or more memories may also be provided in part separately and in part integrated into a decoder, processor, or communication device. The type of memory may be any form of storage medium and is not limited thereto.

[0086] 8. The “protocol” referred to in this application may refer to a standard protocol in the field of communications, such as the fourth generation (4G) th generation, 4G) network, fifth generation (5 th generation, 5G) network protocol, NR protocol, 5.5G network protocol, sixth generation (6 th generation, 6G) network protocols and related protocols used in future communication systems, which are not limited in this application.

[0087] 9. The arrows or boxes indicated by dotted lines in the schematic diagrams in the accompanying drawings of this application specification represent optional steps or optional modules.

[0088] 10. Unless otherwise specified, “ / ” indicates that the objects associated with each other are in an “or” relationship. For example, A / B can mean A or B. “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 mean: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural.

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

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

[0091] A terminal device is a device with wireless transceiver capabilities and 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.

[0092] 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 capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a communication device carried on a high-altitude aircraft, a wearable device, a drone, a robot, a terminal in device-to-device (D2D) communication, 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 care, a smart grid, or a wireless terminal in industrial control. There are no restrictions on wireless terminals in the wireless grid, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, or terminal devices in communication networks evolved after 5G.

[0093] The communication device used to implement the functions of the terminal device can be the terminal device, or it can be a device that can support the terminal device to implement the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In this application, the chip system can be composed of a chip or include a chip and other discrete devices.

[0094] 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) in LTE; or a base station in a 5G network such as gNodeB (gNB) or a base station in a public land mobile network (PLMN) that evolves after 5G, a broadband network gateway (BNG), an aggregation switch, or the 3GPP (3rd Generation Partnership Project). rd generation partnership project, 3GPP) access equipment, etc.

[0095] 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). Access network equipment can also include various forms of base stations, such as: macro base stations, micro base stations (also known as small stations), relay stations, transmission points (transmitting and receiving points, TRPs), transmission points (transmitting points, TPs), mobile switching centers, and devices that perform base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, network equipment in non-terrestrial networks (NTNs), etc., without specific limitation.

[0096] 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 functions 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 RU in the O-RAN system, etc., without limitation.

[0097] The communication device used to implement the functions of the access network device can be the access network device, or it can be a device that can support the access network device to implement the functions, such as a chip system. The device can be installed in the access network device or used in conjunction with the access network device. The chip system in the embodiments of the present application can be composed of a chip, or it can include a chip and other discrete devices.

[0098] In the communication system 100 , a terminal device needs to access the network through a random access process, as shown in FIG2 .

[0099] FIG2 is a schematic diagram of a contention-based random access process 200. As shown in FIG2 , the random access process 200 includes:

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

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

[0102] 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. Furthermore, the terminal device randomly selects a preamble code from the selected RO (up to 64 preamble codes can be transmitted simultaneously on an RO) for transmission.

[0103] 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 the threshold, or randomly select the index of an SSB, and there is no limitation on this.

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

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

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

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

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

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

[0110] 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.

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

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

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

[0114] 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.

[0115] 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.

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

[0117] 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.

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

[0119] 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 effects of multipath propagation.

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

[0121] 3) GI: This is related to the cell's coverage radius. Generally, access network equipment must ensure that no other information is transmitted on the uplink resources where the preamble might be sent. In the initial access scenario, the access network equipment must account for the uncertainty of preamble reception timing. The preambles sent by central users and edge users arrive at the access network equipment at different times. The maximum allowable difference between the two is the GI.

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

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

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

[0125] 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.

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

[0127] μ: 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.

[0128] 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.

[0129] Table 1

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

[0131] Based on a specific ZC root sequence, more zero-correlation preamble sequences can be generated through cyclic shifting. Cyclic shifting involves shifting the ZC root sequence end to end by a certain number of bits, as shown in Figure 3.

[0132] FIG3 is a schematic diagram of a cyclic shift 300. As shown in FIG3 , the length L of the ZC root sequence is RA The ZC root sequence is 10, and 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 cyclic shift can be:

[0134] 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 preamble sequences that can be generated by a ZC root sequence, which is equal to L RA / N CS Round down, such as L RA is 139, N CS is 19, then v=7.

[0135] Example of generating 64 preamble sequences:

[0136] 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 3GPP TS 38.211 V15.7.0, the corresponding zeroCorrelationZoneConfig is 10, as shown in Table 2.

[0137] Table 2

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

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

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

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

[0142] For ease of understanding and explanation, the following description uses the interaction between a terminal device and an access network device as an example to describe the communication method of the embodiments of the present application. However, this does not limit the execution subject of the communication method of the embodiments of the present application. For example, the terminal device can be replaced with a component configured in the terminal device (such as a circuit, chip, or chip system, etc.), and the access network device can be replaced with a component configured in the access network device (such as a circuit, chip, or chip system, etc.).

[0143] FIG4 is a schematic diagram of an interaction flow of a communication method 400 according to an embodiment of the present application. As shown in FIG4 , the method 400 includes:

[0144] S401: The terminal device determines a first sequence.

[0145] 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.

[0146] The length of the first sequence satisfies the following formula: 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 of the second sequence after M repetitions. This allows the preamble's transmit power to be increased by constructing a longer sequence.

[0147] In one possible implementation, the terminal device determining the first sequence may include:

[0148] 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.

[0149] For a description of S1, please refer to Table 3. The contents shown in Table 3 are only for example description and are not intended as a final limitation.

[0150] Table 3

[0151] As shown in Table 3, illustratively:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0167] As shown in Table 2, the present application can construct a first sequence with a length of M×N through at least two sequences.

[0168] 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.

[0169] In one 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.

[0170] When the lengths of the K sequences are the same, the first sequence can be constructed from the same sequence, which increases the likelihood of selecting the K sequences. When the K sequences include at least two sequences of different lengths, the first sequence can be constructed from at least two different sequences, which also increases the likelihood of selecting the K sequences. In summary, through the above solution, the present application can construct a first sequence with a length of M×N from multiple sequences, thereby increasing the transmit power of the first sequence.

[0171] 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.

[0172] In one possible implementation, the terminal device determining the first sequence may include:

[0173] 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.

[0174] For a description of S2, please refer to Table 4. The contents shown in Table 4 are only for example description and are not intended as a final limitation.

[0175] Table 4

[0176] As shown in Table 4, illustratively:

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

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

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

[0180] In one possible implementation, the terminal device determining the first sequence may include:

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

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

[0183] 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.

[0184] In summary, this application supports generating a first sequence with a length of 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.

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

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

[0187] For example, M resources can be used to carry a 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 a first subsequence in the first sequence, and the second resource is used to transmit information corresponding to a 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 a corresponding subsequence in the first sequence.

[0188] 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.

[0189] It should be noted that each of the M resources can be an RO or a symbol, without limitation. An RO resource can include one or more symbols, without limitation. For ease of description, the following example uses an RO including one symbol. In other words, the description is based on an example where M resources are M symbols.

[0190] 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 multiple symbols corresponding to the first sequence. For details, please refer to the description of Figures 7 to 9.

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

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

[0193] In 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 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.

[0194] Furthermore, for a given cyclic shift interval, a longer first sequence can generate more preamble sequences, effectively increasing user capacity. Furthermore, longer first sequences provide better cross-correlation between different sequences. Specifically, the cross-correlation coefficients between preamble codes generated by different ZC root sequences are smaller, resulting in less detection interference and effectively improving sequence correlation detection performance.

[0195] The sending and receiving of the first sequence will be further described below with reference to FIG. 5 to FIG. 9 .

[0196] FIG5 is a schematic diagram of a process of sending a first sequence 500 according to an embodiment of the present application. As shown in FIG5 , the process includes:

[0197] S501: Split the first sequence to obtain G subsequences.

[0198] S502 . Perform DFT on the G subsequences respectively to obtain G DFT sequences, where the G DFT sequences correspond to the G subsequences in a one-to-one manner.

[0199] S503 : Perform IFFT of a first number of points on the G DFT sequences respectively to obtain G symbols, where the G symbols correspond one-to-one to the G DFT sequences.

[0200] S504: Add a CP to each of the G symbols.

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

[0202] 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).

[0203] 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 is not repeated here.

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

[0205] The first sequence is divided into subsequence 1 {a1, a2, a3, a4, a5} and subsequence 2 {a6, a7, a8, a9, a10}. A 5-point DFT is performed on subsequence 1 and subsequence 2, 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.

[0206] i. Map DFT sequences 1 and 2 to two consecutive frequency resource blocks: frequency resource block 1 {resource elements (REs) 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 RE being 10).

[0207] ii. After resource mapping, the unoccupied REs of DFT sequence 1 and DFT sequence 2 in the corresponding frequency domain resource blocks are padded with zeros;

[0208] iii. Perform a 10-point IFFT 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 the value 0) and DFT sequence 2 (RE6 carries b6, RE7 carries b7, RE8 carries b8, RE9 carries b9, RE10 carries b10, and the remaining REs carry the value 0) to obtain Symbol 1 and Symbol 2. The spectra of the received signals of the two DFT sequences are directly summed at corresponding points to obtain the spectrum of the complete sequence, facilitating detection.

[0209] or,

[0210] 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);

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

[0212] iii. Perform a 10-point IFFT 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 the value 0) and DFT sequence 2 (RE1 carries b6, RE2 carries b7, RE3 carries b8, RE4 carries b9, RE5 carries b10, and the remaining REs carry the value 0), respectively, to obtain Symbol 1 and Symbol 2. This ensures that the two DFT sequences occupy the same spectral locations, aligning spectrum resource allocation and facilitating the allocation of remaining spectrum to other services by the access network equipment.

[0213] 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 the addition of 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 the addition of four-point CP as an example to describe it).

[0214] The DAC converts the symbol 1 and symbol 2 after adding the CP and transmits them.

[0215] It should be noted that each frequency domain resource block may include one frequency resource or multiple consecutive 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 also applies to the following and will not be repeated here.

[0216] 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 example uses the same length for each subsequence, but does not limit the scenario where different subsequences have different lengths.

[0217] 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.

[0218] 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.

[0219] 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.

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

[0221] FIG6 is a schematic diagram of a process of sending a first sequence 600 according to an embodiment of the present application. As shown in FIG6 , the process includes:

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

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

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

[0225] S604: Add a CP to each of the G symbols.

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

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

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

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

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

[0231] Regarding the IFFT and subsequent processing of the DFT subsequence 1 and the DFT subsequence 2, reference may be made to the description of FIG5 , which will not be repeated here.

[0232] Through the above process, this application can complete the sending of the first sequence.

[0233] FIG7 is a schematic diagram of a process of receiving a first sequence 700 according to an embodiment of the present application. As shown in FIG7 , the process includes:

[0234] S701: Perform CP removal processing on G symbols.

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

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

[0237] S704: Determine a first sequence according to the G IDFT sequences.

[0238] Exemplarily, after receiving G symbols, the access network device performs the following processing on each symbol: CP removal, sampling, downsampling after low-pass filtering, FFT transform of the first number of points, de-subcarrier mapping and extraction of the frequency domain signal of the corresponding FFT sequence (discarding the RE for zero padding), and IDFT to obtain G IDFT sequences, which are sequentially combined 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 sequentially combined to obtain the conjugate of the local total sequence, element-by-element multiplication and summation to obtain multiple correlation values, determine the local total sequence with the maximum correlation value, and then determine the first sequence.

[0239] For ease of description, the following description is made using G=2 as an example.

[0240] After receiving symbol 1 and symbol 2, CP processing is performed on each symbol 1 and symbol 2 (due to the lack of uplink synchronization, the sampling time will be delayed. Taking 10 sampling points starting from the third point as an example for description), 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.

[0241] After the CP is removed, symbol 1 and symbol 2 are respectively subjected to an FFT transformation with a point number of 10 to obtain an FFT sequence 1 and an FFT sequence. FFT sequence 1 corresponds to symbol 1, and FFT sequence 2 corresponds to symbol 2.

[0242] 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.

[0243] 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 is combined with the local subsequences {a1, a2, a3, a4, a5} and {a6, a7, a8, a9, a10}, which are obtained by fractional or integer cyclic shifting of the ZC root sequence (length 10). These subsequences are then combined to obtain the conjugate of the local total sequence. These subsequences are then element-wise multiplied and summed to obtain multiple correlation values. The local total sequences with the maximum correlation values, namely {a5, a1, a2, a3, a4} and {a10, a6, a7, a8, a9}, are then determined to determine the first sequence.

[0244] Through the above process, this application can complete the reception of the first sequence.

[0245] It should be noted that in the solution shown in Figure 7, the number of IDFT points and the length of the corresponding FFT sequence are the same or multiples of each other. This ensures that the length of the sequence obtained after downsampling after the IDFT is consistent with the length of the local sequence.

[0246] FIG8 is a schematic diagram of a process of receiving a first sequence 800 according to an embodiment of the present application. As shown in FIG8 , the process includes:

[0247] S801: Perform CP removal processing on G symbols.

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

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

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

[0251] S805: Determine the first sequence according to the fifth sequence.

[0252] 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 (the zero-padding RE will be discarded), and sequentially combine the G FFT sequences to obtain the FFT total sequence (such as the fourth sequence), the FFT total sequence is conjugated with the frequency domain signal of the ZC root sequence (length is 10), and multiplied 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.

[0253] For ease of description, the following description is made using G=2 as an example.

[0254] After receiving symbol 1 and symbol 2, the CP is removed from each symbol 1 and symbol 2 (due to the lack of uplink synchronization, the sampling time will be delayed. This is described using 10 sampling points starting from the third point as an example). 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.

[0255] After CP removal, symbol 1 and symbol 2 are respectively transformed with an FFT of 10 points to obtain FFT sequence 1 and FFT sequence 2. FFT sequence 1 corresponds to symbol 1, and FFT sequence 2 corresponds to symbol 2.

[0256] The FFT sequence 1 and the FFT sequence 2 are combined to obtain a fourth sequence. Furthermore, the fourth sequence is subjected to an IDFT transform to obtain a fifth sequence.

[0257] The fifth sequence needs to be conjugated with the local total sequence obtained by fractional or integer cyclic shift of the ZC root sequence, and multiplied element by element and summed to obtain multiple correlation values. The local total sequence with the maximum correlation value is determined, and then the first sequence is determined.

[0258] Through the above process, this application can complete the reception of the first sequence.

[0259] It should be noted that in the solution shown in FIG8 , the number of IDFT points of the combined sequence is the same as or a multiple of the length of the combined sequence. In this way, the length of the sequence obtained after downsampling after the IDFT can be kept consistent with the length of the local sequence.

[0260] FIG9 is a schematic diagram of a process of receiving a first sequence 900 according to an embodiment of the present application. As shown in FIG9 , the process includes:

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

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

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

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

[0265] It should be noted that the first symbol is a symbol obtained by performing CP removal processing on G symbols.

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

[0267] S901a1, perform CP removal processing on G symbols;

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

[0269] 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.

[0270] 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 the CP of symbol 1 and symbol 2 respectively, and obtains the symbol 1 {c7, c8, c9, c10, c1, c2, c3, c4, c5, c6} after the CP is removed (due to the lack of uplink synchronization, the sampling time will be delayed, and the example of obtaining 10 sampling points starting from the third point is used 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}.

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

[0272] S901b1. Combine G symbols to obtain a second symbol;

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

[0274] For example, the access network device first combines G symbols to obtain a second symbol, and then performs CP removal processing on the second symbol to obtain a 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 combines symbol 1 and symbol 2 to obtain the 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}.

[0276] For example, after receiving G OFDM symbols, the access network device may perform an FFT transform of a first number of points on a first symbol obtained from the G symbols to obtain a sixth sequence. The access network device may then perform an IDFT transform on the sixth sequence to obtain a seventh sequence, and determine the first sequence based on the seventh sequence.

[0277] For ease of description, the following description is made using G=2 as an example.

[0278] After receiving symbol 1 and symbol 2, a 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 an FFT transform with a point number of 10 is performed on the first symbol to obtain a sixth sequence. It should be noted that the process of performing the FFT transform on the first symbol may also include performing resource demapping (which is the inverse process of the aforementioned resource mapping) to obtain the frequency domain resources actually occupied by each symbol;

[0279] The sixth sequence is de-subcarrier mapped and the corresponding frequency domain signal is extracted (the value of the zero-padding RE is discarded) to obtain a received total sequence. The received total sequence is conjugated with the frequency domain signal of the ZC root sequence (length 10) and multiplied element-by-element to obtain a frequency domain signal of a PDP of the same length. The sixth sequence is subjected to an IFFT transform (the number of points can be 20) to obtain the PDP. The first sequence is determined based on the position of the detected PDP peak in the sequence.

[0280] Through the above process, this application can complete the reception of the first sequence.

[0281] 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 longer, 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 user capacity. At the same time, the cross-correlation performance between different sequences formed by longer sequences 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.

[0282] 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. For example, the length of the first sequence is 556, and the first sequence can generate up to 556 orthogonal ZC sequences, thus carrying up to 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.

[0283] 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 第三信息承载的比特 数量 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. 第三 信息承载的比特数量 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, then 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 different sequences in the K sequences.

[0284] In an embodiment of the present application, in one possible implementation, the first sequence is a sequence multiplied by a modulation symbol, so as to further increase the amount of information carried by the first sequence.

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

[0286] To implement the various functions of the method provided herein, both the terminal device and the access network device may include hardware structures and / or software modules, with the aforementioned functions implemented in the form of hardware structures, software modules, or a combination of hardware structures and software modules. Whether a particular one of the aforementioned functions is implemented in the form of hardware structures, software modules, or a combination of hardware structures and software modules depends on the specific application and design constraints of the technical solution.

[0287] Figure 10 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, which may be interconnected via a bus 1030. The communication device 1000 may be a terminal device or an access network device.

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

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

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

[0291] 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.

[0292] 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.

[0293] The above description is merely exemplary. For details, please refer to the contents of the above method embodiments. The implementation of each operation in FIG10 may also correspond to the corresponding description of the method embodiments shown in FIG4-FIG9.

[0294] Figure 11 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 a chip or module in the terminal device or the access network device, for implementing the methods involved in the above embodiments.

[0295] Communication device 1100 includes a transceiver unit 1110 and a processing unit 1120. Transceiver unit 1110 may include a transmitting unit and a receiving unit. The transmitting unit is configured to perform a transmitting operation of the communication device, and the receiving unit is configured to perform a receiving operation of the communication device. For ease of description, this embodiment of the application combines the transmitting unit and the receiving unit into a single transceiver unit. This is described here as a unified description and will not be repeated later.

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

[0297] When the communication device 1100 is an access network device, illustratively, the transceiver unit 1110 is configured to receive a first sequence. The processing unit 1120 is configured to execute the processing, coordination, and other steps of the access network device. For example, the processing unit 1120 is configured to process the first sequence.

[0298] 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.

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

[0300] The device embodiments shown in Figures 10 and 11 are used to implement the contents described in Figures 4 to 9. The specific execution steps and methods of the devices shown in Figures 10 and 11 can refer to the contents described in the above method embodiments.

[0301] Figure 12 is a schematic block diagram of a communication device 1200 according to 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 the terminal device or the access network device.

[0302] Communication device 1200 includes an input / output interface 1220 and a processor 1210. Input / output interface 1220 may be an input / output circuit. Processor 1210 may be a signal processor, a chip, or other integrated circuit capable of implementing the method of the present application. Input / output interface 1220 is used for inputting or outputting signals or data.

[0303] For example, when the communication device 1200 is a terminal device, the input / output interface 1220 is configured to send a first sequence via M resources. The processor 1210 is configured to determine the first sequence. The processor 1210 is also configured to execute some or all of the steps of any method provided herein.

[0304] 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 some or all steps of any method provided in this application, for example, processing the first sequence.

[0305] 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.

[0306] Optionally, the communication device 1200 further includes a memory.

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

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

[0309] In one possible implementation, the processor 1210 may be a logic circuit, which 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.

[0310] 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 embodiments. For specific content, please refer to the description of the above method embodiments, which will not be repeated here.

[0311] Figure 13 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 configured to execute the operations performed by the access network device in the method embodiments shown in Figures 4-9 above.

[0312] When the communication device 1300 is an access network device, such as a base station. Figure 13 shows a simplified schematic diagram of the base station structure. 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 usually be called 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 usually be called a transceiver module, a transceiver, a transceiver circuit, or a transceiver, etc. The transceiver module of module 1330 can also be called a transceiver or a transceiver, etc., which includes an antenna 1333 and a radio frequency circuit (not shown in Figure 13), wherein the radio frequency circuit is mainly used for radio frequency processing.

[0313] Alternatively, the device for implementing the receiving function in module 1330 may be considered a receiver, and the device for implementing the transmitting function may be considered a transmitter, that is, 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, and the transmitter may be referred to as a transmitting module, a transmitter, or a transmitting circuit.

[0314] Modules 1310 and 1320 may include one or more boards, each of which may include one or more processors and one or more memories. The processor is used to read and execute programs in the memory to implement baseband processing functions and control the base station. If multiple boards are present, the boards may be interconnected to enhance processing capabilities. As an optional implementation, multiple boards may share one or more processors, multiple boards may share one or more memories, or multiple boards may simultaneously share one or more processors.

[0315] For example, in one implementation, the transceiver module of module 1330 is used to execute the transceiver-related processes performed by the access network device in the embodiments shown in Figures 4 to 9. The processor of module 1310 is used to execute the processing-related processes performed by the access network device in the embodiments shown in Figures 4 to 9.

[0316] FIG13 is merely an example and not a limitation. The access network device including the processor, memory, and transceiver described above may not rely on the structures shown in FIG10 to FIG12 .

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

[0318] Figure 14 is a schematic block diagram of a communication device 1400 according to 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 perform the operations performed by the terminal device in the above method embodiment.

[0319] When communication device 1400 is a terminal device, Figure 14 shows a simplified schematic diagram of the terminal device structure. As shown in Figure 14, the terminal device includes a processor, memory, and a transceiver. The memory can store computer program code, and the transceiver includes a transmitter 1431, a receiver 1432, a radio frequency circuit (not shown in Figure 14), an antenna 1433, and input / output devices (not shown in Figure 14).

[0320] The processor is primarily used to process communication protocols and communication data, control terminal devices, execute software programs, and process software program data. Memory is primarily used to store software programs and data. Radio frequency circuits are primarily used to convert baseband signals into radio frequency signals and process radio frequency signals. Antennas are primarily used to transmit and receive radio frequency signals in the form of electromagnetic waves. Input / output devices. For example, touch screens, displays, and keyboards are primarily used to receive user input and output data to the user. It should be noted that some types of terminal devices may not have input / output devices.

[0321] When data needs to be sent, the processor performs baseband processing on the data to be transmitted and outputs the baseband signal to the RF circuit. The RF circuit then performs RF processing on the baseband signal and transmits it via the antenna in the form of electromagnetic waves. When data is sent to a terminal device, the RF circuit receives the RF signal via the antenna, converts it into a baseband signal, and outputs the baseband signal to the processor, which converts the baseband signal into data and processes it.

[0322] For ease of explanation, Figure 14 shows only one memory, processor, and transceiver. In actual terminal equipment products, one or more processors and one or more memories may exist. Memory may also be referred to as a storage medium or storage device. The memory may be independent of the processor or integrated with the processor, and this is not limited in this embodiment of the present application.

[0323] In the embodiment of the present application, the antenna and 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.

[0324] As shown in Figure 14, the terminal device includes a processor 1410, a memory 1420, and a transceiver 1430. The processor 1410 can be called a processing unit, a processing board, a processing module, a processing device, etc., and the transceiver 1430 can also be called a transceiver unit, a transceiver, a transceiver device, etc.

[0325] Alternatively, the device implementing the receiving function in transceiver 1430 may be considered a receiving module, and the device implementing the transmitting function in transceiver 1430 may be considered a transmitting module. That is, transceiver 1430 includes a receiver and a transmitter. A transceiver may also be sometimes referred to as a transceiver, a transceiver module, or a transceiver circuit. A receiver may also be sometimes referred to as a receiver, a receiving module, or a receiving circuit. A transmitter may also be sometimes referred to as a transmitter, a transmitting module, or a transmitting circuit.

[0326] For example, in one implementation, the processor 1410 is used to execute the processing actions of the terminal device in the embodiments shown in Figures 4 to 9, and the transceiver 1430 is used to execute the transceiver actions of the terminal device in Figures 4 to 9.

[0327] FIG14 is merely an example and not a limitation. The terminal device including the transceiver module and the processing module may not rely on the structures shown in FIG10 to FIG12 .

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

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

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

[0331] 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.

[0332] The present application also provides another chip, comprising: 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 configured to execute code in a memory. When the code is executed, the processor is configured to execute the methods in the above examples. Optionally, the chip also includes a memory, which is configured to store computer programs or code.

[0333] The present application also provides a processor for coupling with a memory, and for executing the methods and functions involving a network device or a terminal device in any of the above embodiments.

[0334] 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.

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

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

[0337] Those skilled 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 beyond the scope of this application.

[0338] Those skilled in the art will 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.

[0339] In the several embodiments provided in this application, the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of units is merely a logical function division. In actual implementation, there may be other division methods, such as 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.

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

[0341] 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.

[0342] 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, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the various embodiments of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

[0343] The above is only a specific implementation of the embodiment of the present application, but the scope of protection of the embodiment of the present application is not limited to this. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the embodiment of the present application, and they should be included in the scope of protection of the embodiment of the present application. Therefore, the scope of protection of the embodiment of the present application should be based on the scope of protection 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: MN, 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: A first symbol is obtained according to the G symbols, where the first symbol is a symbol obtained after the G symbols are subjected to CP removal processing. symbols corresponding 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