WO2025151042A1

WO2025151042A1 - Wireless communication method and related products

Info

Publication number: WO2025151042A1
Application number: PCT/RU2024/000001
Authority: WO
Inventors: Mikhail Vladimirovich POTIPAK; Yuanzhou HU
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2024-01-09
Filing date: 2024-01-09
Publication date: 2025-07-17
Anticipated expiration: 2026-07-09

Abstract

Provided are a wireless communication method and related products. The method includes: transmitting multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols. A length of a sequence transmitted on a symbol is thus not limited by a fixed length of the symbol any more, in other words, a sequence length is decoupled from a symbol length.

Description

WIRELESS COMMUNICATION METHOD AND RELATED PRODUCTS

TECHNICAL FIELD

[0001] The present disclosure relates to the field of communication technologies, and in particular, to a wireless communication method and related products.

BACKGROUND

[0002] While a transmitted signal propagates over the complex environment to reach a receiver, it takes multiple paths due to reflections, diffractions, and scattering. These multiple paths result in delayed copies of the transmitted signal arriving at the receiver at different times, which leads to inter-symbol interference (ISI).

[0003] To minimize the ISI, a cyclic prefix (CP) is used. CP, as a copy of the end part of a transmitted symbol, is essentially a guard interval added to the transmitted symbol, and is inserted at the beginning of the transmitted symbol, thus creating a seamless circular transition.

[0004] This background information is provided to reveal information believed by the applicant to be of possible relevance to the present disclosure. No admission is necessarily intended, nor should be construed, that any of the preceding information constitutes prior art against the present disclosure.

SUMMARY

[0005] In a first aspect, a wireless communication method is provided by the present disclosure, and the method includes: transmitting multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix.

[0006] A long second symbol is split into multiple parts, each short first symbol is based on a split part, and a length of a cyclic prefix appended to a certain first symbol is not greater than a length of a first symbol distinct from the certain symbol, hence, each first symbol can be appended with a cyclic prefix from a distinct first symbol, for example, the cyclic prefix may be a copy of the end part of the distinct first symbol, other than a copy of the end part of itself, A length of a sequence transmitted on a symbol is thus not limited by a fixed length of the symbol any more, in other words, a sequence length is decoupled from a symbol length.

[0007] In a possible implementation of the first aspect, a first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple first symbols, and each symbol other than the first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to (preceding) the each symbol.

[0008] The cyclic prefix added to the beginning of each first symbol may be from the preceding first symbol, for example, may be a copy of the end part of the preceding first symbol, where the cyclic prefix of the initial symbol among the multiple first symbols is from the end part of the last one among the multiple first symbols. By the additions of such cyclic prefixes, a length of a sequence transmitted on a symbol is thus decoupled from a length of the symbol.

[0009] In a possible implementation of the first aspect, each of the multiple first symbols is equal in length.

[0010] In a possible implementation of the first aspect, a length of the second symbol is divisible by a preset integer.

[0011] When a length of a long symbol to be split is divisible, convolution of a reconstructed long sequence with a reference sequence has a good theoretical periodic correlation. [0012] In a possible implementation of the first aspect, a length of the second symbol is not divisible by a preset integer, and the second symbol is padded with a preset number to make a length of the padded second symbol divisible by the preset integer.

[0013] When the original length of a long symbol is not divisible, the long symbol can still be processed to be divisible by means of the padding operation, thus the divisible condition can be met, and in this way, convolution of a reconstructed long sequence with a reference sequence has a good theoretical periodic correlation.

[0014] In a possible implementation of the first aspect, at least two of the multiple first symbols are not equal in length.

[0015] A length of a short first symbol can be arbitrary, this may make a burst design for short first symbols flexible, and requirements of different scenarios can be met.

[0016] In a possible implementation of the first aspect, a combination of the first symbol and a cyclic prefix appended to the first symbol is separated apart from a cyclic prefix appended to a symbol next to the first symbol by a predefined interval in a time domain, where the predefined interval is greater than or equal to 0.

[0017] When transmitting the multiple first symbols, each first symbol is appended with a cyclic prefix, that is, multiple combinations of a first symbol and a cyclic prefix are transmitted, the multiple combinations can be transmitted in continuous time intervals in the case that the predefined interval is equal to 0, and can also be transmitted in non-continuous time intervals in the case that the predefined interval is greater than 0. In this way, requirements of different scenarios can be met.

[0018] In a possible implementation of the first aspect, the method further includes: transmitting multiple third symbols, where each of the multiple third symbols is based on a part of a fourth symbol, where for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix.

[0019] The multiple first symbols can form a burst (or referred to as symbol burst) for a certain type of signal, and the multiple third symbols can form a burst for another type of signal, the additions of cyclic prefixes appended to short symbols of two bursts are similar, i.e., after splitting a long symbol into multiple parts, and each short symbol is based on each part, a cyclic prefix of a certain short symbol is based on a distinct symbol other than the certain short symbol itself. It should be noted that, there may be more than two bursts, the number of the burst is not limited here. Thus, a sequence can be transmitted without coupling to neither symbols nor slots.

[0020] In a possible implementation of the first aspect, a first symbol among the multiple third symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple third symbols, and each symbol other than the first symbol in the multiple third symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

[0021] The cyclic prefix added to the beginning of each third symbol may be from the preceding third symbol, for example, may be a copy of the end part of the preceding third symbol, where the cyclic prefix of the initial symbol among the multiple third symbols may be from the end part of the last one among the multiple first symbols. By the additions of such cyclic prefixes, a length of a sequence transmitted on a symbol is thus decoupled from a length of the symbol.

[0022] In a possible implementation of the first aspect, a symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols is smaller than a predefined distance.

[0023] In the case that two types of signals are transmitted on symbols, for example, reference signals and data signals are transmitted on symbols, the distance between a certain symbol for transmitting the reference signals and an adjacent symbol for transmitting the data signals is decreased, thus, the channel estimation can be more robust to mobility.

[0024] In a possible implementation of the first aspect, the first symbol carries a demodulation reference signal (DMRS), and the third symbol carries data to be demodulated using the DMRS.

[0025] In a possible implementation of the first aspect, the third symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0026] In a possible implementation of the first aspect, a length of a cyclic prefix for each of the multiple first symbols is greater than a maximum delay, where the maximum delay is determined based on a channel over which the multiple first symbols are transmitted.

[0027] The length of a cyclic prefix for each short symbol is greater than a maximum delay, and a signal can thus be effectively transmitted using the short symbols in a multipath environment.

[0028] In a possible implementation of the first aspect, the first symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0029] In a second aspect, a wireless communication method is provided by the present disclosure, and the method includes: receiving multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix; and obtaining the second symbol based on the multiple first symbols.

[0030] Multiple short first symbols are received for reconstruction to obtain the long second symbol, a length of a cyclic prefix appended to a certain first symbol is not greater than a length of a first symbol distinct from the certain symbol, hence, each first symbol can be appended with a cyclic prefix from a distinct first symbol, for example, the cyclic prefix may be a copy of the end part of the distinct first symbol, other than a copy of the end part of itself. A length of a sequence received on a symbol is thus not limited by a fixed length of the symbol any more, in other words, a sequence length is decoupled from a symbol length.

[0031] In a possible implementation of the second aspect, a first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple first symbols, and each symbol other than the first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to (preceding) the each symbol.

[0032] The cyclic prefix added to the beginning of each first symbol may be from the preceding first symbol, for example, may be a copy of the end part of the preceding first symbol, where the cyclic prefix of the initial symbol among the multiple first symbols may be from the end part of the last one among the multiple first symbols. By the additions of such cyclic prefixes, a length of a sequence received on a symbol is thus decoupled from a length of the symbol.

[0033] In a possible implementation of the second aspect, each of the multiple first symbols is equal in length.

[0034] In a possible implementation of the second aspect, at least two of the multiple first symbols are not equal in length.

[0035] A length of a short first symbol can be arbitrary, this may make a burst design for short first symbols flexible, and requirements of different scenarios can be met.

[0036] In a possible implementation of the second aspect, a combination of the first symbol and a cyclic prefix appended to the first symbol is separated apart from a cyclic prefix appended to a symbol next to the first symbol by a predefined interval in a time domain, where the predefined interval is greater than or equal to 0.

[0037] When receiving the multiple first symbols, each first symbol is appended with a cyclic prefix, that is, multiple combinations of a first symbol and a cyclic prefix are received, the multiple combinations can be received in continuous time intervals in the case that the predefined interval is equal to 0, and can also be received in non- continuous time intervals in the case that the predefined interval is greater than 0. In this way, requirements of different scenarios can be met.

[0038] In a possible implementation of the second aspect, the method further includes: receiving multiple third symbols, where each of the multiple third symbols is based on a part of a fourth symbol, where for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix; and obtaining the fourth symbol based on the multiple third symbols.

[0039] The multiple first symbols can form a burst (or referred to as symbol burst) for a certain type of signal, and the multiple third symbols can form a burst for another type of signal, the additions of cyclic prefixes appended to short symbols of two bursts are similar, i.e., a cyclic prefix of a certain short symbol is based on a distinct symbol other than the certain short symbol itself. It should be noted that, there may be more than two bursts, the number of the burst is not limited here. Thus, a sequence can be received without coupling to neither symbols nor slots.

[0040] In a possible implementation of the second aspect, the obtaining the fourth symbol based on the multiple third symbols includes: for each combination of a third symbol and a cyclic prefix appended with the third symbol, processing the combination by using a first receiving window; and reconstructing the each combination to obtain the fourth symbol.

