Communication method, communication apparatus, and storage medium

Abstract

Provided are a communication method, a communication apparatus, and a storage medium. The communication method comprises: acquiring a first data sequence to be transmitted and a first reference sequence; adding a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence to obtain a second reference sequence; placing the last part of the second reference sequence before the first data sequence, and placing the first part of the second reference sequence after the first data sequence to obtain a second data sequence; processing the second data sequence to obtain a third data sequence; and sending the third data sequence.

Description

Communication method, communication device and storage medium

[0001] This disclosure claims priority to Chinese patent application No. 202311240900.9, filed on September 22, 2023, the entire contents of which are incorporated herein by reference. Technical Field

[0002] The present disclosure relates to the field of communication technology, and in particular to a communication method, a communication device, and a storage medium. Background Art

[0003] Fifth-generation wireless systems (5G) support mobile services with enhanced bandwidth, low latency, high reliability, and large-scale machine-to-machine communication connectivity. These services include augmented reality (AR) / virtual reality (VR), factory automation, transportation scenarios including remote driving, and distributed power system control. 5G New Radio (NR) allows for flexible configuration of demodulation parameters to meet the diverse demodulation reference signal (DRS) requirements of various service scenarios. In some scenarios, a larger DRS symbol overhead is required to meet demodulation accuracy requirements.

[0004] Summary of the Invention

[0005] In a first aspect, an embodiment of the present disclosure provides a communication method. The communication method includes:

[0006] A first data sequence and a first reference sequence to be transmitted are obtained.

[0007] A cyclic prefix sequence and a cyclic suffix sequence are added to the first reference sequence to obtain a second reference sequence.

[0008] The second data sequence is obtained by placing the latter part of the second reference sequence before the first data sequence and the former part of the second reference sequence after the first data sequence.

[0009] The second data sequence is processed to obtain a third data sequence.

[0010] A third data sequence is sent.

[0011] In a second aspect, an embodiment of the present disclosure provides another communication method. The communication method includes:

[0012] Acquire a first data sequence and a first reference sequence to be transmitted;

[0013] Adding a cyclic suffix sequence before the first data sequence, and sequentially adding a cyclic prefix sequence and a first reference sequence after the first data sequence to obtain a second data sequence; the cyclic prefix sequence and the cyclic suffix sequence are determined based on the first reference sequence;

[0014] processing the second data sequence to obtain a third data sequence;

[0015] A third data sequence is sent.

[0016] In a third aspect, an embodiment of the present disclosure provides a communication device. The communication device includes: a receiving module, a processing module, and a sending module;

[0017] The receiving module is configured to obtain a first data sequence and a first reference sequence to be transmitted.

[0018] The processing module is configured to add a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence to obtain a second reference sequence.

[0019] The processing module is further configured to place the latter part of the second reference sequence before the first data sequence, and place the former part of the second reference sequence after the first data sequence, to obtain a second data sequence.

[0020] The processing module is further configured to process the second data sequence to obtain a third data sequence.

[0021] The sending module is configured to send a third data sequence.

[0022] In a fourth aspect, an embodiment of the present disclosure provides another communication device. The communication device includes: a receiving module, a processing module, and a sending module;

[0023] A receiving module, configured to obtain a first data sequence and a first reference sequence to be transmitted;

[0024] a processing module, configured to add a cyclic suffix sequence before the first data sequence, and sequentially add a cyclic prefix sequence and a first reference sequence after the first data sequence to obtain a second data sequence; the cyclic prefix sequence and the cyclic suffix sequence are determined based on the first reference sequence;

[0025] The processing module is further configured to process the second data sequence to obtain a third data sequence;

[0026] The sending module is configured to send a third data sequence.

[0027] In a fifth aspect, embodiments of the present disclosure further provide a communication device. The communication device includes: a memory and a processor; the memory and the processor are coupled; the memory is configured to store instructions executable by the processor; and when the processor executes the instructions, it performs any of the methods provided in the first or second aspects.

[0028] In a sixth aspect, an embodiment of the present disclosure provides a computer program product comprising computer instructions. When the computer instructions are executed on a computer, the computer is caused to execute any one of the methods provided in the first or second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] The accompanying drawings are used to provide a further understanding of the technical solution of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the technical solution of the present disclosure and do not constitute a limitation to the technical solution of the present disclosure.

[0030] FIG1 is a schematic diagram of a communication system according to some embodiments.

[0031] FIG2 is a schematic flow chart of a communication method according to some embodiments.

[0032] FIG3 is a schematic diagram illustrating the composition of a second reference sequence according to some embodiments.

[0033] FIG4A is a schematic diagram showing the composition of a second data sequence according to some embodiments.

[0034] FIG4B is a schematic diagram illustrating composition of another second data sequence according to some embodiments.

[0035] FIG4C is a schematic diagram illustrating composition of yet another second data sequence according to some embodiments.

[0036] FIG5 is a schematic diagram of composition of a time-domain symbol according to some embodiments.

[0037] FIG6 is a schematic diagram illustrating composition of another time-domain symbol according to some embodiments.

[0038] FIG7 is a schematic diagram of composition of yet another time-domain symbol according to some embodiments.

[0039] FIG8 is a schematic diagram illustrating the composition of a time slot according to some embodiments.

[0040] FIG9A is a schematic diagram of a data processing process according to some embodiments.

[0041] FIG9B is a schematic diagram of another data processing process according to some embodiments.

[0042] FIG10 is a schematic diagram of a time window according to some embodiments.

[0043] FIG11 is a schematic diagram of another data processing process according to some embodiments.

[0044] FIG12 is a flow chart of another communication method according to some embodiments.

[0045] FIG13 is a schematic diagram illustrating the composition of a communication device according to some embodiments.

[0046] FIG14 is a schematic diagram illustrating the composition of another communication device according to some embodiments.

[0047] FIG15 is a schematic structural diagram of a communication device according to some embodiments. DETAILED DESCRIPTION

[0048] The following will be combined with the accompanying drawings in the embodiments of the present disclosure to clearly and completely describe the technical solutions in the embodiments of the present disclosure. Obviously, the embodiments described are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present disclosure.

[0049] In the description of this disclosure, unless otherwise specified, " / " means "or". For example, A / B can mean A or B. "And / or" in this article is merely a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: only A, only B, and A and B. In addition, "at least one" means one or more, and "a plurality" means two or more. Expressions such as "first" and "second" do not limit the quantity and execution order, and expressions such as "first" and "second" do not necessarily limit them to be different.

