Method performed by node in communication system, node, and storage medium

Abstract

The present disclosure relates to a 5G communication system or a 6G communication system for supporting higher data rates than 4G communication systems such as Long Term Evolution (LTE). In particular, embodiments of the present disclosure provide a method performed by a node in a communication system, a node, and a storage medium. A new signal generation scheme is proposed in the method. The method comprises: encoding a bit sequence to be transmitted on an orthogonal frequency division multiplexing (OFDM) symbol into a first sequence, a number of elements included in the first sequence being equal to a size of Fourier transform, each bit with a value of 0 in the bit sequence being encoded as a first binary sequence, and each bit with a value of 1 being encoded as a second binary sequence; performing transform precoding on the first sequence to obtain a second sequence; and performing resource mapping on the second sequence, and generating a baseband signal based on a result of the resource mapping. Based on the scheme provided by the present disclosure, communication requirements can be better met.

Description

METHOD PERFORMED BY NODE IN COMMUNICATION SYSTEM, NODE, AND STORAGE MEDIUM

[0001] The present disclosure relates to the technical field of wireless communication, and more particularly, to a method performed by a node in a communication system, a node, and a storage medium.

[0002] Considering the development of wireless communication from generation to generation, the technologies have been developed mainly for services targeting humans, such as voice calls, multimedia services, and data services. Following the commercialization of 5th-generation (5G) communication systems, it is expected that the number of connected devices will exponentially grow. Increasingly, these will be connected to communication networks. Examples of connected things may include vehicles, robots, drones, home appliances, displays, smart sensors connected to various infrastructures, construction machines, and factory equipment. Mobile devices are expected to evolve in various form-factors, such as augmented reality glasses, virtual reality headsets, and hologram devices. In order to provide various services by connecting hundreds of billions of devices and things in the 6th-generation (6G) era, there have been ongoing efforts to develop improved 6G communication systems. For these reasons, 6G communication systems are referred to as beyond-5G systems.

[0003] 6G communication systems, which are expected to be commercialized around 2030, will have a peak data rate of tera (1,000 giga)-level bps and a radio latency less than 100μsec, and thus will be 50 times as fast as 5G communication systems and have the 1 / 10 radio latency thereof.

[0004] In order to accomplish such a high data rate and an ultra-low latency, it has been considered to implement 6G communication systems in a terahertz band (for example, 95GHz to 3THz bands). It is expected that, due to severer path loss and atmospheric absorption in the terahertz bands than those in mmWave bands introduced in 5G, technologies capable of securing the signal transmission distance (that is, coverage) will become more crucial. It is necessary to develop, as major technologies for securing the coverage, radio frequency (RF) elements, antennas, novel waveforms having a better coverage than orthogonal frequency division multiplexing (OFDM), beamforming and massive multiple input multiple output (MIMO), full dimensional MIMO (FD-MIMO), array antennas, and multiantenna transmission technologies such as large-scale antennas. In addition, there has been ongoing discussion on new technologies for improving the coverage of terahertz-band signals, such as metamaterial-based lenses and antennas, orbital angular momentum (OAM), and reconfigurable intelligent surface (RIS).

[0005] Moreover, in order to improve the spectral efficiency and the overall network performances, the following technologies have been developed for 6G communication systems: a full-duplex technology for enabling an uplink transmission and a downlink transmission to simultaneously use the same frequency resource at the same time; a network technology for utilizing satellites, high-altitude platform stations (HAPS), and the like in an integrated manner; an improved network structure for supporting mobile base stations and the like and enabling network operation optimization and automation and the like; a dynamic spectrum sharing technology via collision avoidance based on a prediction of spectrum usage; an use of artificial intelligence (AI) in wireless communication for improvement of overall network operation by utilizing AI from a designing phase for developing 6G and internalizing end-to-end AI support functions; and a next-generation distributed computing technology for overcoming the limit of user equipment (UE) computing ability through reachable super-high-performance communication and computing resources (such as mobile edge computing (MEC), clouds, and the like) over the network. In addition, through designing new protocols to be used in 6G communication systems, developing mechanisms for implementing a hardware-based security environment and safe use of data, and developing technologies for maintaining privacy, attempts to strengthen the connectivity between devices, optimize the network, promote softwarization of network entities, and increase the openness of wireless communications are continuing.

[0006] It is expected that research and development of 6G communication systems in hyper-connectivity, including person to machine (P2M) as well as machine to machine (M2M), will allow the next hyper-connected experience. Particularly, it is expected that services such as truly immersive extended reality (XR), high-fidelity mobile hologram, and digital replica could be provided through 6G communication systems. In addition, services such as remote surgery for security and reliability enhancement, industrial automation, and emergency response will be provided through the 6G communication system such that the technologies could be applied in various fields such as industry, medical care, automobiles, and home appliances.

[0007] Embodiments of the present disclosure provide a method performed by a node in a communication system, a node, and a storage medium. Embodiments of the present disclosure provide the following technical solutions.

[0008] The technical objects to be achieved by various embodiments of the disclosure are not limited to the technical objects mentioned above, and other technical objects not mentioned may be considered by those skilled in the art from various embodiments of the disclosure to be described below.

[0009] In one aspect, embodiments of the present disclosure provide a method performed by a node in a communication system. The method comprises:

[0010] encoding a bit sequence to be transmitted on an orthogonal frequency division multiplexing (OFDM) symbol into a first sequence, a number of elements included in the first sequence being equal to a size of Fourier transform, each bit with a value of 0 in the bit sequence being encoded as a first binary sequence, and each bit with a value of 1 being encoded as a second binary sequence;

[0011] performing transform precoding on the first sequence to obtain a second sequence; and

[0012] performing resource mapping on the second sequence, and generating a baseband signal based on a result of the resource mapping.

[0013] In another aspect, embodiments of the present disclosure also provide a node in a communication system. The node comprises at least one transceiver and at least one processor coupled to the at least one transceiver. The at least one processor is configured to perform the method performed by the node provided in any of the embodiments of the present disclosure.

[0014] In another aspect, embodiments of the present disclosure also provide a computer-readable storage medium. The storage medium stores a computer program, that, when executed by a processor, cause the processor to perform steps of the method provided in any of the embodiments of the present disclosure.

[0015] In another aspect, embodiments of the present disclosure also provide a computer program product, comprising a computer program that, when executed by a processor, implements steps of the method provided in any of the embodiments of the present disclosure.

[0016] Beneficial effects brought about through the technical solutions provided in the embodiments of the present disclosure will be described below in conjunction with specific embodiments.

[0017] Embodiments of the present disclosure provide a method performed by a node in a communication system, a node, and a storage medium. Embodiments of the present disclosure provide the following technical solutions.

[0018] The effects that can be achieved through the disclosure are not limited to the effects mentioned in the various embodiments, and other effects not mentioned will be clearly understood by those skilled in the art from the description below.

[0019] FIG. 1 shows a schematic structure diagram of a wireless network system to which embodiments of the present disclosure are applied;

[0020] FIG. 2 shows a schematic structure diagram of an example base station according to the present disclosure;

[0021] FIG. 3 shows a schematic structure diagram of an example user equipment according to the present disclosure;

[0022] FIG. 4 shows a schematic flowchart of a signal generation method provided in embodiments of the present disclosure;

[0023] FIG. 5 shows a schematic diagram of a pattern of downlink data;

[0024] FIG. 6 shows a schematic flowchart of a signal generation method provided in embodiments of the present disclosure;

[0025] FIG. 7 shows a schematic diagram of a bit encoding mode;

[0026] FIG. 8a shows a schematic diagram of results of various bit encodings;

[0027] FIG. 8b shows a schematic diagram of results of various bit encodings;

[0028] FIG. 8c shows a schematic diagram of results of various bit encodings;

[0029] FIG. 8d shows a schematic diagram of results of various bit encodings;

[0030] FIG. 9 shows a schematic diagram of a bit encoding mode provided in embodiments of the present disclosure;

[0031] FIG. 10 shows a schematic diagram of an encoding result provided in embodiments of the present disclosure;

[0032] FIG. 11 shows a schematic diagram of another encoding result provided in embodiments of the present disclosure; and

[0033] FIG. 12 shows a schematic structure diagram of an electronic device provided in embodiments of the present disclosure.

[0034] Before undertaking the DETAILED DESCRIPTION below, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document. The term “couple” and its derivatives refer to any direct or indirect communication between two or more elements, whether those elements are in physical contact with one another. The terms “transmit,” “receive,” and “communicate,” as well as derivatives thereof, encompass both direct and indirect communication. The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and / or. The phrase “associated with,” as well as derivatives thereof, means to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, have a relationship to or with, or the like. The term “controller” means any device, system or part thereof that controls at least one operation. Such a controller may be implemented in hardware or a combination of hardware and software and / or firmware. The functionality associated with any particular controller may be centralized or distributed, whether locally or remotely. The phrase “at least one of,” when used with a list of items, means that different combinations of one or more of the listed items may be used, and only one item in the list may be needed. For example, “at least one of: A, B, and C” includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A and B and C. Likewise, the term “set” means one or more. Accordingly, a set of items can be a single item or a collection of two or more items.