[0041] In a possible implementation of the second aspect, a first symbol among the multiple third symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple third symbols, and each symbol other than the first symbol in the multiple third symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

[0042] The cyclic prefix added to the beginning of each third symbol may be from the preceding third symbol, for example, may be a copy of the end part of the preceding third symbol, where the cyclic prefix of the initial symbol among the multiple third symbols may be from the end part of the last one among the multiple first symbols. By the additions of such cyclic prefixes, a length of a sequence received on a symbol is thus decoupled from a length of the symbol.

[0043] In a possible implementation of the second aspect, a symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols is smaller than a predefined distance.

[0044] In the case that two types of signals are received on symbols, for example, reference signals and data signals are received on symbols, the distance between a certain symbol carrying the reference signals and an adjacent symbol carrying the data signals is decreased, thus, the channel estimation can be more robust to mobility.

[0045] In a possible implementation of the second aspect, the first symbol carries a demodulation reference signal (DMRS), and the third symbol carries data; where the method further includes: demodulating the data from the fourth symbol based on the DMRS.

[0046] In a possible implementation of the second aspect, the obtaining the second symbol based on the multiple first symbols includes: for each combination of a first symbol and a cyclic prefix appended to the first symbol, processing the combination by using a second receiving window; and reconstructing the each combination to obtain the second symbol.

[0047] In a possible implementation of the second aspect, the third symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0048] In a possible implementation of the second aspect, a length of a cyclic prefix for each of the multiple first symbols is greater than a maximum delay, where the maximum delay is determined based on a channel over which the multiple first symbols are transmitted.

[0049] The length of a cyclic prefix for each short symbol is greater than a maximum delay, and a signal can thus be effectively received on the short symbols in a multi-path environment.

[0050] In a possible implementation of the second aspect, the first symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0051] In a third aspect, a wireless communication apparatus is provided by the present disclosure, and the apparatus includes various modules configured to execute the wireless communication method according to the first aspect or any possible implementation of the first aspect.

[0052] In a fourth aspect, a wireless communication apparatus is provided by the present disclosure, and the apparatus includes various modules configured to execute the wireless communication method according to the second aspect or any possible implementation of the second aspect.

[0053] In a fifth aspect, a transmitting end is provided by the present disclosure, and the transmitting end includes processing circuitry for executing the wireless communication method according to the first aspect or any possible implementation of the first aspect.

[0054] In a sixth aspect, a receiving end is provided by the present disclosure, and the receiving end includes processing circuitry for executing the wireless communication method according to the second aspect or any possible implementation of the second aspect.

[0055] In a seventh aspect, a wireless communication system is provided by the present disclosure, and the wireless communication system includes the transmitting end according to the fifth aspect and the receiving end according to the sixth aspect.

[0056] In an eighth aspect, a chip is provided by the present disclosure, and the chip includes an input/output (I/O) interface and a processor, where the processor is configured to call and run computer execution instructions stored in a memory, to enable a device installing with the chip to execute the wireless communication method according to the first aspect or any possible implementation of the first aspect or according to the second aspect or any possible implementation of the second aspect.

[0057] In a ninth aspect, a computer-readable medium is provided by the present disclosure, and the computer-readable medium includes storing computer execution instructions which, when executed by a processor, causes the processor to execute the wireless communication method according to the first aspect or any possible implementation of the first aspect or according to the second aspect or any possible implementation of the second aspect. [0058] In a tenth aspect, a computer program product is provided by the present disclosure, and the computer program product includes computer execution instructions which, when executed by a processor, causes the processor to execute the wireless communication method according to the first aspect or any possible implementation of the first aspect or according to the second aspect or any possible implementation of the second aspect.

[0059] A wireless communication method and related products are provided by the present disclosure. At a transmitting end, a long second symbol is split into multiple parts, each short first symbol is based on a split part, and a length of a cyclic prefix appended to a certain first symbol is not greater than a length of a first symbol distinct from the certain symbol, hence, each first symbol can be appended with a cyclic prefix from a distinct first symbol, for example, the cyclic prefix is a copy of the end part of the distinct first symbol, other than a copy of the end part of itself. At a receiving end, multiple short first symbols are received for reconstruction to obtain the long second symbol. A length of a sequence transmitted or received on a symbol is thus not limited by a fixed length of the symbol any more, in other words, a sequence length is decoupled from a symbol length.

BRIEF DESCRIPTION OF DRAWINGS

[0060] The accompanying drawings are used to provide a further understanding of the present disclosure, constitute a part of the specification, and are used to explain the present disclosure together with the following specific embodiments, but should not be construed as limiting the present disclosure.

[0061] FIG. 1 is a schematic illustration of a communication system according to one or more embodiments of the present disclosure.

[0062] FIG. 2 is another schematic illustration of a communication system according to one or more embodiments of the present disclosure.

[0063] FIG. 3 is a schematic illustration of basic component structure of a communication system according to one or more embodiments of the present disclosure. io [0064] FIG. 4 illustrates a block diagram of a device in a communication system according to one or more embodiments of the present disclosure.

[0065] FIG. 5(a) is a schematic illustration of transmitting and receiving signals without CPs according to one or more embodiments of the present disclosure.

[0066] FIG. 5(b) is a schematic illustration of transmitting and receiving signals with CPs according to one or more embodiments of the present disclosure.

[0067] FIG. 6 is a schematic illustration of symbol reconstruction according to one or more embodiments of the present disclosure.

[0068] FIG. 7 is a flowchart of a wireless communication method according to an embodiment of the present disclosure.

[0069] FIG. 8 is a flowchart of another wireless communication method according to an embodiment of the present disclosure.

[0070] FIG. 9 is a schematic illustration of transmission and reconstruction of a sequence according to one or more embodiments of the present disclosure.

[0071] FIG. 10 is another schematic illustration of transmission and reconstruction of a sequence according to one or more embodiments of the present disclosure.

[0072] FIG. 11 is a schematic illustration of data transmission according to one or more embodiments of the present disclosure.

[0073] FIG. 12 is a schematic illustration of transmitting a sequence according to one or more embodiments of the present disclosure.

[0074] FIG. 13 is a schematic illustration of transmitting multiple sequences according to one or more embodiments of the present disclosure.

[0075] FIG. 14 is a block diagram of a wireless communication apparatus according to one or more embodiments of the present disclosure.

[0076] FIG. 15 is a block diagram of another wireless communication apparatus according to one or more embodiments of the present disclosure.

DESCRIPTION OF EMBODIMENTS

[0077] In the following description, reference is made to the accompanying figures, n which form part of the present disclosure, and which show, by way of illustration, specific aspects of embodiments of the present disclosure or specific aspects in which embodiments of the present disclosure may be used. It is understood that embodiments of the present disclosure may be used in other aspects and include structural or logical changes not depicted in the figures. The following detailed description, therefore, is not to be taken in a limiting sense, and the scope of the present disclosure is defined by the appended claims.

[0078] To assist in understanding the present disclosure, examples of wireless communication systems and devices are described below.

[0079] Example communication systems and devices

[0080] Referring to FIG. 1, as an illustrative example without limitation, a simplified schematic illustration of a communication system is provided. The communication system 100 includes a radio access network 120. The radio access network 120 may be a next generation (e.g., sixth generation (6G) or later) radio access network, or a legacy (e.g., 5G, 4G, 3G or 2G) radio access network. One or more communication electric device (ED) llOa-llOj (generically referred to as 110) may be interconnected to one another or connected to one or more network nodes (170a, 170b, generically referred to as 170) in the radio access network 120. A core network 130 may be a part of the communication system and may be dependent or independent of the radio access technology used in the communication system 100. Also, the communication system 100 includes a public switched telephone network (PSTN) 140, the internet 150, and other networks 160.

[0081] FIG. 2 illustrates an example communication system 100. In general, the communication system 100 enables multiple wireless or wired elements to communicate data and other content. The purpose of the communication system 100 may be to provide content, such as voice, data, video, and/or text, via broadcast, multicast and unicast, etc. The communication system 100 may operate by sharing resources, such as carrier spectrum bandwidth, between its constituent elements. The communication system 100 may include a terrestrial communication system and/or a non-terrestrial communication system. The communication system 100 may provide a wide range of communication services and applications (such as earth monitoring, remote sensing, passive sensing and positioning, navigation and tracking, autonomous delivery and mobility, etc.). The communication system 100 may provide a high degree of availability and robustness through a joint operation of the terrestrial communication system and the non-terrestrial communication system. For example, integrating a nonterrestrial communication system (or components thereof) into a terrestrial communication system can result in what may be considered a heterogeneous network including multiple layers. Compared to conventional communication networks, the heterogeneous network may achieve better overall performance through efficient multilink joint operation, more flexible functionality sharing, and faster physical layer link switching between terrestrial networks and non-terrestrial networks.

[0082] The terrestrial communication system and the non-terrestrial communication system could be considered sub-systems of the communication system. In the example shown, the communication system 100 includes electronic devices (ED) l lOa-l lOd (generically referred to as ED 110), radio access networks (RANs) 120a- 120b, nonterrestrial communication network 120c, a core network 130, a public switched telephone network (PSTN) 140, the internet 150, and other networks 160. The RANs 120a-120b include respective base stations (BSs) 170a-170b, which may be generically referred to as terrestrial transmit and receive points (T-TRPs) 170a- 170b. The nonterrestrial communication network 120c includes an access node 120c, which may be generically referred to as a non-terrestrial transmit and receive point (NT-TRP) 172.

