Communication method, communication device and storage medium

Abstract

The embodiment of the invention provides a communication method, a communication device and a storage medium, relates to the technical field of communication, and is used for improving the precision of channel estimation, and the communication method comprises the steps: obtaining a to-be-transmitted first data sequence 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, and placing the latter part of the second reference sequence in front of the first data sequence, and placing the former part of the second reference sequence in back of 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

Technical Field

[0001] 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

[0002] The fifth generation of mobile communication technology (5G) supports mobile enhanced bandwidth, low latency, high reliability and large-scale machine communication connection services, such as augmented reality (AR) / virtual reality (VR), factory automation, transportation business scenarios including remote driving, distributed power system control, etc. Flexible demodulation parameters can be configured in 5G New Radio (NR) to meet the different requirements of demodulation reference signals in different business scenarios. In some business scenarios, a larger demodulation reference signal symbol overhead is required to meet the demodulation accuracy requirements. However, the increase in the overhead of the demodulation reference signal will lead to a decrease in system spectrum efficiency and throughput, affecting the user experience. Summary of the invention

[0003] The present disclosure provides a communication method, a communication device and a storage medium for improving the accuracy of channel estimation.

[0004] In order to achieve the above objectives, the present disclosure adopts the following technical solutions:

[0005] In a first aspect, the present disclosure provides a communication method, the method comprising:

[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, the present disclosure provides another communication method, the method comprising:

[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, the present disclosure provides a communication device, the device comprising:

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

[0018] The processing module is used 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 used 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, so as to obtain the second data sequence.

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

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

[0022] In a fourth aspect, the present disclosure provides another communication device, the device comprising:

[0023] A receiving module, used 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 used to process the second data sequence to obtain a third data sequence;

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

[0027] In a fifth aspect, the present disclosure further provides a communication device, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store instructions executable by the processor; when the processor executes the instructions, it performs any method provided in the first aspect or the second aspect.

[0028] In a sixth aspect, the present disclosure provides a computer program product comprising computer instructions, which, when executed on a computer, enables the computer to execute any one of the methods provided in the first or second aspect above.

[0029] The present disclosure provides a communication method. Based on the communication method provided by the embodiment of the present disclosure, a data sequence to be transmitted can be processed based on a 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, so that the channel estimation parameters can be updated in time and the accuracy of channel estimation can be improved, and it 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 are cyclic protection data before and after it, thereby reducing the interference of adjacent data and suppressing the influence of multipath, so as to facilitate channel estimation based on the first reference sequence. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] The accompanying drawings are used to provide 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 on the technical solution of the present disclosure.

[0031] Figure 1 A schematic diagram of a communication system provided for an embodiment of the present disclosure;

[0032] Figure 2 A flow chart of a communication method provided in an embodiment of the present disclosure;

[0033] Figure 3 A schematic diagram of the composition of a second reference sequence provided for an embodiment of the present disclosure;

[0034] Figure 4a A schematic diagram of the composition of a second data sequence provided in an embodiment of the present disclosure;

[0035] Figure 4b A schematic diagram of another composition of a second data sequence provided for an embodiment of the present disclosure;

[0036] Figure 4c A schematic diagram of another composition of a second data sequence provided for an embodiment of the present disclosure;

[0037] Figure 5 A schematic diagram of the composition of a time domain symbol provided for an embodiment of the present disclosure;

[0038] Figure 6 A schematic diagram of another time domain symbol composition provided for an embodiment of the present disclosure;

[0039] Figure 7 A schematic diagram of another time domain symbol composition provided for an embodiment of the present disclosure;

[0040] Figure 8 A schematic diagram of the composition of a time slot provided in an embodiment of the present disclosure;

[0041] Figure 9a A schematic diagram of a data processing process provided for an embodiment of the present disclosure;

[0042] Figure 9b Another data processing process schematic diagram provided for an embodiment of the present disclosure;

[0043] Fig.10 A schematic diagram of a time window provided for an embodiment of the present disclosure;

[0044] Fig.11 Another data processing process schematic diagram provided for an embodiment of the present disclosure;

[0045] Fig.12 A flowchart of another communication method provided for an embodiment of the present disclosure;

[0046] Fig.13 A schematic diagram of the composition of a communication device provided in an embodiment of the present disclosure;

[0047] Fig.14 A schematic diagram of another communication device provided in an embodiment of the present disclosure;

[0048] Fig.15 A schematic diagram of the structure of a communication device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0049] The following will be combined with the 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 described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present disclosure.