[0035] Moreover, various functions described below can be implemented or supported by one or more computer programs, each of which is formed from computer readable program code and embodied in a computer readable medium. The terms “application” and “program” refer to one or more computer programs, software components, sets of instructions, procedures, functions, objects, classes, instances, related data, or a portion thereof adapted for implementation in a suitable computer readable program code. The phrase “computer readable program code” includes any type of computer code, including source code, object code, and executable code. The phrase “computer readable medium” includes any type of medium capable of being accessed by a computer, such as read only memory (ROM), random access memory (RAM), a hard disk drive, a compact disc (CD), a digital video disc (DVD), or any other type of memory. A “non-transitory” computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals. A non-transitory computer readable medium includes media where data can be permanently stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device.

[0036] Definitions for other certain words and phrases are provided throughout this patent document. Those of ordinary skill in the art should understand that in many if not most instances, such definitions apply to prior as well as future uses of such defined words and phrases.

[0037] The figures included herein, and the various embodiments used to describe the principles of the present disclosure are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Further, those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged wireless communication system.

[0038] FIGS. 1-3 below describe various embodiments of the present disclosure implemented in wireless communications systems. The descriptions of FIGS. 1-3 are not meant to imply physical or architectural limitations to the manner in which different embodiments may be implemented. Different embodiments of the present disclosure may be implemented in any suitably-arranged communications system.

[0039] FIG. 1 illustrates an example wireless network according to embodiments of the present disclosure. The embodiment of the wireless network shown in FIG. 1 is for illustration only. Other embodiments of the wireless network 100 could be used without departing from the scope of the present disclosure.

[0040] As shown in FIG. 1, the wireless network includes a base station (next generation nodeB, gNB or gNodeB) 101, a gNB 102, and a gNB 103. The gNB 101 communicates with the gNB 102 and the gNB 103. The gNB 101 also communicates with at least one network 130, such as the Internet, a proprietary Internet Protocol (IP) network, or other data network.

[0041] The gNB 102 provides wireless broadband access to the network 130 for a plurality of first user equipments (UEs) within a coverage area 120 of the gNB 102. The plurality of first UEs include a UE 111, which may be located in a small business; a UE 112, which may be located in an enterprise (E); a UE 113, which may be located in a WiFi hotspot (HS); a UE 114, which may be located in a first residence (R1); a UE 115, which may be located in a second residence (R2); and a UE 116, which may be a mobile device (M), such as a cell phone, a wireless laptop, a wireless personal digital assistant (PDA), or the like. The gNB 103 provides wireless broadband access to the network 130 for a plurality of second UEs within a coverage area 125 of the gNB 103. The plurality of second UEs include the UE 115 and the UE 116, as well as subscriber stations (SS, for example, UEs) 117, 118 and 119. In some embodiments, one or more of the gNBs 101-103 may communicate with each other and with the UEs 111-116 using existing wireless communication techniques, and one or more of the UE 111-119 may communicate directly with each other (e.g., UEs 117-119) using other existing or proposed wireless communication techniques.

[0042] Depending on the network type, the term “base station” or “BS” can refer to any component (or collection of components) configured to provide wireless access to a network, such as transmit point (TP), transmit-receive point (TRP), an enhanced (or “evolved”) base station (eNodeB or eNB), a 5G base station (gNB), a macrocell, a femtocell, a wireless fidelity (WiFi) access point (AP), or other wirelessly enabled devices. Base stations may provide wireless access in accordance with one or more wireless communication protocols, e.g., 3GPP 5G New Radio (NR), Long Term Evolution (LTE), LTE Advanced (LTE-A), high speed packet access (HSPA), Wi-Fi 802.11a / b / g / n / ac, etc. For the sake of convenience, the various names for a base station-type apparatus and functionality are used interchangeably in this patent document to refer to network infrastructure components that provide wireless access to remote terminals. Also, depending on the network type, the term “user equipment” (UE) can refer to any component such as a mobile station (MS), subscriber station (SS), remote terminal, wireless terminal, receive point, or user device. For the sake of convenience, the various names for a user equipment-type device and functionality are used interchangeably in this patent document to refer to remote wireless equipment that wirelessly accesses a BS, whether the UE is a mobile device (such as a mobile telephone or smartphone) or is normally considered a stationary device (such as a desktop computer or vending machine).

[0043] Dotted lines show the approximate extents of the coverage areas 120 and 125, which are shown as approximately circular for the purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with gNBs, such as the coverage areas 120 and 125, may have other shapes, including irregular shapes, depending upon the configuration of the gNBs and variations in the radio environment associated with natural and man-made obstructions.

[0044] As described in more detail below, one or more of the UEs 111-119 include circuitry, programing, or a combination thereof. In certain embodiments, and one or more of the gNBs 101-103 includes circuitry, programing, or a combination thereof.

[0045] Although FIG. 1 illustrates one example of a wireless network, various changes may be made to FIG. 1. For example, the wireless network could include any number of gNBs and any number of UEs in any suitable arrangement. Also, the gNB 101 could communicate directly with any number of UEs and provide those UEs with wireless broadband access to the network 130. Similarly, each gNB 102-103 could communicate directly with the network 130 and provide UEs with direct wireless broadband access to the network 130. Further, the gNBs 101, 102, and / or 103 could provide access to other or additional external networks, such as external telephone networks or other types of data networks.

[0046] FIG. 2 illustrates an example base station according to embodiments of the present disclosure. The embodiment of the gNB 102 illustrated in FIG. 2 is for illustration only, and the gNBs 101 and 103 of FIG. 1 could have the same or similar configuration. However, gNBs come in a wide variety of configurations, and FIG. 2 does not limit the scope of the present disclosure to any particular implementation of a gNB.

[0047] As shown in FIG 2, the gNB 102 includes multiple antennas 200a-200n, multiple radio frequency (RF) transceivers 201a-201n, transmit (TX) processing circuitry 203, and receive (RX) processing circuitry 204. The gNB 102 also includes a controller / processor 205, a memory 206, and a backhaul or network interface (IF) 207.

[0048] The RF transceivers 201a-201n receive, from the antennas 200a-200n, incoming RF signals, such as signals transmitted by UEs in the network 100. The RF transceivers 201a-201n down-convert the incoming RF signals to generate intermediate frequency (IF) or baseband signals. The IF or baseband signals are sent to the RX processing circuitry 204, which generates processed baseband signals by filtering, decoding, and / or digitizing the baseband or IF signals. The RX processing circuitry 204 transmits the processed baseband signals to the controller / processor 205 for further processing.

[0049] The TX processing circuitry 203 receives analog or digital data (such as voice data, web data, electronic mail, or interactive video game data) from the controller / processor 205. The TX processing circuitry 203 encodes, multiplexes, and / or digitizes the outgoing baseband data to generate processed baseband or IF signals. The RF transceivers 201a-201n receive the outgoing processed baseband or IF signals from the TX processing circuitry 203 and up-converts the baseband or IF signals to RF signals that are transmitted via the antennas 201a-201n.

[0050] The controller / processor 205 can include one or more processors or other processing devices that control the overall operation of the gNB 102. For example, the controller / processor 205 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceivers 201a-201n, the RX processing circuitry 204, and the TX processing circuitry 203 in accordance with well-known principles. The controller / processor 205 could support additional functions as well, such as more advanced wireless communication functions.

[0051] For instance, the controller / processor 205 could support beam forming or directional routing operations in which outgoing signals from multiple antennas 200a-200n are weighted differently to effectively steer the outgoing signals in a desired direction. Any of a wide variety of other functions could be supported in the gNB 102 by the controller / processor 205.

[0052] The controller / processor 205 is also capable of executing programs and other processes resident in the memory 206, such as an operating system (OS). The controller / processor 205 can move data into or out of the memory 206 as required by an executing process.

[0053] The controller / processor 205 is also coupled to the backhaul or network interface 207. The backhaul or network interface 207 allows the gNB 102 to communicate with other devices or systems over a backhaul connection or over a network. The interface 207 could support communications over any suitable wired or wireless connection(s). For example, when the gNB 102 is implemented as part of a cellular communication system (such as one supporting 5G, LTE, or LTE-A), the interface 207 could allow the gNB 102 to communicate with other gNBs over a wired or wireless backhaul connection. When the gNB 102 is implemented as an access point, the interface 207 could allow the gNB 102 to communicate over a wired or wireless local area network or over a wired or wireless connection to a larger network (such as the Internet). The interface 207 includes any suitable structure supporting communications over a wired or wireless connection, such as an Ethernet or RF transceiver.

[0054] The memory 206 is coupled to the controller / processor 205. Part of the memory 206 could include a random access memory (RAM), and another part of the memory 206 could include a Flash memory or other read only memory (ROM).

[0055] Although FIG. 2 illustrates one example of gNB 102, various changes may be made to FIG. 2. For example, the gNB 102 could include any number of each component shown in FIG. 2. As a particular example, an access point could include a number of interfaces 207, and the controller / processor 205 could support routing functions to route data between different network addresses. As another particular example, while shown as including a single instance of TX processing circuitry 203 and a single instance of RX processing circuitry 204, the gNB 102 could include multiple instances of each (such as one per RF transceiver). Also, various components in FIG. 2 could be combined, further subdivided, or omitted and additional components could be added according to particular needs.

