Method executed 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 beyond 4G communication systems such as Long Term Evolution (LTE). Specifically, the embodiment of the invention provides a method executed by a node in a communication system, the node and a storage medium. A new signal generation scheme is provided in the method, and the method comprises the steps that a bit sequence to be transmitted on an orthogonal frequency division multiplexing (OFDM) symbol is coded into a first sequence, and the number of elements included in the first sequence is equal to the size of Fourier transform; wherein each bit, the value of which is 0, in the bit sequence is coded into a first binary sequence, and each bit, the value of which is 1, in the bit sequence is coded into 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 mapping result. Based on the scheme provided by the invention, the communication requirement can be better met.

Description

Technical Field

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

[0002] As wireless communications have evolved over generations, these technologies have primarily been developed for human-targeted services such as voice calls, multimedia services, and data services. With the commercialization of fifth-generation (5G) communication systems, the number of connected devices is expected to grow exponentially. These will increasingly be connected to communication networks. Examples of the Internet of Things (IoT) include vehicles, robots, drones, home appliances, displays, smart sensors connected to various infrastructures, construction machinery, and factory equipment. Mobile devices are expected to develop in various forms, such as augmented reality glasses, virtual reality headsets, and holographic devices. Efforts are underway to develop improved 6G communication systems to provide a variety of services by connecting hundreds of billions of devices and things in the sixth-generation (6G) era. For these reasons, 6G communication systems are referred to as beyond-5G systems.

[0003] The 6G communication system, which is expected to be commercialized around 2030, will have a peak data rate of tera (1,000 gigabits) per second and a radio latency of less than 100 μsec, thus being 50 times the data rate of the 5G communication system and having 1 / 10 of its radio latency.

[0004] In order to achieve such high data rates and ultra-low latency, the implementation of 6G communication systems in the terahertz band (e.g., the 95 GHz to 3 THz band) has been considered. It is expected that since the path loss and atmospheric absorption in the terahertz band are more severe than those in the millimeter wave (mmWave) band introduced in 5G, technologies that can ensure the signal transmission distance (i.e., coverage) will become more critical. As the main technology to ensure coverage, it is necessary to develop radio frequency (RF) elements, antennas, new waveforms with better coverage than orthogonal frequency division multiplexing (OFDM), beamforming and massive multiple input multiple output (MIMO), full dimensional multiple input multiple output (FD-MIMO), array antennas, and multi-antenna transmission technologies such as massive antennas. In addition, new technologies to improve signal coverage in the terahertz band have been discussed, such as metamaterial-based lenses and antennas, orbital angular momentum (OAM), and reconfigurable intelligence surface (RIS).

[0005] In addition, in order to improve spectrum efficiency and overall network performance, the following technologies have been developed for 6G communication systems: full-duplex technology for enabling uplink and downlink transmissions to use the same frequency resources simultaneously; network technology that utilizes satellites, high-altitude platform stations (HAPS), etc. in an integrated manner; improved network structure to support mobile base stations, etc., and enable network operation optimization and automation, etc.; dynamic spectrum sharing technology with conflict avoidance based on spectrum usage prediction: using artificial intelligence (AI) in wireless communications to improve overall network operations by utilizing AI from the design stage of developing 6G and internalizing end-to-end AI support functions; and next-generation distributed computing technology that overcomes the computing power limitations of user equipment (UE) through ultra-high performance communication and computing resources achievable on the network (such as mobile edge computing (MEC), cloud, etc.). In addition, attempts are continuing to strengthen connectivity between devices, optimize networks, promote the softwareization of network entities, and increase the openness of wireless communications by designing new protocols to be used in 6G communication systems, developing mechanisms for achieving a hardware-based secure environment and secure use of data, and developing technologies for maintaining privacy.

[0006] Research and development of 6G communication systems, including hyperconnectivity between people and machines (P2M) and machines and machines (M2M), are expected to bring about the next hyperconnected experience. Specifically, services such as truly immersive extended reality (XR), high-fidelity mobile holograms, and digital replicas are expected to be provided through 6G communication systems. Furthermore, services such as remote surgery for enhanced safety and reliability, industrial automation, and emergency response will be provided through 6G communication systems, enabling the technology to be applied in various fields such as industry, healthcare, automobiles, and home appliances. Summary of the Invention

[0007] The embodiments of the present disclosure provide a method, node, and storage medium executed by a node in a communication system. The technical solutions provided by the embodiments of the present disclosure are as follows:

[0008] In one aspect, an embodiment of the present disclosure provides a method performed by a node in a communication system, the method comprising:

[0009] Encoding a bit sequence to be transmitted on an OFDM (Orthogonal Frequency Division Multiplexing) symbol into a first sequence, where the number of elements in the first sequence is equal to the size of the Fourier transform; wherein each bit with a value of 0 in the bit sequence is encoded as a first binary sequence, and each bit with a value of 1 is encoded as a second binary sequence;

[0010] Performing transform precoding on the first sequence to obtain a second sequence;

[0011] Perform resource mapping on the second sequence, and generate a baseband signal based on the mapping result.

[0012] On the other hand, an embodiment of the present disclosure also provides a node in a communication system, wherein the node includes at least one transceiver and at least one processor coupled to the at least one transceiver, and the at least one processor is configured to execute the method performed by the node provided by any embodiment of the present disclosure.

[0013] On the other hand, an embodiment of the present disclosure further provides a computer-readable storage medium, which stores a computer program. When the computer program runs in a processor, the processor executes the steps of the method provided in any embodiment of the present disclosure.

[0014] On the other hand, an embodiment of the present disclosure further provides a computer program product, including a computer program, which implements the steps of the method provided by any embodiment of the present disclosure when executed by a processor.

[0015] The beneficial effects brought about by the technical solutions provided by the embodiments of the present disclosure will be introduced below in conjunction with specific embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 A schematic structural diagram of a wireless network system applicable to an embodiment of the present disclosure is shown;

[0017] Figure 2 shows a schematic structural diagram of an example base station according to the present disclosure;

[0018] Figure 3 A schematic diagram showing the structure of an example user equipment according to the present disclosure is shown;

[0019] Figure 4 A schematic diagram of a flow chart of a signal generation method provided by an embodiment of the present disclosure is shown;

[0020] Figure 5 A schematic diagram of a downlink data format is shown;

[0021] Figure 6A schematic diagram of a flow chart of a signal generation method provided by an embodiment of the present disclosure is shown;

[0022] Figure 7 A schematic diagram showing a bit encoding method is shown;

[0023] Figures 8a to 8d Schematic diagrams showing the results of various bit encodings;

[0024] Figure 9 A schematic diagram showing a bit encoding method provided by an embodiment of the present disclosure is shown;

[0025] Figure 10 A schematic diagram showing an encoding result provided by an embodiment of the present disclosure is shown;

[0026] Figure 11 A schematic diagram showing another encoding result provided by an embodiment of the present disclosure is shown;

[0027] Figure 12 A schematic structural diagram of an electronic device provided by an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0028] Before proceeding to the following specific embodiments, it may be advantageous to set forth the definitions of certain words and phrases used throughout the patent document. The term "connect" and its derivatives refer to any direct or indirect communication between two or more elements, regardless of whether those elements are in physical contact with each other. The terms "send," "receive," and "communicate," and their derivatives encompass both direct and indirect communication. The terms "include," "comprise," and "includes," and their derivatives, mean to include without limitation. The term "or" is inclusive, meaning and / or. The phrase "associated with," and its derivatives, means to include, be included within, be interconnected with, include, be included within, be connected to or connected with, be coupled to or coupled with, communicate with, collaborate with, be interwoven, juxtaposed, be close to, be bound to or bound with, have, have an attribute of, have a relationship to ... or have a relationship to ... etc. The term "controller" means any device, system, or part thereof that controls at least one operation. Such a controller can be implemented in hardware or in a combination of hardware and software and / or firmware. The functionality associated with any particular controller, whether local or remote, can be centralized or distributed. 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 can be used, and only one item in the list may be required. 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 only A, only B, and only C. Similarly, the term "set" means one or more. Thus, a set of items can be a single item or a set of two or more items.