[0083] Any ED 110 may be alternatively or additionally configured to interface, access, or communicate with any other T-TRP 170a- 170b and NT-TRP 172, the internet 150, the core network 130, the PSTN 140, the other networks 160, or any combination of the preceding. In some examples, ED 110a may communicate an uplink and/or downlink transmission over an interface 190a with T-TRP 170a. In some examples, the EDs 110a, 110b, 110c and HOd may also communicate directly with one another via one or more sidelink air interfaces 190b. In some examples, ED 11 Od may communicate an uplink and/or downlink transmission over an interface 190c with NT-TRP 172.

[0084] The air interfaces 190a and 190b may use similar communication technology, such as any suitable radio access technology. For example, the communication system 100 may implement one or more channel access methods, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or single-carrier FDMA (SC- FDMA) in the air interfaces 190a and 190b. The air interfaces 190a and 190b may utilize other higher dimension signal spaces, which may involve a combination of orthogonal and/or non-orthogonal dimensions.

[0085] The air interface 190c can enable communication between the ED l lOd and one or multiple NT-TRPs 172 via a wireless link or simply a link. In some examples, the link is a dedicated connection for unicast transmission, a connection for broadcast transmission, or a connection between a group of EDs and one or multiple NT-TRPs for multicast transmission.

[0086] The RANs 120a and 120b are in communication with the core network 130 to provide the EDs 110a 110b, and 110c with various services such as voice, data, and other services. The RANs 120a and 120b and/or the core network 130 may be in direct or indirect communication with one or more other RANs (not shown), which may or may not be directly served by core network 130, and may or may not employ the same radio access technology as RAN 120a, RAN 120b or both. The core network 130 may also serve as a gateway access between (i) the RANs 120a and 120b or EDs 110a 110b, and 110c or both, and (ii) other networks (such as the PSTN 140, the internet 150, and the other networks 160). In addition, some or all of the EDs 110a 110b, and 110c may include functionality for communicating with different wireless networks over different wireless links using different wireless technologies and/or protocols. Instead of wireless communication (or in addition thereto), the EDs 110a 110b, and 110c may communicate via wired communication channels to a service provider or switch (not shown), and to the internet 150. PSTN 140 may include circuit switched telephone networks for providing plain old telephone service (POTS). Internet 150 may include a network of computers and subnets (intranets) or both, and incorporate protocols, such as Internet Protocol (IP), Transmission Control Protocol (TCP), User Datagram Protocol (UDP). EDs 11 Oa 11 Ob, and 110c may be multimode devices capable of operation according to multiple radio access technologies, and incorporate multiple transceivers necessary to support such.

[0087] Basic component structure

[0088] FIG. 3 illustrates another example of an ED 110 and a base station 170a, 170b and/or 170c. The ED 110 is used to connect persons, objects, machines, etc. The ED 110 may be widely used in various scenarios, for example, cellular communications, device-to-device (D2D), vehicle to everything (V2X), peer-to-peer (P2P), machine-to- machine (M2M), machine-type communications (MTC), internet of things (IOT), virtual reality (VR), augmented reality (AR), industrial control, self-driving, remote medical, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, drones, robots, remote sensing, passive sensing, positioning, navigation and tracking, autonomous delivery and mobility, etc.

[0089] Each ED 110 represents any suitable end user device for wireless operation and may include such devices (or may be referred to) as a user equipment/device (UE), a wireless transmit/receive unit (WTRU), a mobile station, a fixed or mobile subscriber unit, a cellular telephone, a station (STA), a machine type communication (MTC) device, a personal digital assistant (PDA), a smartphone, a laptop, a computer, a tablet, a wireless sensor, a consumer electronics device, a smart book, a vehicle, a car, a truck, a bus, a train, or an loT device, an industrial device, or apparatus (e.g. communication module, modem, or chip) in the forgoing devices, among other possibilities. Future generation EDs 110 may be referred to using other terms. The base station 170a and 170b is a T-TRP and will hereafter be referred to as T-TRP 170. Also shown in FIG. 3, a NT-TRP will hereafter be referred to as NT-TRP 172. Each ED 110 connected to T- TRP 170 and/or NT-TRP 172 can be dynamically or semi-statically tumed-on (i.e., established, activated, or enabled), turned-off (i.e., released, deactivated, or disabled) and/or configured in response to one of more of: connection availability and connection necessity.

[0090] The ED 110 includes a transmitter 201 and a receiver 203 coupled to one or more antennas 204. Only one antenna 204 is illustrated. One, some, or all of the antennas may alternatively be panels. The transmitter 201 and the receiver 203 may be integrated, e.g. as a transceiver. The transceiver is configured to modulate data or other content for transmission by at least one antenna 204 or network interface controller (NIC). The transceiver is also configured to demodulate data or other content received by the at least one antenna 204. Each transceiver includes any suitable structure for generating signals for wireless or wired transmission and/or processing signals received wirelessly or by wire. Each antenna 204 includes any suitable structure for transmitting and/or receiving wireless or wired signals.

[0091] The ED 110 includes at least one memory 208. The memory 208 stores instructions and data used, generated, or collected by the ED 110. For example, the memory 208 could store software instructions or modules configured to implement some or all of the functionality and/or embodiments described herein and that are executed by the processing unit(s) 210. Each memory 208 includes any suitable volatile and/or non-volatile storage and retrieval device(s). Any suitable type of memory may be used, such as random access memory (RAM), read only memory (ROM), hard disk, optical disc, subscriber identity module (SIM) card, memory stick, secure digital (SD) memory card, on-processor cache, and the like.

[0092] The ED 110 may further include one or more input/output devices (not shown) or interfaces (such as a wired interface to the internet 150 in FIG. 1). The input/output devices permit interaction with a user or other devices in the network. Each input/output device includes any suitable structure for providing information to or receiving information from a user, such as a speaker, microphone, keypad, keyboard, display, or touch screen, including network interface communications.

[0093] The ED 110 further includes a processor 210 for performing operations including those related to preparing a transmission for uplink transmission to the NT- TRP 172 and/or T-TRP 170, those related to processing downlink transmissions received from the NT-TRP 172 and/or T-TRP 170, and those related to processing sidelink transmission to and from another ED 110. Processing operations related to preparing a transmission for uplink transmission may include operations such as encoding, modulating, transmit beamforming, and generating symbols for transmission. Processing operations related to processing downlink transmissions may include operations such as receive beamforming, demodulating and decoding received symbols. Depending upon the embodiment, a downlink transmission may be received by the receiver 203, possibly using receive beamforming, and the processor 210 may extract signaling from the downlink transmission (e.g. by detecting and/or decoding the signaling). An example of signaling may be a reference signal transmitted by NT-TRP 172 and/or T-TRP 170. In some embodiments, the processor 276 implements the transmit beamforming and/or receive beamforming based on the indication of beam direction, e.g. beam angle information (BAI), received from T-TRP 170. In some embodiments, the processor 210 may perform operations relating to network access (e.g. initial access) and/or downlink synchronization, such as operations relating to detecting a synchronization sequence, decoding and obtaining the system information, etc. In some embodiments, the processor 210 may perform channel estimation, e.g. using a reference signal received from the NT-TRP 172 and/or T-TRP 170.

[0094] Although not illustrated, the processor 210 may form part of the transmitter 201 and/or receiver 203. Although not illustrated, the memory 208 may form part of the processor 210.

[0095] The processor 210, and the processing components of the transmitter 201 and receiver 203 may each be implemented by the same or different one or more processors that are configured to execute instructions stored in a memory (e.g. in memory 208). Alternatively, some or all of the processor 210, and the processing components of the transmitter 201 and receiver 203 may be implemented using dedicated circuitry, such as a programmed field-programmable gate array (FPGA), a graphical processing unit (GPU), or an application-specific integrated circuit (ASIC).

[0096] The T-TRP 170 may be known by other names in some implementations, such as a base station, a base transceiver station (BTS), a radio base station, a network node, a network device, a device on the network side, a transmit/receive node, a Node B, an evolved NodeB (eNodeB or eNB), a Home eNodeB, a next Generation NodeB (gNB), a transmission point (TP) ), a site controller, an access point (AP), or a wireless router, a relay station, a remote radio head, a terrestrial node, a terrestrial network device, or a terrestrial base station, base band unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distribute unit (DU), positioning node, among other possibilities. The T-TRP 170 may be macro BSs, pico BSs, relay node, donor node, or the like, or combinations thereof. The T-TRP 170 may refer to the forging devices or apparatus (e.g. communication module, modem, or chip) in the forgoing devices.

[0097] In some embodiments, the parts of the T-TRP 170 may be distributed. For example, some of the modules of the T-TRP 170 may be located remote from the equipment housing the antennas of the T-TRP 170, and may be coupled to the equipment housing the antennas over a communication link (not shown) sometimes known as front haul, such as common public radio interface (CPRI). Therefore, in some embodiments, the term T-TRP 170 may also refer to modules on the network side that perform processing operations, such as determining the location of the ED 110, resource allocation (scheduling), message generation, and encoding/decoding, and that are not necessarily part of the equipment housing the antennas of the T-TRP 170. The modules may also be coupled to other T-TRPs. In some embodiments, the T-TRP 170 may actually be a plurality of T-TRPs that are operating together to serve the ED 110, e.g. through coordinated multipoint transmissions.