[0050] It should be noted that in this disclosure, expressions such as "exemplarily" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described in this disclosure as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of expressions such as "exemplarily" or "for example" is intended to present the relevant concepts in a detailed manner.

[0051] Currently, in some high-speed mobility scenarios, more time-domain symbols may be required in the data channel to transmit demodulation reference signals (DRSs) to improve demodulation accuracy and mitigate the impact of high-speed mobility on demodulation accuracy. This increases the DRS overhead, which in turn reduces system spectral efficiency, resulting in insufficient system throughput and a poor user experience. Therefore, how to perform data transmission to avoid the impact of excessive DRS symbol overhead on limited spectral efficiency is an urgent issue.

[0052] In view of this, an embodiment of the present disclosure provides a communication method, comprising: obtaining a first data sequence and a first reference sequence to be transmitted; adding a cyclic prefix (CP) sequence and a cyclic suffix (CS) sequence to the first reference sequence to obtain a second reference sequence; placing the latter portion of the second reference sequence before the first data sequence, and placing the former portion of the second reference sequence after the first data sequence to obtain a second data sequence; processing the second data sequence to obtain a third data sequence, and transmitting the third data sequence.

[0053] In this way, the tail of the previous symbol and the beginning of the next symbol in two adjacent OFDM (orthogonal frequency-division multiplexing) symbols can form a complete second time domain reference sequence, which can improve the channel estimation parameter update speed and channel estimation accuracy in high-speed mobile scenarios.

[0054] The method provided by the embodiment of the present disclosure can be applied to various communication systems. For example, the communication system can be a long term evolution (LTE) system, a fifth generation (5G) communication system, a Wi-Fi system, a third generation partnership project (3GPP) related communication system, a future evolved communication system (such as a sixth generation (6G) communication system, etc.), or a system integrating multiple systems, etc., without limitation. The method provided by the embodiment of the present disclosure is described below using the communication system 100 shown in Figure 1 as an example. Figure 1 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided by the present disclosure.

[0055] FIG1 is a schematic diagram of the architecture of a communication system according to some embodiments. As shown in FIG1 , the communication system 100 may include one or more network devices 12 and one or more terminal devices 11. The terminal device 11 may be communicatively connected with the one or more network devices 12.

[0056] In some embodiments, the network device 12 can be used to implement functions such as resource scheduling, wireless resource management, and wireless access control of terminal devices. For example, the network device 12 can be an evolution nodeB (eNB), a next-generation nodeB (gNB), a transmission receive point (TRP), a transmission point (TP), and some other access nodes. According to the size of the service coverage area provided, the base station can be divided into a macro base station for providing macro cells (Macro cell), a micro base station for providing micro cells (Pico cell), and a femto base station for providing femto cells (Femto cell). With the continuous evolution of wireless communication technology, future base stations may also adopt other names.

[0057] The terminal device 11 may also be referred to as a terminal, user equipment (UE), mobile station, mobile terminal, etc. For example, the terminal device 11 may be a mobile phone, a tablet computer, a computer with wireless transceiver capabilities, a virtual reality terminal, an augmented reality terminal, a wireless terminal used in industrial control, a wireless terminal used in unmanned driving, a wireless terminal used in remote surgery, a wireless terminal used in transportation safety, a wireless terminal used in smart cities, a wireless terminal used in smart homes, etc. The embodiments of the present disclosure do not limit the device form adopted by the terminal.

[0058] In some embodiments, during a communication process, a network device sends data to a terminal device, and the terminal device receives the data sent by the network device. Thus, the network device can be referred to as a transmitter. Accordingly, the terminal device can be referred to as a receiver. Alternatively, when a terminal device sends data to a network device, the network device can be referred to as a receiver. Accordingly, the terminal device can be referred to as a transmitter.

[0059] It should be noted that Figure 1 is only an exemplary framework diagram. The number of devices or nodes included in Figure 1 and the names of each device are not restricted. In addition to the functional nodes shown in Figure 1, the communication system may also include other nodes or devices (such as core network devices).

[0060] The system architecture and business scenarios described in the embodiments of this disclosure are intended to more clearly illustrate the technical solutions of the embodiments of this disclosure and do not constitute a limitation of the technical solutions provided by the embodiments of this disclosure. Persons skilled in the art will appreciate that, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of this disclosure are equally applicable to similar technical problems.

[0061] The embodiments provided by the present disclosure are described in detail below with reference to the accompanying drawings.

[0062] As shown in FIG2 , an embodiment of the present disclosure provides a communication method, which includes the following steps.

[0063] S101: Acquire a first data sequence and a first reference sequence to be transmitted.

[0064] The first reference sequence is a reference signal sequence in the communication process, and the reference signal sequence is used by the receiving end to perform channel estimation, coherent detection and demodulation, so that the receiving end can correctly demodulate the data sent by the transmitting end.

[0065] A reference signal is a signal used by a receiving end to perform operations such as channel estimation, channel measurement, time synchronization, or frequency synchronization. The reference signal may be sent by a transmitting end to a receiving end, and the reference signal is known to both the transmitting end and the receiving end. For example, the reference signal provided in the embodiments of the present disclosure may include a demodulation reference signal (DMRS), a sounding reference signal (SRS), or a channel state information-reference signal (CSI-RS).

[0066] S102: Add a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence to obtain a second reference sequence.

[0067] In some embodiments, the transmitter may determine a cyclic prefix sequence and a cyclic suffix sequence in the first reference sequence.

[0068] In some embodiments, the cyclic prefix sequence may include the tail end of the first reference sequence, and the cyclic suffix sequence may include the head end of the first reference sequence. In addition, the length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

[0069] Exemplarily, the transmitting end may truncate a portion of the sequence from the tail of the first reference sequence as a cyclic prefix sequence, and truncate a portion of the sequence from the head of the first reference sequence as a cyclic suffix sequence. As shown in FIG3 , in a first reference sequence 31, the transmitting end may truncate a portion of the sequence from the tail as a cyclic prefix sequence 311, and a portion of the sequence from the head as a cyclic suffix sequence 312. In one example, the length of cyclic prefix sequence 311 is greater than the length of cyclic suffix sequence 312.

[0070] In some embodiments, the transmitter may add a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence to obtain a second reference sequence.

[0071] Exemplarily, the transmitter may place the cyclic prefix sequence before the first reference sequence and the cyclic suffix sequence after the first reference sequence, and then use the combined sequence of the cyclic prefix sequence, the first reference sequence and the cyclic suffix sequence as the second reference sequence.