[0029] Moreover, the various functions described below can be implemented or supported by one or more computer programs, each of which is formed by a 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, instruction sets, processes, functions, objects, classes, instances, related data, or a portion thereof that are suitable 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 that can be accessed by a computer, such as read-only memory (ROM), random access memory (RAM), hard drive, compact disc (CD), digital video disc (DVD), or any other type of memory. "Non-transitory" computer-readable media excludes wired, wireless, optical, or other communication links that transmit instantaneous electrical or other signals. Non-transitory computer-readable media include media in which data can be permanently stored and media in which data can be stored and later rewritten, such as rewritable optical discs or erasable memory devices.

[0030] Definitions for certain other words and phrases are provided throughout this patent document. Those skilled 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.

[0031] The figures and various embodiments used to describe the principles of the present disclosure are included herein for illustration only and should not be construed in any way to limit the scope of the present disclosure. In addition, those skilled in the art will appreciate that the principles of the present disclosure can be implemented in any appropriately arranged wireless communication system.

[0032] The following Figures 1 to 3 Various embodiments of the present disclosure are described as being implemented in a wireless communication system. Figures 1 to 3 The description is 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.

[0033] Figure 1 An example wireless network according to an embodiment of the present disclosure is shown. Figure 1 The embodiment of the wireless network shown in FIGURE 1 is for illustration only. Other embodiments of the wireless network 100 may be used without departing from the scope of this disclosure.

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

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

[0036] Depending on the type of network, the term "base station" or "BS" may refer to any component (or collection of components) configured to provide wireless access to a network, such as a transmit point (TP), a transmit-receive point (TRP), an enhanced (or "evolved") base station (eNodeB or eNB), a 5G base station (gNB), a macro cell, a femto cell, a wireless fidelity (WiFi) access point (AP), or other wireless-capable device. A base station may provide wireless access according to one or more wireless communication protocols, such as 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 convenience, various names of base station-type devices and functions are used interchangeably in this patent document to refer to network infrastructure components that provide wireless access to remote terminals. Furthermore, depending on the network type, the term "user equipment" (UE) may refer to any component such as a mobile station (MS), a subscriber station (SS), a remote terminal, a wireless terminal, a reception point, or a user device, etc. For convenience, various names of user equipment type devices and functions are used interchangeably in this patent document to refer to a remote wireless device that wirelessly accesses a BS, regardless of whether the UE is a mobile device (such as a mobile phone or smartphone) or a device that is generally considered to be a fixed device (such as a desktop computer or a vending machine).

[0037] Dashed lines illustrate the approximate extents of coverage areas 120 and 125, which are shown as generally circular for purposes of illustration and explanation only. It should be clearly understood that coverage areas associated with a gNB, such as coverage areas 120 and 125, may have other shapes, including irregular shapes, depending on the configuration of the gNB and variations in the wireless environment associated with natural and man-made obstacles.

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

[0039] although Figure 1 An example of a wireless network is shown, but Figure 1Various changes may be made. For example, wireless network 100 may include any number of gNBs and any number of UEs in any suitable arrangement. Moreover, gNB 101 may communicate directly with any number of UEs and provide those UEs with wireless broadband access to network 130. Similarly, each gNB 102-103 may communicate directly with network 130 and provide the UEs with direct wireless broadband access to network 130. In addition, gNBs 101, 102, and / or 103 may provide access to other or additional external networks, such as an external telephone network or other types of data networks.

[0040] Figure 2 An example base station according to an embodiment of the present disclosure is shown. Figure 2 The embodiment of the gNB 102 shown in FIGURE 1 is for illustration only, and Figure 1 gNBs 101 and 103 may have the same or similar configurations. However, gNBs appear in a variety of configurations, and Figure 2 The scope of this disclosure is not limited to any particular implementation of a gNB.

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

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

[0043] The TX processing circuitry 203 receives analog or digital data (such as voice data, web data, email, 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-convert the baseband or IF signals into RF signals that are transmitted via the antennas 201a-201n.

[0044] The controller / processor 205 may include one or more processors or other processing devices that control the overall operation of the gNB 102. For example, the controller / processor 205 may 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 may also support additional functionality, such as more advanced wireless communication functionality.

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

[0046] The controller / processor 205 is also capable of executing programs and other processes, such as an operating system (OS), located in the memory 206. The controller / processor 205 can move data into or out of the memory 206 as needed to execute the processes.

[0047] The controller / processor 205 is also connected to a 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 can support communication 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 that supports 5G, LTE, or LTE-A), the interface 207 can 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 can 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 that supports communication over a wired or wireless connection, such as Ethernet or an RF transceiver.

[0048] Memory 206 is connected to controller / processor 205. A portion of memory 206 may include random access memory (RAM), and another portion of memory 206 may include flash memory or other read-only memory (ROM).

[0049] although Figure 2 An example of gNB 102 is shown, but the Figure 2 For example, gNB 102 may include any number of Figure 2 As a specific example, the access point may include multiple interfaces 207, and the controller / processor 205 may support routing functionality to route data between different network addresses. As another specific example, although shown as including a single instance of the TX processing circuitry 203 and a single instance of the RX processing circuitry 204, the gNB 102 may include multiple instances of each (such as one for each RF transceiver). For example, Figure 2 The various components in may be combined, further subdivided, or omitted, and additional components may be added according to specific needs.

[0050] Figure 3 An example user device according to an embodiment of the present disclosure is shown. Figure 3 The embodiment of UE 116 shown in FIGURE 1 is for illustration only, and Figure 1 UEs 111-115 and 117-119 may have the same or similar configurations. However, UEs may appear in a variety of configurations, and Figure 3 The scope of this disclosure is not limited to any particular implementation of the UE.

[0051] like Figure 3 As shown in FIG, UE 116 includes an antenna 301, a radio frequency (RF) transceiver 302, a TX processing circuit 303, a microphone 304, and a receive (RX) processing circuit 305. 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 touch screen display 310, and a memory 311. The memory 311 includes an OS 312 and one or more applications 313.

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

[0053] The TX processing circuit 303 receives analog or digital voice data from the microphone 304 or other outgoing baseband data (such as web data, email, or interactive video game data) from the processor 307. The TX processing circuit 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 circuit 303 and up-converts the baseband or IF signal into an RF signal that is transmitted via the antenna 301.

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

[0055] Processor 307 is also capable of executing other processes and programs located in memory 311, such as processes for reporting CSI (Channel State Information) on uplink channels. Processor 307 can move data into or out of memory 311 as needed for the executed processes. In some embodiments, processor 307 is configured to execute application 313 based on OS 312 or in response to signals received from the gNB or operator. Processor 307 is also coupled to I / O interface 308, which provides UE 116 with the ability to connect to other devices such as laptops and portable computers. I / O interface 308 is the communication path between these accessories and processor 307.

[0056] Processor 307 is also connected to touch screen display 310. A user of UE 116 may use touch screen display 310 to enter data into UE 116. Touch screen display 310 may be a liquid crystal display, a light emitting diode display, or other display capable of rendering text and / or at least limited graphics, such as from a website.

[0057] The memory 311 is connected to the processor 307. A portion of the memory 311 may include RAM, and another portion of the memory 311 may include flash memory or other ROM.

[0058] although Figure 3 An example of a UE 116 is shown, but the Figure 3 Make various changes. For example, Figure 3 The various components in the embodiment may be combined, further subdivided, or omitted, and additional components may be added as needed. As a specific example, processor 307 may be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs). Furthermore, although Figure 3 The UE 116 is shown configured as a mobile phone or smartphone, but the UE may be configured to operate as other types of mobile or stationary devices.

[0059] Optimizing communication systems and improving their resource utilization have always been hot topics for practitioners. Due to the varying signal functions and communication requirements within these systems, each has its own unique characteristics. Achieving interoperability between these systems is a key issue being researched by those skilled in the field.