[0050] In the description of the present 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 three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "at least one" means one or more, and "plurality" means two or more. The words "first", "second", etc. do not limit the quantity and execution order, and the words "first", "second", etc. do not limit them to be different.

[0051] It should be noted that in the present disclosure, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the present disclosure should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0052] At present, in some high-speed mobile scenarios, more time domain symbols may be needed in the data channel to send demodulation reference signals to improve demodulation accuracy and reduce the impact of high-speed movement on demodulation accuracy. In this way, the overhead of the demodulation reference signal increases, which in turn leads to a decrease in the system spectrum efficiency and insufficient system throughput, which brings a bad user experience. Therefore, how to perform data transmission to avoid the impact of excessive demodulation reference signal symbol overhead on the limited improvement of spectrum efficiency is a problem that needs to be solved urgently.

[0053] In view of this, an embodiment of the present disclosure provides a communication method, the 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 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, and sending the third data sequence.

[0054] In this way, the tail of the previous symbol and the head of the next symbol in two adjacent OFDM 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.

[0055] The method provided by the embodiments 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 communication system related to the third generation partnership project (3GPP), a future evolution communication system (such as a sixth generation (6G) communication system, etc.), or a system integrating multiple systems, etc., without limitation. Figure 1 Taking the communication system 100 as an example, the method provided by the embodiment of the present disclosure is described. Figure 1 It is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided by the present disclosure.

[0056] Figure 1 The following is a schematic diagram of the architecture of a communication system provided by an embodiment of the present disclosure. Figure 1 As shown, the communication system 100 may include one or more network devices 11 and one or more terminal devices 12. The terminal device 12 may be communicatively connected with the one or more network devices 11.

[0057] In some embodiments, the network device 11 can be used to implement functions such as resource scheduling, wireless resource management, and wireless access control of terminal devices. For example, it can be an evolution nodeB (eNB), a next generation base station (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.

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

[0059] In some embodiments, during the communication process, the network device sends data to the terminal device, and the terminal device receives the data sent by the network device. Thus, the network device can be called a transmitting end. Correspondingly, the terminal device can be called a receiving end. Alternatively, the terminal device sends data to the network device, and the network device can be called a receiving end. Correspondingly, the terminal device can be called a transmitting end.

[0060] It should be noted that Figure 1 This is just an exemplary framework diagram. Figure 1 The number of devices or nodes included in the Figure 1 In addition to the functional nodes shown, the communication system may also include other nodes or devices, such as core network devices.

[0061] The system architecture and business scenarios described in the embodiments of the present disclosure are intended to more clearly illustrate the technical solutions of the embodiments of the present disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. A person of ordinary skill in the art can appreciate that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are also applicable to similar technical problems.

[0062] The embodiments provided by the present disclosure are described in detail below in conjunction with the accompanying drawings.

[0063] like Figure 2 As shown, the embodiment of the present disclosure provides a communication method, which includes the following steps:

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

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

[0066] Among them, the reference signal is a signal used by the receiving end to perform operations such as channel estimation, channel measurement, time synchronization or frequency synchronization, and the reference signal can be a signal sent by the transmitting end to the receiving end and known to both the transmitting end and the receiving end. Exemplarily, 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), etc.

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

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

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

[0070] Exemplarily, the transmitting end may extract a portion of the sequence from the tail of the first reference sequence as a cyclic prefix sequence, and extract a portion of the sequence from the head of the first reference sequence as a cyclic suffix sequence. Figure 3 As shown, in the first reference sequence 31, the transmitter can cut off part of the sequence at the tail as a cyclic prefix sequence 311, and cut off part of the sequence at the head as a cyclic suffix sequence 312. In an example, the length of the cyclic prefix sequence 311 is greater than the length of the cyclic suffix sequence 312.

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

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

[0073] For example, Figure 3 As shown, the second reference sequence 32 includes a cyclic prefix sequence 311 , the first reference sequence 31 and a cyclic suffix sequence 312 , and the cyclic prefix sequence 311 precedes the first reference sequence 31 and the cyclic suffix sequence 312 follows the first reference sequence 31 .

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

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

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

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