[0072] Exemplarily, as shown in FIG3 , the second reference sequence 32 includes a cyclic prefix sequence 311 , the first reference sequence 31 and a cyclic suffix sequence 312 , wherein the cyclic prefix sequence 311 precedes the first reference sequence 31 and the cyclic suffix sequence 312 follows the first reference sequence 31 .

[0073] It should be noted that, during the processing, a cyclic prefix CP and a cyclic suffix CS can be added to the beginning and end of the first reference sequence, respectively, so that there is cyclic protection data before and after it, thereby reducing interference from adjacent data and suppressing multipath effects, so as to facilitate channel estimation based on the first reference sequence.

[0074] S103 : Place the latter part of the second reference sequence before the first data sequence, and place the former part of the second reference sequence after the first data sequence, to obtain a second data sequence.

[0075] In some embodiments, the transmitting end may divide the second reference sequence into two parts, including a first part and a second part. It should be understood that since the second reference sequence is obtained by adding a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence, the first part of the second reference sequence includes the cyclic prefix sequence and the first part of the first reference sequence, and the second part of the second reference sequence includes the second part of the first reference sequence and the cyclic suffix sequence.

[0076] In some embodiments, the length of the first portion of the second reference sequence is greater than or equal to the length of the second portion of the second reference sequence.

[0077] For example, as shown in FIG4A , second reference sequence 41 includes a first portion 411 and a second portion 412. As shown in FIG4A , the length of first portion 411 is greater than the length of second portion 412. Furthermore, the length of the cyclic prefix sequence in FIG4A is greater than the length of the cyclic suffix sequence. Alternatively, as shown in FIG4B , second reference sequence 42 includes a first portion 421 and a second portion 422. As shown in FIG4B , the length of first portion 421 is equal to the length of second portion 422. Furthermore, the length of the cyclic prefix sequence in FIG4B is greater than the length of the cyclic suffix sequence.

[0078] In some embodiments, the length of the first portion of the second reference sequence is positively correlated with the length of the cyclic prefix sequence. That is, the longer the cyclic prefix sequence, the longer the first portion of the second reference sequence. Conversely, the shorter the cyclic suffix sequence, the shorter the first portion of the second reference sequence.

[0079] In some embodiments, the first portion of the second reference sequence includes a cyclic prefix sequence and the first reference sequence, and the second portion of the second reference sequence includes a cyclic suffix sequence. For example, as shown in FIG4C , second reference sequence 43 includes a first portion 431 and a second portion 432. As shown in FIG4C , first portion 431 includes the cyclic prefix sequence and the second reference sequence 43, while second portion 432 includes the cyclic suffix sequence. Furthermore, the length of first portion 431 is greater than the length of second portion 432.

[0080] Furthermore, the transmitting end may place the latter portion of the second reference sequence before the first data sequence, and the former portion of the second reference sequence after the first data sequence, to obtain a second data sequence. For example, as shown in FIG4A , FIG4B , or FIG4C , the transmitting end may use a combination of the former portion of the second reference sequence, the first data sequence, and the latter portion of the second reference sequence as the second data sequence.

[0081] In some embodiments, the sum of the length of the second reference sequence and the length of the first data sequence is equal to the length of one time domain symbol. That is, the length of the second data sequence is equal to the length of one time domain symbol, and the second data sequence is a data sequence carried in one time domain symbol.

[0082] For example, the time-domain symbol may be an Orthogonal Frequency Division Multiplexing (OFDM) symbol. OFDM is a multi-carrier transmission technology that uses a large number of adjacent orthogonal subcarriers (SCs), each modulated using modulation techniques such as BPSK and QAM. This technology enables high-speed transmission and effectively combats frequency selective fading.

[0083] In one example, in adjacent first time domain symbols and second time domain symbols, the first reference sequence carried in the first time domain symbol is the same as the first reference sequence carried in the second time domain symbol, the leading element of the second data sequence carried in the first time domain symbol is the same as the leading element of the second data sequence carried in the second time domain symbol, and the trailing element of the second data sequence carried in the first time domain symbol is the same as the trailing element of the second data sequence carried in the second time domain symbol.

[0084] In some embodiments, the length of the cyclic prefix sequence carried in the first time domain symbol is the same as the length of the cyclic prefix sequence carried in the second time domain symbol, and the length of the cyclic suffix sequence carried in the first time domain symbol is the same as the length of the cyclic suffix sequence carried in the second time domain symbol.

[0085] It should be noted that, in adjacent first and second time domain symbols, since the first reference sequence carried by the first time domain symbol is the same as the first reference sequence carried by the second time domain symbol, and the cyclic prefix sequence and cyclic suffix sequence in the first and second time domain symbols are also the same, the second reference sequence determined based on the first reference sequence, the cyclic prefix sequence, and the cyclic suffix sequence of the first and second time domain symbols is also the same.

[0086] Furthermore, since the second data sequence is derived from the latter portion of the second reference sequence, the first data sequence, and the former portion of the second reference sequence, and the second reference sequence in the first time domain symbol is the same as that in the second time domain symbol, the latter portion of the second reference sequence in the first time domain symbol is the same as that in the second time domain symbol, i.e., the leading element of the second data sequence carried in the first time domain symbol is the same as the leading element of the second data sequence carried in the second time domain symbol. Furthermore, the former portion of the second reference sequence in the first time domain symbol is the same as that in the second time domain symbol, i.e., the trailing element of the second data sequence carried in the first time domain symbol is the same as the trailing element of the second data sequence carried in the second time domain symbol.

[0087] For example, as shown in FIG5 , the first time domain symbol 51 carries the latter portion 522 of the second reference sequence 52, the first data sequence, and the former portion 521 of the second reference sequence 52. Furthermore, the second reference sequence 52 carries a cyclic prefix sequence 523, a first reference sequence 524, and a cyclic suffix sequence 525. When the first reference sequence carried in the first time domain symbol is the same as the first reference sequence carried in the second time domain symbol, the beginning of the second data sequence carried in the second time domain symbol 53 in FIG5 is derived from the latter portion 522 of the second reference sequence 52. That is, the leading element of the second data sequence carried in the second time domain symbol 53 is the same as the leading element of the second data sequence carried in the first time domain symbol 51. Furthermore, the tail of the second data sequence carried in the second time domain symbol 53 in FIG5 is derived from the former portion 521 of the second reference sequence 52. That is, the tail element of the second data sequence carried in the second time domain symbol 53 is the same as the tail element of the second data sequence carried in the first time domain symbol 51.