[0060] Currently, the most widely used communication systems are those based on the 3GPP protocol, such as 4G communication systems such as LTE and LTE-A, 5G communication systems, and the 6G communication systems that have begun to be discussed. The signal waveforms used by these communication systems are all based on OFDM modulation waveforms.

[0061] Unlike 3GPP-based communication systems, RFID (Radio Frequency Identification) systems rely on contactless data communication between a reader and a tag to identify the target. RFID systems are a key technology in the Internet of Things (IoT) and are widely used in many industries. In RFID systems, data is modulated onto a carrier wave, using common modulation methods such as amplitude keying, phase keying, and frequency keying.

[0062] However, current OFDM communication systems don't transmit signals continuously, but rather symbol by symbol, with each symbol consisting of a cyclic prefix followed by a signal waveform. Therefore, to achieve inter-system compatibility, designing a signal suitable for RFID systems based on the OFDM system's signal structure and transmission principles is a technical challenge that needs to be addressed. Achieving uninterrupted downlink data transmission between multiple OFDM symbols within an OFDM system is also a future research direction for the Internet of Things.

[0063] To optimize communication systems and address or improve one or more of the current issues, the present disclosure provides a new communication solution and a novel signal generation method. Based on the solution provided by the present disclosure, OFDM-based signals suitable for RFID systems can be generated while maintaining satisfactory demodulation performance.

[0064] The methods provided in the embodiments of the present disclosure can be executed by any electronic device / node. For example, the node can be a user device or a network node in a communication system. The user device can be a conventional terminal such as a mobile phone or a computer, or a terminal-like device such as an electronic tag. The network node can be a base station or other network node, such as a transmission / reception point (TRP). The network node can also be a reader. In the embodiments of the present disclosure, the electronic tag can be an active tag, a passive tag, or a semi-passive tag.

[0065] In addition, the "uplink" or "downlink" described in the embodiments of the present disclosure is a relative concept. For example, in an RFID system, the reader acts like a base station, and the electronic tag is similar to a user device. The link in which the reader sends a signal to the electronic tag can be called a downlink, and the link in which the electronic tag sends a signal to the reader or other nodes can be called an uplink.

[0066] It should be noted that some of the terminology involved in the embodiments of the present disclosure may be terminology that already exists in the communication standards, and some terminology may be newly added or newly defined. The names of these newly added or newly defined terms may also adopt other names in future communication standards, or may be described in other ways (such as a text description). The names or names of the various information / messages / parameters / configurations involved in the embodiments of the present disclosure are not unique. In theory, as long as the role of the information / message / parameter / configuration, the content contained, or the explanation or description of the information / message / parameter / configuration can correspond or be associated, the name or name of the information / message / parameter / configuration can be changed.

[0067] For example, terms such as "sequence," "number of padding bits," and "padding length" in the description of the embodiments of this disclosure may also be referred to as names with related meanings. For another example, the 0s or 1s used to pad a sequence may be referred to as invalid bits, dummy bits, or padding bits.

[0068] The following describes the technical solutions provided by the present disclosure and the technical effects produced by the technical solutions. In the absence of conflicts or contradictions, the following implementations can refer to, draw on or combine with each other, and the same terms, similar features and similar implementation steps in different implementations will not be described repeatedly. For the interaction steps between different nodes, it is possible to derive the corresponding solutions for the network nodes on the other side based on the description of the solutions for the network nodes on one side. For example, if a network node receives a signal from another network node, it can be deduced that the other network node sends a signal to the above-mentioned network node. In an embodiment including multiple steps, if there is no clear order of sequence for the multiple steps, the embodiment of the present disclosure does not make a unique limitation on the implementation order of the multiple steps.

[0069] The following further illustrates the optional implementation methods of the method provided by the present disclosure in combination with the principles of the solution provided by the present disclosure and several optional embodiments. The steps of different embodiments can be combined or replaced with each other if there is no conflict.

[0070] Figure 4 An optional signal generation scheme provided by the present disclosure is shown. The method can be executed by a node in a communication system (hereinafter referred to as a first node). The node can be any electronic device, wherein the first node can be called a sending node / transmitter. Optionally, the first node can be a base station or a device that acts as a base station. The device can be any electronic device, including but not limited to a reader, such as Figure 4 As shown, the method may include the following steps:

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

[0072] Step S102: transform and precode the first sequence to obtain a second sequence;

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

[0074] The method of the embodiment of the present disclosure proposes a new signal generation method based on transform precoding. This method encodes both bit "0" and bit "1" into a binary sequence with both high-level samples and low-level samples, so that the code element corresponding to bit "0" can also have energy. Therefore, the energy transmission efficiency of the signal generated based on this method can be higher and better meet the needs.

[0075] As an optional application scenario, when the signal generated by the method provided in the embodiment of the present disclosure is applied to a scenario where the signal receiver (such as an electronic tag) is a passive device or a semi-passive device, the signal can be used to provide energy to the device more stably, reducing the possibility of energy supply interruption to the receiving device, allowing the device to operate more stably.

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

[0077] That is, the lengths of the binary sequences of two bits with the same value in a bit sequence can be the same or different, and the number of elements with values 0 and / or 1 in these two bits can be the same or different. Taking the bit "0" as an example, the total number of elements in the two first binary sequences corresponding to the two bits "0" in the bit sequence can be the same or different, and the number of elements with values 0 in these two first binary sequences can be the same or different. This is because the decoding method corresponding to PIE (Pulse Interval Encoding) is based on whether the number of high-level samples in the code element (i.e., the number of elements with a value of 1 in the binary sequence corresponding to the bit) is greater than or equal to a decision threshold, or based on whether the number of low-level samples in the code element is greater than or equal to the decision threshold. Therefore, as long as the comparison result of the number of high-level samples / the number of low-level samples corresponding to the bit and the decision threshold during decoding can ensure that the bit is correctly decoded, it is sufficient. For example, the decoding method used is based on the number of high-level samples, and the judgment threshold is A. As long as the number of 1s in the binary sequence corresponding to bit "0" is less than the judgment threshold A, and the number of 1s in the binary sequence corresponding to bit "1" is not less than the judgment threshold, bit "0" and bit "1" can be correctly decoded.

[0078] In the embodiment of the present disclosure, the number of elements in the first binary sequence (referred to as sequence 1) and the second binary sequence (referred to as sequence 2), i.e., the sequence lengths, may be the same or different. The number of elements with a value of 1 (i.e., bit "1") in sequence 1 is less than the number of elements with a value of 1 in sequence 2. The encoding method for encoding the bit sequence into the first sequence may be referred to as N FFT Sample level coding or sample level PIE coding of the point, where N FFT is the number of Fourier transform points, that is, the size of the Fourier transform.

[0079] In the embodiment of the present disclosure, the number of first elements in the first binary sequence (i.e., the number of elements included in the sequence, that is, the first length of the first binary sequence) and / or the number of second elements in the second binary sequence (the second length of the second binary sequence) can be predetermined values, such as pre-agreed fixed values, or can be determined by the first node based on length-related information received from other nodes, or can be calculated by the first node itself based on relevant information or determined by looking up a table.

[0080] 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 based on the data transmission rate. For example, the first length and / or the second length may be determined based on the data transmission rate by looking up a table.

[0081] In actual implementation, after determining sequence 1 and sequence 2, the length of the encoded sequence corresponding to the bit sequence, i.e., the number of elements in the encoded sequence, can be calculated based on the number of bits "0" and bits "1" in the bit sequence. If this length is exactly equal to the number of Fourier transform points, the encoded sequence can 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 to obtain a first sequence including a number of elements equal to the number of Fourier transform points. Based on this, in an optional embodiment of the present disclosure, the encoding of the bit sequence to be transmitted on an OFDM symbol into the first sequence includes:

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