[0078] For example, Figure 4a As shown, the second reference sequence 41 includes a front part 411 and a rear part 412. Figure 4a It can be seen that the length of the front portion 411 is greater than the length of the rear portion 412. And, Figure 4a The length of the cyclic prefix sequence is greater than the length of the cyclic suffix sequence. Figure 4b As shown, the second reference sequence 42 includes a front part 421 and a rear part 422. Figure 4b It can be seen that the length of the first part 421 is equal to the length of the second part 422. And, Figure 4b The length of the cyclic prefix sequence is greater than the length of the cyclic suffix sequence.

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

[0080] In some embodiments, the first part of the second reference sequence includes a cyclic prefix sequence and the first reference sequence, and the second part of the second reference sequence includes a cyclic suffix sequence. Figure 4c As shown, the second reference sequence 43 includes a front part 431 and a rear part 432. Figure 4c It can be seen that the first part 431 includes a cyclic prefix sequence 431 and a second reference sequence 43, and the second part 432 includes a cyclic suffix sequence 432. Moreover, the length of the first part 431 is greater than the length of the second part 432.

[0081] Furthermore, the transmitting end may 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 the second data sequence. Figure 4a , Figure 4b or Figure 4cAs shown, the transmitting end may use a combined sequence of the first part of the second reference sequence, the first data sequence, and the second part of the second reference sequence as the second data sequence.

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

[0083] Exemplarily, the time domain symbol may be an orthogonal frequency-division multiplexing (OFDM) symbol. OFDM is a multi-carrier transmission technology. It uses a large number of adjacent orthogonal subcarriers (SC), each of which is modulated using modulation techniques such as BPSK and QAM. Based on the technology, it has the ability of high-speed transmission and can effectively combat frequency selective fading.

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

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

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

[0087] Furthermore, since the second data sequence is obtained from the latter part of the second reference sequence, the first data sequence, and the former part 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 part of the second reference sequence in the first time domain symbol is the same as that in the second time domain symbol, that is, the first element of the second data sequence carried in the first time domain symbol is the same as the first element of the second data sequence carried in the second time domain symbol. In addition, the first part of the second reference sequence in the first time domain symbol is the same as that in the second time domain symbol, that is, 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.

[0088] For example, Figure 5 As shown, the first time domain symbol 51 carries the second reference sequence 52, the second data sequence, and the first reference sequence 52. In addition, the second reference sequence 52 carries a cyclic prefix sequence 523, a first reference sequence 524, and a cyclic suffix sequence 525. In the case where 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, Figure 5 The head of the second data sequence carried in the second time domain symbol 53 is obtained from the latter part 522 of the second reference sequence 52, that is, the head element of the second data sequence carried in the second time domain symbol 53 is the same as the head element of the second data sequence carried in the first time domain symbol 51. And, Figure 5 The tail of the second data sequence carried in the second time domain symbol 53 is obtained from the previous part 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.

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

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

[0091] 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 latter part of the second reference symbol carried in the first time domain symbol is different from the latter 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.

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

[0093] 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. Figure 6 As shown, 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.

[0094] In some embodiments, the partial sequence of the first reference sequence included in the first part 613 of the second reference sequence carried in the first time domain symbol 61 is the same as the partial sequence of the first reference sequence included in the first part 623 of the second reference sequence carried in the second time domain symbol 62, then the first part 613 and the first part 623 have different leading elements but the same trailing elements, so that 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 second part 614 of the second reference sequence carried in the first time domain symbol 61 is the same as the second part 624 of the second reference sequence carried in the second time domain symbol 62, so that 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.

[0095] 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. Figure 7 As shown, 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 part 714 of the second reference sequence carried in the first time domain symbol 71 is different from the latter part 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.

[0096] In some embodiments, the partial sequence of the first reference sequence included in the latter part 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 part 724 of the second reference sequence carried in the second time domain symbol 72, then the latter part 714 and the latter part 724 have different tail elements but the same head elements, so that 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 former part 713 of the second reference sequence carried in the first time domain symbol 71 is the same as the former part 723 of the second reference sequence carried in the second time domain symbol 72, so that 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.

[0097] 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. Thus, 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.

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

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

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

[0101] It should be noted that, when the first reference sequence of each time domain symbol in the first time slot is the same as the first reference sequence carried in 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 in each time domain symbol in the first time slot is different from the second reference sequence carried in each time domain symbol in the second time slot. Alternatively, when 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, 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 in each time domain symbol in the first time slot is different from the second reference sequence carried in each time domain symbol in the second time slot.

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