[0098] The T-TRP 170 includes at least one transmitter 252 and at least one receiver 254 coupled to one or more antennas 256. Only one antenna 256 is illustrated. One, some, or all of the antennas may alternatively be panels. The transmitter 252 and the receiver 254 may be integrated as a transceiver. The T-TRP 170 further includes a processor 260 for performing operations including those related to: preparing a transmission for downlink transmission to the ED 110, processing an uplink transmission received from the ED 110, preparing a transmission for backhaul transmission to NT-TRP 172, and processing a transmission received over backhaul from the NT-TRP 172. Processing operations related to preparing a transmission for downlink or backhaul transmission may include operations such as encoding, modulating, precoding (e.g. MIMO precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing received transmissions in the uplink or over backhaul may include operations such as receive beamforming, and demodulating and decoding received symbols. The processor 260 may also perform operations relating to network access (e.g. initial access) and/or downlink synchronization, such as generating the content of synchronization signal blocks (SSBs), generating the system information, etc. In some embodiments, the processor 260 also generates the indication of beam direction, e.g. BAI, which may be scheduled for transmission by scheduler 253. The processor 260 performs other network-side processing operations described herein, such as determining the location of the ED 110, determining where to deploy NT-TRP 172, etc. In some embodiments, the processor 260 may generate signaling, e.g. to configure one or more parameters of the ED 110 and/or one or more parameters of the NT-TRP 172. Any signaling generated by the processor 260 is sent by the transmitter 252. Note that “signaling”, as used herein, may alternatively be called control signaling. Dynamic signaling may be transmitted in a control channel, e.g. a physical downlink control channel (PDCCH), and static or semi-static higher layer signaling may be included in a packet transmitted in a data channel, e.g. in a physical downlink shared channel (PDSCH).

[0099] A scheduler 253 may be coupled to the processor 260. The scheduler 253 may be included within or operated separately from the T-TRP 170, which may schedule uplink, downlink, and/or backhaul transmissions, including issuing scheduling grants and/or configuring scheduling-free (“configured grant”) resources. The T-TRP 170 further includes a memory 258 for storing information and data. The memory 258 stores instructions and data used, generated, or collected by the T-TRP 170. For example, the memory 258 could store software instructions or modules configured to implement some or all of the functionality and/or embodiments described herein and that are executed by the processor 260.

[0100] Although not illustrated, the processor 260 may form part of the transmitter 252 and/or receiver 254. Also, although not illustrated, the processor 260 may implement the scheduler 253. Although not illustrated, the memory 258 may form part of the processor 260.

[0101] The processor 260, the scheduler 253, and the processing components of the transmitter 252 and receiver 254 may each be implemented by the same or different one or more processors that are configured to execute instructions stored in a memory, e.g. in memory 258. Alternatively, some or all of the processor 260, the scheduler 253, and the processing components of the transmitter 252 and receiver 254 may be implemented using dedicated circuitry, such as a FPGA, a GPU, or an ASIC.

[0102] Although the NT-TRP 172 is illustrated as a drone only as an example, the NT- TRP 172 may be implemented in any suitable non-terrestrial form. Also, the NT-TRP 172 may be known by other names in some implementations, such as a non-terrestrial node, a non-terrestrial network device, or a non-terrestrial base station. The NT-TRP 172 includes a transmitter 272 and a receiver 274 coupled to one or more antennas 280. Only one antenna 280 is illustrated. One, some, or all of the antennas may alternatively be panels. The transmitter 272 and the receiver 274 may be integrated as a transceiver. The NT-TRP 172 further includes a processor 276 for performing operations including those related to: preparing a transmission for downlink transmission to the ED 110, processing an uplink transmission received from the ED 110, preparing a transmission for backhaul transmission to T-TRP 170, and processing a transmission received over backhaul from the T-TRP 170. Processing operations related to preparing a transmission for downlink or backhaul transmission may include operations such as encoding, modulating, precoding (e.g. MIMO precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing received transmissions in the uplink or over backhaul may include operations such as receive beamforming, and demodulating and decoding received symbols. In some embodiments, the processor 276 implements the transmit beamforming and/or receive beamforming based on beam direction information (e.g. BAI) received from T-TRP 170. In some embodiments, the processor 276 may generate signaling, e.g. to configure one or more parameters of the ED 110. In some embodiments, the NT-TRP 172 implements physical layer processing, but does not implement higher layer functions such as functions at the medium access control (MAC) or radio link control (RLC) layer. As this is only an example, more generally, the NT-TRP 172 may implement higher layer functions in addition to physical layer processing.

[0103] The NT-TRP 172 further includes a memory 278 for storing information and data. Although not illustrated, the processor 276 may form part of the transmitter 272 and/or receiver 274. Although not illustrated, the memory 278 may form part of the processor 276.

[0104] The processor 276 and the processing components of the transmitter 272 and receiver 274 may each be implemented by the same or different one or more processors that are configured to execute instructions stored in a memory, e.g. in memory 278. Alternatively, some or all of the processor 276 and the processing components of the transmitter 272 and receiver 274 may be implemented using dedicated circuitry, such as a programmed FPGA, a GPU, or an ASIC. In some embodiments, the NT-TRP 172 may actually be a plurality of NT-TRPs that are operating together to serve the ED 110, e.g. through coordinated multipoint transmissions.

[0105] The T-TRP 170, the NT-TRP 172, and/or the ED 110 may include other components, but these have been omitted for the sake of clarity.

[0106] Basic module structure

[0107] One or more steps of the embodiment methods provided herein may be performed by corresponding units or modules, according to FIG. 4. FIG. 4 illustrates units or modules in a device, such as in ED 110, in T-TRP 170, or in NT-TRP 172. For example, a signal may be transmitted by a transmitting unit or a transmitting module. For example, a signal may be transmitted by a transmitting unit or a transmitting module. A signal may be received by a receiving unit or a receiving module. A signal may be processed by a processing unit or a processing module. Other steps may be performed by an artificial intelligence (Al) or machine learning (ML) module. The respective units or modules may be implemented using hardware, one or more components or devices that execute software, or a combination thereof. For instance, one or more of the units or modules may be an integrated circuit, such as a programmed FPGA, a GPU, or an ASIC. It will be appreciated that where the modules are implemented using software for execution by a processor for example, they may be retrieved by a processor, in whole or part as needed, individually or together for processing, in single or multiple instances, and that the modules themselves may include instructions for further deployment and instantiation.

[0108] Additional details regarding the EDs 110, T-TRP 170, and NT-TRP 172 are known to those of skill in the art. As such, these details are omitted here.

[0109] Example concepts of some terms

[0110] Modulation: the process of superimposing a low-frequency signal carrying transmission information on a high-frequency carrier signal.

Demodulation: extracting the original information from a modulated carrier wave.

Reference signal: a priori known signal provided by the transmitting end to the receiving end, for channel estimation or detection.

Fast Fourier Transformation: transforming received signals from a time domain to a frequency domain.

[0111] The above describes possible scenarios or generalized description of the examples of the present disclosure, the motivation and technical concepts of the present disclosure are illustrated in the following.

[0112] While a transmitted signal propagates over the complex environment to reach a receiver, it takes multiple paths due to reflections, diffractions, and scattering. These multiple paths result in delayed copies of the transmitted signal arriving at the receiver at different times, which leads to inter-symbol interference (ISI).

[0113] To minimize the ISI, a cyclic prefix (CP) is used. CP, as a copy of the end part of a transmitted signal on a symbol, is essentially a guard interval added to the symbol, and is inserted at the beginning of the symbol, thus creating a seamless circular transition.

[0114] The length of the cyclic prefix is typically shorter than the symbol duration but long enough to accommodate the adoptable maximum delay in the channel. At the receiver side, the symbol sample length should be power of two, to achieve best Fast Fourier Transformation (FFT) performance of a receiving window. For example, if the symbol duration is too long, which means the subcarrier spacing is becoming too small, then the Inter-carrier interference (ICI) is likely to happen. Generally, a sequence length is limited by the symbol duration, and the symbol duration is predefined by the frame structure. Thus, a method for decoupling the sequence length from the symbol length is required.

[0115] FIG. 5(a) illustrates transmitting and receiving signals without CPs, while FIG. 5(b) illustrates transmitting and receiving signals with CPs. As shown in FIG. 5(a), if signals without CPs are transmitted on symbols over a channel, considering there is a propagation delay for the transmitted signals, at the receiver side, in a receiving window, symbol overlap may occur, i.e., ISI may be caused. In order to minimize the ISI, a copy of the end part of a transmitted signal on a symbol is used as a CP of the symbol, as shown in FIG. 5(b). In this way, there is no symbol overlap in each receiving window, ISI is thus avoided.

[0116] During the above processing, it is assumed that a transmitter and a receiver are in a good synchronization; and only samples which are in receiving windows are taken into processing at the receiver side. In addition, a periodic convolution with a priori known sequence is performed over the extracted samples.

[0117] As mentioned before, a sequence length is limited by the symbol duration. Since the total symbol sample length (without CPs) should be power of two, the sequence length should also be power of two length. If a long symbol is directly split into short symbol parts with the above CP approach, and then at the receiver side reconstructing the long symbol from the short symbol parts is not possible due to unknown channel delays, as shown in FIG. 6. A stride in FIG. 6 means that short symbols (or the short symbol parts) transmitted non-continuously in a L_s period. At the receiver side, the split short symbols are received in receiving windows, then the received short symbols are combined to form a long symbol, but the combined long symbol is obviously not the long symbol at the transmitting side.

[0118] In view of the above, the present disclosure provides a flexible allocation, mapping and multiplexing of a physical layer frame channel structure, to decouple a sequence length from a symbol length, and in the present disclosure, a long symbol is split into multiple short symbols, while the short symbols can be transmitted non- continuously. Specific embodiments of the present disclosure will be elaborated in the following description.

[0119] An embodiment of the present disclosure provides a wireless communication method, and the method includes: a transmitting end transmitting multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix.

[0120] The transmitting end may be a network device, or may be a terminal device, or may also be a part of the network device or the terminal device (e.g., implemented as a module which can be integrated into a device), which is not limited here. It should be noted that in a case where the transmitting end is implemented as a module, the transmitting operation may also be an outputting operation, it is not necessary to transmit but just to output the multiple first symbols to a certain device with a transmission function, the specific details with regard to the transmitting operation performed by the transmitting end throughout the document also apply for the outputting operation.

[0121] Each first symbol is based on a split part from a long symbol (or sequence), i.e., the foregoing mentioned second symbol, it means that a first symbol may directly be a split part of a long sequence, or may be a variation of the split part. In the splitting process, for example, the second symbol is split into multiple first symbols, and the multiple first symbols do not overlap with each other, while in some cases, two or more first symbols can overlap, which is not limited here. Regarding a type of the first symbol, the first symbol can be one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0122] The further first symbol (or referred to as another first symbol) refers to a distinct first symbol other than a first symbol with a cyclic prefix to be determined, for example, in the case that a cyclic prefix of an initial first symbol among the multiple first symbols needs to be determined, the further first symbol refers a distinct first symbol other than the initial first symbol. Regarding the specific implementation for a cyclic prefix appended to a first symbol, in a possible implementation, a first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple first symbols, and each symbol other than the first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to (preceding) the each symbol.

[0123] The cyclic prefix added to the beginning of each first symbol may be from the preceding first symbol, for example, may be a copy of the end part of the preceding first symbol, where the cyclic prefix of the initial symbol among the multiple first symbols may be from the end part of the last one among the multiple first symbols. By the additions of such cyclic prefixes, a length of a sequence transmitted on a symbol is thus decoupled from a length of the symbol.

[0124] In addition, since the cyclic prefix for one first symbol is taken from a further first symbol, so a length of the further first symbol is greater than a length of the cyclic prefix.

[0125] The above mentioned the multiple first symbols are from the split parts of the second symbol, regarding a length of a first symbol, there is no limitation in the embodiments of the present disclosure. For example, each of the multiple first symbols is equal in length, or at least two of the multiple first symbols are not equal in length. For an example, each of the multiple first symbols has a different length which is arbitrary, or a different length which has certain regularity, such as incremental or decremental principles, and other principles. For another example, some of the multiple first symbols are different in length, while the remaining first symbols are the same in length. A length of a short first symbol can be arbitrary, this may make a burst design for short first symbols flexible, and requirements of different scenarios can be met.

[0126] In the case that each first symbol has the same length, and a length of the second symbol is divisible by a preset integer, a length of a first symbol may equal to the ratio of the length of the second symbol to the number of the first symbols. When a length of a long symbol to be split is divisible, convolution of a reconstructed long sequence with a reference sequence has a good theoretical periodic correlation. In addition, if a length of the second symbol is not divisible by a preset integer, a padding operation may be performed, and the second symbol is padded with a preset number to make a length of the padded second symbol divisible by the preset integer. It should be noted that, the preset number may be 0, or other default values. That is, when the original length of a long symbol is not divisible, the long symbol can still be processed to be divisible by means of the padding operation, thus the divisible condition can be met, and in this way, convolution of a reconstructed long sequence with a reference sequence has a good theoretical periodic correlation.

[0127] In a possible implementation, a combination of the first symbol and a cyclic prefix appended to the first symbol is separated apart from a cyclic prefix appended to a symbol next to the first symbol by a predefined interval in a time domain, where the predefined interval is greater than or equal to 0. It means that one combination of a first symbol and a cyclic prefix is transmitted after another combination of a first symbol and a cyclic prefix, there may be or may not be a time interval between two combinations, which can be designed according to actual requirements. In other words, when transmitting the multiple first symbols, each first symbol is appended with a cyclic prefix, that is, multiple combinations of a first symbol and a cyclic prefix are transmitted, the multiple combinations can be transmitted in continuous time intervals in the case that the predefined interval is equal to 0, and can also be transmitted in non- continuous time intervals in the case that the predefined interval is greater than 0. In this way, requirements of different scenarios can be met.

[0128] The above describes a symbol burst (or referred to as burst) design aiming at decoupling a sequence length from a symbol length from a broad perspective, and next the symbol burst design will be introduced in more details.

[0129] In a possible implementation, as shown in FIG. 7, the wireless communication method includes the following steps.

[0130] Step 702, a transmitting end transmits multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix.

[0131] Step 704, the transmitting end transmits multiple third symbols, where each of the multiple third symbols is based on a part of a fourth symbol, where for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix.

[0132] For step 702, reference may be made to the foregoing relevant description, which will not be repeated here. Each third symbol is based on a split part from a long symbol (or sequence), i.e., the foregoing mentioned fourth symbol, it means that a third symbol may directly be a split part of a long sequence, or may be a variation of the split part. In the splitting process, for example, the fourth symbol is split into multiple third symbols, and the multiple third symbols do not overlap with each other, while in some cases, two or more third symbols can overlap, which is not limited here. Regarding a type of the third symbol, the third symbol can be one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0133] The further third symbol (or referred to as another third symbol) refers to a distinct third symbol other than a third symbol with a cyclic prefix to be determined, for example, in the case that a cyclic prefix of an initial third symbol among the multiple third symbols needs to be determined, the further third symbol refers a distinct third symbol other than the initial third symbol. Regarding the specific implementation for a cyclic prefix appended to a third symbol, in a possible implementation, a first symbol among the multiple third symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple third symbols, and each symbol other than the first symbol in the multiple third symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to (preceding) the each symbol.