[0083] Determine the padding length, i.e., the number of elements to be padded, based on the size of the Fourier transform and the length of the number of elements in the encoded sequence corresponding to the bit sequence;

[0084] When padding is required (the padding length is greater than 0), the encoded sequence corresponding to the bit sequence is padded with a first value whose total value is equal to the determined padding length to obtain a first sequence, where the first value is 0 or 1.

[0085] The padding length may also be referred to as the padding quantity, the number of padding bits, the number of padding digits, the number of padding elements, etc. The padding length is equal to the difference between the number of Fourier transform points and the length of the encoded sequence corresponding to the bit sequence. Optionally, a total of 0s or 1s equal to the padding length may be padded to the beginning and / or end of the encoded sequence. For example, a sequence of all 1s or all 0s equal to the padding length may be padded to the beginning of the encoded sequence. Optionally, the padding sequence may be padded to the end of the encoded sequence corresponding to the bit sequence.

[0086] As an optional solution of the present disclosure, the number of first elements in the first binary sequence is equal to the number of second 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 the Fourier transform.

[0087] Based on this scheme, the code elements corresponding to bit "0" and bit "1" have the same duration (that is, they are encoded as sequences with an equal number of elements), and an integer number of code elements can be transmitted in one OFDM symbol, which allows the encoding processing of the bit sequence to be implemented in a simpler way.

[0088] It should be noted that the word "encode" in the above "encode the bit sequence to be transmitted on an OFDM symbol into a first sequence" can also be replaced by other words. For example, "encode" can be replaced by conversion or similar words, and step S101 can also be described as "generating a first sequence based on the bit sequence."

[0089] In the first sequence, an element with a value of 1 indicates that the corresponding sample point is a high level, which can also be called a high-level sample point. An element with a value of 0 indicates that the corresponding sample point is a low level, which can also be called a low-level sample point. Through the above encoding process, the bit sequence is converted into a first sequence with a length / number of elements equal to the number of Fourier transform points. Subsequently, transform precoding can be performed on the first sequence. Subsequently, subsequent signal processing such as resource mapping, inverse Fourier transform, and CP addition is performed on the transform precoding result to obtain a baseband signal on an OFDM symbol.

[0090] As another optional solution, the number of first elements in the first binary sequence is equal to the number of second elements in the second binary sequence, and the number of first elements is an integer divider of the Fourier transform size. The encoding of the bit sequence to be transmitted on an OFDM symbol into the first sequence may include:

[0091] Determine the number of padding bits corresponding to the cyclic prefix according to the number of sampling points corresponding to the cyclic prefix and the number of first elements;

[0092] Inserting a second value whose total number is equal to the number of padding bits after the bit sequence to obtain a padded bit sequence;

[0093] The bits with values of 0 and 1 in the bit sequence in the padded sequence are respectively encoded into a first binary sequence and a second binary sequence, and each padded bit is encoded into a third sequence including the same number of elements as the first element, to obtain a first sequence, wherein the values of the elements in the third sequence are all 1.

[0094] By adopting the optional solution provided by the present disclosure, a baseband signal with CP can be generated. Since the element values in the encoded sequence corresponding to the padding bits are the same and all 1, when decoding the signal, corresponding processing can be performed based on the encoding method, thereby effectively avoiding the problem of decoding errors that may be caused by CP when decoding the signal using a high-level or low-level decoding method.

[0095] The optional scheme for generating the first sequence provided by the present disclosure differs from the previously described scheme of first encoding the elements in the bit sequence and then performing padding. In this scheme, padding is performed first and then encoded, 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 number of first elements. In other words, in this scheme, each bit in the bit sequence and the dummy padding bits are encoded into sequences of the same length.

[0096] The number of bits corresponding to the CP can be obtained based on the ratio of the number of sampling points corresponding to the CP to the number of first elements. Optionally, the ratio can be rounded up or down to obtain the number of padding bits. The term "number of padding bits" can also be referred to by other similar names, such as "number of padding bits" or "padding length." The element / bit whose padded value is the second value can be referred to as a "dummy bit" or other names.

[0097] After calculating the number of padding bits, a total of dummy bits equal to this number of padding bits can be inserted after the bit sequence. All zeros in the padded bit sequence are then encoded as sequence 1, and all ones are encoded as sequence 2. Each padded dummy bit is then encoded as a padded sequence with all 1s or all 0s, i.e., the aforementioned third sequence. Based on the obtained first sequence, a baseband signal with a CP can be obtained through transformation precoding, resource mapping, and other processing. The CP of the baseband signal generated using this scheme is the portion of the encoded sequence corresponding to the number of padding bits. Since the values of the elements in the encoded third sequence corresponding to each padded bit are all 1s, the encoded sequence corresponding to the CP is known. Therefore, when decoding the baseband signal, the portion of the sequence corresponding to the CP can be processed accordingly, thereby avoiding decoding errors caused by the CP. The value of the padded bit, i.e., the second value, can theoretically be any value, such as 0, 1, or any other identifier. As long as the bit is known to be a padding bit, it will be encoded as the third sequence, distinguishable from the encoded sequences corresponding to 0s and 1s.

[0098] Optionally, the value of the element in the third sequence may be associated with the decoding mode corresponding to the baseband signal. As an optional solution, when the decoding mode corresponding to the baseband signal is the first decoding mode based on the low level duration, the value of the element in the third sequence is 1.

[0099] For the first decoding method, because decoding determines whether to decode as 0 or 1 based on the number of elements with a value of 0 in the code element corresponding to the bit, the third sequence corresponding to the CP uses elements with values all set to 1, which does not affect the decoding result. Of course, if the receiving device is an active device and does not require signal energy, the values of the elements in the third sequence corresponding to the padding bits can also be all 0. The decoding method corresponding to the baseband signal can use a decoding method based on high-level duration. This decoding method determines whether to decode as 0 or 1 based on the number of high-level samples corresponding to the code element, that is, the number of elements with a value of 1. Therefore, the third sequence corresponding to the CP uses elements with values all set to 0, which does not affect the decoding result.

[0100] In an optional embodiment of the present disclosure, before determining the number of padding bits, the method may further include:

[0101] Determine that a first number of elements having a value of 1 in the first binary sequence is less than the number of sampling points corresponding to the cyclic prefix;

[0102] The method further includes: if the first number is greater than or equal to the number of sampling points corresponding to the cyclic prefix, determining the number of padding bits to be 0.

[0103] Among them, the first quantity, that is, the number of high-level sample points in sequence 1 into which the elements with a value of 0 in the bit sequence are encoded, that is, the number of elements with a value of 1 in sequence 1. The embodiment of the present disclosure does not make a sole limitation on the method for determining the specific value of the first quantity. Optionally, the first quantity can be an agreed fixed value, or it can be known by the first node through calculation or table lookup. It is understandable that the determination of the first quantity can be obtained by counting the number of elements with a value of 1 in the first binary sequence, or by calculating the difference between the number of second elements in the first binary sequence and the number of elements with a value of 0 in the first binary sequence.

[0104] In an optional embodiment of the present disclosure, when the values of the elements in the third sequence are all 1, if the above-mentioned 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. Because at this time, the tail of the encoded sequence corresponding to the bit sequence is all high-level sample points, and the number of high-level sample points is greater than the number of sample points corresponding to the CP. Therefore, even if no padding is performed, the sample points of the CP are all high-level sample points.

[0105] As an optional method, both bit "0" and bit "1" in the bit sequence can be encoded as sequences ending with high-level samples, 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 samples, that is, the values of the last several elements of the sequence are all 1.

[0106] As an optional method, both bit "0" and bit "1" in the bit sequence can be encoded as a low level segment and a high level segment, and the sequence ends with a 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 sample points, that is, the values of the last several elements of the sequence are all 1.

[0107] If the above-mentioned first number is greater than or equal to the number of sampling points corresponding to the CP, then the high-level sample points corresponding to the cyclic prefix will definitely be connected to the high level in the last codeword of the previous OFDM. If a decoding method based on low-level duration is adopted, the presence of CP will not affect the decoding. Therefore, if a decoding method based on low-level duration is adopted, padding is not required at this time.