[0103] It should be noted that the first reference sequences of adjacent time domain symbols are the same, and in the second data sequences of adjacent time domain symbols, the header elements are the same and the tail elements are also the same. Thus, in 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, so there is no need to add a new cyclic prefix to each symbol, and the interval between adjacent time domain symbols is equal to the inverse of the subcarrier interval, thereby improving the spectrum efficiency.

[0104] For example, Figure 8 As shown, in the adjacent Nth time slot and the N+1th time slot, the length of the cyclic prefix sequence 811 of each time domain symbol in the Nth time slot is greater than the length of the cyclic prefix sequence 821 of each time domain symbol in the N+1th time slot, and the length of the cyclic suffix sequence 812 of each time domain symbol in the Nth time slot is equal to the length of the cyclic suffix sequence 822 of each time domain symbol in the N+1th time slot. Therefore, the first part 813 of the second reference sequence in each time domain symbol in the Nth time slot is different from the first part 823 of the second reference sequence in each time domain symbol in the N+1th time slot, that is, the second reference sequence carried by each time domain symbol in the Nth time slot is different from the second reference sequence carried by each time domain symbol in the N+1th time slot. In some embodiments, the tail element of the N+1th data sequence carried by each time domain symbol in the N+1th 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 N+1th 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.

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

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

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

[0108] For example, Figure 9aAs shown, 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.

[0109] In some embodiments, the time window length used in the Fourier transform processing is equal to the time length of the second data sequence. Fig.10 As shown, 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 time window length used in the Fourier transform processing is equal to the time length of the second data sequence.

[0110] In some embodiments, the number of calculation points used in the Fourier transform process is equal to the number of elements of 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.

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

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

[0113] In another possible 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.

[0114] For example, Figure 9bAs shown, after determining the second data sequence, the transmitting end can first perform Fourier transform processing on the second data sequence, then perform frequency domain spectrum shaping (FDSS) processing on the second data sequence after Fourier transform processing, and then perform inverse Fourier transform processing to obtain a third data sequence. Then, the transmitting end can transmit the obtained third data sequence.

[0115] In some embodiments, the size of the coefficient 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.

[0116] In some embodiments, the size of the coefficient 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.

[0117] For example, Fig.11 As shown, for the second data sequence 111, the roll-off coefficient of the root raised cosine function used in the frequency domain shaping process is a1, a1 = 0.1. For the second data sequence 112, the roll-off coefficient of the root raised cosine function used in the frequency domain shaping process is a2, a1 = 0.2. In addition, the length of the cyclic prefix sequence 1111 in the second data sequence 111 is greater than the cyclic prefix sequence 1121 in the second data sequence 112. It can be seen that the length of the cyclic prefix sequence of the first reference sequence decreases monotonically with the increase of the roll-off coefficient.

[0118] S105. Send a third data sequence.

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

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

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

[0122] 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, so that the channel estimation parameters can be updated in time and the accuracy of channel estimation can be improved, and it 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, so that there are 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.

[0123] In some embodiments, Fig.12 As shown, the embodiment of the present disclosure also provides another communication method, which includes the following steps:

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

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

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

[0127] 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. Moreover, the length of the cyclic prefix sequence is greater than or equal to the length of the cyclic suffix sequence.

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

[0129] For detailed description of the cyclic prefix sequence and the cyclic suffix sequence, reference may be made to the description of step S102 above, which will not be repeated here.

[0130] In some embodiments, the transmitter may place the 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.

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

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

[0133] In some embodiments, the time window length used in the Fourier transform process 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 process is greater than the number of calculation points used in the Fourier transform. In some embodiments, the time length of the third data sequence is equal to the time length of the second data sequence.

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

[0135] S204: Send a third data sequence.

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

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

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

[0139] Based on the communication method provided in the embodiments of the present disclosure, the channel estimation parameter update speed and the accuracy of channel estimation in high-speed mobile scenarios can be improved, and 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.

[0140] The above mainly introduces the solution provided by the present disclosure from the perspective of 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. It should be easily appreciated by those skilled in the art 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 exceed the scope of the present invention.

[0141] Fig.13 FIG. 1 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. Fig.13As shown, the communication device 130 includes a receiving module 1301 , a processing module 1302 and a sending module 1303 .

[0142] In some embodiments, the receiving module 1301 is used to obtain a first data sequence and a first reference sequence to be transmitted. The processing module 1302 is used to add a cyclic prefix sequence and a cyclic suffix sequence to the first reference sequence to obtain a second reference sequence. The processing module 1302 is also used 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, and process the second data sequence to obtain a third data sequence. The sending module 1303 is used to send the third data sequence.

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

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

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

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

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

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

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

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