[0056] FIG. 3 illustrates an example user equipment according to embodiments of the present disclosure. The embodiment of the UE 116 illustrated in FIG. 3 is for illustration only, and the UEs 111-115 and 117-119 of FIG. 1 could have the same or similar configuration. However, UEs come in a wide variety of configurations, and FIG. 3 does not limit the scope of the present disclosure to any particular implementation of a UE.

[0057] As shown in FIG. 3, the UE 116 includes an antenna 301, a radio frequency (RF) transceiver 302, TX processing circuitry 303, a microphone 304, and receive (RX) processing circuitry 305. The UE 116 also includes a speaker 306, a controller or processor 307, an input / output (I / O) interface (IF) 308, an input device 309, a touchscreen display 310, and a memory 311. The memory 311 includes an OS 312 and one or more applications 313.

[0058] The RF transceiver 302 receives, from the antenna 301, an incoming RF signal transmitted by an gNB of the network 100. The RF transceiver 302 down-converts the incoming RF signal to generate an IF or baseband signal. The IF or baseband signal is sent to the RX processing circuitry 305, which generates a processed baseband signal by filtering, decoding, and / or digitizing the baseband or IF signal. The RX processing circuitry 305 transmits the processed baseband signal to the speaker 306 (such as for voice data) or to the processor 307 for further processing (such as for web browsing data).

[0059] The TX processing circuitry 303 receives analog or digital voice data from the microphone 304 or other outgoing baseband data (such as web data, e-mail, or interactive video game data) from the processor 307. The TX processing circuitry 303 encodes, multiplexes, and / or digitizes the outgoing baseband data to generate a processed baseband or IF signal. The RF transceiver 302 receives the outgoing processed baseband or IF signal from the TX processing circuitry 303 and up-converts the baseband or IF signal to an RF signal that is transmitted via the antenna 301.

[0060] The processor 307 can include one or more processors or other processing devices and execute the OS 312 stored in the memory 311 in order to control the overall operation of the UE 116. For example, the processor 307 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceiver 302, the RX processing circuitry 305, and the TX processing circuitry 303 in accordance with well-known principles. In some embodiments, the processor 307 includes at least one microprocessor or microcontroller.

[0061] The processor 307 is also capable of executing other processes and programs resident in the memory 311, such as processes for channel state information (CSI) reporting on uplink channel. The processor 307 can move data into or out of the memory 311 as required by an executing process. In some embodiments, the processor 307 is configured to execute the applications 313 based on the OS 312 or in response to signals received from gNBs or an operator. The processor 307 is also coupled to the I / O interface 308, which provides the UE 116 with the ability to connect to other devices, such as laptop computers and handheld computers. The I / O interface 308 is the communication path between these accessories and the processor 307.

[0062] The processor 307 is also coupled to the touchscreen display 310. The user of the UE 116 can use the touchscreen display 310 to enter data into the UE 116. The touchscreen display 310 may be a liquid crystal display, light emitting diode display, or other display capable of rendering text and / or at least limited graphics, such as from web sites.

[0063] The memory 311 is coupled to the processor 307. Part of the memory 311 could include RAM, and another part of the memory 311 could include a Flash memory or other ROM.

[0064] Although FIG. 3 illustrates one example of UE 116, various changes may be made to FIG. 3. For example, various components in FIG. 3 could be combined, further subdivided, or omitted and additional components could be added according to particular needs. As a particular example, the processor 307 could be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs). Also, while FIG. 3 illustrates the UE 116 configured as a mobile telephone or smartphone, UEs could be configured to operate as other types of mobile or stationary devices.

[0065] How to optimize a communication system and improve the resource utilization of the communication system has always been a hot issue concerned by practitioners. Due to different functions of signals in different communication systems or different communication requirements, the different communication systems each have own characteristics. How to achieve compatibility between different systems is also one of the important issues that a person skilled in the relevant art is researching.

[0066] The most widely used communication systems at present are systems based on a 3GPP protocol, including 4G communication systems such as LTE and LTE-A, 5G communication systems, and 6G communication systems which have been discussed. Signal waveforms used in these communication systems are based on OFDM modulated waveforms.

[0067] Unlike the communication systems based on 3GPP, a radio frequency identification (RFID) system performs contactless data communication between a reader and a tag to achieve the purpose of target identification. The RFID system is a key technology of Internet of Things (IOT), which is widely used in many industries. In the RFID system, data is modulated on a carrier, and common modulation methods are amplitude keying, phase keying, and frequency keying.

[0068] However, signals of existing OFDM communication systems are not transmitted continuously, but are transmitted symbol by symbol, and each symbol adopts a structure of a cyclic prefix plus a signal waveform. Therefore, in order to achieve compatibility between systems, how to design a signal applicable to the RFID system based on the structure of the signal of the OFDM system and the transmission principle is one of the technical problems to be solved. How to realize uninterrupted downlink data transmission between multiple OFDM symbols in the OFDM system is also a research direction of IOT in the future.

[0069] In order to optimize a communication system, one or more of the currently existing problems are solved or improved. Embodiments of the present disclosure provide a new communication scheme that provides an entirely new signal generation method. Based on the scheme provided in the embodiments of the present disclosure, it is possible to generate the signal based on the OFDM system that is applicable to the RFID system under the premise of satisfying the demodulation performance.

[0070] The method provided in the embodiments of the present disclosure may be performed by any electronic device / node. For example, the node may be a user equipment in the communication system, and may also be a network node. The user equipment may be a terminal such as a general cell phone and a computer, and may also be a device similar to an electronic tag. The network node may be a base station or another network node, such as a transmission / reception point (TRP). The network node may also be a reader. In the embodiments of the present disclosure, the electronic tag may be an active tag or may be a passive or semi-passive tag.

[0071] Furthermore, "uplink" or "downlink" described in the embodiments of the present disclosure is a relative concept. For example, in the RFID system, the reader functions similarly to the base station, the electronic tag functions similarly to the user equipment, a link where the reader transmits a signal to the electronic tag may be referred to as a downlink, and a link where the electronic tag transmits a signal to the reader or another node may be referred to as an uplink.

[0072] It should be noted that some of term names referred to in the embodiments of the present disclosure may adopt term names already existing in a communication standard, some of the term names may be newly added or newly defined term names, and the newly added or newly defined term names may adopt other terms in a future communication standard, or may be described in other ways (for example, by text). The names or calls of various information / messages / parameters / configurations referred to in the embodiments of the present disclosure are not exclusive. In theory, the names or calls of the information / messages / parameters / configurations may vary as long as the role of the information / messages / parameters / configurations, the contents involved, or the explanation or description of the information / messages / parameters / configurations can correspond or be associated.

[0073] For example, "sequence", "number of padding bits", "padding length", and the like in the description of the embodiments of the present disclosure may also be referred to as names having related meanings. As another example, 0 or 1 for padding a sequence may be referred to an invalid bit, a dummy bit, or a padding bit.

[0074] Technical solutions provided by the present disclosure and technical effects brought about by the technical solutions are explained below through the description of various alternative implementations. In the absence of conflict or contradiction, the following implementations may be cross-referenced, learned from or combined with each other, and the description of the same terms, like features, and similar steps in different implementations will not be repeated. For interaction steps between different nodes, a corresponding scheme of a network node on the other side may be derived based on a scheme description of a network node on one side. For example, one network node receives a signal from another network node, and accordingly, the another network node transmits a signal to the above-mentioned network node. In embodiments that include multiple steps, the embodiments of the present disclosure are not limited solely to the order in which the multiple steps are performed if there is no explicit ordering of the multiple steps.

[0075] Alternative implementations of the method provided by the present disclosure are further explained below in connection with the principles of the scheme provided by the present disclosure and several alternative embodiments, and the steps of different embodiments may be combined or substituted with each other without conflict.

[0076] FIG. 4 shows an alternative signal generation method provided by the present disclosure. The method may be performed by a node (hereinafter referred to as a first node) in a communication system, and the node may be any electronic device. The first node may be referred to as a transmitting node / transmitter. Alternatively, the first node may be a base station or a device acting as the base station. The device may be any electronic device, and may include but is not limited to a reader. As shown in FIG. 4, the method may comprise the following steps:

[0077] Step S101: Encode a bit sequence to be transmitted on an OFDM symbol into a first sequence, a number of elements (a first number of elements, namely a length of the first sequence) included in the first sequence being equal to a size of Fourier transform (i.e, number of Fourier transform points), each bit with a value of 0 in the bit sequence being encoded as a first binary sequence, and each bit with a value of 1 being encoded as a second binary sequence;

[0078] Step S102: Perform transform precoding on the first sequence to obtain a second sequence;

[0079] Step S103: Perform resource mapping on the second sequence, and generate a baseband signal based on a result of the resource mapping.