[0108] However, if a decoding method based on high-level duration is used, the continuous high levels may cause the decoding device to misinterpret the bit "0" of the last symbol of the previous OFDM symbol as a bit "1". To address this issue, in an optional embodiment of the present disclosure, when the decoding method corresponding to the baseband signal is a decoding method based on high-level duration and the value of the element of the third sequence is 1, the decoding result of the last symbol of the baseband signal is determined using the following method:

[0109] Determine the number of high-level samples between the rising edge corresponding to the last code element and the next adjacent falling edge;

[0110] The decoding result corresponding to the last symbol is determined based on the difference between the number of high-level sample points and a second number, wherein the second number is equal to the sum of the number of sample points corresponding to the number of padding bits and the number of sample points corresponding to the cyclic prefix.

[0111] By adopting this optional solution, when decoding the last codeword of an OFDM symbol, the influence of the samples corresponding to the CP and the number of padding bits on the decoding is removed, thereby avoiding the problem of decoding errors caused by the addition of CP and padding bits.

[0112] Optionally, the first number may be associated with a data transmission rate. Optionally, the higher the data transmission rate, the smaller the value of the first number. Optionally, the corresponding value of the first number may be obtained by looking up a table based on the actual data transmission rate.

[0113] As an example, Table 1 shows an optional scheme for determining a first quantity provided by an embodiment of the present application. According to the data transmission rate corresponding to the bit sequence, the value of the first quantity can be obtained by looking up a table. The data transmission rate S1, S2, or S3 in Table 1 can be a rate value or a rate range. Optionally, S1, S2, or S3 have different rate ranges. According to the rate range described for the data transmission rate corresponding to the bit sequence, the corresponding first quantity, that is, the number of elements with a value of 1 in the first binary sequence, can be found.

[0114] Table 1

[0115] Data transfer rate First quantity S1 N1 S2 N2 S3 N3