[0088] In another example, in adjacent first time domain symbols and second time domain symbols, the first reference sequence carried in the first time domain symbol is the same as the first reference sequence carried in the second time domain symbol, and the second reference sequence carried in the first time domain symbol is different from the second reference sequence carried in the second time domain symbol.

[0089] In some embodiments, the length of the cyclic prefix sequence carried in the first time domain symbol is different from the length of the cyclic prefix sequence carried in the second time domain symbol, and / or the length of the cyclic suffix sequence carried in the first time domain symbol is different from the length of the cyclic suffix sequence carried in the second time domain symbol.

[0090] It should be noted that, when the first reference sequence carried in the first time domain symbol is the same as the first reference sequence carried in the second time domain symbol, and the length of the cyclic prefix sequence carried in the first time domain symbol is different from the length of the cyclic prefix sequence carried in the second time domain symbol, the first part of the second reference symbol carried in the first time domain symbol is different from the first part of the second reference symbol carried in the second time domain symbol, that is, the second reference sequence carried in the first time domain symbol is different from the second reference sequence carried in the second time domain symbol. Alternatively, when the length of the cyclic suffix sequence carried in the first time domain symbol is different from the length of the cyclic suffix sequence carried in the second time domain symbol, the second part of the second reference symbol carried in the first time domain symbol is different from the second part of the second reference sequence carried in the second time domain symbol, that is, the second reference sequence carried in the first time domain symbol is different from the second reference sequence carried in the second time domain symbol.

[0091] In some embodiments, the tail element of the second data sequence carried in the first time domain symbol is the same as the tail element of the second data sequence carried in the second time domain symbol, and the head element of the second data sequence carried in the first time domain symbol is the same as the head element of the second data sequence carried in the second time domain symbol.

[0092] Example 1: The length of the cyclic prefix sequence carried in the first time domain symbol is different from the length of the cyclic prefix sequence carried in the second time domain symbol. As shown in Figure 6, the length of the cyclic prefix sequence 611 carried in the first time domain symbol 61 is smaller than the cyclic prefix sequence 621 carried in the second time domain symbol 62, and the length of the cyclic suffix sequence 612 carried in the first time domain symbol 61 is equal to the length of the cyclic suffix sequence 622 carried in the second time domain symbol 62. Therefore, the first part 613 of the second reference sequence carried in the first time domain symbol 61 is different from the first part 623 of the second reference sequence carried in the second time domain symbol 62, that is, the second reference sequence carried in the first time domain symbol 61 is different from the second reference sequence carried in the second time domain symbol 62.

[0093] In some embodiments, the first portion 613 of the second reference sequence carried in the first time domain symbol 61 includes the same partial sequence of the first reference sequence as the first portion 623 of the second reference sequence carried in the second time domain symbol 62. Thus, the leading element of the leading portion 613 is different from the leading element of the leading portion 623, but the trailing element is the same. Thus, the trailing element of the second data sequence carried in the first time domain symbol 61 is the same as the trailing element of the second data sequence carried in the second time domain symbol 62. Furthermore, the trailing portion 614 of the second reference sequence carried in the first time domain symbol 61 is the same as the trailing portion 624 of the second reference sequence carried in the second time domain symbol 62. Thus, the leading element of the second data sequence carried in the first time domain symbol 61 is the same as the leading element of the second data sequence carried in the second time domain symbol 62.

[0094] Example 2: The length of the cyclic suffix sequence carried in the first time domain symbol is different from the length of the cyclic suffix sequence carried in the second time domain symbol. As shown in Figure 7, the length of the cyclic prefix sequence 711 carried in the first time domain symbol 71 is equal to the cyclic prefix sequence 721 carried in the second time domain symbol 72, and the length of the cyclic suffix sequence 712 carried in the first time domain symbol 71 is less than the length of the cyclic suffix sequence 722 carried in the second time domain symbol 72. Therefore, the latter portion 714 of the second reference sequence carried in the first time domain symbol 71 is different from the latter portion 724 of the second reference sequence carried in the second time domain symbol 72, that is, the second reference sequence carried in the first time domain symbol 71 is different from the second reference sequence carried in the second time domain symbol 72.

[0095] In some embodiments, the partial sequence of the first reference sequence included in the latter portion 714 of the second reference sequence carried in the first time domain symbol 71 is the same as the partial sequence of the first reference sequence included in the latter portion 724 of the second reference sequence carried in the second time domain symbol 72. The tail element of the latter portion 714 is different from the tail element of the latter portion 724, but the head element is the same. Thus, the head element of the second data sequence carried in the first time domain symbol 71 is the same as the head element of the second data sequence carried in the second time domain symbol 72. Furthermore, the first portion 713 of the second reference sequence carried in the first time domain symbol 71 is the same as the first portion 723 of the second reference sequence carried in the second time domain symbol 72. Thus, the tail element of the second data sequence carried in the first time domain symbol 71 is the same as the tail element of the second data sequence carried in the second time domain symbol 72.

[0096] Example 3: The length of the cyclic prefix sequence in the first time domain symbol is different from the length of the cyclic prefix sequence in the second time domain symbol, and the length of the cyclic suffix sequence in the first time domain symbol is also different from the length of the cyclic suffix sequence in the second time domain symbol. Therefore, the second reference sequence carried in the first time domain symbol is different from the second reference sequence carried in the second time domain symbol.

[0097] In some embodiments, the first reference sequence carried in all time domain symbols within a time slot is the same, the leading elements of the second data sequence carried in all time domain symbols within the time slot are the same, and the trailing elements of the second data sequence carried in all time domain symbols are the same.

[0098] In some embodiments, in adjacent first time slots and second time slots, the first reference sequence carried by each time domain symbol in the first time slot is the same as the first reference sequence carried by each time domain symbol in the second time slot, and the second reference sequence carried by each time domain symbol in the first time slot is different from the second reference sequence carried by each time domain symbol in the second time slot.

[0099] In some embodiments, the length of the cyclic prefix sequence carried by each time domain symbol in the first time slot is different from the length of the cyclic prefix sequence carried by each time domain symbol in the second time slot, and / or the length of the cyclic suffix sequence carried by each time domain symbol in the first time slot is different from the length of the cyclic suffix sequence carried by each time domain symbol in the second time slot.