[0080] According to the method of the embodiments of the present disclosure, a new signal generation method based on transform precoding is proposed. Based on the method, by encoding both a bit "0" and a bit "1" into binary sequences with both high-level sampling points and low-level sampling points, a symbol corresponding to the bit "0" may also have energy. Therefore, the energy transmission efficiency of a signal generated based on the method may be higher, and the requirements can be better met.

[0081] As an alternative application scenario, when a signal generated by the method provided in the embodiments of the present disclosure is applied to a scenario in which a signal receiver (such as an electronic tag) is a passive device or a semi-passive device, the device may operate more stably by providing more stable energy to the device through the signal and reducing the possibility of interruption of the energy supply of a receiving device.

[0082] In the embodiments of the present disclosure, the number of elements with a value of 1 and / or 0 in binary sequences corresponding to different bits with the same value of a bit sequence is the same or different when encoding the bit sequence.

[0083] That is, the length of a binary sequence of two bits with the same value in the bit sequence may be the same or different, and the number of elements with a value of 0 and / or 1 in the two bits may be the same or different. For bit "0", a total number of elements in two first binary sequences corresponding to two bits "0" in a bit sequence may be the same or different, and the number of elements with a value of 0 in the two first binary sequences may be the same or different, because a decoding mode corresponding to pulse interval encoding (PIE) is based on whether the number of high-level sampling points in a symbol (namely, the number of elements with a value of 1 in a binary sequence corresponding to a bit) is greater than or equal to a decision threshold, or based on whether the number of low-level sampling points in a symbol is greater than or equal to the decision threshold. Therefore, it is only necessary to ensure that a comparison result between the number of high-level sampling points / low-level sampling points corresponding to a bit and the decision threshold enables the bit to be correctly decoded during decoding. For example, the decoding mode based on the number of high-level sampling points is adopted during decoding, and the decision threshold is A. As long as the number of 1s in the binary sequence corresponding to bit "0" is less than the decision threshold A and the number of 1s in the binary sequence corresponding to bit "1" is not less than the decision threshold, bit "0" and bit "1" may be correctly decoded.

[0084] In the embodiments of the present disclosure, the number of elements, namely the sequence length, of the first binary sequence (referred to as simply sequence 1) and the second binary sequence (referred to as simply sequence 2) may be the same or may be different. The number of elements (namely, bits "1") with a value of 1 in the sequence 1 is less than the number of elements with a value of 1 in the sequence 2. An encoding mode of encoding a bit sequence into a first sequence may be referred to as -size sampling point-level encoding or sampling point-level PIE encoding, where is the number of Fourier transform points, namely the size of Fourier transform.

[0085] In the embodiments of the present disclosure, the first number of elements in the first binary sequence (namely, the number of elements included in a sequence, that is, a first length of the first binary sequence) and / or the second number of elements in the second binary sequence (a second length of the second binary sequence) may be a predetermined value, such as a pre-agreed fixed value, or may also be determined by the first node according to length-related information received from other nodes, or may also be calculated by the first node itself according to the related information or determined by table look-up.

[0086] Optionally, the first length and / or the second length may also be associated with a data transmission rate, and the first node may determine the first length and / or the second length according to the data transmission rate. For example, the first length and / or the second length may be determined by table look-up according to the data transmission rate.

[0087] In a practical implementation, after the sequence 1 and the sequence 2 are determined, a length of an encoded sequence corresponding to the bit sequence namely a number of elements in the encoded sequence may be calculated according to the number of bits "0" and "1" in the bit sequence. If the length is exactly equal to the number of Fourier transform points, the encoded sequence may be directly used as the first sequence. If the encoded length is less than the number of Fourier transform points, the encoded sequence needs to be padded so as to obtain the first sequence with the number of elements included being equal to the number of Fourier transform points. Based on this, in an alternative embodiment of the present disclosure, the encoding a bit sequence to be transmitted on an OFDM symbol into a first sequence comprises:

[0088] determining a length of an encoded sequence corresponding to the bit sequence, namely a number of elements included in the encoded sequence, based on a number of bits with a value of 0 in the bit sequence, a number of bits with a value of 1 in the bit sequence, and a number of elements in a sequence after each bit is encoded;

[0089] determining a padding length, namely a number of elements to be padded, based on the size of Fourier transform and the number of elements in the encoded sequence corresponding to the bit sequence; and

[0090] padding, when needed (the padding length is greater than 0), the encoded sequence corresponding to the bit sequence with first values whose total number is equal to the determined padding length, to obtain the first sequence, the first values being 0 or 1.

[0091] The padding length may also be referred to as a padding number, or a number of padding bits, or a number of padding bits, or a number of padding elements, or the like. The padding length is equal to a difference between the number of Fourier transform points and the length of the encoded sequence corresponding to the bit sequence. Alternatively, 0s or 1s whose total number is equal to the padding length may be padded to the beginning and / or the end of the encoded sequence. For example, sequences with values of all 1s or 0s whose number is equal to the padding length may be padded to the beginning of the encoded sequence. Alternatively, the padding sequence may be padded to the end of the encoded sequence corresponding to the bit sequence.

[0092] As an alternative of the present disclosure, the first number of elements in the first binary sequence is equal to the second number of elements in the second binary sequence, and / or at least one of the first number of elements and the second number of elements divides the size of Fourier transform.

[0093] Based on this scheme, symbol durations corresponding to bit "0" and bit "1" are the same (namely, encoded sequences including an equal number of elements), and an integer number of symbols may be transmitted within one OFDM symbol, and encoding processing of the bit sequence may be achieved in a simpler manner.

[0094] It should be noted that "encoding" in the "encoding a bit sequence to be transmitted on an OFDM symbol into a first sequence" may also be replaced with other words. For example, "encoding" may adopt conversion or similar words. Step S101 may also be described as "generating a first sequence based on a bit sequence".

[0095] An element with a value of 1 in the first sequence indicates a high level at a corresponding sampling point, 1 may also be referred to as a high-level sampling point, while an element with a value of 0 indicates a low level at a corresponding sampling point, and 0 may also be referred to as a low-level sampling point. By the above encoding processing, the bit sequence is converted into a first sequence of which the length / number of elements is the number of Fourier transform points. Hereafter, transform precoding may be performed on the first sequence. Then, a baseband signal on an OFDM symbol is obtained by performing subsequent signal processing, such as resource mapping, inverse Fourier transform and CP addition, on a result of the transform precoding.

[0096] As another alternative, the first number of elements in the first binary sequence is equal to the second number of elements in the second binary sequence. The first number of elements divides the size of Fourier transform. The encoding a bit sequence to be transmitted on an OFDM symbol into a first sequence may comprise:

[0097] determining a number of padding bits corresponding to a cyclic prefix according to a number of sampling points corresponding to the cyclic prefix and the first number of elements;

[0098] inserting second values whose total number is equal to the number of padding bits after the bit sequence, to obtain a padded bit sequence; and

[0099] encoding bits with values of 0 and 1 in the bit sequence in the padded sequence into a first binary sequence and a second binary sequence respectively, and encoding each padded bit into a third sequence comprising the same number of elements as the first number of elements, to obtain the first sequence, values of elements in the third sequence being all 1.

[0100] In this alternative provided by the present disclosure, a baseband signal with a CP may be generated. Since values of elements in the encoded sequence corresponding to the padding bits are all the same and equal to 1, corresponding processing may be performed based on the encoding mode when decoding a signal, thus effectively avoiding the problem of decoding errors occurring when decoding the signal by using a decoding mode based on a high level or a low level due to the CP.

[0101] The alternative of generating the first sequence provided by the present disclosure is different from the previous scheme of encoding the elements in the bit sequence and then padding. In this scheme, padding and encoding are performed in sequence, and each bit in the padded bit sequence is encoded into a sequence with an equal number of elements. The number of padding bits is the number of bits corresponding to the CP, and the number of sampling points corresponding to one padding bit is also the first number of elements. That is, each bit in the bit sequence and padded dummy bits are both encoded into sequences of the same length in the scheme.

[0102] The number of bits corresponding to the CP may be obtained based on a ratio of the number of sampling points corresponding to the CP to the first number of elements. Alternatively, the number of padding bits may be obtained by rounding up or down the ratio. The "Number of padding bits" may also adopt similar other names, such as "number of padding bits" or "padding length", etc.. An element / bit with a second value as a padding value may be referred to as "dummy bit" or other names.

[0103] After the number of padding bits is calculated, dummy bits whose total number is equal to the number of padding bits may be inserted after the bit sequence. Then, all 0s in the padded bit sequence are encoded as sequence 1, all 1s are encoded as sequence 2, and each dummy bit padded is encoded as a padded sequence with all values of 1 or 0, namely the third sequence. Then, a baseband signal with a CP may be obtained by processing such as transform precoding and resource mapping based on the first sequence obtained. The CP of the baseband signal generated using the scheme is a part of the encoded sequence corresponding to the number of padding bits. Since the values of elements in the encoded third sequence corresponding to each padding bit are all 1, namely, the encoded sequence corresponding to the CP is known, the part of the sequence corresponding to the CP may be correspondingly processed when decoding the baseband signal, thus avoiding decoding errors caused by the CP. The value of the padded bit, namely the second value, may in theory be any value, such as 0, 1, or any other identifier. As long as it is known that the bit is a padded bit, the bit is encoded into the third sequence, which can be distinguished from the encoded sequence corresponding to 0 and 1.