[0116] In practical applications, when the number of Fourier transform points and the number of elements in the binary sequence corresponding to one bit (that is, the number of samples 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, the number of padding bits will affect the number of bits in the bit sequence corresponding to the data to be transmitted. Therefore, in an optional embodiment of the present disclosure, the method further includes:

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

[0118] Among them, the length of the bit sequence is equal to the number of Fourier transform points, that is, the size of the Fourier transform N FFT With the first element number N codeCell The ratio of minus the number of padding bits N dummy That is, in each N data bits are inserted after dummy dummy bits (filling bits / non-data bits).

[0119] After obtaining the first sequence, a transform precoding process may be performed. The specific method of transform precoding is not limited in the present embodiment. As an optional solution provided by the present embodiment, the transform precoding of the first sequence to obtain the second sequence includes at least one of the following:

[0120] The first sequence is multiplied by the transform precoding matrix to obtain the second sequence, where the size of the transform precoding matrix is 2K×N FFT ; Among them, N FFT is the size of the Fourier transform, K<N FFT ;

[0121] The first sequence is N FFTThe second sequence is obtained by performing Fourier transform and extracting 2K elements at predetermined positions in the Fourier transform result.

[0122] Correspondingly, the resource mapping of the second sequence includes: mapping the second sequence to 2K resource elements corresponding to the OFDM symbol.

[0123] Here, "2K" may also be replaced by other methods, for example, "L" or any other character. The optional solution disclosed herein proposes the above two new transform precoding solutions, which can effectively reduce the complexity of transform precoding.

[0124] Among them, the 2K elements at the predetermined position can be elements corresponding to low-frequency components in the Fourier transform result, and the predetermined position is related to the position of the component with a frequency of 0 after the Fourier transform in the Fourier transform result. Optionally, if the component with a frequency of 0 is the element at the starting position in the Fourier transform result, the 2K elements at the predetermined position are the first 2K elements in the Fourier transform result. Optionally, if the component with a frequency of 0 is not the element at the starting position in the Fourier transform result, the 2K elements at the predetermined position are 2K elements centered on the position where the component with a frequency of 0 is located. Optionally, the 2K elements at the predetermined position are at least one of the following:

[0125] N FFT -K+k mod N FFT , where k = 0, 1, ..., 2K-1;

[0126] Where k = 0, 1,…, 2K-1.

[0127] The embodiment of the present disclosure does not impose a single limitation on the specific value of K. The K value can be a relatively small fixed value, can be dynamically calculated, or can be obtained by looking up a table.

[0128] As an optional solution, the value of K can be associated with at least one of the data transmission rate, the subcarrier spacing, the signal bandwidth corresponding to the bit sequence, i.e., the bandwidth used to transmit the bit sequence, and the communication scenario.

[0129] For example, the value of K (i.e., 2K) can be determined by the rate required for data transmission. In some application scenarios (such as RFID systems), the data rate when the transmitter sends data is very low, so the value of K can be a relatively small value. For example, the value of K can be determined based on the communication scenario. The value of K for each scenario can be a predetermined fixed value, or the value of K can be obtained by looking up a table based on information related to the communication scenario. For another example, the value of K is associated with the subcarrier spacing and the data transmission rate. The value of K can be obtained based on the subcarrier spacing and the data transmission rate through an agreed calculation method or a table lookup.

[0130] As an example, Table 2 shows a method for determining the value of K / 2K by looking up a table based on relevant parameters. Any one of the relevant parameter columns A1 to An can be a value or value range of a parameter, or a combination of values / value ranges of multiple parameters. Each parameter value or combination corresponds to a specific K / 2K value, such as A1 corresponding to k1. The parameters here may include, but are not limited to, a combination of one or more of the above-mentioned data transmission rate, subcarrier spacing, signal bandwidth, scenario, etc.

[0131] Table 2

[0132] Related parameters K / 2K A1 k1 … … An kn

[0133] After the second sequence is obtained through transform precoding, a baseband signal can be obtained by performing resource mapping and other necessary subsequent signal processing on the second sequence.

[0134] In practical applications, for a signal receiver (i.e., a decoding end), some information required for decoding needs to be informed by the transmitter (first node) or is agreed upon by the receiver and transmitter. As an optional solution, the above bit sequence includes information related to at least one of the following:

[0135] The number of elements in the first binary sequence corresponding to at least one bit in the bit sequence; the number of elements in the second binary sequence corresponding to at least one bit in the bit sequence; the padding length or number of padding bits required to encode the first sequence; and the data transmission rate.

[0136] According to one or more pieces of information carried in the above bit sequence, the decoding end can obtain the information required for decoding.

[0137] Taking the RFID system in the IOT application scenario as an example, assuming that the downlink data to be transmitted is Figure 5The present invention illustrates downlink data of an RFID system, including an auxiliary sequence and signaling, such as control signaling. The auxiliary sequence, also known as a synchronization sequence or preamble sequence, precedes the signaling and assists a receiving node (such as an electronic tag) in receiving the signaling. Optionally, one or more of the aforementioned information may be carried in the auxiliary sequence.

[0138] Among them, if the lengths of the binary sequences corresponding to bits with the same value in the bit sequence (the number of elements included in the sequence) are the same, the first length of the first binary sequence corresponding to the at least one bit is also a value. If the lengths of the binary sequences corresponding to bits with the same value are different, based on the information related to the number of elements in the first binary sequence corresponding to the at least one bit, the decoding end should be able to know the number of elements in the binary sequence corresponding to each bit 0. Similarly, the same applies to the number of elements in the second binary sequence corresponding to the at least one bit.

[0139] Of course, the information that the decoding end needs to know for decoding can also be an agreed fixed value, or the decoding end can calculate it itself based on relevant parameters. For example, the number of elements in the binary sequence is related to the data transmission rate, and the decoding end can calculate the number of elements in the binary sequence based on the data transmission rate.

[0140] The following describes several optional embodiments of the baseband signal generation solution provided by the present disclosure.

[0141] Example 1

[0142] 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 the low-power wake-up signal in the related art that can only use non-return-to-zero codes, the method provided in this embodiment can be used for, but is not limited to, PIEs with high levels lasting for different lengths of time within the code element time commonly used by electronic tags. For passive or semi-passive electronic tags, there is no energy in the code element of the bit "0" in the non-return-to-zero code in the related art, and multiple bits "0" appearing in a short period of time may cause the energy supply of the electronic tag to be interrupted. However, using the signal generation method proposed in this embodiment, a signal with higher energy transmission efficiency can be used, thereby allowing the electronic tag to work more stably.

[0143] For ease of description, in this embodiment, the size of the Fourier transform is referred to as the Fourier transform point number, and the number of elements included in a sequence, i.e., the number of elements in the sequence, is referred to as the sequence length. For example, the number of first elements in a first binary sequence is referred to as the length of the first binary sequence, denoted as the first length, and the number of second elements in a second binary sequence is referred to as the length of the second binary sequence, denoted as the second length. The padding length is the number of elements to be padded (referred to as padding elements).

[0144] Figure 6 FIG. 4 shows a flow chart of the signal generation method provided in this embodiment, as shown in FIG. Figure 6 As shown, the method includes the following steps:

[0145] (1)N FFT Sample-level coding of points

[0146] In this embodiment, N FFT The sample level coding of the point can be called but not limited to pulse width coding. Assume that there are M0 0s and M1 1s in the bit sequence. The number of high level samples of the m0th bit "0" is The number of low-level samples is The waveform of the m1th bit "1" is encoded as the number of high-level samples. The number of low-level samples is That is, each bit "0" is encoded as a first length of The number of elements with value 0 in the binary sequence is The number of elements with value 0 is

[0147] In addition, this embodiment defines invalid bits "X", that is, padding elements with a total length of padding. Each invalid bit can be encoded as a low-level sample or a high-level sample. The invalid bits are used for symbol padding. Among them, the above parameters should meet the following requirements:

[0148]

[0149] That is, just one OFDM symbol is filled, that is, the number of elements in the filled sequence (fifth sequence) is equal to the number of Fourier transform points N FFT , where N X Indicates the number of invalid bits, that is, the padding length.

[0150] It should be noted that for pulse width coding, during decoding, as long as the number of high-level samples is greater than a certain threshold, it will be decoded as 1, otherwise it will be decoded as 0. Therefore, the number of high-level samples for each bit "1" can be different, as long as it is greater than the threshold value (optionally, this threshold value can be calculated by the receiving end by sending the waveform of bit "0" and the calibration waveform in the leading sequence, that is, the waveform of the data to be transmitted can include the waveform of bit "0" and the calibration waveform, and the signal sent by the transmitter carries the relevant information of these two waveforms. The receiving end knows the encoded sequence corresponding to bit "0", that is, the first binary sequence, based on the relevant information of the waveform of bit "0", and can determine the threshold value based on the calibration waveform). Therefore, the second communication node can always adjust the various parameters in the above formula so that the total number of high and low-level samples transmitted on an OFDM symbol is exactly equal to N FFT .

[0151] Optionally, the first binary sequence and the second binary sequence may have the same length, and the invalid bit "X" may be encoded as a high level, further avoiding the problem of energy interruption at the receiving end caused by invalid bit padding. Optionally, all invalid bits may be padded to the end of the encoded sequence corresponding to the bit sequence.

[0152] Alternatively, a simplest implementation is to make the following restrictions on the pulse width coding scheme:

[0153] ① and Equal, that is, the code element duration of bit "0" and bit "1" is the same;

[0154] ② (also equal to ) can divide N FFT , that is, an integer number of code elements can be transmitted in one OFDM symbol.

[0155] In the embodiment of the present disclosure, no matter which encoding method is used, the first communication node can always obtain a coding sequence, namely the first sequence r[n], after encoding, where n=0, 1, ..., N FFT -1, indicating the encoded signal on the OFDM symbol. In particular, for pulse width coding, the encoding sequence r[n] has only two values: r[n] = 1 indicates that the sample with index / sequence number n is high, and r[n] = 0 indicates that the sample with index n is low.

[0156] (2) Transform Precoding

[0157] N FFT The code sequence r[n] of the point is transformed and precoded, and the transformation precoding matrix is:

[0158]

[0159] Among them, the transformation precoding matrix The matrix size is 2K×N FFT .

[0160] Optionally, the value of K can be determined by the required data rate. Generally speaking, the data rate when sending data to the electronic tag (signal receiving end) is very low, so the value of K is usually very small. For example, it can be selected as a fixed value, or it can be dynamically calculated according to the data rate. Assuming that the required data rate is x bits per second, an optional calculation method is: K = [x / (2Δf)], where Δf is the subcarrier spacing and [·] is rounding. There is no restriction on rounding here, and any rounding method can be used, which can be rounding up or rounding down. For example, assuming that the required data rate is 180kbps (180,000 bits per second), Δf = 15kHz, then the corresponding K value is 6. It should be noted that since the K value is very small, the complexity of transform precoding is higher than that of N. FFT The Fourier transform of the point is much lower.

[0161] Optionally, as another equivalent implementation of transform precoding, N FFT The coding sequence r[n] of the point is N FFT The Fourier transform of the point is performed, and 2K elements representing the low-frequency components are taken out from the result of the Fourier transform, that is, 2K elements at the predetermined position. If the component representing the frequency of 0 after the Fourier transform is located at the position of the first element of the Fourier transform result, the sequence number of the 2K elements taken out in the Fourier transform result is N FFT -K+kmodN FFT , where k = 0, 1, ..., 2K-1, and mod is the remainder operation. If the component representing the frequency of 0 after Fourier transform is located in the middle of the Fourier transform result, the sequence number of the 2K elements taken out in the Fourier transform result is Where k = 0, 1,…, 2K-1.

[0162] (3) Resource Mapping

[0163] Assume that the transformed precoded sequence, i.e., the second sequence, is y[n], where n = 0, 1, ..., 2K - 1. The resource mapping method can reuse the resource mapping method in existing communication systems to map y[n] onto 2K resource elements within the system bandwidth. The frequency corresponding to the resource element to which y[n] is mapped is the operating frequency of the receiving end, i.e., the operating bandwidth of the receiving end.

[0164] (4) Inverse Fourier transform and adding CP

[0165] Based on the resource mapping result, an inverse Fourier transform, CP addition, and subsequent signal processing are performed to obtain a baseband signal on an OFDM symbol. Optionally, the operations after resource mapping can be the same as those in existing NR communication systems.

[0166] Example 2

[0167] This embodiment provides a pulse width coding implementation method and a corresponding decoding method applicable to an OFDM system.

[0168] In the existing UHF RFID protocol of the RFID system, the encoding method of bit "0" and bit "1" is as follows: Figure 7 As shown in Figure 1, the duration of the code elements 0 and 1 is different and ends with a low level. However, if such coded data is to be generated and transmitted based on an OFDM system, there will be at least the following three problems:

[0169] (1) Different symbol durations make it difficult to achieve OFDM symbol-level time alignment, i.e., all symbols cannot evenly divide the entire OFDM symbol.

[0170] (2) Because each symbol ends with a low level, under the condition (1), the end of the cyclic prefix unique to the OFDM system will inevitably contain a low level, and the rest of the cyclic prefix is a high level. As the downlink data rate increases, the following may occur: Figures 8a to 8d The four cases shown are: Figure 8a All low levels in the medium CP range may occur when the data rate is very low; Figure 8b There is a high level and a low level (mainly low level) in the CP, and the data rate is Figure 8a It may occur when the data rate in is high; Figure 8c There is a high level and a low level (mainly high level) in the CP, and the data rate is Figure 8b It may occur when the data rate in is high; Figure 8d There are multiple high and low levels in the CP range, and the data rate is Figure 8c May occur when the data rate is high.

[0171] Although Figure 8d Only the situation of two high-level segments and two low-level segments within the CP is shown. However, since the length of the cyclic prefix is fixed, and the low-level time within each symbol changes with the change of the downlink data rate, when the downlink data rate is further increased, there may be more high-level segments and more low-level segments within the cyclic prefix range. Figures 8a to 8dIt can be seen that due to the existence of the cyclic prefix, there may be multiple situations for high and low level conversion within the cyclic prefix range. If the electronic tag is required to handle each situation separately during decoding, the implementation complexity and cost of the electronic tag will inevitably increase. Otherwise, at least one 0 or 1 will be detected at the time of the cyclic prefix when no data is transmitted, which will inevitably cause decoding errors.

[0172] (3) For Figure 8a and Figure 8b In the two cases shown, the high level duration within the CP range is shorter than the low level duration. The electronic tag cannot effectively store energy on the recurring CP, which may lead to the problem of energy supply interruption of the electronic tag.

[0173] In order to solve at least one of the above problems, the signal generation method provided in this embodiment can be used Figure 9 The encoding method shown is pulse width encoding, such as Figure 9 As shown, this embodiment defines three types of code elements: bit "1," bit "0," and dummy bit "X," which is also known as a padding bit. Both bit "1" and bit "0" are encoded as sequences of a certain length (a first length) that begin with a low-level segment and end with a high-level segment. The number of high-level samples for bit "1" is greater than that for bit "0" (corresponding to a decoding method based on high-level duration). The dummy bit is encoded as a sequence of high-level samples of a certain length. Specifically, the binary sequence corresponding to bit "1" includes, in sequence, a third number of elements with a value of 0 and a fourth number of elements with a value of 1. The binary sequence corresponding to bit "0" includes, in sequence, a fifth number of elements with a value of 0 and a sixth number of elements with a value of 1.

[0174] Among them, the three bit symbols have the same duration, and the duration of the symbol can be converted into the number of samples, which is N codeCell Sample points (first length), and N codeCell Can be divided by the number of Fourier transform points N FFT .

[0175] As an optional method, instead of performing a high-level to low-level transition during the symbol duration of bit "1" and bit "0", a low-level to high-level transition is performed. The number of sample points converted from the high-level duration of the symbol of bit 0 is N. 0,high .

[0176] Optionally, the first communication node may generate a signal in the following manner:

[0177] Step 1: Determine N based on the downlink data rate 0,highOptionally, N can be determined by looking up a table based on the downlink data rate, that is, the data transmission rate. 0,high value.

[0178] Step 2: Determine N 0,high Is it greater than the number of cyclic prefix points N? CP (The number of sampling points corresponding to the cyclic prefix).

[0179] Case 1: If N 0,high ≥N CP (corresponding to the case where the downlink data rate is relatively low)

[0180] In this case, it is not necessary to send dummy bits on the last few symbols of the OFDM symbol (ie, the number of dummy bits in each OFDM symbol is the number of padding bits N). dummy =0), and the signal generation method proposed in the first embodiment can be used (the length of the sequence after each bit encoding is N codeCell ) generates a baseband signal including CP. Taking the bit sequence [1 0 1 0] as an example, the time domain waveform of the baseband signal obtained in this embodiment is as follows: Figure 10 The waveform corresponding to the OFDM symbol with index n+1 is shown in FIG.