[0100] It should be noted that, if the first reference sequence carried by each time domain symbol in the first time slot is the same as the first reference sequence carried by each time domain symbol in the second time slot, and the length of the cyclic prefix sequence in each time domain symbol in the first time slot is different from the length of the cyclic prefix sequence in each time domain symbol in the second time slot, the first part of the second reference symbol in each time domain symbol in the first time slot is different from the first part of the second reference symbol in each time domain symbol in the second time slot, that is, the second reference sequence carried by each time domain symbol in the first time slot is different from the second reference sequence carried by each time domain symbol in the second time slot. Alternatively, if the length of the cyclic suffix sequence in each time domain symbol in the first time slot is different from the length of the cyclic suffix sequence in each time domain symbol in the second time slot, then the second part of the second reference symbol in each time domain symbol in the first time slot is different from the second part of the second reference symbol in each time domain symbol in the second time slot, that is, the second reference sequence carried by each time domain symbol in the first time slot is different from the second reference sequence carried by each time domain symbol in the second time slot.

[0101] In some embodiments, the tail element of the second data sequence carried by each time domain symbol in the first time slot is the same as the tail element of the second data sequence carried by each time domain symbol in the second time slot, and the head element of the second data sequence carried by each time domain symbol in the first time slot is the same as the head element of the second data sequence carried by each time domain symbol in the second time slot.

[0102] It should be noted that the first reference sequences of adjacent time-domain symbols are identical, and the second data sequences of adjacent time-domain symbols have the same header and tail elements. Therefore, between two adjacent time-domain symbols, the tail of the previous time-domain symbol can be used as the cyclic prefix of the next time-domain symbol. Therefore, there is no need to add a new cyclic prefix for each symbol. The interval between adjacent time-domain symbols is equal to the inverse of the subcarrier interval, thereby improving spectrum efficiency.

[0103] For example, as shown in FIG8 , in adjacent time slots N and N+1, the length of the cyclic prefix sequence 811 of each time domain symbol in the time slot N is greater than the length of the cyclic prefix sequence 821 of each time domain symbol in the time slot N+1, and the length of the cyclic suffix sequence 812 of each time domain symbol in the time slot N is equal to the length of the cyclic suffix sequence 822 of each time domain symbol in the time slot N+1. Therefore, the first portion 813 of the second reference sequence in each time domain symbol in the time slot N is different from the first portion 823 of the second reference sequence in each time domain symbol in the time slot N+1, that is, the second reference sequence carried by each time domain symbol in the time slot N is different from the second reference sequence carried by each time domain symbol in the time slot N+1. In some embodiments, the tail element of the N+1th data sequence carried by each time domain symbol in the Nth time slot is the same as the tail element of the N+1th data sequence carried by each time domain symbol in the N+1th time slot, and the head element of the N+1th data sequence carried by each time domain symbol in the Nth time slot is the same as the head element of the N+1th data sequence carried by each time domain symbol in the N+1th time slot.

[0104] S104: Process the second data sequence to obtain a third data sequence.

[0105] In some embodiments, the time length of the third data sequence is equal to the time length of the second data sequence.

[0106] In one implementation, the transmitting end may perform Fourier transform (FT) and inverse Fourier transform (IFT) processing on the second data sequence to obtain a third data sequence.

[0107] Exemplarily, as shown in FIG9A , after determining the second data sequence, the transmitting end may first perform Fourier transform processing on the second data sequence, such as fast Fourier transform (FFT) processing or discrete Fourier transform (DFT) processing, to perform time domain-frequency domain transform analysis on the second data sequence. Further, the transmitting end performs inverse Fourier transform processing on the second data sequence after Fourier transform processing, such as inverse fast Fourier transform (IFFT) or inverse discrete Fourier transform (IDFT) to obtain time domain data reconstructed from the frequency domain, that is, the third data sequence. Furthermore, the transmitting end may transmit the obtained third data sequence.

[0108] In some embodiments, the length of the time window used in the Fourier transform processing is equal to the time length of the second data sequence. For example, as shown in FIG10 , the time starting point of the time window used in the Fourier transform processing is the time starting point of the second data sequence, and the time ending point of the time window used in the Fourier transform processing is the time ending point of the second data sequence, that is, the length of the time window used in the Fourier transform processing is equal to the time length of the second data sequence.

[0109] In some embodiments, the number of calculation points used in the Fourier transform process is equal to the number of elements in the second data sequence. In some embodiments, the number of calculation points used in the inverse Fourier transform process is greater than the number of calculation points used in the Fourier transform process.

[0110] In some embodiments, the number of elements in the third data sequence is greater than the number of elements in the second data sequence.

[0111] It should be noted that since the number of calculation points used in the Fourier transform (such as DFT) processing is the number of elements of the second data sequence, and the number of calculation points used in the inverse Fourier transform (such as IFFT) processing is greater than the number of calculation points used in the Fourier transform (such as DFT) processing, that is, zero subcarriers are added to the frequency domain data after the second data sequence is Fourier transformed, and then an oversampled inverse Fourier transform is performed, the number of elements of the obtained third data sequence is greater than the number of elements of the second data sequence.

[0112] In another implementation, the transmitting end may perform Fourier transform processing, frequency domain shaping processing, and inverse Fourier transform processing on the second data sequence to obtain a third data sequence.

[0113] For example, as shown in FIG9B , after determining the second data sequence, the transmitting end may first perform Fourier transform processing on the second data sequence, then perform frequency domain spectrum shaping (FDSS) processing on the Fourier transformed second data sequence, and then perform inverse Fourier transform processing to obtain a third data sequence. The transmitting end may then transmit the obtained third data sequence.

[0114] In some embodiments, the size of the coefficient of the root raised cosine function used in the frequency domain shaping process is negatively correlated with the length of the cyclic prefix sequence determined based on the first reference sequence.

[0115] In some embodiments, the size of the coefficients of the root raised cosine function used in the frequency domain shaping process is negatively correlated with the length of the cyclic suffix sequence determined based on the first reference sequence.

[0116] For example, as shown in Figure 11, for second data sequence 111, the roll-off coefficient of the root raised cosine function used in frequency domain shaping is a1, where a1 = 0.1. For second data sequence 112, the roll-off coefficient of the root raised cosine function used in frequency domain shaping is a2, where a1 = 0.2. Furthermore, the length of cyclic prefix sequence 1111 in second data sequence 111 is greater than that of cyclic prefix sequence 1121 in second data sequence 112. This indicates that the length of the cyclic prefix sequence of the first reference sequence monotonically decreases as the roll-off coefficient increases.

[0117] S105: Send a third data sequence.

[0118] In some embodiments, the transmitting end may transmit the third data sequence to the receiving end on the determined time-frequency resources.

[0119] In some embodiments, the sending end may also send indication information to the receiving end.

[0120] The above indication information is used to indicate the length of the cyclic prefix sequence and / or the length of the cyclic suffix sequence.