[0104] Alternatively, the values of elements in the third sequence may be associated with a decoding / decoding mode corresponding to the baseband signal. As an alternative, when the decoding mode corresponding to the baseband signal is a first decoding mode based on a low-level duration, the values of elements in the third sequence are 1.

[0105] For the first decoding mode, since it is determined whether the decoding is 0 or 1 according to the number of elements with a value of 0 in a symbol corresponding to a bit, the third sequence corresponding to the CP adopts elements with all values of 1, without affecting the decoding result. Of course, if a receive-side device is an active device, there is no need for a signal to provide energy, the values of elements in the third sequence corresponding to the padding bits may also all be 0, and the decoding mode corresponding to the baseband signal may be a decoding method based on a high-level duration. The decoding mode is to determine whether the decoding is 0 or 1 according to the number of high-level sampling points corresponding to the symbol, namely the number of elements with a value of 1. Therefore, the third sequence corresponding to the CP adopts elements with all values of 0, without affecting the decoding result.

[0106] In an alternative embodiment of the present disclosure, before determining the number of padding bits, the method may further comprise:

[0107] determining that a first number of elements with a value of 1 in the first binary sequence is less than the number of sampling points corresponding to the cyclic prefix.

[0108] The method further comprises: determining that the number of padding bits is 0 if the first number is greater than or equal to the number of sampling points corresponding to the cyclic prefix.

[0109] The first number is also a number of high-level sampling points in the sequence 1 into which elements with a value of 0 in the bit sequence are encoded, namely a number of elements with a value of 1 in the sequence 1. The embodiments of the present disclosure are not limited solely as to the manner in which specific values of the first number are determined. Alternatively, the first number may be an agreed fixed value, or may be known by the first node through calculation or table lookup. It will be appreciated that the first number may be determined by counting the number of elements with a value of 1 in the first binary sequence or by calculating a difference between the second number of elements in the first binary sequence and the number of elements with a value of 0 in the first binary sequence.

[0110] In an alternative embodiment of the present disclosure, in a case that the values of elements in the third sequence are all 1, if the first number is greater than or equal to the number of sampling points corresponding to the CP, that is, the high-level duration is greater than or equal to the duration of the CP, the bit sequence may not be padded. Since the tails of the encoded sequences corresponding to the bit sequence are all high-level sampling points and the number of high-level sampling points is greater than the number of sampling points corresponding to the CP, the sampling points of the CP without padding addition are all high-level sampling points.

[0111] As an alternative, both bit "0" and bit "1" in the bit sequence may be encoded as a sequence ending with high-level sampling points. That is, the first binary sequence corresponding to bit "0" and the second binary sequence corresponding to bit "1" both end with several high-level sampling points. That is, the last several elements of the sequence all have values of 1.

[0112] As an alternative, both bit "0" and bit "1" in the bit sequence may be encoded as a sequence having a segment of low level and a segment of high level and ending with high level. That is, the first binary sequence corresponding to bit "0" and the second binary sequence corresponding to bit "1" both end with several high-level sampling points. That is, the last several elements of the sequence all have values of 1.

[0113] If the first number is greater than or equal to the number of sampling points corresponding to the CP, the high-level sampling points corresponding to the cyclic prefix must be connected to the high level in the last symbol of the previous OFDM. If a decoding mode based on a low-level duration is adopted, the presence of the CP will not affect the decoding. Therefore, if the decoding mode based on the low-level duration is adopted, no padding may be performed at this moment.

[0114] However, if a decoding method based on a high-level duration is adopted, a connected high level may cause the decoding device to misinterpret bit "0" of the last symbol of the previous OFDM symbol into bit "1". In view of this, in an alternative embodiment of the present disclosure, when the decoding mode corresponding to the baseband signal is the decoding mode based on the high-level duration and the values of the elements in the third sequence are 1, the decoding result of the last symbol of the baseband signal is determined by:

[0115] determining a number of high-level sampling points between a rising edge corresponding to the last symbol and a next adjacent falling edge; and

[0116] determining the decoding result corresponding to the last symbol based on a difference between the number of high-level sampling points and a second number, the second number being equal to a sum of a number of sampling points corresponding to the number of padding bits and the number of sampling points corresponding to the cyclic prefix.

[0117] With this alternative, when decoding the last symbol of an OFDM symbol, the problem of decoding errors due to CP addition and padding bits can be avoided by removing the influence of sampling points corresponding to the CP and the number of padding bits on decoding.

[0118] Alternatively, the first number may be associated with a data transmission rate. Alternatively, as the data transmission rate is higher, the value of the first number is relatively smaller. Alternatively, the value of the corresponding first number may be obtained by table lookup according to an actual data transmission rate.

[0119] As an example, Table 1 shows an alternative of determining the first number provided in embodiments of the present disclosure. The value of the first number may be obtained by table lookup according to the data transmission rate corresponding to the bit sequence. The data transmission rates S1, S2 or S3 in Table 1 may be a rate value or a rate range. Alternatively, S1, S2 or S3 respectively have different rate ranges. The corresponding first number, namely, the number of elements with a value of 1 in the first binary sequence may be found according to the rate ranges of the data transmission rates corresponding to the bit sequence.

[0120] Table 1

[0121]

[0122] In a practical application, in the case that the number of Fourier transform points and the number of elements in a binary sequence corresponding to one bit (namely, the number of sampling points corresponding to one bit) are determined, the number of bits that can be transmitted on an OFDM symbol is also determined. If bit padding is required, a size of the number of padding bits will affect the number of bits in the bit sequence corresponding to data to be transmitted. Therefore, in an alternative embodiment of the present disclosure, the method further comprises:

[0123] determining a length of the bit sequence transmitted on an OFDM symbol based on the size of Fourier transform, the first number of elements, and the number of padding bits.

[0124] The length of the bit sequence is equal to the number of Fourier transform points, namely the ratio of the -size of Fourier transform to the first number of elements minus the number of padding bits . That is, dummy bits (padding bits / non-data bits) are inserted after every ( - ) data bits.

[0125] After the first sequence is obtained, transform precoding processing may be performed. The embodiments of the present disclosure are not limited solely as to the specific manner of transform precoding. As an alternative provided in the embodiments of the present disclosure, the performing transform precoding on the first sequence to obtain a second sequence comprises at least one of the following:

[0126] multiplying the first sequence by a transform precoding matrix to obtain a second sequence, a size of the transform precoding matrix being being the size of Fourier transform, and ; and

[0127] performing -size Fourier transform on the first sequence, and taking out 2K elements at predetermined positions in a Fourier transform result, to obtain the second sequence.

[0128] Accordingly, the performing resource mapping on the second sequence comprises: mapping the second sequence onto 2K resource elements corresponding to the OFDM symbol.

[0129] "2K" may also be replaced in other ways, for example, with "L" or any other character. This alternative of the present disclosure proposes two new transform precoding schemes, by which the complexity of the transform precoding can be effectively reduced.

[0130] The 2K elements at the predetermined positions may be elements corresponding to low-frequency components in the Fourier transform result, and the predetermined positions are related to the positions of components with a frequency of 0 after the Fourier transform in the Fourier transform result. Alternatively, if the component with a frequency of 0 is an element at a starting position in the Fourier transform result, the 2K elements at the predetermined positions are the first 2K elements in the Fourier transform result. Alternatively, if the component with a frequency of 0 is not an element at the starting position in the Fourier transform result, the 2K elements at the predetermined positions are 2K elements centered on the position where the component with a frequency 0 is located. Alternatively, the 2K elements at the predetermined positions are at least one of:

[0131]

[0132] The embodiments of the present disclosure are not limited solely as to the specific value of K. The K value may be a smaller fixed value, may be obtained by dynamic calculation, or may be obtained by table lookup.

[0133] As an alternative, the value of K may be associated with at least one of a data transmission rate, a subcarrier spacing, a signal bandwidth corresponding to a bit sequence namely a bandwidth used for transmitting the bit sequence, and a communication scenario.

[0134] For example, the value of K (namely, 2K) may be determined by a rate required for data transmission. In some application scenarios (for example, RFID systems), the data rate at which a transmitter transmits data is low, and therefore, K may take a relatively small value. For example, the value of K may be related to communication scenarios, and the value of K in each scenario is a predetermined fixed value, or may be obtained by table lookup according to information related to the communication scenarios. As another example, the value of K is associated with the subcarrier spacing and the data transmission rate, and the value of K may be obtained according to the subcarrier spacing and the data transmission rate by an agreed calculation mode or table lookup.

[0135] As an example, Table 2 shows a way in which the value of K / 2K may be determined by table lookup according to relevant parameters. Any one of a list of relevant parameters A1 to An may be a value or value range of a parameter, and may also be values / value range combinations of multiple parameters. The value or combination of each parameter corresponds to a specific value of K / 2K. For example, the value corresponding to A1 is k1. The parameters here may include but are not limited to a combination of one or more of the data transmission rate, the subcarrier spacing, the signal bandwidth, the scenario, and the like.