[0151] In some embodiments, in adjacent first time domain symbols and second time domain symbols, the first reference sequence of 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.

[0152] In some embodiments, in adjacent first time domain symbols and second time domain symbols, the first reference sequence of 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.

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

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

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

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

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

[0158] In some embodiments, the processing module 1302 is specifically 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.

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

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

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

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

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

[0164] In some embodiments, the size of the coefficient 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.

[0165] In some embodiments, the size of the coefficient 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.

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

[0167] 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 therein, and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0168] Fig.14 FIG. 2 is a schematic diagram showing the composition of another communication device provided by an embodiment of the present disclosure. Fig.14 As shown, the communication device 140 includes a receiving module 1401 , a processing module 1402 and a sending module 1403 .

[0169] In some embodiments, the receiving module 1401 is used to obtain a first data sequence and a first reference sequence to be transmitted. The processing module 1402 is used to add a cyclic suffix sequence before the first data sequence, and to add a cyclic prefix sequence and a 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. The processing module 1402 is also used to process the second data sequence to obtain a third data sequence. The sending module 1403 is used to send the third data sequence.

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

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

[0172] In some embodiments, the time window length used in the Fourier transform process 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 process is greater than the number of calculation points used in the Fourier transform. In some embodiments, the time length of the third data sequence is equal to the time length of the second data sequence.

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

[0174] 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 therein, and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0175] It should be noted that Fig.13 or Fig.14 The modules in the example may also be referred to as units. For example, the receiving module may be referred to as a receiving unit. Fig.13 or Fig.14 In the illustrated embodiment, the names of the modules may not be the names shown in the figure. For example, the sending module may be called a communication module, and the receiving module may be called a communication module.

[0176] Fig.13 or Fig.14If the various units or modules in the embodiment 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 the prior art or all or 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, including several 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: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program codes.

[0177] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiment of the present disclosure provides a structural schematic diagram of a communication device. Fig.15 As shown, the communication device 1500 includes: a processor 1502 , a communication interface 1503 , and a bus 1504 . Optionally, the communication device 1500 may further include a memory 1501 .

[0178] The processor 1502 may be a processor that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the contents of the present disclosure. The 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 devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the contents of the present disclosure. The 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.

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

[0180] The memory 1501 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices 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.

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

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

[0183] The bus 1504 may be an extended industry standard architecture (EISA) bus, etc. The bus 1504 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.15 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0184] 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 assigned to 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.

[0185] The embodiment of the present disclosure also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above computer-readable storage medium. When the program is executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be the memory or memory of any of the above embodiments. The above computer-readable storage medium can also be an external storage device of the above 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 device or apparatus. Further, the above computer-readable storage medium can also include both the internal storage unit of the above device or apparatus and an external storage device. The above computer-readable storage medium is used to store the above computer program and other programs and data required by the above device or apparatus. The above computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0186] The embodiments of the present disclosure also 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.

[0187] Although the present disclosure is described herein in conjunction with various embodiments, in the process of implementing the present disclosure claimed for protection, 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.

[0188] "A" or "an" does not exclude a plurality of cases. 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.

[0189] Although the present disclosure has been described in conjunction with specific features and embodiments thereof, it is 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 exemplary illustrations of the present disclosure as defined by the appended claims, and are deemed to have covered any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. Obviously, 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, if these modifications and variations of the present disclosure fall within the scope of the claims of the present disclosure and their equivalents, the present disclosure is also intended to include these modifications and variations.

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

Claims

1. A communication method, characterized in that: The method comprises: 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, characterized in that 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, characterized in that 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, characterized in that: 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that: The second data sequence is a data sequence carried in a time domain symbol.

10. The method according to claim 1, characterized in that 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, characterized in that: 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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 according to claim 17, characterized in that 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 according to claim 1, characterized in that The method further comprises: 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, characterized in that: The method comprises: 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, characterized in that 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, characterized in that 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, characterized in that The time window length adopted in the Fourier transform processing is equal to the time length of the second data sequence.

30. The method according to claim 28, characterized in that 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 according to claim 26, characterized in that The time length of the third data sequence is equal to the time length of the second data sequence.

32. The method according to claim 26, characterized in that The method further comprises: 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, characterized in that: include: Memory and processor; Memory and processor coupling; 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, characterized in that: 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