[0121] Based on the communication method provided by the embodiment of the present disclosure, the data sequence to be transmitted can be processed based on the reference sequence so that the tail of the previous symbol and the head of the next symbol in two adjacent time domain symbols can form a complete second reference sequence. In this way, channel estimation can be performed based on the acquired complete second reference sequence at each interval of receiving a time domain symbol, thereby timely updating the channel estimation parameters and improving the accuracy of channel estimation, and is suitable for high-speed mobile scenarios. In addition, since a cyclic prefix CP and a cyclic suffix CS can be added to the head and tail of the first reference sequence respectively during the processing process, so that there is cyclic protection data before and after it, the interference of adjacent data is reduced and the multipath effect is suppressed, so as to facilitate channel estimation based on the first reference sequence.

[0122] In some embodiments, as shown in FIG12 , the present disclosure also provides another communication method, which includes the following steps.

[0123] S201: Acquire a first data sequence and a first reference sequence to be transmitted.

[0124] The detailed description of S201 can refer to the description of S101 above, which will not be repeated here.

[0125] S202: Add a cyclic suffix sequence before the first data sequence, and add a cyclic prefix sequence and a first reference sequence in sequence after the first data sequence to obtain a second data sequence.

[0126] The cyclic prefix sequence and the cyclic suffix sequence are determined based on the first reference sequence. In some embodiments, the cyclic prefix sequence may include the tail end of the first reference sequence, and the cyclic suffix sequence may include the head end of the first reference sequence. Furthermore, the length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

[0127] In some embodiments, the length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

[0128] For detailed description of the cyclic prefix sequence and the cyclic suffix sequence, please refer to the description of S102 above, which will not be repeated here.

[0129] In some embodiments, the transmitter may place a cyclic prefix sequence before the first reference sequence, place the cyclic prefix sequence and the first reference sequence after the first data sequence, and place the cyclic suffix sequence before the first data sequence, and then use the combined sequence of the cyclic suffix sequence, the first data sequence, the cyclic prefix sequence and the first reference sequence as the second data sequence.

[0130] S203: Process the second data sequence to obtain a third data sequence.

[0131] In some embodiments, the transmitting end may perform Fourier transform and inverse Fourier transform on the second data sequence to obtain a third data sequence.

[0132] In some embodiments, the time window length used in the Fourier transform processing is equal to the time length of the second data sequence. In some embodiments, the number of calculation points used in the inverse Fourier transform processing is greater than the number of calculation points used in the Fourier transform processing. In some embodiments, the time length of the third data sequence is equal to the time length of the second data sequence.

[0133] The detailed description of S203 can refer to the description of S104 above, which will not be repeated here.

[0134] S204: Send a third data sequence.

[0135] In some embodiments, the sending end may also send indication information to the receiving end.

[0136] The above indication information is used to indicate the length of the cyclic prefix sequence and / or the length of the cyclic suffix sequence.

[0137] The detailed description of S204 can refer to the description of S105 above, which will not be repeated here.

[0138] The communication method provided in the embodiments of the present disclosure can improve the channel estimation parameter update speed and the accuracy of channel estimation in high-speed mobile scenarios. In addition, a cyclic prefix sequence, a first reference sequence, and a cyclic suffix sequence are directly added to the first data sequence to obtain a second data sequence. The operation is more direct and simple, and the complexity of the transmission data processing process can be reduced.

[0139] The above mainly introduces the solution provided by the present disclosure from the perspective of the interaction between various devices or nodes. It is understandable that, in order to realize the above functions, each device or node includes a hardware structure and / or software module corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0140] FIG13 is a schematic diagram showing the components of a communication device according to some embodiments. As shown in FIG13 , the communication device 130 includes a receiving module 1301 , a processing module 1302 , and a sending module 1303 .

[0141] In some embodiments, receiving module 1301 is configured to obtain a first data sequence and a first reference sequence to be transmitted. Processing module 1302 is configured to add a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence to obtain a second reference sequence. Processing module 1302 is further configured to place the latter portion of the second reference sequence before the first data sequence and the former portion of the second reference sequence after the first data sequence to obtain a second data sequence, and to process the second data sequence to obtain a third data sequence. Transmitting module 1303 is configured to transmit the third data sequence.

[0142] In some embodiments, the length of the first portion of the second reference sequence is greater than or equal to the length of the second portion of the second reference sequence.

[0143] In some embodiments, the first portion of the second reference sequence includes a cyclic prefix sequence and the first reference sequence, and the second portion of the second reference sequence includes a cyclic suffix sequence.

[0144] In some embodiments, the first part of the second reference sequence includes a cyclic prefix sequence and the first part of the first reference sequence, and the second part of the second reference sequence includes the second part of the first reference sequence and a cyclic suffix sequence.

[0145] In some embodiments, the length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

[0146] In some embodiments, the length of the first portion of the second reference sequence is positively correlated with the length of the cyclic prefix sequence.

[0147] In some embodiments, the sum of the length of the second reference sequence and the length of the first data sequence is equal to the length of one time-domain symbol.

[0148] In some embodiments, the cyclic prefix sequence includes the tail element of the first reference sequence, and the cyclic suffix sequence includes the head element of the first reference sequence.

[0149] In some embodiments, the second data sequence is a data sequence carried in one time domain symbol.

[0150] In some embodiments, in adjacent first time domain symbols and second time domain symbols, the first reference sequence carried by the first time domain symbol is the same as the first reference sequence carried in the second time domain symbol, the leading element of the second data sequence carried in the first time domain symbol is the same as the leading element of the second data sequence carried in the second time domain symbol, and the trailing element of the second data sequence carried in the first time domain symbol is the same as the trailing element of the second data sequence carried in the second time domain symbol.

[0151] In some embodiments, in adjacent first time domain symbols and second time domain symbols, the first reference sequence carried by the first time domain symbol is the same as the first reference sequence carried in the second time domain symbol, and the second reference sequence carried in the first time domain symbol is different from the second reference sequence carried in the second time domain symbol.

[0152] In some embodiments, the length of the cyclic prefix sequence in the first time domain symbol is different from the length of the cyclic prefix sequence in the second time domain symbol, and / or the length of the cyclic suffix sequence in the first time domain symbol is different from the length of the cyclic suffix sequence in the second time domain symbol.

[0153] In some embodiments, the first reference sequence carried in all time domain symbols within a time slot is the same, the leading elements of the second data sequence carried in all time domain symbols within the time slot are the same, and the trailing elements of the second data sequence carried in all time domain symbols are the same.