[0181] like Figure 10 As shown, the high level of the cyclic prefix must be connected to the high level in the last code element of the previous OFDM symbol. If the electronic tag decodes by the duration of the low level, this connected high level will not have any impact on the decoding. However, if the electronic tag decodes by the duration of the high level, the connected high level may cause the electronic tag to misinterpret the bit "0" of the last code element of the previous OFDM symbol as bit "1". Therefore, if the electronic tag decodes by the duration of the high level, the following method proposed in the embodiment of the present disclosure can be used for decoding:

[0182] Step 1: Get the high level duration (converted to the number of samples) N between the rising edge (the rising edge corresponding to the last code element) and the next adjacent falling edge (the first falling edge of the next OFDM symbol) high ;

[0183] Step 2: Get the high level duration N high Subtract N codeCell ·N dummy +N CP , N codeCell ·N dummy +N CP That is the second number. The calculation result is compared with the decision threshold. If it is lower than the decision threshold, the current codeword is decoded as bit "0", otherwise it is decoded as bit "1".

[0184] It should be noted that N dummy 、N CP 、N FFT 、N codeCell Both the number of samples and the sample interval need to be known by the electronic tag. fFR 、N CP The sampling interval is a system parameter and the default value can be used without notification. dummy and N codeCell Both are related to the downlink data rate, so these two parameters can be notified directly in the auxiliary sequence, or can be obtained indirectly from the downlink data rate. In this case, the second communication node needs to indicate the downlink data rate in the auxiliary sequence. That is, the bit sequence can carry the N dummy and N codeCell For information about codeCell It can also be a fixed value agreed upon, and the receiving end can CP and N codeCell Calculate N yourself dummy .

[0185] Case 2: If N 0,high <N CP (corresponding to the case where the downlink data rate is relatively high)

[0186] In the transmission block, each data bits and then insert N dummy pseudo bits and divided according to the number of OFDM symbols, that is, sent sequentially on each OFDM symbol data bits and N dummy pseudo bits, where Indicates rounding up.

[0187] Optionally, after calculating the number of pseudo bits N dummy Afterwards, each pseudo bit can be encoded into a length N codeCell , a sequence with all values 1, encoding each bit "1" as a sequence of length N codeCell Sequence 1, each bit "1" is encoded as a sequence of length N codeCell Sequence 2, the length is equal to N FFT After the first sequence of , steps (2) to (4) in the first embodiment can be performed to obtain a baseband signal including a cyclic prefix (including adding a cyclic prefix). In this way, an example of the waveform actually transmitted on each OFDM symbol, that is, the waveform of the baseband signal (data bits are still [1 0 1 0 1] as an example) is as follows Figure 11 As shown, in this example, each pseudo bit is encoded into a length of N codeCell, a sequence whose values are all 1, that is, all are high-level samples.

[0188] Similar to Case 1 above, if the electronic tag decodes using a low-level duration, the subsequent high-level delay will have no effect on the decoding. However, if the electronic tag decodes using a high-level duration, the subsequent high-level delay may cause the electronic tag to misinterpret the "0" bit of the last symbol of the previous OFDM symbol as a "1" bit. Therefore, if the electronic tag decodes using a high-level duration, the new decoding method described in Case 1 can be used.

[0189] Since the number of valid data bits actually transmitted in one OFDM symbol is If the subcarrier spacing is Δf, the average data rate is bits per second. Assume N FFT =1024, N CP =72, Δf=15kHz, then the parameters are shown in the following table, which can meet the different data rate requirements of the downlink.

[0190]

[0191]

[0192] Based on the same principle as the method provided in the present disclosure, an embodiment of the present disclosure also provides a node in a communication system, which node may include at least one transceiver and at least one processor coupled to the at least one transceiver, and the at least one processor is configured to execute the steps of the method provided in any optional embodiment of the present disclosure.

[0193] An embodiment of the present application further provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory, wherein the processor, when executing the computer program, can implement the steps of the method provided in any optional embodiment of the present application. The electronic device can be either a terminal device or a network device.

[0194] Figure 12 FIG. 1 shows a schematic structural diagram of an electronic device to which an embodiment of the present invention is applicable. Figure 12 As shown, Figure 12The electronic device 4000 shown includes: a processor 4001 and a memory 4003. The processor 4001 and the memory 4003 are connected, such as via a bus 4002. Optionally, the electronic device 4000 may further include a transceiver 4004, which may be used for data exchange between the electronic device and other electronic devices, such as data transmission and / or data reception. It should be noted that in actual applications, the transceiver 4004 is not limited to one, and the structure of the electronic device 4000 does not constitute a limitation on the embodiments of the present application. Optionally, the electronic device may be a first communication node.