[0136] Table 2

[0137]

[0138] After obtaining the second sequence by transform precoding, the baseband signal may be obtained by performing resource mapping and other necessary subsequent signal processing on the second sequence.

[0139] In a practical application, for a signal receiver (namely, a decoder), some of the information required for decoding needs to be informed to the receiver by the transmitter (first node), or agreed upon by the receiver and the transmitter. As an alternative, the bit sequence includes information related to at least one of the following:

[0140] a number of elements in the first binary sequence corresponding to at least one bit in the bit sequence; a number of elements in the second binary sequence corresponding to at least one bit in the bit sequence; a padding length or number of padding bits required to obtain the first sequence through encoding; and a data transmission rate.

[0141] According to one or more items of information carried in the bit sequence, the decoder may know the information required for decoding.

[0142] Taking an RFID system in an IOT application scenario as an example, it is supposed that downlink data to be transmitted is downlink data of an RFID system shown in FIG. 5. The downlink data includes an auxiliary sequence and signaling, such as a control signaling. The auxiliary sequence may also be referred to as a synchronization sequence or a preamble sequence. The sequence is a sequence located ahead of the signaling for assisting a receiving node (such as an electronic tag) to receive the signaling. Alternatively, one or more items of the above information may be carried in the auxiliary sequence.

[0143] If the length (the number of elements included in the sequence) of the binary sequence corresponding to the bits with the same value in the bit sequence is the same, the first length of the first binary sequence corresponding to the at least one bit is a value. If the length of the binary sequence corresponding to the bits with the same value is different, the decoder should be able to know the number of elements in the binary sequence corresponding to each bit 0 according to the information related to the number of elements in the first binary sequence corresponding to the at least one bit. Likewise, the same is true for the number of elements in the second binary sequence corresponding to the at least one bit.

[0144] Of course, various items of information needed to be known for decoding by the decoder may also be agreed fixed values, or may be calculated by the decoder according to relevant parameters. For example, the number of elements in a binary sequence is related to a data transmission rate, and the decoder may calculate the number of elements in the binary sequence according to the data transmission rate.

[0145] Alternative implementations of generating the baseband signal provided by the present disclosure are described below in connection with several alternative embodiments.

[0146] Embodiment 1

[0147] This embodiment provides a signal generation method based on transform precoding performed by a first node (which may be referred to as a first communication node), which may also be referred to as a downlink data signal generation method based on transform precoding. Unlike a low-power wake-up signal which can only use non-zeroing codes in the related art, the method provided by this embodiment may be used for, but is not limited to, PIE with different high-level durations in the symbol time commonly used by electronic tags. For a passive or semi-passive electronic tag, there is no energy in the symbol of bit "0" in the non-zeroing code in the related art, and multiple bits "0" appearing in a short time may cause the energy supply of the electronic tag to be interrupted. With the signal generation method proposed in this embodiment, a signal with higher energy transmission efficiency may be used, thereby allowing the electronic tag to operate more stably.

[0148] For convenience of description, in this embodiment, the size of Fourier transform is referred to as the number of Fourier transform points, the number of elements included in the sequence namely the number of elements in the sequence is referred to as the length of the sequence. For example, the first number of elements in the first binary sequence is referred to as the length of the first binary sequence, namely a first length, and the second number of elements in the second binary sequence is referred to as the length of the second binary sequence, namely a second length. The padding length is the number of elements to be padded (referred to as simply padding elements).

[0149] FIG. 6 shows a schematic flowchart of a signal generation method provided by this embodiment. As shown in FIG. 6, the method comprises the following steps:

[0150] (1) -size sampling point-level encoding

[0151] In this embodiment, the -size sampling point-level encoding may be referred to as, but not limited to, pulse interval encoding. It is supposed that there are a total of 0 and 1 in a bit sequence. An bit "0" is encoded as a waveform having a number of high-level sampling points and a number of low-level sampling points . An bit "1" is encoded as a waveform having a number of high-level sampling points and a number of low-level sampling points . That is, each bit "0" is encoded as a binary sequence with a first length of . The number of elements with a value of 0 in the sequence is , and the number of elements with a value of 0 is .

[0152] In addition, invalid bits "X", namely padding elements with a total number of the padding length, are defined in this embodiment. Each invalid bit may be encoded as 1 low-level sampling point or one high level, and the invalid bits are used for symbol padding. The above respective parameters shall satisfy:

[0153]

[0154] One OFDM symbol is exactly padded. That is, the number of elements of the padded sequence (fifth sequence) is equal to the number of Fourier transform points , where represents the number of invalid bits, namely the padding length.

[0155] It should be noted that for the pulse interval encoding, a symbol is decoded as 1 as long as the number of high-level sampling points is greater than a certain threshold, otherwise it is decoded as 0 during decoding. Therefore, the number of high-level sampling points of each bit "1" may be different as long as the number is greater than a threshold (alternatively, this threshold may be calculated by the receiver in a manner of transmitting a waveform of bit "0" and a calibration waveform in a preamble sequence, that is, the waveform of data to be transmitted may include the waveform of bit "0" and the calibration waveform, a signal transmitted by the transmitter carries relevant information about these two waveforms, and the receiver knows the encoded sequence corresponding to bit "0" (namely the first binary sequence) according to the relevant information about the waveform of bit "0", and may determine the threshold according to the calibration waveform). Therefore, a second communication node may adjust the respective parameters in the above equation, so that a total number of high-level and low-level sampling points transmitted on an OFDM symbol is equal to .

[0156] Alternatively, the lengths of the first binary sequence and the second binary sequence may be the same, and the invalid bit "X" may be encoded as one high level, thereby further avoiding the problem of energy interruption at the receiver due to invalid bit padding. Alternatively, all invalid bits may be padded to the tail of the encoded encoding sequence corresponding to the bit sequence.

[0157] Alternatively, one of the simplest implementations is to define the pulse interval encoding scheme as follows:

[0158] ① equals to , that is, symbol durations of bit "0" and bit "1" are the same;

[0159] ② (also equals to ) can divide , that is, an integer number of symbols may be transmitted within one OFDM symbol.

[0160] In the embodiments of the present disclosure, regardless of the encoding mode, after encoding the first communication node may always obtain an encoding sequence, namely, a first sequence r[n]，n=0,1,…, -1, representing a signal encoded on the OFDM symbol. In particular, for the pulse interval encoding, the encoding sequence r[n] has only two values: r[n]=1 represents a high level at a sampling point with an index / sequence number of n, and r[n]=0 represents a low level at a sampling point with an index of n.

[0161] (2) Transform precoding

[0162] Transform precoding is performed on an encoding sequence r[n] of -size. A transform precoding matrix is:

[0163]

[0164] The transform precoding matrix has a matrix size of 2K× .

[0165] Alternatively, the value of K may be determined by a required data rate. Generally, when transmitting data to an electronic tag (a signal receiver), the data rate is very low. Therefore, the value of K is usually very small. For example, the value may be selected as a fixed value or may be dynamically calculated according to the data rate. It is supposed that the required data rate is x bits per second, then an alternative calculation method is: , where is a subcarrier spacing, and [·] is rounding. The rounding is not limited herein, and any rounding method is possible. The rounding may be rounding up or down. For example, it is supposed that the required data rate is 180 kbps (180, 000 bits per second), =15kHz, and the corresponding value of K is 6. It should be noted that since the value of K is very small, the complexity of transform precoding is much lower than the -size Fourier transform.

[0166] Alternatively, as another equivalent implementation of transform precoding, the -size Fourier transform is performed on the encoding sequence r[n] of -size, and 2K elements representing low-frequency components namely 2K elements at predetermined positions are taken out from a Fourier transform result. If a component representing a frequency of 0 after the Fourier transform is located at the position of the first element of the result of Fourier transform, the sequence numbers of the taken-out 2K elements in the Fourier transform result are -K+k mod , where k=0,1,…,2K-1, and mod is a remainder operation. If a component representing a frequency of 0 after the Fourier transform is located in the middle of the Fourier transform result, the sequence numbers of the taken-out 2K elements in the Fourier transform result are , where k=0,1,…,2K-1.

[0167] (3) Resource mapping

[0168] It is supposed that the sequence after transform precoding namely the second sequence is y[n],n=0,1,…,2K-1. The resource mapping method may reuse a resource mapping method in an existing communication system. y[n] is mapped onto 2K resource elements in a system bandwidth, where a frequency corresponding to the mapped y[n] resource elements is an operating frequency of a receiver, namely, an operating bandwidth of the receiver.

[0169] (4) Inverse Fourier transform and CP addition

[0170] Based on a result of the resource mapping, inverse Fourier transform, CP addition and subsequent signal processing are performed to obtain a baseband signal on an OFDM symbol. Alternatively, operations after the resource mapping may be the same as corresponding operations in an existing NR communication system.

[0171] Embodiment 2

[0172] This embodiment provides an implementation method of pulse interval encoding suitable for an OFDM system and a corresponding decoding method.