[0154] In some embodiments, in adjacent first time slots and second time slots, the first reference sequence carried by each time domain symbol in the first time slot is the same as the first reference sequence carried by each time domain symbol in the second time slot, and the second reference sequence carried by each time domain symbol in the first time slot is different from the second reference sequence carried by each time domain symbol in the second time slot.

[0155] In some embodiments, the length of the cyclic prefix sequence of each time domain symbol in the first time slot is different from the length of the cyclic prefix sequence of each time domain symbol in the second time slot, and / or the length of the cyclic suffix sequence of each time domain symbol in the first time slot is different from the length of the cyclic suffix sequence of each time domain symbol in the second time slot.

[0156] In some embodiments, the processing module 1302 is configured to perform Fourier transform and inverse Fourier transform on the second data sequence to obtain a third data sequence.

[0157] In some embodiments, the processing module 1302 is used to perform Fourier transform processing, frequency domain shaping processing, and inverse Fourier transform processing on the second data sequence to obtain a third data sequence.

[0158] In some embodiments, the length of the time window used in the Fourier transform processing is equal to the time length of the second data sequence.

[0159] In some embodiments, the number of calculation points used in the Fourier transform processing is equal to the number of elements in the second data sequence.

[0160] In some embodiments, the time length of the third data sequence is equal to the time length of the second data sequence.

[0161] In some embodiments, the number of computation points employed in the inverse Fourier transform process is greater than the number of computation points employed in the Fourier transform process.

[0162] In some embodiments, the number of elements in the third data sequence is greater than the number of elements in the second data sequence.

[0163] In some embodiments, the size of the coefficient of the root raised cosine function used in the frequency domain shaping process is negatively correlated with the length of the cyclic prefix sequence determined based on the first reference sequence.

[0164] In some embodiments, the size of the coefficients of the root raised cosine function used in the frequency domain shaping process is negatively correlated with the length of the cyclic suffix sequence determined based on the first reference sequence.

[0165] In some embodiments, the sending module 1303 is further used to send indication information, where the indication information is used to indicate the length of the cyclic prefix sequence and / or the length of the cyclic suffix sequence.

[0166] For a more detailed description of the above-mentioned receiving module 1301, processing module 1302 and sending module 1303, as well as a more detailed description of each technical feature and a description of the beneficial effects, please refer to the above-mentioned corresponding method embodiment part and will not be repeated here.

[0167] FIG14 is a schematic diagram showing the composition of another communication device according to some embodiments. As shown in FIG14 , the communication device 140 includes a receiving module 1401 , a processing module 1402 , and a sending module 1403 .

[0168] In some embodiments, receiving module 1401 is configured to obtain a first data sequence and a first reference sequence to be transmitted. Processing module 1402 is configured to add a cyclic suffix sequence before the first data sequence, and to add a cyclic prefix sequence and the first reference sequence in sequence after the first data sequence to obtain a second data sequence; the cyclic prefix sequence and the cyclic suffix sequence are determined based on the first reference sequence. Processing module 1402 is further configured to process the second data sequence to obtain a third data sequence. Transmitting module 1403 is configured to transmit the third data sequence.

[0169] In some embodiments, the length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

[0170] In some embodiments, the processing module 1402 is configured to perform Fourier transform and inverse Fourier transform on the second data sequence to obtain a third data sequence.

[0171] In some embodiments, the time window length used in the Fourier transform processing is equal to the time length of the second data sequence. In some embodiments, the number of calculation points used in the inverse Fourier transform processing is greater than the number of calculation points used in the Fourier transform processing. In some embodiments, the time length of the third data sequence is equal to the time length of the second data sequence.

[0172] In some embodiments, the sending module 1403 is further used to send indication information, where the indication information is used to indicate the length of the cyclic prefix sequence and / or the length of the cyclic suffix sequence.

[0173] For a more detailed description of the above-mentioned receiving module 1401, processing module 1402 and sending module 1403, as well as a more detailed description of each technical feature and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part and will not be repeated here.

[0174] It should be noted that the modules in FIG13 or FIG14 may also be referred to as units. For example, the receiving module may be referred to as a receiving unit. In addition, in the embodiment shown in FIG13 or FIG14 , the names of the modules may not be those shown in the figure. For example, the sending module may be referred to as a communication module, and the receiving module may be referred to as a communication module.

[0175] If the various units or modules in Figure 13 or Figure 14 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to some technologies or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the various embodiments of the present disclosure. The storage medium for storing computer software products includes various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0176] In the case of implementing the functions of the above-mentioned integrated modules in hardware, an embodiment of the present disclosure provides a schematic structural diagram of a communication device, as shown in Figure 15. The communication device 1500 includes: a processor 1502, a communication interface 1503, and a bus 1504. In some embodiments, the communication device 1500 may also include a memory 1501.

[0177] Processor 1502 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the contents of this disclosure. Processor 1502 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Processor 1502 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the contents of this disclosure. Processor 1502 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0178] The communication interface 1503 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, or wireless local area network (WLAN).

[0179] The memory 1501 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0180] As an implementation, memory 1501 may exist independently of processor 1502. Memory 1501 may be connected to processor 1502 via bus 1504 to store instructions or program codes. When processor 1502 calls and executes the instructions or program codes stored in memory 1501, the information processing method provided in the embodiments of the present disclosure can be implemented.

[0181] In another implementation, the memory 1501 may also be integrated with the processor 1502 .

[0182] Bus 1504 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 1504 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG15 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.

[0183] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional modules as needed, that is, the internal structure of the equipment or device is divided into different functional modules to complete all or part of the functions described above.

[0184] The embodiments of the present disclosure also provide a computer-readable storage medium. All or part of the processes in the above-mentioned method embodiments can be completed by computer instructions to instruct relevant hardware, and the program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it can include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be the memory of any of the above-mentioned embodiments. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned device or apparatus, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above-mentioned device or apparatus. Furthermore, the above-mentioned computer-readable storage medium can also include both the internal storage unit of the above-mentioned device or apparatus and an external storage device. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned device or apparatus. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0185] The embodiments of the present disclosure further provide a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the methods provided in the above embodiments.

[0186] Although the present disclosure is described herein in conjunction with various embodiments, in the process of implementing the disclosure for which protection is sought, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude multiple components. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0187] Although the present disclosure has been described in conjunction with features and embodiments thereof, it will be apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely illustrative of the present disclosure as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. It will be apparent that those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, the present disclosure is intended to encompass such modifications and variations as would fall within the scope of the claims of the present disclosure and their equivalents.

[0188] The above is only a specific embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed in the present disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.