[0134] In addition, since the cyclic prefix for one third symbol is taken from a further third symbol, so a length of the further third symbol is greater than a length of the cyclic prefix.

[0135] The cyclic prefix added to the beginning of each third symbol may be from the preceding third symbol, for example, may be a copy of the end part of the preceding third symbol, where the cyclic prefix of the initial symbol among the multiple third symbols may be from the end part of the last one among the multiple first symbols. By the additions of such cyclic prefixes, a length of a sequence transmitted on a symbol is thus decoupled from a length of the symbol.

[0136] The second symbol from which the multiple first symbols come and the fourth symbol from which the multiple third symbols come may carry different types of signal. For example, the multiple first symbols can form a burst (or referred to as symbol burst) for a certain type of signal, and the multiple third symbols can form a burst for another type of signal, the additions of cyclic prefixes appended to short symbols of two bursts are similar, i.e., after splitting a long symbol into multiple parts, and each short symbol is based on each part, a cyclic prefix of a certain short symbol is based on a distinct symbol other than the certain short symbol itself. It should be noted that, there may be more than two bursts, the number of the burst is not limited here. Thus, a sequence can be transmitted without coupling to neither symbols nor slots.

[0137] In a possible implementation, a symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols is smaller than a predefined distance. It should be noted that, more than one type of signals can be transmitted in different symbol bursts. Positions of a first symbol and a third symbol may be predefined, for example, a position of each of the first symbol and the third symbol in a slot is predefined. The predefined distance here is used for characterizing the actual requirement for transmitting two types of symbols, for example, when the first symbol carries a demodulation reference signal (DMRS), and the third symbol carries data to be demodulated using the DMRS, in this case, reference signals and data signals are transmitted on symbols, the distance between a certain symbol for transmitting the reference signals and an adjacent symbol for transmitting the data signals is decreased, thus, the channel estimation can be more robust to mobility. This also applies for other types of reference signals, which is not limited in the embodiments of the present disclosure.

[0138] In the embodiments of the present disclosure, there is no limitation on the length of a cyclic prefix to be added to a short symbol (e.g., the above mentioned first symbol or third symbol), as long as certain requirements are met, for example, the ISI between symbols is avoided. In a possible implementation, a length of a cyclic prefix for each of the multiple first symbols is greater than a maximum delay, where the maximum delay is determined based on a channel over which the multiple first symbols are transmitted. Since the length of a cyclic prefix for each short symbol is greater than a maximum delay, the aforementioned advantages of setting a cyclic prefix also apply here, a signal can thus be effectively transmitted using the short symbols in a multi-path environment.

[0139] With the wireless communication method provided by the present disclosure, a long second symbol is split into multiple parts, each short first symbol is based on a split part, and a length of a cyclic prefix appended to a certain first symbol is not greater than a length of a first symbol distinct from the certain symbol, hence, each first symbol can be appended with a cyclic prefix from a distinct first symbol, for example, the cyclic prefix may be a copy of the end part of the distinct first symbol, other than a copy of the end part of itself. A length of a sequence transmitted on a symbol is thus not limited by a fixed length of the symbol any more, in other words, a sequence length is decoupled from a symbol length.

[0140] In the above, the wireless communication method of the present disclosure is described from the perspective of a transmitting end. In the following, a wireless communication method of the present disclosure will be described from the perspective of a receiving end in combination with FIG. 8. FIG. 8 shows a schematic flowchart of another wireless communication method according to one or more embodiments of the present disclosure. The method can be implemented by a receiving end. As shown in FIG. 8, the method can include the following steps.