[0173] In an ultrahigh frequency RFID protocol of an existing RFID system, encoding modes of bit "0" and bit "1" are as shown in FIG. 7, and symbol durations of 0 and 1 are different and end with a segment of low level. However, there are at least three problems if such encoded data is to be generated and transmitted based on the OFDM system:

[0174] (1) The different symbol durations make it difficult to achieve time alignment at an OFDM symbol level, that is, all the symbols cannot just divide the whole OFDM symbol equally.

[0175] (2) Since each symbol ends with a low level, under the condition that (1) is satisfied, the end of the cyclic prefix unique to the OFDM system will inevitably contain a segment of low level, and other parts of the cyclic prefix are at a high level. With the increase of downlink data rate, four cases as shown in FIG. 8a to FIG. 8d may occur. Low levels may appear in the range of the CP in FIG. 8a, which may be caused when the data rate is very low. A segment of high level and low level (low level is dominant) appears in the CP in FIG. 8b, which may be caused when the data rate is higher than that in FIG. 8a. A segment of high level and low level (high level is dominant) appears in the CP in FIG. 8c, which may be caused when the data rate is higher than that in FIG. 8b. Multiple segments of high level and multiple segments of low level may appear in the range of the CP in FIG. 8d, which may be caused when the data rate is higher than that in FIG. 8c.

[0176] FIG. 8d only illustrates a case where there are two segments of high level and two segments of low level in the CP. However, since the length of the cyclic prefix is fixed and the time of the low level within each symbol varies according to the variation of the downlink data rate, when the downlink data rate further increases, there may be a case where there are more segments of high level and more segments of low level in the range of the cyclic prefix. It can be seen from FIGS. 8a to 8d that due to the existence of a cyclic prefix, there may be multiple cases of high-low level transitions in the range of the cyclic prefix. If an electronic tag is required to perform separate processing for each case during decoding, the implementation complexity and cost of the electronic tag will inevitably be increased. Otherwise, at least one 0 or 1 will inevitably be detected at the time of the cyclic prefix in which no data is transmitted, which will inevitably result in decoding errors.

[0177] (3) For both cases shown in FIGS. 8a and 8b, the duration of the high level in the range of the CP is less than the duration of the low level, the electronic tag cannot perform efficient energy storage on repeatedly occurring CPs, and there is a possibility that the energy supply of the electronic tag is interrupted.

[0178] In order to solve at least one of the above-mentioned problems, the signal generation method provided by this embodiment may use the encoding mode shown in FIG. 9 to perform the pulse interval encoding. As shown in FIG. 9, in this embodiment, symbols defining three types of bits are defined: bit "1", bit "0" and dummy bit "X". The dummy bit is a padding bit. Both bit "1" and bit "0" are encoded as a sequence of a certain length (first length) and starting with a segment of low level and ending with a segment of high-level sampling point. The number of high-level sampling points of bit "1" is greater than the number of high-level sampling points of bit "0" (corresponding to a decoding method based on a high-level duration). The dummy bit is encoded as a sequence of high-level sampling points of a certain length. That is, a binary sequence corresponding to bit "1" sequentially includes a third number of elements with a value of 0 and a fourth number of elements with a value of 1. A binary sequence corresponding to bit "0" sequentially includes a fifth number of elements with a value of 0 and a sixth number of elements with a value of 1.

[0179] The symbols of the three types of bits have the same duration, the duration of the symbols may be converted into the number of sampling points namely sampling points (first length), and the number of Fourier transform points may be divided by .

[0180] As an alternative, instead of performing a high-to-low level transition within the symbol durations of bit "1" and bit "0", a low-to-high level transition is performed, and the number of sampling points converted from the high-level duration in the symbol of bit 0 is .

[0181] Alternatively, the first communication node may generate a signal as follows:

[0182] In a first step, the value of namely a first number is determined according to a downlink data rate. Alternatively, the value of may be determined by table lookup according to the downlink data rate namely a data transmission rate.

[0183] In a second step, it is determined whether is greater than a number of cyclic prefix points (the number of sampling points corresponding to the cyclic prefix).

[0184] Case 1: (corresponding to a case where the downlink data rate is relatively low)

[0185] At this time, it is not necessary to transmit the dummy bits on the last several symbols of the OFDM symbol (namely, the number of dummy bits in each OFDM symbol is the number of padding bits =0), and the signal generation mode proposed in Embodiment 1 may be used (the length of the encoded sequence of each bit is ) for generating a baseband signal including a CP. In a bit sequence of [1 0 1 0], a time domain waveform of the baseband signal obtained in the embodiment is as shown in a waveform corresponding to an OFDM symbol with an index of n+1 in FIG. 10.

[0186] As shown in FIG. 10, the high level of the cyclic prefix must be connected with the high level in the last symbol of the previous OFDM symbol. If the electronic tag decodes with a low-level duration, this connected high level does not have any influence on decoding. If the electronic tag decodes with a high-level duration, the connected high level may cause the electronic tag to misinterpret bit "0" of the last symbol of the previous OFDM symbol as bit "1". Therefore, if the electronic tag decodes with the high-level duration, the decoding may be performed by using the following method proposed by the embodiments of the present disclosure:

[0187] In a first step, a high-level duration (converted into the number of sampling points) between a rising edge (a rising edge corresponding to the last symbol) and a next adjacent falling edge (a first falling edge of the next OFDM symbol) is acquired.

[0188] In a second step, is subtracted from the acquired high-level duration , where is a second number. The calculation result is compared with a decision threshold. If the calculation result is lower than the decision threshold, the current symbol is decoded as bit "0", otherwise, the current symbol is decoded as bit "1".

[0189] It should be noted that the electronic tag is required to be known for and sampling point spacing. Alternatively, and the sampling point spacing are system parameters, and default values may be used without notification. Both and are related to the downlink data rate. Therefore, the two parameters may be notified directly in the auxiliary sequence or obtained indirectly from the downlink data rate. The second communication node needs to indicate the downlink data rate in the auxiliary sequence at this moment. That is, the bit sequence may carry the information related to and . Of course, may also be an agreed fixed value, and the receiver may calculate according to and .

[0190] Case 2: if (corresponding to a case where the downlink data rate is relatively high),

[0191] every data bits in a transport block are followed by dummy bits and divided by the number of OFDM symbols. That is, data bits and dummy bits are transmitted on each OFDM symbol in sequence, where and represents rounding up.

[0192] Alternatively, after calculating the number of dummy bits , each dummy bit may be encoded as a sequence with a length of and all values of 1, each bit "1" may be encoded as a sequence 1 with a length of , and each bit "1" may be encoded as a sequence 2 with a length of , so as to obtain a first sequence with a length equal to . Afterwards, steps (2) to (4) in Embodiment 1 may be performed to obtain a baseband signal including a cyclic prefix (including addition of cyclic prefix). Thus, an example of a waveform actually transmitted on each OFDM symbol namely a waveform of the baseband signal (data bits are still exemplified by [1 0 1 0 1]) is shown in FIG. 11. In the example, each dummy bit is encoded as a sequence with a length of and all values of 1, namely all high-level sampling points.

[0193] Similar to Case 1, if the electronic tag decodes with the low-level duration, the connected high level does not have any influence on decoding, whereas if the electronic tag decodes with the high-level duration, the connected high level may cause the electronic tag to misinterpret bit "0" of the last symbol of the previous OFDM symbol as bit "1". Therefore, if the electronic tag decodes with the high-level duration, a new decoding method provided in Case 1 may be used for decoding.

[0194] Since the number of valid data bits actually transmitted on one OFDM symbol is an average data rate is bits per second if the subcarrier spacing is . It is supposed that respective parameters are as shown in the table below, and different data rate requirements for downlink may be met.

[0195]

[0196] Based on the same principles as the method provided by the present disclosure, embodiments of the present disclosure also provide a node in a communication system. The node may comprise at least one transceiver and at least one processor coupled to the at least one transceiver. The at least one processor is configured to perform steps of the method provided in any of the alternative embodiments of the present disclosure.

[0197] Embodiments of the present disclosure also provide an electronic device. The electronic device includes a memory, a processor, and a computer program stored on the memory. The computer program, when executed by the processor, may implement steps of the method provided in any of the alternative embodiments of the present disclosure. The electronic device may be a terminal device or a network device.

[0198] FIG. 12 shows a schematic structure diagram of an electronic device to which embodiments of the present disclosure are applied. As shown in FIG. 12, the electronic device 4000 shown in FIG. 12 includes a processor 4001 and a memory 4003. Wherein, the processor 4001 is connected to the memory 4003, for example, through a bus 4002. Optionally, the electronic device 4000 may further include a transceiver 4004, and the transceiver 4004 may be used for data exchange between the electronic device and other electronic device, for example, the transmission and / or reception of data, etc. It should be noted that, in practical applications, the transceiver 4004 is not limited to one, and the structure of the electronic device 4000 does not constitute any limitations to the embodiments of the present disclosure. Optionally, the electronic device may be a first communication node.