Claims

1. A communication method, comprising: Acquire a first data sequence and a first reference sequence to be transmitted; Adding a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence to obtain a second reference sequence; Placing the latter part of the second reference sequence before the first data sequence, and placing the former part of the second reference sequence after the first data sequence, to obtain a second data sequence; processing the second data sequence to obtain a third data sequence; The third data sequence is sent.

2. The method according to claim 1, wherein: The length of the first part of the second reference sequence is greater than or equal to the length of the second part of the second reference sequence.

3. The method according to claim 1, wherein: The first part of the second reference sequence includes the cyclic prefix sequence and the first reference sequence, and the second part of the second reference sequence includes the cyclic suffix sequence.

4. The method according to claim 1, wherein: The first part of the second reference sequence includes the cyclic prefix sequence and the first part of the first reference sequence, and the second part of the second reference sequence includes the second part of the first reference sequence and the cyclic suffix sequence.

5. The method according to claim 1, wherein: The length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

6. The method according to claim 1, wherein: The length of the first part of the second reference sequence is positively correlated with the length of the cyclic prefix sequence.

7. The method according to claim 1, wherein: The sum of the length of the second reference sequence and the length of the first data sequence is equal to the length of one time domain symbol.

8. The method according to claim 1, wherein: The cyclic prefix sequence includes the tail element of the first reference sequence, and the cyclic suffix sequence includes the head element of the first reference sequence.

9. The method according to claim 1, wherein: The second data sequence is a data sequence carried in a time domain symbol.

10. The method according to claim 1, wherein: In adjacent first time domain symbols and second time domain symbols, the first reference sequence carried in the first time domain symbol is the same as the first reference sequence carried in the second time domain symbol, the leading element of the second data sequence carried in the first time domain symbol is the same as the leading element of the second data sequence carried in the second time domain symbol, and the trailing element of the second data sequence carried in the first time domain symbol is the same as the trailing element of the second data sequence carried in the second time domain symbol.

11. The method according to claim 1, wherein: In adjacent first time domain symbols and second time domain symbols, a first reference sequence carried in the first time domain symbol is the same as a first reference sequence carried in the second time domain symbol, and a second reference sequence carried in the first time domain symbol is different from a second reference sequence carried in the second time domain symbol.

12. The method according to claim 11, wherein: The length of the cyclic prefix sequence in the first time domain symbol is different from that in the second time domain symbol, and / or the length of the cyclic suffix sequence in the first time domain symbol is different from that in the second time domain symbol.

13. The method according to claim 1, wherein: The first reference sequences carried in all time domain symbols in a time slot are the same, the first elements of the second data sequences carried in all time domain symbols in the time slot are the same, and the tail elements of the second data sequences carried in all time domain symbols are the same.

14. The method according to claim 1, wherein: In adjacent first and second time slots, the first reference sequence carried by each time domain symbol in the first time slot is the same as the first reference sequence carried by each time domain symbol in the second time slot, and the second reference sequence carried by each time domain symbol in the first time slot is different from the second reference sequence carried by each time domain symbol in the second time slot.

15. The method according to claim 14, wherein: The length of the cyclic prefix sequence of each time domain symbol in the first time slot is different from the length of the cyclic prefix sequence in each time domain symbol in the second time slot, and / or the length of the cyclic suffix sequence of each time domain symbol in the first time slot is different from the length of the cyclic suffix sequence in each time domain symbol in the second time slot.

16. The method according to claim 1, wherein: The processing of the second data sequence to obtain a third data sequence includes: The second data sequence is subjected to Fourier transform processing and inverse Fourier transform processing to obtain a third data sequence.

17. The method according to claim 1, wherein: The processing of the second data sequence to obtain a third data sequence includes: The second data sequence is subjected to Fourier transform processing, frequency domain shaping processing and inverse Fourier transform processing to obtain a third data sequence.

18. The method according to claim 16 or 17, wherein: The time window length adopted in the Fourier transform processing is equal to the time length of the second data sequence.

19. The method according to claim 16 or 17, wherein: The number of calculation points used in the Fourier transform processing is equal to the number of elements of the second data sequence.

20. The method according to claim 16 or 17, wherein: The time length of the third data sequence is equal to the time length of the second data sequence.

21. The method according to claim 16 or 17, wherein: The number of calculation points used in the inverse Fourier transform process is greater than the number of calculation points used in the Fourier transform process.

22. The method according to claim 21, wherein: The number of elements in the third data sequence is greater than the number of elements in the second data sequence.

23. The method according to claim 17, wherein: The magnitude of the coefficients in the root raised cosine function used in the frequency domain shaping process is negatively correlated with the length of the cyclic prefix sequence determined based on the first reference sequence.

24. The method of claim 17, wherein: The magnitude of the coefficients in the root raised cosine function used in the frequency domain shaping process is negatively correlated with the length of the cyclic suffix sequence determined based on the first reference sequence.

25. The method of claim 1, further comprising: Send indication information, where the indication information is used to indicate the length of the cyclic prefix sequence and / or the length of the cyclic suffix sequence.

26. A communication method, comprising: Acquire a first data sequence and a first reference sequence to be transmitted; A cyclic suffix sequence is added before the first data sequence, and a cyclic prefix sequence and the first reference sequence are added in sequence after the first data sequence to obtain a second data sequence; the cyclic prefix sequence and the cyclic suffix sequence are determined based on the first reference sequence; processing the second data sequence to obtain a third data sequence; The third data sequence is sent.

27. The method according to claim 26, wherein: The length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

28. The method according to claim 26, wherein: The processing of the second data sequence to obtain a third data sequence includes: The second data sequence is subjected to Fourier transform processing and inverse Fourier transform processing to obtain a third data sequence.

29. The method according to claim 28, wherein: The time window length adopted in the Fourier transform processing is equal to the time length of the second data sequence.

30. The method of claim 28, wherein: The number of calculation points used in the inverse Fourier transform process is greater than the number of calculation points used in the Fourier transform process.

31. The method of claim 26, wherein: The time length of the third data sequence is equal to the time length of the second data sequence.

32. The method of claim 26, further comprising: Send indication information, where the indication information is used to indicate the length of the cyclic prefix sequence and / or the length of the cyclic suffix sequence.

33. A communication device, comprising: Memory and processor; The memory is coupled to the processor; The memory is used to store instructions executable by the processor; When the processor executes the instructions, the method according to any one of claims 1 to 32 is performed.

34. A computer-readable storage medium, wherein: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a communication device, the communication device is caused to perform the method according to any one of claims 1 to 32.

Images