[0141] Step 802, a receiving end receives multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix.

[0142] Step 804, the receiving end obtains the second symbol based on the multiple first symbols.

[0143] The receiving end may be a network device, or may be a terminal device, or may also be a part of the network device or the terminal device (e.g., implemented as a module which can be integrated into a device), which is not limited here. It should be noted that in a case where the receiving end is implemented as a module, the receiving operation may also be an inputting operation, it is not necessary to receive but just to input the multiple first symbols from a certain device with a receiving function, the specific details with regard to the receiving operation performed by the receiving end throughout the document also apply for the inputting operation.

[0144] For step 802, reference may be made to the forgoing relevant description, which will not be repeated here. Regarding the implementation of step 804, for each combination of a third symbol and a cyclic prefix appended with the third symbol, the combination is processed by using a first receiving window, and then the each combination is reconstructed to obtain the fourth symbol.

[0145] With the wireless communication method provided by the present disclosure, multiple short first symbols are received for reconstruction to obtain the long second symbol, a length of a cyclic prefix appended to a certain first symbol is not greater than a length of a first symbol distinct from the certain symbol, hence, each first symbol can be appended with a cyclic prefix from a distinct first symbol, for example, the cyclic prefix is a copy of the end part of the distinct first symbol, other than a copy of the end part of itself. A length of a sequence received on a symbol is thus not limited by a fixed length of the symbol any more, in other words, a sequence length is decoupled from a symbol length.

[0146] In a possible implementation, the wireless communication method includes: a receiving end receiving multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix; the receiving end obtaining the second symbol based on the multiple first symbols; the receiving end receiving transmitting multiple third symbols, where each of the multiple third symbols is based on a part of a fourth symbol, where for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix; and the receiving end obtaining the fourth symbol based on the multiple third symbols.

[0147] For the above steps, reference may be made to the forgoing relevant description, which will not be repeated here. The multiple first symbols can form a burst (or referred to as symbol burst) for a certain type of signal, and the multiple third symbols can form a burst for another type of signal, the additions of cyclic prefixes appended to short symbols of two bursts are similar, i.e., a cyclic prefix of a certain short symbol is based on a distinct symbol other than the certain short symbol itself. It should be noted that, there may be more than two bursts, the number of the burst is not limited here. Thus, a sequence can be received without coupling to neither symbols nor slots.

[0148] It should be understood by a person skilled in the art that, the relevant description of the wireless communication method from the perspective of the receiving end in the embodiments of the present disclosure may be understood with reference to the relevant description of the wireless communication method from the perspective of the transmitting end in the embodiments of the present disclosure.

[0149] Here a long sequence is taken as an object to be split, and the result of the splitting will be multiple short sequence parts, and the long sequence may be transmitted on a long symbol (the foregoing mentioned second/fourth symbol), but as mentioned above, such transmission would be impossible due to ICI and/or the symbol duration limit. So in the embodiments of the present disclosure, it is proposed to transmit the split sequence parts (or referred to as short sequence parts) obtained based on the long sequence via short symbols (the foregoing mentioned first/third symbols). The long sequence may correspond to the long symbol, and the short sequence parts may correspond to short symbols. When the sequence parts are transmitted via short symbols, they may form a symbol burst.

[0150] In order to elaborate the wireless communication methods of the present disclosure more clearly, in the following, taking a long sequence with a given length L as an example, the method will be described in more details.

[0151] For a long sequence with a given length L, the long sequence (corresponding to a possible implementation of the above second/fourth symbol) is to be transmitted by parts with a length L_p, i.e., the long sequence is divided into multiple short sequence parts (corresponding to a possible implementation of the above first/third symbols) with the same length L_p. A condition of L mod L_p = 0 may be met, it means that a total length of the long sequence is divisible, if it is not divisible, the long sequence can be padded with a preset number to make the total length of the padded long sequence divisible, where the preset number may be 0 or other default values. Therefore, the total length of the long sequence (or the padded long sequence) is not a prime number. It should be noted that, when the total length of the long sequence is not divisible, as shown in FIG. 9, a burst (or referred to as a symbol burst) consisting from N_b sequence parts (corresponding to a possible implementation of the above first/third symbols) is thus designed, where the sequence parts count of the burst is N_b = [L/ L_p]. The cyclic prefix length L_CP should be long enough to accommodate an adoptable maximum delay in a channel, as in the foregoing CP approach. After splitting the long sequence (corresponding to a possible implementation of the above second/fourth symbol) into N_b sequence parts, N_b symbols for transmitting corresponding N_b sequence parts are respectively constructed by adding a corresponding CP from the end of a previous sequence part. The sequence parts of the burst may be transmitted non-continuously in a L_s period (L_s refers to a stride length), and a burst with a total length L_b = (L_CP + L_p + Ls ■ N_b is transmitted by parts.

[0152] At the receiver side, the sequence parts of the burst are processed by receiving windows with a length L_p . As shown in FIG. 9, the received parts can be joined together and assembled to obtain the long sequence, in other words, the long sequence is obtained through reconstruction of the received parts. Then periodic cross-correlation of the reconstructed long sequence and a reference long sequence is computed. A long sequence theoretical bound of side lobe level can thus be achieved.

[0153] In the above case, each of the split sequence parts is equal in length, however, in some cases, some or all of the split sequence parts can be unequal in length, i.e., at least two of the split sequence parts are not equal in length. Next, a technical solution of the split sequence parts with arbitrary lengths will be introduced. [0154] For a long sequence with a given length L, the long sequence (corresponding to a possible implementation of the above second/fourth symbol) is to be transmitted by parts with arbitrary lengths L_pi, where i = 0, 1, 2, ... , N_b. As shown in FIG. 10, a burst (or referred to as a symbol burst) consisting from N_b sequence parts (corresponding to a possible implementation of the above first/third symbols) is thus designed. The cyclic prefix length L_CP should be long enough to accommodate an adoptable maximum delay in a channel, as in the foregoing CP approach. After splitting the long sequence into N_b sequence parts, N_b symbols for transmitting corresponding N_b sequence parts are respectively constructed by adding a corresponding CP from the end of a previous sequence part. The restriction L_pi > L_CP may be met, i.e., a length of a sequence part is longer than a length of the CP (determined based on said sequence parts). The sequence parts of the burst may be transmitted non-continuously in a L_si period (L_si refers to a stride length, which may be different from sequence part to part), and a burst with a total length L_b = L_CP • N_b + transmitted by parts.

[0155] At the receiver side, the sequence parts of the burst are processed by receiving windows with a length L_pi with corresponding L_si. As shown in FIG. 10, the received parts can be joined together and assembled to obtain the long sequence, in other words, the long sequence is obtained through reconstruction of the received parts. Then periodic cross-correlation of the reconstructed long sequence and a reference long sequence is computed. A long sequence theoretical bound of side lobe level can thus be achieved.

[0156] Next, several examples will be illustrated based on the foregoing ideas.

[0157] In an example, for data transmission, a long data symbol is split into multiple short data symbols. As shown in baseline 1 of FIG. 11, there are two DMRS symbols (black symbols) and four data symbols (white symbols), these symbols are with subcarrier spacing Ay, each symbol carries N sequences (i.e., definite sequences from the set of orthogonal cover codes (OCC codes), where N is a cardinal of the set of OCC codes), the distance between a data symbol (Symbol 1) and adjacent DMRS symbols (Symbol 2 and Symbol 3) is 1.5 symbols. As shown in baseline 2 of FIG. 11, there are one DMRS symbol (black symbol) and two data symbols (white symbols), these symbols are with subcarrier spacing Ay/2 , since the subcarrier spacing becomes smaller, the symbol duration becomes longer, thus each symbol carries 2N sequences (i.e., definite sequences from the set of OCC codes, where N is a cardinal of the set of OCC codes), the distance between a data symbol (Symbol 0) and an adjacent DMRS symbol (Symbol 1) is 2 symbols. When the foregoing CP getting approach is applied to the case of baseline 2, i.e., each of the symbols is split into two parts. For each symbol, the foregoing CP getting approach is used, i.e., CP appended to (Symbol 0 Part 0) gets from the end part of (Symbol 0 Part 1), CP to (Symbol 0 Part 1) gets from the end part of (Symbol 0 Part 0), where Symbol 0 Part 0 and Symbol 0 Part 1 may be a specific example of the forgoing mentioned first symbols, and Symbol 0 may be a specific example of the forgoing mentioned second symbol. All the same for other data symbols and the DMRS symbol, that is, CP appended to (Symbol 2 Part 0) gets from the end part of (Symbol 2 Part 1), CP to (Symbol 2 Part 1) gets from the end part of (Symbol 2 Part 0); and CP appended to (Symbol 1 Part 0) gets from the end part of (Symbol 1 Part 1), CP to (Symbol 1 Part 1) gets from the end part of (Symbol 1 Part 0), where Symbol 2 Part 0 and Symbol 2 Part 1 may be a specific example of the forgoing mentioned first symbols, Symbol 1 Part 0 and Symbol 1 Part 1 may be a specific example of the forgoing mentioned third symbols, Symbol 2 may be a specific example of the forgoing mentioned second symbol, and Symbol 1 may be a specific example of the forgoing mentioned fourth symbol. Then, symbol parts are mixed for transmission. For a data symbol (Symbol 0 Part 0) and an adjacent data symbol (Symbol 0 Part 1), the distance (or stride) is a length of (CP + Symbol 1 Part 0) + (CP + Symbol 2 Part 0). For a data symbol (Symbol 0 Part 0) and an adjacent DMRS symbol (Symbol 1 Part 0), the distance is one symbol (or subcarrier spacing, it is a specific example of the abovementioned symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols), and is smaller than the forgoing mentioned distance 2 symbols as shown in baseline 2. While supporting same number of sequences, the proposed solution decreases a distance between a data symbol and a DMRS symbol, thus the channel estimation will be more robust to mobility.

[0158] As mentioned above, the short symbols (first/third symbols) may be transmitted in predefined positions. In another example, as shown in FIG. 12, a long sequence (corresponding to a possible implementation of the above second symbol) is split into 12 parts, i.e., a symbol burst includes 12 parts (corresponding to a possible implementation of the above first symbols). Illustratively, a position (location) of the symbol burst with regular mapping is also shown in FIG. 12, i.e., the symbol burst transmits on symbols 0, 4, 8, 16, 20, 24, 28, 32, 36, 40, 44 (a specific example of the above first symbols). In other words, the symbol burst occupies symbols 0, 4, 8, 12 in a first time slot, symbols 2, 6, 10 in a second time slot, symbols 0, 4, 8, 12 in a third time slot, and symbol 2 in a fourth time slot. The long sequence can be transmitted without coupling to a symbol length. It should be noted that the intervals between different short symbols in a symbol burst are not limited in the embodiments of the present disclosure.

[0159] In still another example, as shown in FIG. 13, there are three long sequences (each long sequence may correspond to a possible implementation of the above second/fourth symbol), and each of these sequence is split into 4 sequence parts (shown as 0, 1, 2, 3 in FIG. 13, the split parts of each long sequence may correspond to a possible implementation of the above first/third symbols), so Nb = 4. Illustratively, a position (location) of the symbol bursts with regular mapping is also shown in FIG. 13, i.e., symbol burst 0 (or referred to as burst 0) transmits on symbols 0, 4, 8, 12; symbol burst 1 (or referred to as burst 1) transmits on symbols 21, 25, 29, 33; symbol burst 2 (or referred to as burst 2) transmits on symbols 42, 46, 50, 54. In other words, these sequence parts (short symbols) are located in slots, as shown in FIG. 13 : four sequence parts of a first long sequence occupies symbols 0, 4, 8, 12 in a first time slot (burst 0); four sequence parts of a second long sequence occupies symbols 7 and 11 in a second time slot, and symbols 1 and 5 in a third time slot (burst 1); and four sequence parts of a third sequence occupies symbols 0, 4, 8, 12 in a fourth time slot (burst 3).

[0160] For each short symbol (sequence part) in the symbol burst, the foregoing CP getting approach is used. For example, for the four parts of the first long sequence, CP for a first part (symbol 0 in the first time slot) gets from the end of part 3 of the first long sequence, CP for a second part (symbol 4 in the first time slot) gets from the end of part 0, CP for a third part (symbol 8 in the first time slot) gets from the end of part 1 , and CP for a fourth part (symbol 12 in the first time slot) gets from the end of part 2. The same is for the second and third long sequences. Between different sequences CP can’t be mixed, i.e., a part of one long sequence is not mixed with a part of another long sequence for transmission. A sequence train can be transmitted without coupling to neither symbols nor slots.

[0161] In summary, a CP getting approach is proposed in present disclosure, a symbol is constructed from a part of a long sequence by adding CP from the end of a previous part, thus, a sequence length is decoupled from a symbol length. Based on the foregoing CP getting approach, the present disclosure further proposes a location configuration for multiple sequence parts and multiple data parts as mentioned before, through this configuration, a minimal distance between a sequence symbol (e.g., a DMRS symbol) and an adjacent data symbol can be achieved, and the channel estimation can thus be more robust to mobility. In the present disclosure, a long sequence is split into parts, and each part is used to generate a short symbol, a sequence train can be transmitted without coupling to neither symbols nor slots, and this allows codebooks with long sequences.

[0162] Next, embodiments of products related to the wireless communication methods will be described.

[0163] FIG. 14 shows a schematic structural diagram of a wireless communication apparatus according to one or more embodiments of the present disclosure. As shown in FIG. 14, the wireless communication apparatus 1400 may include: a first transmitting module 1402, configured to transmit multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix.

[0164] In a possible implementation, a first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple first symbols, and each symbol other than the first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

[0165] In a possible implementation, each of the multiple first symbols is equal in length.

[0166] In a possible implementation, a length of the second symbol is divisible by a preset integer.

[0167] In a possible implementation, a length of the second symbol is not divisible by a preset integer, and the second symbol is padded with a preset number to make a length of the padded second symbol divisible by the preset integer.

[0168] In a possible implementation, at least two of the multiple first symbols are not equal in length.

[0169] In a possible implementation, a combination of the first symbol and a cyclic prefix appended to the first symbol is separated apart from a cyclic prefix appended to a symbol next to the first symbol by a predefined interval in a time domain, where the predefined interval is greater than or equal to 0.

[0170] In a possible implementation, the apparatus further includes: a second transmitting module 1404, configured to transmit multiple third symbols, where each of the multiple third symbols is based on a part of a fourth symbol, where for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix.

[0171] In a possible implementation, a first symbol among the multiple third symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple third symbols, and each symbol other than the first symbol in the multiple third symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

[0172] In a possible implementation, a symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols is smaller than a predefined distance.

[0173] In a possible implementation, the first symbol carries a demodulation reference signal (DMRS), and the third symbol carries data to be demodulated using the DMRS.

[0174] In a possible implementation, the third symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency- Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0175] In a possible implementation, a length of a cyclic prefix for each of the multiple first symbols is greater than a maximum delay, where the maximum delay is determined based on a channel over which the multiple first symbols are transmitted.