[0199] FIG. 12 shows a schematic structure diagram of an electronic device to which embodiments of the present disclosure are applied. As shown in FIG. 12, the electronic device 4000 shown in FIG. 12 includes a processor 4001 and a memory 4003. Wherein, the processor 4001 is connected to the memory 4003, for example, through a bus 4002. Optionally, the electronic device 4000 may further include a transceiver 4004, and the transceiver 4004 may be used for data exchange between the electronic device and other electronic device, for example, the transmission and / or reception of data, etc. It should be noted that, in practical applications, the transceiver 4004 is not limited to one, and the structure of the electronic device 4000 does not constitute any limitations to the embodiments of the present disclosure. Optionally, the electronic device may be a first network node, a second network node or a third network node.

[0200] The processor 4001 may be a central processing unit (CPU), a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), or a field programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various examplary logical blocks, modules and circuits described in connection with the present disclosure. The processor 4001 may also be a combination for realizing computing functions, for example, a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0201] The bus 4002 may include a path to transfer information between the components described above. The bus 4002 may be a peripheral component interconnect (PCI) bus, or an extended industry standard architecture (EISA) bus, etc. The bus 4002 may be an address bus, a data bus, a control bus, etc. For ease of presentation, the bus is represented by only one thick line in FIG. 12. However, it does not mean that there is only one bus or one type of buses.

[0202] The memory 4003 may be, but not limited to, read only memories (ROMs) or other types of static storage devices that can store static information and instructions, random access memories (RAMs) or other types of dynamic storage devices that can store information and instructions, may be electrically erasable programmable read only memories (EEPROMs), compact disc read only memories (CD-ROMs) or other optical disk storages, optical disc storages (including compact discs, laser discs, discs, digital versatile discs, blue-ray discs, etc.), magnetic storage media or other magnetic storage devices, or any other media that can carry or store desired program codes in the form of instructions or data structures and that can be accessed by computers.

[0203] The memory 4003 is used to store computer program for executing the solutions of the present disclosure, and is controlled by the processor 4001. The processor 4001 is used to execute the computer program stored in the memory 4003 to implement the solution provided in any method embodiment described above.

[0204] Embodiments of the present disclosure provide a computer-readable storage medium having a computer program stored on the computer-readable storage medium, the computer program, when executed by a processor, implements the steps and corresponding contents of the foregoing method embodiments.

[0205] Embodiments of the present disclosure also provide a computer program product including a computer program, the computer program when executed by a processor realizing the steps and corresponding contents of the preceding method embodiments.

[0206] The terms "first", "second", "third", "fourth", "1", "2", etc. (if present) in the specification and claims of this application and the accompanying drawings above are used to distinguish similar objects and need not be used to describe a particular order or sequence. It should be understood that the data so used is interchangeable where appropriate so that embodiments of the present disclosure described herein can be implemented in an order other than that illustrated or described in the text.

[0207] It should be understood that while the flow diagrams of embodiments of the present disclosure indicate the individual operational steps by arrows, the order in which these steps are performed is not limited to the order indicated by the arrows. Unless explicitly stated herein, in some implementation scenarios of embodiments of the present disclosure, the implementation steps in the respective flowcharts may be performed in other orders as desired. In addition, some, or all of the steps in each flowchart may include multiple sub-steps or multiple phases based on the actual implementation scenario. Some or all of these sub-steps or stages can be executed at the same moment, and each of these sub-steps or stages can also be executed at different moments separately. The order of execution of these sub-steps or stages can be flexibly configured according to requirements in different scenarios of execution time, and the embodiments of the present disclosure are not limited thereto.

[0208] The above-mentioned description and the drawings are provided merely as examples to help readers to understand the present disclosure, and they should not be interpreted or aim to limit the scope of the present disclosure in any way. Although some embodiments are provided, it is apparent for those skilled in the art to adopt other similar implementation means based on the technical idea of the present disclosure without departing from the technical concept of the solution of the present disclosure.

Claims

1.A method performed by a node in a communication system, comprising:encoding a bit sequence to be transmitted on an orthogonal frequency division multiplexing (OFDM) symbol into a first sequence, a number of elements in the first sequence being equal to a size of Fourier transform, each bit with a value of 0 in the bit sequence being encoded as a first binary sequence, and each bit with a value of 1 being encoded as a second binary sequence;performing transform precoding on the first sequence to obtain a second sequence; andperforming resource mapping on the second sequence, and generating a baseband signal based on a result of the resource mapping.2.The method according to claim 1, wherein the performing transform precoding on the first sequence to obtain a second sequence comprises any one of the following:multiplying the first sequence by a transform precoding matrix to obtain the second sequence, a size of the transform precoding matrix being,being the size of Fourier transform, and; andperforming-size Fourier transform on the first sequence, and taking out 2K elements at predetermined positions in a Fourier transform result, to obtain the second sequence.3.The method according to claim 2, wherein the 2K elements at the predetermined positions are at least one of:, where k=0,1,…,2K-1; and, where k=0,1,…,2K-1.4.The method according to claim 3, wherein the performing resource mapping on the second sequence comprises:mapping the second sequence onto 2K resource elements corresponding to the OFDM symbol.5.The method according to claim 1, wherein the encoding a bit sequence to be transmitted on an OFDM symbol into a first sequence comprises:determining a number of elements in an encoded sequence corresponding to the bit sequence, based on a number of bits with a value of 0 in the bit sequence, a number of bits with a value of 1 in the bit sequence, and a number of elements in a sequence after each bit is encoded;determining a padding length based on the size of Fourier transform and the number of elements in the encoded sequence corresponding to the bit sequence; andpadding, when needed, the encoded sequence corresponding to the bit sequence with first values whose total number is equal to the padding length, to obtain the first sequence, the first values being 0 or 1.6.The method according to claim 1. wherein a first number of elements in the first binary sequence is the same as or different from a second number of elements in the second binary sequence, and / or at least one of the first number of elements and the second number of elements divides the size of Fourier transform.7.The method according to claim 1, wherein a first number of elements in the first binary sequence is equal to a second number of elements in the second binary sequence, and the first number of elements divides the size of Fourier transform，wherein, the encoding a bit sequence to be transmitted on an OFDM symbol into a first sequence comprises:determining a number of padding bits corresponding to a cyclic prefix according to a number of sampling points corresponding to the cyclic prefix and the first number of elements;padding second values whose total number is equal to the number of padding bits after the bit sequence, to obtain a padded sequence; andencoding bits with values of 0 and 1 in the bit sequence in the padded sequence into a first binary sequence and a second binary sequence respectively, and encoding each padded bit into a third sequence comprising the same number of elements as the first number of elements, to obtain the first sequence, values of elements in the third sequence being all 1.8.The method according to claim 7, wherein before determining the number of padding bits, the method further comprises:determining that the first number is less than the number of sampling points corresponding to the cyclic prefix, the first number being a number of elements with a value of 1 in the first binary sequence,wherein the method further comprising:determining that the number of padding bits is 0 if the first number is greater than or equal to the number of sampling points corresponding to the cyclic prefix.9.The method according to claim 8, wherein the first number is associated with a data transmission rate.10.The method according to claim 7, wherein when a decoding mode corresponding to the baseband signal is a decoding method based on a high-level duration, a decoding result of the last symbol of the baseband signal is determined by:determining that a value between a rising edge corresponding to the last symbol and a next adjacent falling edge is a number of high-level sampling points; anddetermining a decoding result corresponding to the last symbol based on a difference between the number of high-level sampling points and the second number, the second number being equal to a sum of a number of sampling points corresponding to the number of padding bits and the number of sampling points corresponding to the cyclic prefix.11.The method according to claim 1, wherein the bit sequence comprises information related to at least one of the following:a number of elements in the first binary sequence corresponding to at least one bit in the bit sequence;a number of elements in the second binary sequence corresponding to at least one bit in the bit sequence;a padding length or number of padding bits required to obtain the first sequence through encoding; anda data transmission rate.12.A node in a communication system comprising:at least one transceiver; andat least one processor coupled to the at least one transceiver, the at least one processor being configured to:encode a bit sequence to be transmitted on an orthogonal frequency division multiplexing (OFDM) symbol into a first sequence, a number of elements in the first sequence being equal to a size of Fourier transform, each bit with a value of 0 in the bit sequence being encoded as a first binary sequence, and each bit with a value of 1 being encoded as a second binary sequence;perform transform precoding on the first sequence to obtain a second sequence; andperform resource mapping on the second sequence, and generating a baseband signal based on a result of the resource mapping.13.The node according to claim 12, wherein the performing transform precoding on the first sequence to obtain a second sequence comprises any one of the following:multiplying the first sequence by a transform precoding matrix to obtain the second sequence, a size of the transform precoding matrix being,being the size of Fourier transform, and; andperforming-size Fourier transform on the first sequence, and taking out 2K elements at predetermined positions in a Fourier transform result, to obtain the second sequence.14.The node according to claim 13, wherein the 2K elements at the predetermined positions are at least one of:, where k=0,1,…,2K-1; and, where k=0,1,…,2K-1.15.The node according to claim 13, wherein, for performing resource mapping on the second sequence, the at least one processor is configured to:mapping the second sequence onto 2K resource elements corresponding to the OFDM symbol.

Images