[0195] Figure 12 FIG. 1 shows a schematic diagram of the structure of an electronic device to which the embodiment of the present disclosure is applicable. Figure 12 As shown, Figure 12 The electronic device 4000 shown includes: a processor 4001 and a memory 4003. The processor 4001 and the memory 4003 are connected, such as via a bus 4002. Optionally, the electronic device 4000 may further include a transceiver 4004, which may be used for data interaction between the electronic device and other electronic devices, such as data transmission and / or data reception. It should be noted that in actual applications, the transceiver 4004 is not limited to one, and the structure of the electronic device 4000 does not constitute a limitation on 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.

[0196] Processor 4001 may be a CPU (Central Processing Unit), a general-purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the present disclosure. Processor 4001 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0197] Bus 4002 may include a path for transmitting information between the above components. Bus 4002 may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. Bus 4002 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 12 Only one thick line is used in the diagram, but this does not mean that there is only one bus or one type of bus.

[0198] The memory 4003 can be a ROM (Read Only Memory) or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory) or other types of dynamic storage devices that can store information and instructions, or an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory) or other optical disk storage, optical disk storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media, other magnetic storage devices, or any other medium that can be used to carry or store computer programs and can be read by a computer, without limitation here.

[0199] The memory 4003 is used to store the computer program for executing the embodiments of the present disclosure, and the execution is controlled by the processor 4001. The processor 4001 is used to execute the computer program stored in the memory 4003 to implement the steps shown in the above method embodiments.

[0200] An embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps and corresponding contents of the aforementioned method embodiment can be implemented.

[0201] The embodiments of the present disclosure further provide a computer program product, including a computer program, which can implement the steps and corresponding contents of the aforementioned method embodiments when executed by a processor.

[0202] The terms "first," "second," "third," "fourth," "1," "2," and the like (if any) in the description and claims of the present disclosure and the accompanying drawings are used to distinguish similar objects and are not necessarily used to describe a particular order or sequential sequence. It should be understood that the terms used in this manner are interchangeable where appropriate, such that the embodiments of the present disclosure described herein can be practiced in an order other than that shown or described.

[0203] It should be understood that, although the flowcharts of the embodiments of the present disclosure indicate the various operation steps by arrows, the order of implementation of these steps is not limited to the order indicated by the arrows. Unless otherwise clearly stated herein, in some implementation scenarios of the embodiments of the present disclosure, the implementation steps in each flowchart can be performed in other orders as required. In addition, some or all of the steps in each flowchart may include multiple sub-steps or multiple stages based on the actual implementation scenario. Some or all of these sub-steps or stages can be executed at the same time, and each sub-step or stage in these sub-steps or stages can also be executed at different times. In scenarios where the execution times are different, the order of execution of these sub-steps or stages can be flexibly configured as required, and the embodiments of the present disclosure do not limit this.

[0204] The above text and drawings are provided as examples only to help readers understand the present disclosure. They are not intended to, and should not be interpreted as, limiting the scope of the present disclosure in any way. Although certain embodiments and examples have been provided, it will be apparent to those skilled in the art based on the content disclosed herein that, without departing from the scope of the present disclosure, the illustrated embodiments and examples may be modified and other similar implementations based on the technical concepts of the present disclosure may be adopted, which also fall within the scope of protection of the embodiments of the present disclosure.

Claims

1. A method performed by a node in a communication system, characterized in that include: Encoding a bit sequence to be transmitted on an orthogonal frequency division multiplexing (OFDM) symbol into a first sequence, wherein the number of elements in the first sequence is equal to the size of the Fourier transform; wherein each bit with a value of 0 in the bit sequence is encoded as a first binary sequence, and each bit with a value of 1 is encoded as a second binary sequence; Performing transform precoding on the first sequence to obtain a second sequence; Perform resource mapping on the second sequence, and generate a baseband signal based on the mapping result.

2. The method according to claim 1, characterized in that The transforming and precoding the first sequence to obtain a second sequence includes any one of the following: The first sequence is multiplied by a transform precoding matrix to obtain a second sequence, wherein the size of the transform precoding matrix is 2K×N FFT , N FFT is the size of the Fourier transform, K<N FFT ; The first sequence is processed with a size of N FFT The second sequence is obtained by performing Fourier transform and extracting 2K elements at predetermined positions in the Fourier transform result.

3. The method according to claim 2, characterized in that The 2K elements at the predetermined positions are at least one of the following: N FFT -K+k mod N FFT , where k = 0, 1, ..., 2K-1; Wherein, k=0, 1, ..., 2K-1.

4. The method according to claim 3, characterized in that The performing resource mapping on the second sequence includes: The second sequence is mapped to 2K resource elements corresponding to the OFDM symbol.

5. The method according to any one of claims 1 to 4, characterized in that The step of encoding a bit sequence to be transmitted on an orthogonal frequency division multiplexing (OFDM) symbol into a first sequence includes: Determining the number of elements in a sequence encoded corresponding to the bit sequence based on the number of bits with a value of 0, the number of bits with a value of 1 in the bit sequence, and the number of elements in the sequence after each bit is encoded; determining a padding length based on a size of the Fourier transform and a number of elements in an encoded sequence corresponding to the bit sequence; When padding is required, the encoded sequence corresponding to the bit sequence is padded with a first value whose total value is equal to the padding length to obtain a first sequence, wherein the first value is 0 or 1.

6. The method according to any one of claims 1 to 5, characterized in that The first number of elements in the first binary sequence is the same as or different from 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 the Fourier transform.

7. The method according to any one of claims 1 to 4, characterized in that The number of first elements in the first binary sequence is equal to the number of second elements in the second binary sequence, and the first number of elements divides the size of the Fourier transform; The bit sequence to be transmitted on an OFDM symbol is encoded into a first sequence, including: Determining the number of padding bits corresponding to the cyclic prefix according to the number of sampling points corresponding to the cyclic prefix and the number of the first elements; Filling the bit sequence with a second value whose total number is equal to the number of padding bits to obtain a padded sequence; The bits with values of 0 and 1 in the bit sequence in the padded sequence are respectively encoded into a first binary sequence and a second binary sequence, and each padded bit is encoded into a third sequence including the same number of elements as the first elements, to obtain a first sequence, wherein the values of the elements in the third sequence are all 1.

8. The method according to claim 7, characterized in that Before determining the number of padding bits, it also includes: Determine a first number that is less than the number of sampling points corresponding to the cyclic prefix, the first number being the number of elements having a value of 1 in the first binary sequence; The method further comprises: If the first number is greater than or equal to the number of sampling points corresponding to the cyclic prefix, the number of padding bits is determined to be 0.

9. The method according to claim 8, characterized in that The first number is associated with a data transmission rate.

10. The method according to any one of claims 7 to 9, characterized in that When the decoding mode corresponding to the baseband signal is a decoding mode based on high level duration, the decoding result of the last code element of the baseband signal is determined in the following manner: Determine the value between the rising edge corresponding to the last code element and the next adjacent falling edge as the number of high-level sample points; Determine a decoding result corresponding to the last symbol based on a difference between the number of high-level sample points and a second number; wherein the second number is equal to the sum of the number of sample points corresponding to the number of padding bits and the number of sample points corresponding to the cyclic prefix.

11. The method according to any one of claims 1 to 10, characterized in that The bit sequence includes information related to at least one of the following: the number of elements in the first binary sequence corresponding to at least one bit in the bit sequence; the number of elements in the second binary sequence corresponding to at least one bit in the bit sequence; Encoding the padding length or number of padding bits required to obtain the first sequence; Data transfer rate.

12. A node in a communication system, characterized in that: The node includes at least one transceiver and at least one processor coupled to the at least one transceiver, wherein the at least one processor is configured to execute the method according to any one of claims 1 to 11.

13. A computer-readable storage medium, characterized in that The storage medium stores a computer program. When the computer program runs in a processor, the processor executes the steps of the method according to any one of claims 1 to 11.

14. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 11 are implemented.

Images