[0176] In a possible implementation, the first symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency- Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0177] The wireless communication apparatus may be applied to the transmitting end as described in the above method embodiments or may be the transmitting end as described in the above method embodiments. It should be understood by a person skilled in the art that, the relevant description of the above modules in the embodiments of the present disclosure may be understood with reference to the relevant description of the wireless communication method in the embodiments of the present disclosure.

[0178] FIG. 15 shows a schematic structural diagram of another wireless communication apparatus according to one or more embodiments of the present disclosure. As shown in FIG. 15, the wireless communication apparatus 1500 may include: a first receiving module 1502, configured to receive multiple first symbols, where each of the multiple first symbols is based on a part of a second symbol, where for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix; and a first obtaining module 1504, configured to obtain the second symbol based on the multiple first symbols.

[0179] In a possible implementation, a first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple first symbols, and each symbol other than the first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

[0180] In a possible implementation, each of the multiple first symbols is equal in length.

[0181] In a possible implementation, at least two of the multiple first symbols are not equal in length.

[0182] In a possible implementation, a combination of the first symbol and a cyclic prefix appended to the first symbol is separated apart from a cyclic prefix appended to a symbol next to the first symbol by a predefined interval in a time domain, where the predefined interval is greater than or equal to 0.

[0183] In a possible implementation, the apparatus further includes: a second receiving module, configured to receive multiple third symbols, where each of the multiple third symbols is based on a part of a fourth symbol, where for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix; and a second obtaining module, configured to obtain the fourth symbol based on the multiple third symbols.

[0184] In a possible implementation, the second obtaining module includes: a first processing sub-module, configured to: for each combination of a third symbol and a cyclic prefix appended with the third symbol, process the combination by using a first receiving window; and a first reconstructing sub-module, configured to reconstruct the each combination to obtain the fourth symbol.

[0185] In a possible implementation, a first symbol among the multiple third symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple third symbols, and each symbol other than the first symbol in the multiple third symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

[0186] In a possible implementation, a symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols is smaller than a predefined distance.

[0187] In a possible implementation, the first symbol carries a demodulation reference signal (DMRS), and the third symbol carries data; where the apparatus further includes: a demodulating module, configured to demodulate the data from the fourth symbol based on the DMRS.

[0188] In a possible implementation, the first obtaining module includes: a second processing sub-module, configured to: for each combination of a first symbol and a cyclic prefix appended to the first symbol, process the combination by using a second receiving window; and a second reconstructing sub-module, configured to reconstruct the each combination to obtain the second symbol.

[0189] In a possible implementation, the third symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency- Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0190] In a possible implementation, a length of a cyclic prefix for each of the multiple first symbols is greater than a maximum delay, where the maximum delay is determined based on a channel over which the multiple first symbols are transmitted.

[0191] In a possible implementation, the first symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Single-carrier Frequency- Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

[0192] The wireless communication apparatus may be applied to the receiving end as described in the above method embodiments or may be the receiving end as described in the above method embodiments. It should be understood by a person skilled in the art that, the relevant description of the above modules in the embodiments of the present disclosure may be understood with reference to the relevant description of the wireless communication method in the embodiments of the present disclosure.

[0193] In some aspects of the present disclosure, there is provided a transmitting end including processing circuitry for executing any of the above wireless communication methods. It should be understood that the transmitting end can execute the steps performed by the transmitting end in the above method embodiments, which will not be repeated here.

[0194] In some aspects of the present disclosure, there is provided a receiving end including processing circuitry for executing any of the above wireless communication methods. It should be understood that the receiving end can execute the steps performed by the receiving end in the above method embodiments, which will not be repeated here. [0195] In some aspects of the present disclosure, there is provided a wireless communication apparatus which includes a processor and a memory. The memory is storing instructions that cause the processor to perform any of the above wireless communication methods.

[0196] In some aspects of the present disclosure, there is provided a wireless communication system, including a transmitting end and a receiving end. The transmitting end is configured to execute the steps executed by the transmitting end in any of the above wireless communication methods, and the receiving end is configured to execute the steps executed by the receiving end in any of the above wireless communication methods.

[0197] In some aspects of the present disclosure, there is provided a chip, including an input/output (I/O) interface and a processor, where the processor is configured to call and run computer execution instructions stored in a memory, to enable a device installing with the chip to execute any of the above wireless communication methods.

[0198] In some aspects of the present disclosure, there is provided a computer- readable medium storing computer execution instructions which, when executed by a processor, causes the processor to execute any of the above wireless communication methods.

[0199] In some aspects of the present disclosure, there is provided a computer program product including computer execution instructions which, when executed by a processor, causes the processor to execute any of the above wireless communication methods.

[0200] Although the present disclosure describes methods and processes with steps in a certain order, one or more steps of the methods and processes may be omitted or altered as appropriate. One or more steps may take place in an order other than that in which they are described, as appropriate.

[0201] Note that the expression “at least one of A or B”, as used herein, is interchangeable with the expression “A and/or B”. It refers to a list in which you may select A or B or both A and B. Similarly, “at least one of A, B, or C”, as used herein, is interchangeable with “A and/or B and/or C” or “A, B, and/or C”. It refers to a list in which you may select: A or B or C, or both A and B, or both A and C, or both B and C, or all of A, B and C. The same principle applies for longer lists having a same format.

[0202] Although the present disclosure is described, at least in part, in terms of methods, a person of ordinary skill in the art will understand that the present disclosure is also directed to the various components for performing at least some of the aspects and features of the described methods, be it by way of hardware components, software or any combination of the two. Accordingly, the technical solution of the present disclosure may be embodied in the form of a software product. A suitable software product may be stored in a pre-recorded storage device or other similar non-volatile or non-transitory computer readable medium, including DVDs, CD-ROMs, USB flash disk, a removable hard disk, or other storage media, for example. The software product includes instructions tangibly stored thereon that enable a processing device (e.g., a personal computer, a server, or a network device) to execute examples of the methods disclosed herein. The machine-executable instructions may be in the form of code sequences, configuration information, or other data, which, when executed, cause a machine (e.g., a processor or other processing device) to perform steps in a method according to examples of the present disclosure.

[0203] The present disclosure may be embodied in other specific forms without departing from the subject matter of the claims. The described example embodiments are to be considered in all respects as being only illustrative and not restrictive. Selected features from one or more of the above-described embodiments may be combined to create alternative embodiments not explicitly described, features suitable for such combinations being understood within the scope of this disclosure.

[0204] All values and sub-ranges within disclosed ranges are also disclosed. Also, although the systems, devices and processes disclosed and shown herein may include a specific number of elements/components, the systems, devices and assemblies could be modified to include additional or fewer of such elements/components. For example, although any of the elements/components disclosed may be referenced as being singular, the embodiments disclosed herein could be modified to include a plurality of such elements/components. The subject matter described herein intends to cover and embrace all suitable changes in technology.

[0205] Although embodiments have been described above with reference to the accompanying drawings, those of skill in the art will appreciate that variations and modifications may be made without departing from the scope thereof as defined by the appended claims.

Claims

1. A wireless communication method, comprising: transmitting multiple first symbols, wherein each of the multiple first symbols is based on a part of a second symbol, wherein for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix.

2. The method according to claim 1, wherein a first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple first symbols, and each symbol other than the first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

3. The method according to claim 1 or 2, wherein each of the multiple first symbols is equal in length.

4. The method according to claim 3, wherein a length of the second symbol is divisible by a preset integer.

5. The method according to claim 3, wherein a length of the second symbol is not divisible by a preset integer, and the second symbol is padded with a preset number to make a length of the padded second symbol divisible by the preset integer.

6. The method according to claim 1 or 2, wherein at least two of the multiple first symbols are not equal in length.

7. The method according to any one of claims 1 to 6, wherein a combination of the first symbol and a cyclic prefix appended to the first symbol is separated apart from a cyclic prefix appended to a symbol next to the first symbol by a predefined interval in a time domain, wherein the predefined interval is greater than or equal to 0.

8. The method according to any one of claims 1 to 7, further comprising: transmitting multiple third symbols, wherein each of the multiple third symbols is based on a part of a fourth symbol, wherein for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix.

9. The method according to claim 8, wherein a first symbol among the multiple third symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple third symbols, and each symbol other than the first symbol in the multiple third symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

10. The method according to claim 8 or 9, wherein a symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols is smaller than a predefined distance.

11. The method according to any one of claims 8 to 10, wherein the first symbol carries a demodulation reference signal (DMRS), and the third symbol carries data to be demodulated using the DMRS.

12. The method according to any one of claims 8 to 11, wherein the third symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Singlecarrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

13. The method according to any one of claims 1 to 12, wherein a length of a cyclic prefix for each of the multiple first symbols is greater than a maximum delay, wherein the maximum delay is determined based on a channel over which the multiple first symbols are transmitted.

14. The method according to any one of claims 1 to 13, wherein the first symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Singlecarrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

15. A wireless communication method, comprising: receiving multiple first symbols, wherein each of the multiple first symbols is based on a part of a second symbol, wherein for each of the multiple first symbols, the first symbol is appended with a cyclic prefix determined based on a further first symbol among the multiple first symbols, and a length of the further first symbol is greater than a length of the cyclic prefix; and obtaining the second symbol based on the multiple first symbols.

16. The method according to claim 15, wherein a first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple first symbols, and each symbol other than the first symbol among the multiple first symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

17. The method according to claim 15 or 16, wherein each of the multiple first symbols is equal in length.

18. The method according to claim 15 or 16, wherein at least two of the multiple first symbols are not equal in length.

19. The method according to any one of claims 15 to 18, wherein a combination of the first symbol and a cyclic prefix appended to the first symbol is separated apart from a cyclic prefix appended to a symbol next to the first symbol by a predefined interval in a time domain, wherein the predefined interval is greater than or equal to 0.

20. The method according to any one of claims 15 to 19, further comprising: receiving multiple third symbols, wherein each of the multiple third symbols is based on a part of a fourth symbol, wherein for each of the multiple third symbols, the third symbol is appended with a cyclic prefix determined based on a further third symbol among the multiple third symbols, and a length of the further third symbol is greater than a length of the cyclic prefix; and obtaining the fourth symbol based on the multiple third symbols.

21. The method according to claim 20, wherein the obtaining the fourth symbol based on the multiple third symbols comprises: for each combination of a third symbol and a cyclic prefix appended with the third symbol, processing the combination by using a first receiving window; and reconstructing the each combination to obtain the fourth symbol.

22. The method according to claim 20 or 21, wherein a first symbol among the multiple third symbols is appended with a cyclic prefix determined based on a length of a last symbol among the multiple third symbols, and each symbol other than the first symbol in the multiple third symbols is appended with a cyclic prefix determined based on a length of an adjacent symbol prior to the each symbol.

23. The method according to any one of claims 20 to 22, wherein a symbol distance between a first symbol among the multiple first symbols and a third symbol adjacent to the first symbol among the multiple third symbols is smaller than a predefined distance.

24. The method according to any one of claims 20 to 23, wherein the first symbol carries a demodulation reference signal (DMRS), and the third symbol carries data; wherein the method further comprises: demodulating the data from the fourth symbol based on the DMRS.

25. The method according to any one of claims 15 to 24, wherein the obtaining the second symbol based on the multiple first symbols comprises: for each combination of a first symbol and a cyclic prefix appended to the first symbol, processing the combination by using a second receiving window; and reconstructing the each combination to obtain the second symbol.

26. The method according to any one of claims 20 to 25, wherein the third symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Singlecarrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

27. The method according to any one of claims 15 to 26, wherein a length of a cyclic prefix for each of the multiple first symbols is greater than a maximum delay, wherein the maximum delay is determined based on a channel over which the multiple first symbols are transmitted.

28. The method according to any one of claims 15 to 27, wherein the first symbol is one of an Orthogonal Frequency Division Multiplexing (OFDM) symbol, a Singlecarrier Frequency-Division Multiple Access (SC-FDMA) symbol or a single carrier symbol.

29. A wireless communication apparatus, comprising modules for performing the method according to any one of claims 1 to 14, or modules for carrying out the method according to any one of claims 15 to 28.

30. A transmitting end, comprising processing circuitry for executing the method according to any one of claims 1 to 14.

31. A receiving end, comprising processing circuitry for executing the method according to any one of claims 15 to 28.

32. A wireless communication system, comprising the transmitting end according to claim 30 and the receiving end according to claim 31.

33. A chip, comprising an input/output (I/O) interface and a processor, wherein the processor is configured to call and run computer execution instructions stored in a memory, to enable a device installing with the chip to execute the method according to any one of claims 1 to 14 or the method according to any one of claims 15 to 28.

34. A computer-readable medium storing computer execution instructions which, when executed by a processor, causes the processor to execute the method according to any one of claims 1 to 14 or the method according to any one of claims 15 to 28.

35. A computer program product comprising computer execution instructions which, when executed by a processor, causes the processor to execute the method according to any one of claims 1 to 14 or the method according to any one of claims 15 to 28.