Wireless Communication Method and Zero Power Device

Description

1 / 141 Wireless Communication Method and Zero Power Device FIELD OF TECHNIQUE

[001] This disclosure relates to the field of communication, in particular to a method of wireless communication and a zero-power device. BACKGROUND

[002] Zero-power devices have low complexity and low cost, can be maintenance-free and battery-free, can support energy harvesting and / or backscatter communication, and therefore can achieve high-density and large-scale deployment at a relatively low cost. However, at present, zero-power devices have relatively poor data transmission performance, and how to improve the data transmission performance of zero-power devices is a problem to be solved. SUMMARY

[003] Embodiments of the present disclosure provide a method of wireless communication and a zero-power device, which can improve the data transmission performance of the zero-power device.

[004] In a first aspect, the embodiments of the present disclosure provide a method of wireless communication. The wireless communication method is applied to a sending device and includes the following. A second sequence is obtained by performing repeat encoding based on a first sequence to be encoded.

[005] In a second aspect, the embodiments of the present disclosure provide a method of wireless communication. The wireless communication method is applied to a device of Petition 870250078547, dated 03 / 09 / 2025, page 8 / 355 2 / 141 submission and includes the following. A first sequence is obtained by performing repeat decoding based on a second sequence to be decoded.

[006] In a third aspect, the embodiments of the present disclosure provide a sending device. The sending device is configured to execute the method in the first aspect or in multiple implementations thereof. Specifically, the sending device includes functional modules configured to execute the method in the first aspect or in multiple implementations thereof.

[007] In one embodiment, the sending device may include a processing unit. The processing unit is configured to perform a function related to information processing. For example, the processing unit may be a processor.

[008] In one embodiment, the sending device may include a sending unit and / or a receiving unit. The sending unit is configured to perform a function related to transmission, and the receiving unit is configured to perform a function related to reception. For example, the sending unit may be a transmitter or a sender, and the receiving unit may be a receiver or a receiving machine. For another example, the sending device is a communication chip, the receiving unit may be an input circuit or a communication chip interface, and the sending unit may be an output circuit or a communication chip interface.

[009] According to a fourth aspect, the embodiments of the present disclosure provide a receiving device. The receiving device is configured to Petition 870250078547, dated 03 / 09 / 2025, p. 9 / 355 3 / 141 execute the method in the second aspect or in multiple implementations thereof. Specifically, the receiving device includes functional modules configured to execute the method in the second aspect or in multiple implementations thereof.

[0010] In one embodiment, the receiving device may include a processing unit. The processing unit is configured to perform a function related to information processing. For example, the processing unit may be a processor.

[0011] In one embodiment, the receiving device may include a sending unit and / or a receiving unit. The sending unit is configured to perform a function related to transmission, and the receiving unit is configured to perform a function related to reception. For example, the sending unit may be a transmitter or a sender, and the receiving unit may be a receiver or a receiving machine. For another example, the receiving device is a communication chip, the receiving unit may be an input circuit or an interface of the communication chip, and the sending unit may be an output circuit or an interface of the communication chip.

[0012] In a fifth aspect, the embodiments of the present disclosure provide a sending device. The sending device includes a processor and memory. The memory is configured to store a computer program. The processor is configured to invoke and execute the computer program stored in memory, to execute the method in the first aspect or in various embodiments thereof.

[0013] In one embodiment, the processor is either Petition 870250078547, dated 03 / 09 / 2025, p. 10 / 355 4 / 141 more, and memory is one or more.

[0014] In one embodiment, the memory may be integrated into the processor, or the memory may be disposed separately from the processor.

[0015] In one embodiment, the sending device also includes a sender (transmitter) and a receiver (receiving machine).

[0016] In a sixth aspect, the embodiments of the present disclosure provide a receiving device. The receiving device includes a processor and a memory. The memory is configured to store a computer program. The processor is configured to invoke and execute the computer program stored in memory, to execute the method in the second aspect or in various embodiments thereof.

[0017] In one embodiment, the processor is one or more, and the memory is one or more.

[0018] In one embodiment, the memory may be integrated into the processor, or the memory may be disposed separately from the processor.

[0019] In one embodiment, the receiving device also includes a transmitter and a receiver.

[0020] In a seventh aspect, the embodiments of the present disclosure provide a chip. The chip is configured to implement the method in either the first or second aspects or in various implementations thereof. Specifically, the chip includes a processor. The processor is configured to invoke and execute a computer program stored in memory, to cause a Petition 870250078547, dated 03 / 09 / 2025, p. 11 / 355 5 / 141 device equipped with the chip execute the method in any of the aspects of the first and second or in various implementations thereof.

[0021] In an eighth aspect, embodiments of the present disclosure provide a computer-readable storage medium. The computer-readable storage medium is configured to store a computer program that, when run on a computer, causes the computer to execute the method in either the first aspect and the second aspect or in multiple implementations thereof.

[0022] In the ninth aspect, the embodiments of the present disclosure provide a computer program product. The computer program product includes computer program instructions that cause a computer to execute the method in either the first aspect or the second aspect, or in various implementations thereof.

[0023] In a tenth aspect, the embodiments of the present disclosure provide a computer program. The computer program, when executed on a computer, causes the computer to perform the method in either the first or second aspect or in various implementations thereof.

[0024] Based on the technical solutions, the zero-power device obtains the second sequence by performing repeat encoding based on the first sequence to be encoded. In other words, redundant information is added by repeat encoding based on the first sequence, so that a receiving end can perform error correction and detection in a Petition 870250078547, dated 03 / 09 / 2025, page 12 / 355 6 / 141 decoded result of the first sequence when decoding the first sequence based on the second sequence, thus improving the data transmission performance of the zero-power device. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 is a schematic diagram of a communication system provided in embodiments of the present disclosure.

[0026] Figure 2 is a schematic diagram of a zero-power communication system provided in embodiments of the present disclosure.

[0027] Figure 3 is a schematic diagram illustrating the energy harvesting provided in embodiments of the present disclosure.

[0028] Figure 4 is a schematic diagram illustrating the backcast communication provided in embodiments of the present disclosure.

[0029] Figure 5 is a schematic circuit diagram illustrating load modulation based on resistance provided in embodiments of the present disclosure.

[0030] Figure 6 is a schematic diagram illustrating the non-return-to-zero (NRZ) encoding provided in embodiments of the present disclosure.

[0031] Figure 7 is a schematic diagram illustrating the unipolar return-to-zero (RZ) encoding provided in embodiments of the present disclosure.

[0032] Figure 8 is a schematic diagram illustrating the Manchester encoding provided in embodiments of the present disclosure.

[0033] Figure 9 is a schematic diagram that Petition 870250078547, dated 03 / 09 / 2025, page 13 / 355 7 / 141 illustrates the Miller coding provided in embodiments of the present disclosure.

[0034] Figure 10 is a schematic diagram illustrating the differential binary phase (DBP) encoding provided in embodiments of the present disclosure.

[0035] Figure 11 is a schematic diagram illustrating the differential coding provided in embodiments of the present disclosure.

[0036] Figure 12 is a schematic diagram illustrating data 0, data 1, start of data frame (SOF), and end of data frame (EOF) in pulse interval coding (PIE) provided in embodiments of the present disclosure.

[0037] Figure 13 is a schematic diagram illustrating the bi-phase space encoding (FM0) provided in embodiments of the present disclosure.

[0038] Figure 14 is a schematic diagram illustrating an FM0 symbol and a sequence of FM0 symbols in the FM0 encoding provided in embodiments of the present disclosure.

[0039] Figure 15 is a schematic diagram illustrating an on-off switching (OOK) modulation scheme provided in embodiments of the present disclosure.

[0040] Figure 16 is a schematic flowchart of a wireless communication method provided in embodiments of the present disclosure.

[0041] Figure 17 is an example illustrating a positional relationship between a check group and a parity bit in a first sequence provided in embodiments of the present disclosure.

[0042] Figure 18 is another example that illustrates Petition 870250078547, dated 03 / 09 / 2025, page 14 / 355 8 / 141 a positional relationship between a check group and a parity bit in a first sequence provided in the embodiments of the present disclosure.

[0043] Figure 19 is an example illustrating an interlacing principle provided in embodiments of the present disclosure.

[0044] Figure 20 is a schematic flowchart illustrating the repetition coding provided in embodiments of the present disclosure.

[0045] Figure 21 is another schematic flowchart of a wireless communication method provided in embodiments of the present disclosure.

[0046] Figure 22 is a schematic block diagram of a zero-power device provided in the embodiments of the present disclosure.

[0047] Figure 23 is another schematic block diagram of a zero-power device provided in the embodiments of the present disclosure.

[0048] Figure 24 is a schematic block diagram of a communication device provided in embodiments of the present disclosure.

[0049] Figure 25 is a schematic block diagram of a chip provided in embodiments of the present disclosure. DETAILED DESCRIPTION

[0050] The technical solutions of the present disclosure will be described below with reference to the accompanying drawings.

[0051] Modalities of the present disclosure are applicable to various communication systems. For example, the Petition 870250078547, dated 03 / 09 / 2025, p. 15 / 355 9 / 141 Communication systems to which the embodiments of this disclosure apply include, but are not limited to: a global mobile communication system (GSM), a code division multiple access system (CDMA), a wideband code division multiple access system (WCDMA), a general packet radio service (GPRS), a long-term evolution system (LTE), an enhanced LTE system (LTEA), a new radio system (NR), an evolved NR system, an LTE-based unlicensed spectrum access system (LTE-U), an NR-based unlicensed spectrum access system (NR-U), a universal mobile telecommunications system (UMTS), a wireless local area network (WLAN), wireless fidelity (WiFi), a next-generation communication system, a zero-power communication system, cellular internet of things (IoT), passive cellular IoT, or other communication systems.

[0052] Cellular IoT is a development product of a combination of a cellular mobile communication network and IoT. Cellular IoT is also called passive cellular IoT, which is a combination of a network device and a passive terminal. In passive cellular IoT, the passive terminal can communicate with other passive terminals through the network device, or the passive terminal can communicate using a device-to-device (D2D) communication mode, while the network device only needs to send carrier signals, i.e., power supply signals, to power the passive terminal.

[0053] In general, a conventional communication system supports a limited number (quantity) of connections and is therefore easy to implement. However, with Petition 870250078547, dated 03 / 09 / 2025, page 16 / 355 10 / 141 With the development of communication technology, a mobile communication system will not only support conventional communication, but will also support, for example, D2D communication, machine-to-machine (M2M) communication, machine-type communication (MTC), vehicle-to-vehicle (V2V) communication, etc. The embodiments of this disclosure are also applicable to these communication systems.

[0054] It can be understood that the communication system in the embodiments of this disclosure is applicable to a carrier aggregation (CA) situation, or is applicable to a dual connectivity (DC) situation, or is applicable to a standalone network (SA) deployment situation. There is no limitation on the type of spectrum in the embodiments of this disclosure. For example, embodiments of this disclosure are applicable to licensed spectrum and also applicable to unlicensed spectrum.

[0055] Figure 1 is a schematic diagram of a communication system 100 provided in embodiments of the present disclosure.

[0056] As illustrated in Figure 1, the communication system 100 may include a network device 110. The network device 110 may be a device for communicating with a terminal device 120 (also referred to as a communication terminal or terminal). The network device 110 may provide communication coverage for a specific geographic area and communicate with terminal devices within the coverage area.

[0057] For example, network device 110 can be a device configured to communicate with a mobile device, and network device 110 can be a point Petition 870250078547, dated 03 / 09 / 2025, page 17 / 355 11 / 141 access point (AP) in a WLAN, a base transceiver station (BTS) in GSM or CDMA, or it could be a Node B (NB) in WCDMA, or it could be an evolved Node B (eNB or eNodeB) in LTE, or a relay station or AP, or a vehicle-mounted device, a wearable device, a network device (gNB) in an NR network, a network device in a future evolved PLMN, etc.

[0058] Network device 110 serves a cell, and terminal device 120 communicates with the network device on a transmission resource (e.g., a frequency domain resource or a spectrum resource) for the cell. The cell may be a cell corresponding to network device 110 (e.g., a base station). The cell may belong to a macro base station, or it may belong to a base station corresponding to a small cell. Small cells may include: a metro cell, a micro cell, a pico cell, a femto cell, and the like. These small cells are characterized by small coverage and low transmission power and are adapted to provide high-rate data transmission service.

[0059] For example, terminal device 120 may also be referred to as user equipment (UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, a user device, etc. The terminal device may be a station (ST) on a WLAN, a cellular radio phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a wireless local access station Petition 870250078547, dated 03 / 09 / 2025, page 18 / 355 12 / 141 (WLL), a personal digital assistant (PDA), a portable device or a computing device with wireless communication functions, other processing devices coupled to a wireless modem, a vehicle-mounted device, a wearable device, and a terminal device in a next-generation communication system, for example, a terminal device in a network of NR, a terminal device in a future-evolved public terrestrial mobile network (PLMN), a zero-power device, etc.

[0060] For example, terminal device 120 can be a near-body wearable device. A near-body wearable device can also be called a smart near-body wearable device, which is a generic term for wearable devices obtained through the design and development of everyday products with near-body wearable technology, for example, eyeglasses, gloves, watches, clothing, accessories, and shoes. A near-body wearable device is a portable device that can be worn directly or integrated into a user's clothing or accessories. In addition to being a hardware device, a near-body wearable device can also perform various functions through software support, data interaction, and cloud interaction.A wearable smart device, in a broad sense, includes, for example, a smartwatch or smart glasses with full functions and large sizes, capable of independently performing all or part of the functions of a smartphone, and, for example, various types of smart bracelets and smart jewelry for physical monitoring. Petition 870250078547, dated 03 / 09 / 2025, p. 19 / 355 13 / 141 of which each is dedicated to a certain type of application function and requires being used in conjunction with other devices, such as a smartphone.

[0061] For another example, the terminal device 120 can also be a zero-power device. A zero-power device can be understood as a device with power consumption lower than a predefined power consumption. For example, a zero-power device includes a passive terminal, even a semi-passive terminal, etc.

[0062] It may be understood that Figure 1 is merely an example in the present disclosure and should not be interpreted as a limitation to the present disclosure.

[0063] For example, in other alternative embodiments, communication system 100 may include multiple network devices, and there may be other quantities of terminal devices in the coverage area of ​​each of the network devices. By another example, in embodiments of the present disclosure, a device with communication functions in a network / system may be referred to as a “communication device”. Taking communication system 100 illustrated in Figure 1 as an example, the communication device may include network device 110 and terminal device (or terminal devices) 120 that have communication functions. Network device 110 and terminal device (or terminal devices) 120 may be the devices described above and will not be repeated in this document. The communication device may also include other devices, such as a network controller, a mobility management entity, or other network entities in Petition 870250078547, dated 03 / 09 / 2025, page 20 / 355 14 / 141 communication system 100, which will not be limited to the modalities of the present disclosure.

[0064] Furthermore, it may be understood that the terms system and network in this document are generally used interchangeably throughout this disclosure. The term and / or in this document describes only an association relationship between associated objects, meaning that three relationships can exist. For example, A and / or B can mean A alone, both A and B exist, and B alone. Additionally, the character / in this document generally indicates that the associated objects are in an or relationship. The term correspondence in this document can mean that there is a direct or indirect correspondence between the two, it can mean that there is an association between the two, or it can mean a relationship of pointing and being pointed at or of setting and being set up, etc. The term pointing in this document can be a direct pointing, it can be an indirect pointing, or it can mean that there is an association relationship.For example, A indicates that B may mean that A directly indicates B, for example, B can be obtained according to A; it may mean that A indirectly indicates B, for example, A indicates C and B can be obtained according to C; or it may mean that there is an association relationship between A and B. The term predefined in this document may be implemented by pre-saving a corresponding code or table in a device (for example, including the terminal device and the network device) or in other ways that may be used to indicate related information, and this disclosure is not limited in this respect. For example, predefined may mean... Petition 870250078547, dated 03 / 09 / 2025, p. 21 / 355 15 / 141 defined in a protocol. It can also be understood that, in the embodiments of the present disclosure, the protocol may refer to a standard communication protocol, which may include, for example, an LTE protocol, an NR protocol, and a protocol applied to a future communication system, which is not limited to the present disclosure.

[0065] In order to facilitate understanding of the technical solutions of the embodiments of the present disclosure, the zero-power device and the related technique will be described.

[0066] The zero-energy consumption device is a radio frequency identification (RFID) tag, which is a technology that uses the spatial coupling of wireless radio frequency (RF) signals to achieve automatic contactless transmission and recognition of tag information. The RFID tag is also referred to as an RF tag or electronic tag. Electronic tag types are classified based on different power supply modes into an active electronic tag, a passive electronic tag, and a semi-passive electronic tag. The active electronic tag refers to the power for the operation of the electronic tag being supplied by a battery. The battery, a memory, and an antenna (or antennas) together form the active electronic tag.Unlike passive radio frequency activation, an active electronic tag continuously transmits information through a defined frequency band before the battery needs to be replaced. A passive electronic tag, also referred to as an inactive electronic tag, does not support a built-in battery. When the passive electronic tag comes near a reader, the tag is activated. Petition 870250078547, dated 03 / 09 / 2025, page 22 / 355 In the near-field band formed by the radiation from a reader's antenna (or antennas), an antenna (or antennas) of the electronic tag generates an induced current through electromagnetic induction, and this induced current drives a chip circuit in the electronic tag. The chip circuit transmits the identification information stored on the tag to the reader via the tag's antenna (or antennas). The semi-passive electronic tag, also known as a semi-active electronic tag, inherits the advantages of small size, light weight, low price, and long lifespan of the passive electronic tag. When the reader is not accessible, the built-in battery supplies power only to some circuits on the chip, and only when the reader is accessible does the built-in battery power the RFID chip, thus increasing the tag's read and write distance and improving communication reliability.

[0067] An RFID system is a wireless communication system. The RFID system consists of an electronic tag and a reader / writer. The electronic tag includes coupling components and chips. Each electronic tag has a unique electronic code and is placed on a measured target to mark the target object. The reader / writer can not only read information on the electronic tag, but also write information to the electronic tag and provide the power needed for the electronic tag to communicate at the same time.

[0068] I. Zero-power device-based communication

[0069] Figure 2 is a schematic diagram of a zero-power communication system provided in the present disclosure. Petition 870250078547, dated 03 / 09 / 2025, page 23 / 355 17 / 141

[0070] As illustrated in Figure 2, the zero-power communication system consists of a network device and a zero-power terminal. The network device is configured to transmit wireless power supply signals and downlink communication signals to the zero-power device and to receive a backscatter signal from the zero-power terminal. A basic zero-power terminal includes a power pickup module, a backscatter communication module, and a low-power computing module. In addition, the zero-power terminal may also include a memory or a sensor configured to store some basic information (such as object identity) or to obtain sensor data such as ambient temperature, ambient humidity, etc.

[0071] Zero-power communication can also be called zero-power terminal-based communication, and the main technologies of zero-power communication mainly include RF energy harvesting and backscatter communication. 1. ENERGY CAPTURE (POWER)

[0072] Figure 3 is a schematic diagram illustrating the energy harvesting provided in embodiments of the present disclosure.

[0073] As illustrated in Figure 3, an energy harvesting module may include a capacitor C and a resistor R1. The energy harvesting module is configured to collect energy from electromagnetic waves in space based on the principle of electromagnetic induction, thus obtaining the energy needed to power the zero-power terminal, such as to drive a demodulation module (or modules) and Petition 870250078547, dated 03 / 09 / 2025, page 24 / 355 18 / 141 Low-power modulation, a sensor (or sensors), memory access, etc. Thus, the zero-power terminal does not need a conventional battery. The principle of electromagnetic induction means that an induced current is generated in a closed circuit, provided that the magnetic flux passing through the closed circuit changes. With reference to the present disclosure, capacitor C and resistor Rl can be configured to form a closed circuit. After receiving RF, an RF energy harvesting module can generate an induced current and store the generated induced current in capacitor C, to collect the energy of electromagnetic waves in space. 2. BACK-SPREAD COMMUNICATION

[0074] Figure 4 is a schematic diagram illustrating the backcast communication provided in this disclosure.

[0075] As illustrated in Figure 4, when the network device serves as a transmitting (TX) end, the network device transmits a carrier to the zero-power device using an amplifier (AMP). Similarly, after receiving the carrier sent by the network device, the zero-power device drives, using the energy captured by the energy-harvesting module, a logic processing module to process the information to be transmitted, loads, using a variable resistor, the information to be transmitted onto the received carrier to obtain a reflected signal, and then radiates the reflected signal through an antenna (or antennas). This information transmission process is called “backscatter communication”. Similarly, when the network device serves as a receiving (RX) end, the device Petition 870250078547, dated 03 / 09 / 2025, page 25 / 355 Network 19 / 141 can receive, using a low-noise amplifier (LNA), the reflected signal sent by the zero-power device. Furthermore, in some possible embodiments, the AMP and the LNA can be connected to a voltage display lamp, and an emergency light can be placed between a voltage display lamp connected to the AMP and a voltage display lamp connected to the LNA.

[0076] Note that the backscatter communication illustrated in Figure 4 is described with reference to the zero-power device and the network device. In fact, any device that has a backscatter communication function can implement backscatter communication. Backscatter communication is closely related to load modulation. Load modulation means adjusting and controlling the circuit parameters of an oscillating circuit at the zero-power terminal based on the rhythm of a data stream, thus altering parameters such as the impedance and phase of the zero-power terminal to achieve modulation. Load modulation technology mainly includes resistance-based load modulation and capacitor-based load modulation.

[0077] Figure 5 is a schematic circuit diagram illustrating load modulation based on resistance provided in embodiments of the present disclosure.

[0078] As illustrated in Figure 5, in resistance-based load modulation, a resistor R1 is connected in parallel to a resistor R3, and resistor R1 can be referred to as a load modulation resistor. A branch containing resistors R1 and R3 is switched on or off under the control of a switch S. Switch S can be Petition 870250078547, dated 03 / 09 / 2025, page 26 / 355 20 / 141 controlled based on a binary data stream. Switching on / off the branch containing resistors R1 and R3 can cause a voltage change in the circuit. Furthermore, resistor R1 can be connected in parallel to inductor L1 via resistor R2. Inductor L1 is configured to form a resonant circuit with inductor L2. Based on this, switching on / off the branch containing resistor R1 and resistor R3 can cause a voltage change in the circuit, which, in turn, leads to a change in the resonant frequency of the resonant circuit, thus achieving amplitude shift keying (ASK) modulation, i.e., achieving modulation and signal transmission by adjusting the amplitude of a backscatter signal from the zero-power terminal.Furthermore, inductor L2 can also be configured to be connected to capacitor C2, and capacitor C2 can be configured to convert the change in the resonant frequency of the resonant circuit into a signal for transmission via an antenna (or antennas). Similarly, in capacitor-based load modulation, switching on / off a branch containing capacitor C1 and resistor R3 can cause a change in the resonant frequency of the resonant circuit, thus achieving frequency-shift keying (FSK) modulation, i.e., achieving modulation and signal transmission by adjusting the operating frequency of the backscatter signal from the zero-power terminal.

[0079] The zero-power terminal modulates the input waveform using load modulation, thus achieving backscatter communication. Therefore, the zero-power terminal has significant advantages:

[0080] 1. A terminal device does not transmit Petition 870250078547, dated 03 / 09 / 2025, page 27 / 355 21 / 141 signals actively and implements backscatter communication by modulating the input waveform signal.

[0081] 2. The terminal device does not rely on a conventional active power amplification transmitter and uses a low-power computing unit, which significantly reduces hardware complexity.

[0082] 3. Battery-free communication can be implemented in combination with power harvesting.

[0083] It can be understood that the terminal device in the communication system 100 can be a zero-power device (for example, a passive terminal or even a semi-passive terminal), and the terminal device can even be a non-zero-power device, such as a common terminal, but the common terminal can perform backcast communication in some cases. II. CODING SCHEMES

[0084] For data to be transmitted by a zero-power terminal, several types of codes can be used to represent binary 1 and binary 0. The zero-power terminal typically uses one of the following encoding schemes: non-return-to-zero (NRZ) encoding, Manchester encoding, unipolar return-to-zero (RZ) encoding, differential binary phase (DBP) encoding, Miller encoding, differential encoding, etc. Simply put, different pulse signals are used to represent binary 0 and binary 1. 1. Non-Return-to-Zero (NRZ) Coding

[0085] As illustrated in Figure 6, NRZ encoding uses a high level to represent binary 1 and a low level to represent binary 0. As Petition 870250078547, dated 03 / 09 / 2025, page 28 / 355 22 / 141 illustrated in Figure 6, the waveform has no gap between symbols, and the symbol is transmitted for the entire duration of the symbol, therefore it is called zero-return-to-zero encoding. 2. Unipolar Return-to-Zero (RZ) Coding

[0086] When a symbol 1 is transmitted, a positive current is emitted, but the duration of the positive current is less than the time width of a symbol, i.e., a narrow pulse is emitted. When a symbol 0 is transmitted, no current is sent. Figure 7 is an example illustrating the unipolar RZ coding rule. Specifically, when comparing NRZ coding and unipolar RZ coding, it can be seen that both are unipolar symbols, but the duty cycle of NRZ coding is 100%, while the duty cycle of unipolar RZ coding is 50%. 3. Manchester Coding

[0087] Manchester coding is also referred to as “split-phase coding” or “two-phase code”. In Manchester coding, a phase difference of the voltage transition is used to distinguish 1 and 0. Specifically, a high-to-low transition represents 1 and a low-to-high transition represents 0. Figure 8 is an example illustrating the Manchester coding rule. 4. Miller Coding

[0088] Miller encoding is an improved version of Manchester encoding. In Miller encoding, any edge in half a bit period represents the binary 1, while an unchanged level in the next bit period represents the binary 0. In other words, in Miller encoding, data “1” is represented by a level transition in the center of the bit, and data “0” is Petition 870250078547, dated 03 / 09 / 2025, page 29 / 355 23 / 141 represented by an unchanged level in the center of the bit. Furthermore, when there are consecutive binary 0s, a level transition occurs at the end of that bit. Figure 9 is an example illustrating the Miller encoding rule. For Miller encoding, a level change occurs at the beginning of the bit period, which makes it easier for the receiver to reconstruct the bit timing. 5. Differential Binary Phase Coding (DBP)

[0089] DBP encoding uses a half-bit period edge to represent the binary “0”, while the absence of an edge represents the binary “1”. Furthermore, the level is inverted at the beginning of each bit period. Therefore, it is easier for the receiver to reconstruct the bit timing. Figure 10 is an example illustrating the DBP encoding rule. 6. DIFFERENTIAL CODING

[0090] For differential coding, each binary 1 to be transmitted causes a change in the signal level, while the signal level remains unchanged for binary 0. Figure 11 is an example illustrating the differential coding rule. 7. Pulse Interval Coding (PIE)

[0091] PIE is an encoding scheme used for a reader / writer to transfer data to an electronic tag. PIE encoding is an encoding scheme in which 0 has a different time interval than 1. PIE encoding is based on a consecutive pulse of fixed interval, and the pulse repetition period is different according to 0 and 1. Generally, a consecutive interval of each binary code is an integer multiple of one. Petition 870250078547, dated 03 / 09 / 2025, page 30 / 355 24 / 141 clock period. There are four encoding symbols for PIE, namely, data 0, data 1, start of data frame (SOF), and end of data frame (EOF), whose encoding symbols are 1, 2, 4, and 4 times a time interval (Tari), respectively. The definitions of data 0, data 1, SOF, and EOF are illustrated in Figure 12. As can be seen, PIE encoding can easily define different data and 1 situations. To determine a type of transmitted symbol, the electronic tag needs to measure an interval of the high / low pulse transition illustrated in Figure 12. 8. Two-Phase Space Coding (FM0)

[0092] FM0 encoding is an encoding scheme used by an electronic tag to transfer data to a reader-writer. The FM0 encoding rule is that a level of a symbol 0 has level changes both in the middle and at the edge of a bit period, and a level of a symbol 1 has a level change only at the edge of a bit period. Figure 13 is an example illustrating the FM0 encoding rule. FM0 encoding can have the following characteristics. The symbol 0 has 3 transitions, including one transition at the beginning of the bit period and one transition in the middle of the bit period. The symbol 1 has 1 transition at the beginning of the bit period. Figure 14 is an example of an FM0 symbol, a sequence of FM0 symbols, and an FM0 encoding. III. APPLICATION SCENARIOS FOR ZERO-POWER COMMUNICATION

[0093] Zero-power communication, with its significant advantages of extremely low cost, zero power, and small size, can be widely applied in various Petition 870250078547, dated 03 / 09 / 2025, page 31 / 355 25 / 141 sectors, such as logistics, smart storage, smart agriculture, energy generation, industrial internet and other vertical sectors, and can also be applied in personal applications, such as smart wearable devices and smart homes. IV. POWER SUPPLY SIGNAL AND TRIGGER SIGNAL IN THE ZERO POWER COMMUNICATION SYSTEM

[0094] A zero-power terminal can collect energy based on a power supply signal.

[0095] For example, in terms of a carrier of the power supply signal, the power supply signal can come from a base station, a smartphone, a smart communication gateway, a charging station, a micro base station, etc. In terms of frequency band, the power supply signal can be a low-frequency signal, a medium-frequency signal, a high-frequency signal, etc. In terms of waveform, the power supply signal can be a sine wave, a square wave, a triangular wave, a pulse, a rectangular wave, etc. The power supply signal can be a continuous wave or it can be a discontinuous wave (i.e., time interruption is allowed).The power supply signal can be a signal specified in the 3rd-generation partnership design standard (3GPP), such as a probe reference signal (SRS), a shared uplink physical channel (PUSCH), a random access physical channel (PRACH), an uplink control physical channel (PUCCH), a downlink control physical channel (PDCCH), a shared downlink physical channel (PDSCH), a transmission physical channel (PBCH), etc.

[0096] It can be noted that, once the sign of Petition 870250078547, dated 03 / 09 / 2025, page 32 / 355 The 26 / 141 carrier signal sent by the network device can also be used to supply power to the zero-power device; the carrier signal can also be called the power supply signal.

[0097] The zero-power terminal can perform backscatter communication based on a received trigger signal.

[0098] For example, the trigger signal can be used to program or trigger the zero-power terminal to perform backcast communication. The trigger signal carries scheduling information from the network device, or the trigger signal is a scheduling signal or a scheduling signal sent by the network device. In terms of a trigger signal carrier, the trigger signal can be from a base station, a smartphone, a smart communication port, etc. In terms of frequency band, the trigger signal can be a low-frequency signal, a medium-frequency signal, a high-frequency signal, etc. In terms of waveform, the trigger signal can be a sine wave, a square wave, a triangular wave, a pulse, a rectangular wave, etc. The trigger signal can be a continuous wave or it can be a discontinuous wave (i.e., time interruption is allowed).The trigger signal can be a signal specified in the 3GPP standard, such as an SRS, a PUSCH, a PRACH, a PUCCH, a PDCCH, a PDSCH, a PBCH, or it can be a new signal.

[0099] It may be noted that the power signal and the trigger signal may be the same signal, or they may be two independent signals, which is not limited to the present disclosure. Petition 870250078547, dated 03 / 09 / 2025, page 33 / 355 27 / 141

[00100] For example, in a cellular network, since a zero-power device does not have a battery to supply power, a network device needs to provide the power supply signal that is used for the zero-power device to obtain power, to perform a corresponding communication process. A signal to supply power (i.e., the power signal) and a signal to transmit information (i.e., the trigger signal) can be two separate signals or they can be the same signal. For another example, in RFID technology, the power supply signal and the trigger signal can be the same signal, and in passive cellular IoT technology, the power supply signal and the trigger signal can be two independent signals. The two signals cannot be sent in the same frequency band.For example, the network device sends a power supply signal consecutively or intermittently in a specific frequency band, and after the zero-power device picks up and obtains power from the supply signal, the zero-power device can perform a corresponding communication process, such as measurement, channel / signal reception, channel / signal transmission, etc. V. ZERO POWER TERMINAL CLASSIFICATIONS

[00101] Based on the power source and the use of the zero-power terminal, the zero-power terminal can be divided into the following types. 1. PASSIVE ZERO-POWER TERMINAL

[00102] For a zero-power device, a built-in battery is not required. When a zero-power device moves close to a network device (e.g., a reader / writer in an RFID system), the device Petition 870250078547, dated 03 / 09 / 2025, page 34 / 355 28 / 141 Zero power is within a near-field radiation of an antenna (or antennas) of the network device. In this case, an antenna (or antennas) of the zero-power device generates an induced current by electromagnetic induction, and the induced current drives a low-power chip circuit of the zero-power device to perform the demodulation of a forward link signal (downlink, a link from the network device to the zero-power device) and modulation of a reverse link signal (uplink, a link from the zero-power device to the network device, also referred to as a backscatter link). For the backscatter link, the zero-power device performs signal transmission via backscatter.

[00103] It can be seen that neither the forward nor the reverse link of the zero-power passive device requires a built-in battery to operate, which is a truly zero-power terminal.

[00104] The passive zero-power device does not require a battery and has a simple RF circuit and a simple baseband circuit. For example, the passive zero-power device does not need components such as an LNA, a power amplifier (PA), a crystal oscillator, an analog-to-digital converter (ADC), etc., and thus has advantages such as small size, light weight, low price, and long service life.

[00105] The zero-power passive device can also support other ways of harvesting energy and obtain energy for a drive circuit by collecting energy from the environment (e.g., light energy, thermal energy, kinetic energy, mechanical energy, etc.), to support the Petition 870250078547, dated 03 / 09 / 2025, page 35 / 355 29 / 141 communication from a terminal device. 2. SEMI-PASSIVE ZERO POWER DEVICE

[00106] A zero-power semi-passive device is not equipped with a conventional battery, but may use a radio frequency (RF) energy harvesting module to collect energy from radio waves or use the energy harvesting module to collect energy from the environment (such as solar energy, thermal energy, mechanical vibration energy, etc.), and store the harvested energy in an energy storage unit (e.g., a capacitor). After the energy storage unit obtains energy, a low-power chip circuit of the zero-power device can be triggered to perform the demodulation of a forward link signal and the modulation of a reverse link signal. For a backscatter link, the zero-power device performs signal transmission via backscatter.

[00107] It can be seen that neither the forward nor the reverse link of the semi-passive zero-power terminal requires a built-in battery to be powered. Although the semi-passive zero-power device utilizes the energy stored in the capacitor during operation, since the energy comes from radio wave energy captured by the energy-harvesting module, the semi-passive zero-power device is truly a zero-power device.

[00108] The semi-passive zero-power device inherits many advantages of the passive zero-power device, and thus has advantages such as small size, light weight, low price, long service life, etc. 3. ACTIVE ZERO POWER DEVICE Petition 870250078547, dated 03 / 09 / 2025, page 36 / 355 30 / 141

[00109] A zero-power device applied in some scenarios can also be an active zero-power device, and such a device may have a built-in battery (a conventional battery, such as a dry cell battery, a rechargeable lithium battery, etc.). The battery is used to power a low-power chip circuit of the zero-power device to perform the demodulation of a forward link signal and the modulation of a reverse link signal. However, for a backscatter link, the zero-power device performs signal transmission via backscatter. Therefore, the zero-power consumption of such a device lies mainly in the fact that signal transmission in the return link does not require power from the terminal itself, but is based on backscatter.Although the active zero-power device uses a battery, it has extremely low power consumption due to the adoption of ultra-low power communication technology. As a result, battery life can be significantly extended compared to existing technologies.

[00110] The built-in battery of the zero-power active terminal powers an RFID circuit to increase the read and write range of a tag, thus improving communication reliability. Therefore, the zero-power active terminal can be applied in some scenarios with high requirements for communication distance, read delay, and other aspects.

[00111] Some zero-power terminals, such as a semi-passive zero-power terminal or an active zero-power terminal, may have the ability to actively transmit, i.e., in addition to communication via Petition 870250078547, dated 03 / 09 / 2025, page 37 / 355 31 / 141 backcasting on the reverse link, zero-power terminals can also communicate via active transmission.

[00112] In addition, the types of services for zero-power terminals will also focus primarily on industry-specific applications, similar to other types of IoT services. Therefore, zero-power terminals can be classified based on the type of transmitter. Zero-power terminals can be classified into the following types based on the type of transmitter. 1. Zero-power device based on backscattering

[00113] This zero-power device performs uplink data transmission via backscatter. The zero-power device does not have an active transmitter for active transmission, but only a backscatter transmitter. Therefore, if data transmission is to be performed, the zero-power device needs to be supplied with a carrier wave from the network device, and then performs backscatter based on the carrier wave, thus implementing data transmission. 2. ZERO POWER DEVICE BASED ON AN ACTIVE TRANSMITTER

[00114] Such a zero-power device performs uplink data transmission using an active transmitter capable of active transmission. Therefore, when performing data transmission, the zero-power device can transmit data using the active transmitter of the zero-power device itself without requiring the network device to provide a carrier wave. An applicable active transmitter Petition 870250078547, dated 03 / 09 / 2025, page 38 / 355 32 / 141 to zero-power device can be, for example, an ultra-low power ASK transmitter, an ultra-low power FSK transmitter, etc. Based on the current implementation, for the case of transmitting a 100 microwatt signal (μw) by such a transmitter, the overall power consumption can be reduced to 400~600 μw. 3. Zero-power device that has a backscatter transmitter and an active transmitter.

[00115] This terminal can support both a backscatter transmitter and an active transmitter. The terminal can determine, according to different conditions (such as amount of power and available ambient power source) or based on the programming of a network device, which signal transmission scheme should be applied, i.e., whether to use a backscatter transmitter or an active transmitter to perform the signal transmission. VI. CELLULAR PASSIVE INTERNET OF THINGS (IoT)

[00116] Cellular IoT is growing, for example, 3GPP standardized Narrowband Internet of Things (NBIoT), MTC, Reduced Capability (RedCap) and other IoT technologies. However, the related technique is no longer able to meet the communication requirements of IoT in many scenarios. The main reasons are as follows. 1. HOSTILE COMMUNICATION ENVIRONMENTS

[00117] In some IoT scenarios, extreme environments such as high temperature, extremely low temperature, high humidity, high pressure, high radiation, or high-speed movement may be encountered. Examples include ultra-high voltage substations, high-speed rail lines, cold regions, industrial production lines, etc. Petition 870250078547, dated 03 / 09 / 2025, page 39 / 355 33 / 141 In these scenarios, due to the limitations of the operating environment of conventional power supplies, existing IoT terminals cannot operate. Furthermore, extreme environments are also unfavorable for IoT maintenance, such as battery replacement. 2. EXTREMELY SMALL TERMINAL FORM REQUIREMENTS

[00118] Some IoT communication scenarios, such as food traceability, goods circulation, and smart wearables, require terminals to be extremely small for convenient use in such scenarios. For example, IoT terminals used for goods-in-transit management are often implemented as electronic tags, which are incorporated into the product packaging in a very compact way. Another example is lightweight wearable devices, which can improve the user experience while meeting user needs. 3. Extremely Low-Cost IoT Communication Requirements

[00119] Many IoT communication scenarios require sufficiently low IoT terminal costs to improve competitiveness compared to other alternative technologies. For example, in logistics or warehousing scenarios, to facilitate the management of a large number of items in circulation, IoT terminals can be connected to each item, and communication between the terminal and the logistics network can achieve precise management throughout the logistics process and lifecycle. These scenarios require that the price of IoT terminals be sufficiently competitive. Petition 870250078547, dated 03 / 09 / 2025, page 40 / 355 34 / 141

[00120] Therefore, to cover these unmet IoT communication needs, the cellular network also needs to develop ultra-low-cost, ultra-small, battery-free / maintenance-free IoT, and zero-power IoT can accurately meet this demand.

[00121] It may also be noted that zero-power IoT may also be called ambient energy-enabled (AMP) IoT, or simply ambient IoT. Specifically, an ambient IoT device may refer to an IoT device that utilizes various energies from the environment, such as RF energy, light energy, solar energy, thermal energy, mechanical energy, etc. The ambient IoT device may have no energy storage capability, or may have very limited energy storage capability (such as the use of a capacitor with a capacity of tens of microfarads (μE)).

[00122] Ambient IoT can be used in at least the following four types of scenarios:

[00123] 1. Object recognition, such as logistics, product management in a product line, and supply chain management;

[00124] 2. Environmental monitoring, such as monitoring of the work environment, temperature and humidity of the natural environment and toxic gases;

[00125] 3. Positioning, such as internal positioning, intelligent object search, and product positioning within a product line;

[00126] 4. Intelligent control, such as intelligent control of various electrical appliances (turning an air conditioner on / off and adjusting the temperature) in a smart home and intelligent control of various installations. Petition 870250078547, dated 03 / 09 / 2025, page 41 / 355 35 / 141 (automatic leakage and fertilization) in an agricultural greenhouse.

[00127] In summary, the zero-power device is low-complexity and low-cost, maintenance-free, and battery-free. The zero-power device can be classified into passive zero-power terminal, semi-passive zero-power terminal, active zero-power terminal, etc. Energy for communication is obtained by capturing energy from the environment (e.g., RF energy, light energy, thermal energy, mechanical energy, kinetic energy, etc.). In terms of communication method, the zero-power device can support backscattering or even active transmission. Furthermore, the zero-power device can achieve high-density and large-scale deployment at a relatively low cost.Furthermore, due to advantages such as being maintenance-free and battery-free, the zero-power device has great potential for application in industrial sensing networks, smart homes, smart agriculture, logistics and warehousing, smart home use, healthcare, etc. The zero-power device can be combined with a sensor to perform environmental monitoring, hazard warning, alarm, etc. VII. REPETITION CODE

[00128] In general, noise or interference inevitably exists in communication channels, so information loss is bound to occur during the information transmission process. In other words, distortion occurs when transmitting a source symbol over a noisy channel. To reduce this information loss, effective channel coding is necessary before the source symbol is inserted into the channel. Petition 870250078547, dated 03 / 09 / 2025, page 42 / 355 36 / 141

[00129] Channel coding can reduce the likelihood of errors occurring during transmission, thereby improving the reliability of the communication system. A basic idea of ​​channel coding is to add redundant information that can be used at the receiving end for error detection or correction. Different coding schemes have varying capabilities for error detection and correction.

[00130] The repeat code is a very simple channel encoding scheme. Essentially, with the repeat code, each symbol to be sent is sent repeatedly. In other words, each original source symbol is encoded into several identical symbols, each with the same value as the original symbol. For example, (3,1) binary repeat code is obtained by an encoding scheme in which each bit in an original binary sequence is repeated 3 times, i.e., 0 is encoded as 000 and 1 is encoded as 111.

[00131] In a corresponding decoding process, a more frequent bit, 0 or 1, in a received codeword can be selected as the decoding result. For example, in the decoding of the binary repeat code (3,1), the received 000, 001, 010 and 100 are decoded as 0, while the received 011, 101, 110 and 111 are decoded as 1. In this way, for each codeword, any bit error that occurs during transmission can be automatically corrected through decoding. VIII. MODULATION SCHEMES FOR ZERO-POWER COMMUNICATION Petition 870250078547, dated 03 / 09 / 2025, page 43 / 355 37 / 141

[00132] When a zero-power device communicates with a network device via backscatter or active transmission, the zero-power device does not generate a carrier but backscatters by modulating an input waveform using modulation schemes such as on-off keying (OOK), ASK, phase-shift keying (PSK), FSK, etc., and therefore the data transmission performance is relatively poor. Similarly, for a zero-power device that supports communication via active transmission, due to its simple structure and focus on low-power communication, the zero-power device also typically uses modulation schemes such as OOK, ASK, PSK, FSK, etc. for signal transmission. However, the signal transmission power is usually at a low level, resulting in poor data transmission performance as well.

[00133] Figure 15 is a schematic diagram illustrating an OOK modulation scheme provided in embodiments of the present disclosure.

[00134] As illustrated in Figure 15, for the OOK modulation scheme, a zero-power device modulates a baseband-encoded data stream into a signal received by the zero-power device, to obtain a reflected signal, and sends the reflected signal to a network device. The signal received by the zero-power device can be a high-frequency signal or a specific carrier signal.

[00135] It can be noted that the zero-power device (or referred to as ambient IoT device) has a simple structure, low complexity and low cost, and can support the harvesting of energy from the environment (e.g., Petition 870250078547, dated 03 / 09 / 2025, page 44 / 355 38 / 141 light energy, thermal energy, RF energy, mechanical energy, kinetic energy, etc.) to obtain the energy needed for communication. The zero-power device can be a device that supports at least one of the following communication modes: backscatter communication or active transmission communication.

[00136] However, due to the characteristics of the zero-power device, the zero-power device does not use a complex modulation scheme during communication. When the zero-power device transmits signals to the network device, with backscattering or active transmission, the data transmission performance is generally lower than that of a device in the existing NR system. Without channel coding, errors in data bits in a transmitted packet can lead to data transmission failure and the need for data retransmission. For the zero-power device, it is essential to improve data transmission performance and minimize the number of data retransmissions. In light of this, the present disclosure provides a wireless communication method and a zero-power device that can improve the data transmission performance of the zero-power device.

[00137] Specifically, in the present disclosure, repeat coding is performed on a first sequence to be encoded, bits in the first sequence, a sequence obtained by mapping sequence to the first sequence, and bits in the sequence obtained by mapping sequence to the first sequence, which can improve the data transmission performance of the zero-power device. Optionally, repeat coding can support different numbers of repetitions. The number of repetitions used Petition 870250078547, dated 03 / 09 / 2025, page 45 / 355 39 / 141 for repeat encoding can be selected from several repetition numbers that can be configured by the network device and adapted to different scenarios, thus balancing error probability and data rate during data transmission. Optionally, the first sequence can also be a bit sequence appended with a parity bit (or parity bits) and / or a cyclic redundancy check (CRC) bit (or cyclic redundancy check bits), so that a receiving device can perform error detection and correction on the received data, further improving the data transmission performance of the zero-power device. Optionally, processing such as interleaving and / or first encoding is introduced for a second sequence, further improving the data transmission performance of the zero-power device.

[00138] Figure 16 is a schematic flowchart of a wireless communication method 200 provided in embodiments of the present disclosure.

[00139] It can be noted that the wireless communication method 200 can be performed by a sending device, and the sending device can be a network device or a terminal device. In other words, the wireless communication method is applied to wireless communication between the sending device and a receiving device (including at least one of the following: the terminal device sending data to the network device, the network device sending data to the terminal device, or the terminal device sending data to the terminal device). For example, the terminal device can be a device of Petition 870250078547, dated 03 / 09 / 2025, p. 46 / 355 40 / 141 zero power and the zero power device may be a device that supports at least one of the following communication modes: communication via backcast or communication via active transmission. For example, the zero power device may be a conventional NR terminal loaded with or integrated into a backcast communication module. For ease of description, method 200 is described below with an example of the method being performed by the zero power device.

[00140] As illustrated in Figure 16, the wireless communication method 200 may include the following.

[00141] In S210, the zero-power device obtains a second sequence by performing repeat encoding based on a first sequence to be encoded.

[00142] For example, the first sequence may include a sequence of data bits.

[00143] The sequence of data bits can be communication data sent by the zero-power device to the network device, or it can be communication data sent by the zero-power device to another terminal device.

[00144] The first sequence may include other information, which is not limited to the present disclosure.

[00145] For example, the first sequence may also include information used to verify the data bit sequence. The information used to verify the data bit sequence includes, but is not limited to, a CRC bit and a parity bit. The information used to verify the data bit sequence may be information used to verify the entire data bit sequence or may include Petition 870250078547, dated 03 / 09 / 2025, p. 47 / 355 41 / 141 pieces of information are used to verify various parts of the data bit sequence, respectively.

[00146] For another example, the first sequence may also include a cyclic prefix, and the cyclic prefix is ​​used for the receiving device to identify or position an initial position of the data bit sequence when receiving the data bit sequence.

[00147] In this mode, the zero-power device obtains the second sequence by performing repeat encoding based on the first sequence to be encoded. In other words, redundant information is added by repeat encoding based on the first sequence, so that the receiving end can perform error correction and detection on a decoded result of the first sequence when decoding the first sequence based on the second sequence, thus improving the data transmission performance of the zero-power device.

[00148] It can be noted that the zero-power device has a simple structure, low complexity, and low cost, and can support the capture of energy from the environment (e.g., light energy, thermal energy, RF energy, mechanical energy, kinetic energy, etc.) to obtain the energy needed for communication. The zero-power device can be a device that supports at least one of the following communication modes: backscatter communication or active transmission communication. Without channel coding, errors in data bits in a transmitted packet can lead to data transmission failure and the need for data retransmission. For the zero-power device, improving transmission performance is essential. Petition 870250078547, dated 03 / 09 / 2025, page 48 / 355 42 / 141 of data and minimize the number of data retransmissions. Therefore, a repeat encoding process is simple and of low complexity, with which the data transmission performance of the zero-power device can be improved as much as possible without increasing the complexity of the zero-power device.

[00149] In addition, the zero-power device may also be called an AMP IoT device or ambient IoT device. Specifically, an ambient IoT device may refer to an IoT device that utilizes various environmental energies, such as RF energy, light energy, solar energy, thermal energy, mechanical energy, etc. The ambient IoT device may have no energy storage capability or may have very limited energy storage capability (such as using a capacitor with tens of pF capacity).

[00150] In some embodiments, operations on S210 may include the following. The zero-power device obtains the second sequence by performing repeat encoding on bit values ​​in the first sequence.

[00151] For example, the zero-power device can obtain the second sequence by performing repeat encoding on the bit values ​​in the first sequence based on the number of repetitions (also called redundancy) of the repeat encoding.

[00152] For example, assuming that the number of repetitions of the repeat encoding is N, then the zero-power device can perform repeat encoding on the bit values ​​in the first sequence according to Table 1: Petition 870250078547, dated 03 / 09 / 2025, page 49 / 355 43 / 141 TABLE 1 Repeat encoding Bits in the first sequence Bits in the second sequence 0 00...00 (N 0s) 1 11... 11 (N 1s)

[00153] As illustrated in Table 1, the zero-power device encodes the bits in the first sequence according to N redundancy, that is, each bit is repeated N times, where 0 is encoded as N 0s and 1 is encoded as N 1s.

[00154] For example, assuming the first sequence is 011 and N=5, then the second sequence is 000001111111111.

[00155] For the receiving device, the receiving device can decode according to the number of 0s and 1s in each codeword (for example, N bits obtained by performing repeat encoding on one bit in the first sequence). For example, the receiving device obtains the bits in the first sequence by decoding every five consecutive bits in a second sequence to be decoded. Usually, the idea of ​​the majority rule can be adopted and a value with the highest frequency is considered as the decoded result of the codeword. Assuming that the N bits in each codeword include N1 1s and N2 0s, where N = N1 + N2, then: if N1 > N2, the codeword is decoded as 1; if N1 <N2, a palavra-código é decodificada como 0; e se N1=N2, a palavra-código pode ser determinada como 1 ou 0 de acordo com uma regra predefinida. Além disso, se N1=N2, Petition 870250078547, dated 03 / 09 / 2025, p. 50 / 355 44 / 141 The codeword can be determined based on other information, such as the CRC bit or the parity bit. For example, the receiving device can determine the codeword based on the parity bit in the case of N1=N2. Specifically, assuming that N1=N2 in a first codeword, then the receiving device can determine a decoded result of the first codeword based on a decoded codeword (or codewords) used to generate the parity bit and a parity code value. For another example, the receiving device can determine the codeword based on the CRC bit in the case of N1=N2. Specifically, assuming that N1=N2 in the first codeword, then the receiving device can determine the decoded result of the first codeword based on a decoded codeword (or decoded codewords) used to generate the CRC bit and a CRC bit value.

[00156] In this mode, when the zero-power device performs repeat encoding on the bit values ​​in the first sequence, the receiving device has a bit-level error correction capability, that is, when there is an error in a repeat code corresponding to a bit, the receiving device is able to correctly determine an original bit corresponding to the codeword, thus improving the data transmission performance of the zero-power device.

[00157] In some embodiments, operations on S210 may include the following. The zero-power device obtains the second sequence by performing repeat encoding on the first sequence.

[00158] For example, the power device Petition 870250078547, dated 03 / 09 / 2025, p. 51 / 355 45 / 141 zero can be obtained by performing repeat encoding on the first sequence based on the number of repetitions of the repeat encoding.

[00159] For example, assuming that the number of repetitions (also referred to as redundancy) of the repeat encoding is N, then the zero-power device can obtain a second sequence formed by N consecutive first sequences by performing repeat encoding on the first sequence.

[00160] For example, assuming the first sequence is 011 and N=5, then the second sequence is 011011011011011.

[00161] For the receiving device, the receiving device can decode according to the number of 0s and 1s in each codeword (e.g., N bits obtained by performing one-bit repeat encoding in the first sequence). For example, in order for a second sequence to be decoded, the receiving device can divide the second sequence into five 011s based on the number of repetitions and then decode the first bit (i.e., 0) in the first sequence based on the first bits (i.e., five 0s) in the five 011s. Typically, the receiving device may adopt the idea of ​​majority rule and assume a value with the highest frequency as the decoded result of the codeword.Assuming that the N bits in each codeword include N1 1s and N2 0s, where N = N1 + N2, then: if N1 > N2, the codeword is decoded as 1; if N1 <N2, a palavracódigo é decodificada como 0; e se N1=N2, a palavra-código pode ser determinada como 1 ou 0 de acordo com uma regra predefinida. Além disso, se N1=N2, a palavra-código pode ser. Petition 870250078547, dated 03 / 09 / 2025, p. 52 / 355 46 / 141 determined based on other information, such as the CRC bit or the parity bit. For example, the receiving device can determine the codeword based on the parity bit in the case of N1=N2. Specifically, assuming N1=N2 in a first codeword, then the receiving device can determine a decoded result of the first codeword based on a decoded codeword (or codewords) used to generate the parity bit and a parity code value. For another example, the receiving device can determine the codeword based on the CRC bit in the case of N1=N2. Specifically, assuming N1=N2 in the first codeword, then the receiving device can determine the decoded result of the first codeword based on a decoded codeword (or decoded codewords) used to generate the CRC bit and a CRC bit value.

[00162] In this mode, when the zero-power device performs repeat encoding on the first sequence, the receiving device has bit-level error correction capability, that is, when there is an error in a repeat code corresponding to a bit, the receiving device is able to correctly determine an original bit corresponding to the codeword, thus increasing the data transmission performance of the zero-power device.

[00163] In some embodiments, when the number of bits in the first sequence is K and the number of repetitions of the repeat encoding is N, the number of bits in the second sequence is NχK, where N and K are each a positive integer. Petition 870250078547, dated 03 / 09 / 2025, p. 53 / 355 47 / 141

[00164] For example, when the zero-power device performs repeat encoding on the bits of the first sequence, if the number of bits in the first sequence is K and the number of repeat encoding repetitions is N, the number of bits in the second sequence will be N χ K. Alternatively, when the zero-power device performs repeat encoding on the first sequence, if the number of bits in the first sequence is K and the number of repeat encoding repetitions is N, the number of bits in the second sequence will be NχK.

[00165] In some embodiments, operations in S210 may include the following. The zero-power device determines at least a third sequence based on the first sequence. The zero-power device obtains the second sequence by performing repeat encoding based on at least a third sequence.

[00166] For example, when the zero-power device performs repeat encoding based on the first sequence, the zero-power device can first map the first sequence to at least a third sequence and then obtain the second sequence by performing repeat encoding based on at least a third sequence.

[00167] In some modes, the zero-power device determines the third sequence based on the bit values ​​in the first sequence.

[00168] For example, the zero-power device first obtains at least a third sequence by mapping a sequence to a value for each bit in the first sequence, and then obtains the second sequence by performing Petition 870250078547, dated 03 / 09 / 2025, page 54 / 355 48 / 141 if the repeat encoding is based on a sequence formed by at least one third sequence.

[00169] In some embodiments, the zero-power device obtains a first mapping relation, wherein the first mapping relation includes a correspondence between a first value and a first candidate sequence and a correspondence between a second value and a second candidate sequence. When a value of a first bit in the first sequence is the first value, the first candidate sequence is determined as the third sequence. When the value of the first bit is the second value, the second candidate sequence is determined as the third sequence.

[00170] For example, the first value is 0, and the second value is 1.

[00171] In other words, the zero-power device obtains the first mapping relation, where the first mapping relation includes a match between 0 and the first candidate sequence and a match between 1 and the second candidate sequence. When the value of the first bit in the first sequence is 0, the first candidate sequence is determined to be the third sequence. When the value of the first bit is 1, the second candidate sequence is determined to be the third sequence.

[00172] For example, the first value is 1, and the second value is 0.

[00173] In other words, the zero-power device obtains the first mapping relation, where the first mapping relation includes a match between 1 and the first candidate sequence and a match between 0 and the second candidate sequence. When the value of Petition 870250078547, dated 03 / 09 / 2025, page 55 / 355 49 / 141 If the first bit in the first sequence is 1, the first candidate sequence is determined to be the third sequence. When the value of the first bit is 0, the second candidate sequence is determined to be the third sequence.

[00174] For example, the first mapping relationship can be configured by a network device, can be predefined, can be determined by the zero-power device, or can be negotiated between the zero-power device and the network device. The first mapping relationship can also be a mapping relationship determined by the zero-power device from several mapping relationships configured by the network device or several predefined mapping relationships. For example, the first mapping relationship can be a mapping relationship corresponding to the number of bits in the first sequence (or the type of information in the first sequence, etc.) among the various mapping relationships. The type of information in the first sequence includes, but is not limited to, a data type, a control type, etc.

[00175] In some modes, the first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

[00176] For example, the first candidate sequence and the second candidate sequence have different values ​​at each bit position.

[00177] For example, the number of bits in the first candidate sequence and the number of bits in the second candidate sequence are greater than or equal to 2.

[00178] For example, the number of bits in the first candidate sequence and the number of bits in the second Petition 870250078547, dated 03 / 09 / 2025, p. 56 / 355 50 / 141 candidate sequence can be 2, and the first candidate sequence and the second candidate sequence have different values ​​in each of the first bit positions and in the second bit position.

[00179] For example, the first mapping relation can be a mapping relation, as illustrated in Table 2 below: TABLE 2 Sequence mapping Bits in the first sequence Third sequences 1 10 0 01

[00180] As illustrated in Table 2, the zero-power device performs sequence mapping on the bits of the first sequence according to Table 2, that is, 1 is mapped to 10 and 0 is mapped to 01.

[00181] For example, the number of bits in the first candidate sequence and the number of bits in the second candidate sequence can each be 4, and the first candidate sequence and the second candidate sequence have different values ​​in each of the positions of the first bit, the second bit position, the third bit position, and the fourth bit position.

[00182] For example, the first mapping relation can be a mapping relation, as illustrated in Table 3 below: TABLE 3 Sequence mapping Petition 870250078547, dated 03 / 09 / 2025, page 57 / 355 51 / 141 Bits in the first sequence Third sequences 1 1001 0 0110

[00183] As illustrated in Table 3, the zero-power device performs sequence mapping on the bits of the first sequence according to Table 3, that is, 1 is mapped to 1001 and 0 is mapped to 0110.

[00184] For example, the first mapping relation could be the mapping relation illustrated in Table 4 below: TABLE 4 Sequence mapping Bits in the first sequence Third sequences 1 1110 0 0001

[00185] As illustrated in Table 4, the zero-power device performs sequence mapping on the bits of the first sequence according to Table 2, that is, 1 is mapped to 1110 and 0 is mapped to 0001.

[00186] Tables 2 through 4 are merely examples in the present disclosure and should not be construed as a limitation to the present disclosure. For example, in other alternative embodiments, the third sequence may also be a sequence with other bit lengths or a sequence with other values. For example, when the number of bits in the first candidate sequence and the number of bits in the second candidate sequence are 3 each, there may be a variety of Petition 870250078547, dated 03 / 09 / 2025, p. 58 / 355 There are 52 / 141 possible cases for the first candidate sequence and the second candidate sequence. For example, if the first candidate sequence is 001, the second candidate sequence will be 110. For another example, the first candidate sequence is 010 and the second candidate sequence is 101. For another example, the first candidate sequence is 100 and the second candidate sequence is 011. For another example, the first candidate sequence is 011 and the second candidate sequence is 100. For another example, the first candidate sequence is 101 and the second candidate sequence is 010. For another example, the first candidate sequence is 110 and the second candidate sequence is 001. For another example, the first candidate sequence is 000 and the second candidate sequence is 111. For another example, the first candidate sequence is 111 and the second candidate sequence is 000.

[00187] For repeat encoding, assume that the first mapping relation is the mapping relation illustrated in Table 2. For example, if the first sequence is 0110, when the zero-power device performs repeat encoding based on the first sequence to be encoded, the zero-power device can first obtain at least one third sequence by mapping 0 in the first sequence to 01 and mapping 1 in the first sequence to 10, that is, at least one third sequence includes the first 01, the first 10, the second 10 and the second 01, and then it can obtain a second sequence by performing repeat encoding based on a sequence formed by at least one third sequence (that is, a sequence formed by the first 01, the first 10, the second 10 and the second 01, that is, 01 10 10 01), that is, perform the Petition 870250078547, dated 03 / 09 / 2025, page 59 / 355 53 / 141 repeat encoding based on 01 10 10 01.

[00188] In some embodiments, the zero-power device first splits the first sequence into at least one coding group and then determines the third sequence based on a value from each of the at least one coding group.

[00189] For example, each of at least one encoding group includes one or more consecutive bits.

[00190] In other words, the zero-power device takes each bit or each of several consecutive bits in the first sequence as an encoding group, obtains at least one third sequence by sequence mapping into the encoding group, and then obtains a second sequence by performing repeat encoding based on a sequence formed by at least one third sequence.

[00191] In some embodiments, the zero-power device first obtains a second mapping relation, where the second mapping relation includes a correspondence between several values ​​and several candidate sequences, and the several values ​​include the value of each of at least one coding group. Then, the zero-power device determines a candidate sequence corresponding to the value of each of at least one coding group as the third sequence.

[00192] For example, each of the multiple values ​​can include a single bit value or a value of multiple consecutive bits.

[00193] For example, the second mapping relationship can be configured by the network device, can be predefined, or can be determined by the device. Petition 870250078547, dated 03 / 09 / 2025, p. 60 / 355 54 / 141 zero power or can be negotiated between the zero power device and the network device. The second mapping relationship can also be a mapping relationship determined by the zero power device from the various mapping relationships configured by the network device or from the various predefined mapping relationships. For example, the second mapping relationship can be a mapping relationship corresponding to the number of bits in the first sequence (or the type of information in the first sequence, etc.) among the various mapping relationships. The type of information in the first sequence includes, but is not limited to, a data type, a control type, etc.

[00194] In some embodiments, the number of multiple candidate sequences is positively correlated with the number of bits in each of the multiple values.

[00195] For example, a larger number of bits for each of the multiple values ​​leads to more candidate sequences. In other words, a smaller number of bits for each of the multiple values ​​leads to fewer multiple candidate sequences.

[00196] For example, assuming that the number of bits in each of the multiple values ​​is P, then the number of candidate multiple sequences is 2P, where P is a positive integer.

[00197] For example, assuming that the number of bits in each of the multiple values ​​is 2, then the number of bits in each of the multiple candidate sequences could be 4.

[00198] For example, the second relation of Petition 870250078547, dated 03 / 09 / 2025, page 61 / 355 55 / 141 mapping may be the mapping ratio illustrated in Table 5 below: TABLE 5 Sequence Mapping Candidate Sequence Values ​​00 0101 01 0110 10 1001 11 1010

[00199] As illustrated in Table 5, the zero-power device divides the bits in the first sequence into at least one encoding group according to Table 5, each encoding group with 2 bits, and performs sequence mapping in each encoding group based on Table 5, that is, 00 is mapped to 0101, 01 is mapped to 0110, 10 is mapped to 1001, and 11 is mapped to 1010.

[00200] Table 5 is merely an example in the present disclosure and should not be construed as a limitation to the present disclosure. For example, in other alternative embodiments, the candidate sequence may also be a sequence with other bit lengths or a sequence with other values. For example, a 2-bit encoding group may be mapped to a third 3-bit sequence.

[00201] For repeat encoding, assume that the first mapping relation is the mapping relation illustrated in Table 5. When the zero-power device performs repeat encoding based on the first sequence to be encoded, the zero-power device Petition 870250078547, dated 03 / 09 / 2025, page 62 / 355 56 / 141 can first split the first sequence into at least one encoding group and obtain at least one third sequence by mapping an encoding group with the value 00 to 0101, mapping an encoding group with the value 01 to 0110, mapping an encoding group with the value 10 to 1001, and mapping an encoding group with the value 11 to 1010. For example, if the first sequence is 0110, the zero-power device splits 0110 into two encoding groups, i.e., 01 and 10, obtains at least one third sequence including 0110 and 1001 by sequence mapping to 01 and 10, and then can obtain a second sequence by performing repeat encoding based on a sequence formed by at least one third sequence (i.e., a sequence formed by 0110 and 1001, i.e., 0110 1001), that is, performing repetition encoding based on 0110 1001.

[00202] In some embodiments, the zero-power device obtains the second sequence by performing repeat encoding on bit values ​​in the third sequence.

[00203] For example, the zero-power device can obtain the second sequence by performing repeat encoding on bit values ​​in the sequence formed by at least one third sequence based on the number of repetitions (also referred to as redundancy) of the repeat encoding.

[00204] For example, assuming that the number of repetitions of the repeat encoding is N, then the zero-power device can obtain the second sequence by performing the repeat encoding on the bit values ​​in the sequence. Petition 870250078547, dated 03 / 09 / 2025, page 63 / 355 57 / 141 formed by at least one third sequence according to Table 6. TABLE 6 Bits in the sequence repeating: one third formed by at least the sequence; Bits in the second sequence: 0 00...00 (N 0s) 1 11... 11 (N 1s)

[00205] As illustrated in Table 6, the zero-power device encodes the bits in the sequence formed by at least one-third of the sequence according to the N redundancy, that is, each bit is repeated N times, where 0 is encoded as N 0s and 1 is encoded as N 1s.

[00206] For example, assuming the first sequence is 0110, at least one third sequence is obtained by mapping each bit in the first sequence to a third sequence according to Table 2. Specifically, the sequence of at least one third includes the first 01, the first 10, the second 10, and the second 01, that is, 01 10 10 01. Based on this, the zero-power device can obtain a second sequence by performing bit value repetition encoding in a sequence formed by at least one third sequence. For example, if the number of repetitions N=5, the second sequence is: 00000 11111 11111 00000 11111 00000 00000 11111.

[00207] For another example, assuming the first sequence is 0110, then the zero-power device divides 0110 into two encoding groups, that is, 01 and 10, and then performs the sequence mapping on 01 and 10. Petition 870250078547, dated 03 / 09 / 2025, page 64 / 355 58 / 141 according to Table 5, to obtain at least one third sequence including 0110 and 1001, that is, 0110 1001. Based on this, the zero-power device can obtain a second sequence by performing bit value repetition encoding in a sequence formed by at least one third sequence. For example, if the number of repetitions N=5, the second sequence is: “00000 11111 11111 00000 11111 00000 00000 11111”.

[00208] For the receiving device, the receiving device can decode according to the number of 0s and 1s in each codeword (for example, five bits obtained by repeating one bit in the sequence formed by at least one-third of the sequence). For example, the receiving device obtains the bits in the sequence formed by at least one-third of the sequence by decoding every five consecutive bits in a second sequence to be decoded. Usually, the idea of ​​the majority rule can be adopted; a value with the highest frequency is taken as the decoded result of the codeword. Assuming that the N bits in each codeword include N1 “1s” and N2 “0s”, where N = N1 + N2, then: if N1 > N2, the codeword is decoded as “1”; if N1 <N2, a palavra-código é decodificada como “0”; e se N1=N2, a palavra-código pode ser determinada como “1” ou “0” de acordo com a regra predefinida.Furthermore, if N1=N2, the codeword can be determined based on other information, such as the CRC bit or the parity bit. For example, the receiving device can determine the codeword based on the parity bit in the case of N1=N2. Specifically, assuming N1=N2 in a first codeword, then the receiving device can determine a decoded result of the first word. Petition 870250078547, dated 03 / 09 / 2025, page 65 / 355 59 / 141 code based on a decoded codeword (or codewords) used to generate the parity bit and a parity code value. For another example, the receiving device can determine the codeword based on the CRC bit in the case of N1=N2. Specifically, assuming that N1=N2 in the first codeword, then the receiving device can determine the decoded result of the first codeword based on a decoded codeword used (or used) to generate the CRC bit and a CRC bit value.Furthermore, after the receiving device obtains the sequence formed by at least one third sequence, the receiving device can, according to the mapping relation, map the third sequence to a bit (e.g., the first mapping relation) or map the third sequence to a coding group (e.g., the second mapping relation), to obtain the first sequence formed by the bit (or bits) or the coding group (or coding group). For example, in one embodiment, the zero-power device can calculate a Hamming distance between the third sequence and a candidate sequence corresponding to 1 and a Hamming distance between the third sequence and a candidate sequence corresponding to 0 and select a value corresponding to the candidate sequence with the smallest Hamming distance as the bit value in the first sequence.

[00209] In this mode, when the zero-power device performs repeat encoding on the bit values ​​in the sequence formed by at least one third sequence, the receiving device has bit-level error correction capability, that is, when there is an error in the repeat code corresponding to the bit, the receiving device Petition 870250078547, dated 03 / 09 / 2025, p. 66 / 355 60 / 141 reception is able to correctly determine an original bit corresponding to the codeword, thus improving the data transmission performance of the zero-power device.

[00210] In some embodiments, the zero-power device obtains the second sequence by performing repeat encoding on the third sequence.

[00211] For example, the zero-power device can obtain the second sequence by performing repeat encoding on each of the sequences by at least one third based on the number of repeat encoding repetitions.

[00212] For example, assuming that the number of repetitions (also referred to as redundancy) of the repeat encoding is N, then the zero-power device can obtain the second sequence by performing the repeat encoding on every third sequence. Compared to the first sequence, in the second sequence, every third sequence is repeated N times.

[00213] For example, assuming that the number of repetitions of the repeat encoding is N, then the zero-power device can obtain at least one third sequence by sequence mapping according to Table 2 to Table 4, and obtain the second sequence by performing repeat encoding on each third sequence in a sequence formed by at least one third sequence.

[00214] For example, the zero-power device can perform sequence mapping and repeat encoding according to Table 7: TABLE 7 Sequence mapping and repetition encoding Petition 870250078547, dated 03 / 09 / 2025, page 67 / 355 61 / 141 Bits in the first sequence Third sequences Output results of the repeat encoding 1 10 10 10 10... 10 (N 10s) 0 01 01 01 01 ... 01 (N 01s)

[00215] As illustrated in Table 7, the zero-power device performs sequence mapping on the bits of the first sequence according to Table 7, that is, 1 is mapped to 10 and repeat encoding is performed on 10 to obtain N 10s, and 0 is mapped to 01 and repeat encoding is performed on 01 to obtain N 01s.

[00216] For example, the zero-power device can perform sequence mapping and repeat encoding according to Table 8: TABLE 8 Sequence mapping and repeat encoding Bits in the first sequence Third sequences Repeat encoding output results 1 1001 1001 1001 1001 ... 1001 (N 1001s) 0 0110 0110 0110 0110 ... 0110 (N 0110s)

[00217] As illustrated in Table 8, the zero-power device performs sequence mapping on the bits of the first sequence according to Table 8, that is, 1 is mapped to 1001 and repeat encoding is performed on 1001 to obtain N 1001s, and 0 is mapped to 0110 and repeat encoding is performed on 0110 to obtain N 0110s. Petition 870250078547, dated 03 / 09 / 2025, page 68 / 355 62 / 141

[00218] For example, the zero-power device can perform sequence mapping and repeat encoding according to Table 7: TABLE 9 Sequence mapping and repeat encoding Bits in the first sequence Third sequences Repeat encoding output results 1 1110 1110 1110 1110... 1110 (N 1110s) 0 0001 0001 0001 0001. 0001 (N 0001s)

[00219] As illustrated in Table 9, the zero-power device performs sequence mapping on the bits of the first sequence according to Table 9, that is, 1 is mapped to 1110 and repeat encoding is performed on 1110 to obtain N 1110s, and 0 is mapped to 0001 and repeat encoding is performed on 0001 to obtain N 0001s.

[00220] For example, assuming the first sequence is 0110, at least one third sequence is obtained by mapping each bit in the first sequence to a third sequence according to Table 2. Specifically, the sequence of at least one third includes the first 01, the first 10, the second 10, and the second 01, that is, 01 10 10 01. Based on this, the zero-power device can obtain a second sequence by performing repeat encoding on a third sequence within a sequence formed by at least one third sequence. For example, if the number of repetitions N=5, the second sequence is: “01010101 1010101010 1010101010 0101010101”. Petition 870250078547, dated 03 / 09 / 2025, page 69 / 355 63 / 141

[00221] For another example, assuming the first sequence is 0110, then the zero-power device divides 0110 into two encoding groups, that is, 01 and 10, and then sequence mapping is performed on 01 and 10 according to Table 5, to obtain at least one third sequence including 0110 and 1001, that is, 0110 1001. Based on this, the zero-power device can obtain a second sequence by performing repetition encoding on a third sequence within a sequence formed by at least one third sequence. For example, if the number of repetitions N=5, the second sequence is: “01100110011001100110 10011001100110011001”.

[00222] For the receiving device, the receiving device can decode according to the number of 0s and 1s in a codeword in every third sequence (for example, five bits obtained from one bit in the sequence formed by at least one third sequence during repeat encoding in the third sequence). For example, the receiving device obtains a third sequence by decoding every five consecutive sequences into a second sequence to be decoded. For example, when the receiving device decodes 01010101, the receiving device divides 01010101 into five 01s and then decodes the first bit (i.e., 0) in the third sequence based on the first bits (i.e., five 0s) in the five 01s. Typically, the receiving device may adopt the idea of ​​majority rule and assume a value with the highest frequency as the decoded result of the codeword.Assuming that the N bits in each codeword include N1 “1s” and N2 “0s”, where. N = N1 + N2, therefore: if N1 > N2, the codeword is decoded as Petition 870250078547, dated 03 / 09 / 2025, p. 70 / 355 64 / 141 1; if N1 <N2, a palavra-código é decodificada como “0”; e se If N1=N2, the codeword can be determined as 1 or 0 according to the predefined rule. Furthermore, if N1=N2, the codeword can be determined based on other information, such as the CRC bit or the parity bit. For example, the receiving device can determine the codeword based on the parity bit in the case of N1=N2. Specifically, assuming N1=N2 in a first codeword, then the receiving device can determine a decoded result of the first codeword based on a decoded codeword (or codewords) used to generate the parity bit and a parity code value. For another example, the receiving device can determine the codeword based on the CRC bit in the case of N1=N2. Specifically, assuming that N1=N2 in the first codeword, then the receiving device can determine the decoded result of the first codeword based on a decoded codeword (or decoded codewords) used to generate the CRC bit and a CRC bit value. Furthermore, after the receiving device obtains the sequence formed by at least one third sequence, the receiving device can map the third sequence to a bit according to the mapping relation (e.g., the mapping relation as illustrated in Table 2) or map the third sequence to a coding group according to the mapping relation (e.g., the mapping relation as illustrated in Table 5), to obtain the first sequence formed by the bit (or bits) or the coding group (or coding groups). For example, in one embodiment, the zero-power device can calculate a distance of Petition 870250078547, dated 03 / 09 / 2025, p. 71 / 355 65 / 141 A Hamming distance is calculated between the third sequence and a candidate sequence corresponding to 1, and a Hamming distance is calculated between the third sequence and a candidate sequence corresponding to 0, and a value corresponding to the candidate sequence with the smallest Hamming distance is selected as the bit value in the first sequence.

[00223] In this mode, when the zero-power device performs repeat encoding on each of the sequences of at least one third, the receiving device has bit-level error correction capability, that is, when there is an error in the repeat code corresponding to the bit, the receiving device is able to correctly determine an original bit corresponding to the codeword, thus improving the data transmission performance of the zero-power device.

[00224] In some embodiments, the zero-power device obtains the second sequence by performing repeat encoding on the sequence formed by at least one third sequence.

[00225] For example, the zero-power device can obtain the second sequence by performing repeat encoding on the sequence formed by at least one third sequence based on the number of repetitions of the repeat encoding.

[00226] For example, assuming that the number of repetitions (also referred to as redundancy) of the repeat encoding is N, then the zero-power device can obtain the second sequence by performing the repeat encoding on the sequence formed by at least one third sequence. Compared to the first sequence, Petition 870250078547, dated 03 / 09 / 2025, page 72 / 355 66 / 141 in the second sequence, the sequence formed by at least one third sequence is repeated N times.

[00227] For example, assuming the first sequence is 0110, then at least one third sequence is obtained by mapping each bit in the first sequence to a third sequence according to Table 2. Specifically, the sequence of at least one third includes the first 01, the first 10, the second 10, and the second 01, that is, 01 10 10 01. Based on this, the zero-power device can obtain a second sequence by performing repeat encoding on a sequence formed by at least one third sequence. For example, if the number of repetitions N=5, the second sequence is: “01101001 01101001 01101001 01101001 01101001”.

[00228] For another example, assuming the first sequence is 0110, then the zero-power device divides 0110 into two encoding groups, that is, 01 and 10, and then performs sequence mapping on 01 and 10 according to Table 5, to obtain at least one third sequence including 0110 and 1001, that is, 0110 1001. Based on this, the zero-power device can obtain a second sequence by performing repeat encoding on a sequence formed by at least one third sequence. For example, if the number of repetitions N=5, the second sequence is: 01101001 01101001 01101001 01101001 01101001”.

[00229] For the receiving device, the receiving device can decode according to the number of 0s and 1s in each codeword (for example, five bits obtained from a bit in the sequence formed by at least one Petition 870250078547, dated 03 / 09 / 2025, page 73 / 355 67 / 141 third sequence during repeat encoding in the sequence formed by at least one third sequence). For example, when the receiving device decodes a second sequence to be decoded, the receiving device divides the second sequence to be decoded into five 01101001 and then decodes the first bit (i.e., 0) in the sequence formed by at least one third sequence based on the first bits (i.e., five 0s) in the five 01101001. Typically, the receiving device may adopt the idea of ​​majority rule and assume a value with the highest frequency as the decoded result of the codeword. Assuming that the N bits in each codeword include N1 = 1s and N2 = 0s, where N = N1 + N2, then: if N1 > N2, the codeword is decoded as 1; if N1 <N2, a palavra-código é decodificada como “0; e se N1=N2, a palavra-código pode ser determinada como “1 ou “0 de acordo com a regra predefinida. Além disso, se N1=N2, a palavra-código pode ser determinada com base em outras informações, como o bit CRC ou o bit de paridade. Por exemplo, o dispositivo de recepção pode determinar a palavra-código com base no bit de paridade no caso de N1=N2. Especificamente, supondo que N1=N2 em uma primeira palavra-código, então o dispositivo de recepção pode determinar um resultado decodificado da primeira palavracódigo com base em uma palavra-código (ou palavras-código) decodificada usada para gerar o bit de paridade e um valor do código de paridade. Para outro exemplo, o dispositivo de recepção pode determinar a palavra-código com base no bit CRC no caso de N1=N2.Specifically, assuming that N1=N2 in the first codeword, then the receiving device can determine the decoded result of the first codeword. Petition 870250078547, dated 03 / 09 / 2025, page 74 / 355 68 / 141 based on a decoded codeword (or decoded codewords) used to generate the CRC bit and a CRC bit value. Furthermore, after the receiving device obtains the sequence formed by at least one third sequence, the receiving device can map the third sequence to a bit according to the mapping relation (e.g., the mapping relation as illustrated in Table 2) or map the third sequence to a coding group according to the mapping relation (e.g., the mapping relation as illustrated in Table 5), to obtain a first sequence formed by the bit (or bits) or the coding group (or coding groups).For example, in one embodiment, the zero-power device can calculate a Hamming distance between the third sequence and a candidate sequence corresponding to 1, and a Hamming distance between the third sequence and a candidate sequence corresponding to 0, and select a value corresponding to the candidate sequence with the smallest Hamming distance as the bit value in the first sequence.

[00230] In this mode, when the zero-power device performs repeat encoding in the sequence of at least one-third, the receiving device has bit-level error correction capability, that is, when there is an error in the repeat code corresponding to the bit, the receiving device is able to correctly determine an original bit corresponding to the codeword, thus improving the data transmission performance of the zero-power device.

[00231] In some modes, when the number of bits in the first sequence is K, the number of repetitions of Petition 870250078547, dated 03 / 09 / 2025, p. 75 / 355 69 / 141 repetition encoding is N and the number of bits in each of the at least one third sequence is X, the number of bits in the second sequence is NχXxK, where N, X and K are each a positive integer.

[00232] For example, when the zero-power device maps each bit or multiple consecutive bits in the first sequence to a third sequence, if the number of bits in the first sequence is K, the number of repetitions of the repeat encoding is N, and the number of bits in each of at least one third sequence is X, the number of bits in the second sequence is NχXχK, where N, X, and K are each a positive integer.

[00233] In some embodiments, the third sequence is combined with any of the following coding schemes: NRZ coding, Manchester coding, unipolar Z coding, Miller coding, DBP coding, differential coding, PIE and FM0 coding.

[00234] For example, when the third sequence is combined with Manchester encoding, the first mapping relation may be the mapping relation illustrated in Table 2 or the second mapping relation may be the mapping relation illustrated in Table 5.

[00235] For example, when the third sequence is combined with the RZ encoding, the first mapping relation can be the mapping relation illustrated in Table 3.

[00236] In other alternative modalities, the third sequence may also correspond to other encoding schemes, which is not limited to the present disclosure. Petition 870250078547, dated 03 / 09 / 2025, page 76 / 355 70 / 141

[00237] For example, the third sequence could be a sequence combined with encoding in an activation mechanism.

[00238] Low Data Rate (LDR) and High Data Rate (HDR) WUR activation radio coding processing is illustrated in the following table: TABLE 10 WUR LDR WUR HDR Input bits Encoded bits Input bits Encoded bits 0 1010 0 10 1 0101 1 01

[00239] As described in Table 10, for the WUR LDR, when an input bit is 0, the encoded bits are 1010 and when the input bit is 1, the encoded bits are 0101. For the WUR HDR, when the input bit is 0, the encoded bits are 10 and when the input bit is 1, the encoded bits are 01. In connection with the solutions of the present disclosure, the first mapping relation can be a mapping relation between the input bits and the encoded bits under the WUR LDR or the WUR HDR. For example, when the first mapping relation is the mapping relation between the input bits and the encoded bits in the WUR LDR, if a value of a first bit in the first sequence is 0, 1010 is determined as the third sequence; and if the value of the first bit is 1, 0101 is determined as the third sequence. For another example, when the first mapping relation is the mapping relation between the input bits and the encoded bits in WUR HDR, if the value of the first bit Petition 870250078547, dated 03 / 09 / 2025, p. 77 / 355 If 71 / 141 in the first sequence is 0, then 10 is determined as the third sequence; and if the value of the first bit is 1, then 01 is determined as the third sequence.

[00240] In some forms, the first sequence includes a fourth sequence and a CRC bit corresponding to the fourth sequence.

[00241] For example, the CRC bit is determined according to the fourth sequence.

[00242] For example, the CRC bit includes one or more consecutive bits.

[00243] For example, the zero-power device adds M CRC bits based on a fourth sequence with the number of Y bits (e.g., Y is a positive integer) (e.g., by adding the CRC bits M at a position in the fourth sequence, or by adding a different bit between the CRC bits M at a different position in the first sequence), to obtain a sequence with the added CRC bits (i.e., the first sequence), with a length of Y+M bits. Then, the zero-power device obtains an encoded sequence of (Y+M)xN bits (i.e., the second sequence) by encoding the first sequence based on redundancy N. Finally, the zero-power device obtains a modulated signal by modulating the second sequence and sends the modulated signal. The modulation scheme for the second sequence includes, but is not limited to, OOK modulation, ASK modulation, PSK modulation, FSK modulation, etc.

[00244] Similarly, the receiver obtains a second sequence of (Y+ M)xN bits by demodulating a received signal and then obtains a first sequence with a length of Y+ M bits through a process of Petition 870250078547, dated 03 / 09 / 2025, p. 78 / 355 72 / 141 decoding corresponding to the repeat code, where the first sequence is a bit sequence with the CRC bits added based on the fourth sequence. The receiver performs CRC verification based on the CRC polynomial in the CRC encoding. For example, if the CRC verification passes, the fourth bit sequence Y will be considered correctly received; otherwise, the fourth bit sequence Y will be considered incorrectly received and retransmission of the fourth sequence data will be necessary.

[00245] In this mode, by introducing the CRC bit (or CRC bits) during signal reception, the receiver can verify the signal sent by the zero-power device to determine if the data sent by the zero-power device was successfully received. In other words, error detection in the data sent by the zero-power device is supported at the receiver, further improving the data transmission performance of the zero-power device.

[00246] In some modes, the CRC bit is positioned after the fourth sequence.

[00247] For example, the final M bits in the first sequence are CRC bits.

[00248] In some forms, the first sequence includes a fourth sequence and at least one parity bit.

[00249] For example, the zero-power device adds S parity bits (e.g., S is a positive integer) based on a fourth sequence with the number of Y bits (e.g., Y is a positive integer) (e.g., adding the S parity bits at a position in Petition 870250078547, dated 03 / 09 / 2025, p. 79 / 355 73 / 141 fourth sequence, or by adding a different bit between the S parity bits at a different position in the first sequence), to obtain a sequence with the added parity bits (i.e., the first sequence), with a length of Y+S bits. Then, the zero-power device obtains an encoded sequence of (Y+S)xN bits (i.e., the second sequence) by encoding the first sequence based on redundancy N. Finally, the zero-power device obtains a modulated signal by modulating the second sequence and sends the modulated signal. The modulation scheme for the second sequence includes, but is not limited to, OOK modulation, ASK modulation, PSK modulation, FSK modulation, etc.

[00250] Correspondingly, the receiver obtains a second sequence of (Y+S)xN bits by demodulating a received signal and then obtains a first sequence with a length of Y+S bits through a decoding process corresponding to the repeat code, where the first sequence is a sequence of bits with the parity bits added based on the fourth sequence. The receiving device can determine the fourth sequence with the number of Y bits and the parity bits with the number of bits. S in the first sequence according to the way in which the zero-power device adds the parity bits S. Furthermore, if there is a bit to be determined in the fourth sequence, the receiver can perform parity checking on the bit to be determined according to a method of determination in the parity bit encoding and perform error correction through parity checking.

[00251] In this mode, by introducing at least one parity bit during signal reception, the receiver Petition 870250078547, dated 03 / 09 / 2025, p. 80 / 355 74 / 141 can support parity checking on the signal sent by the zero-power device. In other words, error correction can be performed on the bits in the fourth sequence when transmission errors occur, further improving the data transmission performance of the zero-power device.

[00252] It can be noted that at least one parity bit can be used to assist the receiving end in error correction. Specifically, in bits to determine a first parity bit of at least one parity bit, when the number of 1s is even, the first parity bit is set to 0; otherwise, the first parity bit is set to 1. Alternatively, when the number of 1s is even, the first parity bit is set to 1; otherwise, the first parity bit is set to 0.

[00253] In some modes, at least one parity bit is positioned after the fourth sequence.

[00254] For example, S the final bits in the first sequence are parity bits.

[00255] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split, and the first parity bit between at least one parity bit is positioned after a first check group between at least one check group.

[00256] For example, the fourth sequence includes at least one check group after the split, and each of the at least one check group is followed by W (W>1) parity bits. In other words, the first sequence can be obtained by interleaving at least one check group. Petition 870250078547, dated 03 / 09 / 2025, p. 81 / 355 75 / 141 and at least one parity bit.

[00257] In some embodiments, the first sequence includes a fourth sequence, a CRC bit corresponding to the fourth sequence, and at least one parity bit.

[00258] For example, the zero-power device adds, based on a fourth sequence with the number of bits Y (for example, Y is a positive integer), M CRC bits (for example, adding the CRC bits M at a position in the fourth sequence, or adding a different bit between the CRC bits M at a different position in the first sequence) and S parity bits (for example, adding the parity bits S at a position in the fourth sequence, or adding a different bit between the parity bits S at a different position in the first sequence), to obtain a sequence with the added parity bits (that is, the first sequence), with a length of Y+M+S bits. Then, the zero-power device obtains a second sequence by performing repeat encoding on the first sequence based on redundancy N.In one embodiment, the zero-power device obtains an encoded sequence of (Y + M + S)χN bits (i.e., the second sequence) by performing repeat encoding directly on the bits of the first sequence. In another embodiment, the zero-power device can obtain at least a third sequence by mapping each bit in the first sequence to a third sequence with the number of X bits and then obtain an encoded sequence of (Y + M + S)χXχN bits (i.e., the second sequence) by performing repeat encoding based on a sequence formed by at least one third sequence. In yet another embodiment, the device... Petition 870250078547, dated 03 / 09 / 2025, page 82 / 355 76 / 141 zero power can divide the first sequence into at least one encoding group and map at least one encoding group to at least a third sequence. If the encoding group has U bits and the third sequence has X bits, an encoded sequence of (Y + M + S) / U x X x N bits (i.e., the second sequence) can be obtained by performing repeat encoding based on a sequence formed by at least one third sequence. After the zero power device obtains the second sequence, the zero power device obtains a modulated signal by modulating the second sequence and sends the modulated signal. The modulation scheme for the second sequence includes, but is not limited to, OOK modulation, ASK modulation, PSK modulation, FSK modulation, etc.

[00259] Similarly, the receiver demodulates a received signal to obtain a second sequence with the number of (Y + M + S) x N bits, (Y + M + S) x X x N bits, or (Y + M + S) / U x X x N bits. Then, the receiver obtains a first sequence with a length of Y + M + S bits through a decoding process and an inverse mapping (when necessary) that corresponds to the repeat code, where the first sequence is a bit sequence with the CRC bits and parity bits added based on the fourth sequence. Based on this, on the one hand, the receiver performs CRC checking based on the CRC polynomial in the CRC encoding. Specifically, if the CRC check passes, the fourth bit sequence Y will be considered correctly received; otherwise, the fourth bit sequence Y will be considered incorrectly received and retransmission of the fourth sequence data will be necessary. On the other hand, the device of Petition 870250078547, dated 03 / 09 / 2025, page 83 / 355 77 / 141 reception can determine the fourth sequence with the number of bits Y and the parity bits with the number of bits S in the first sequence according to the way in which the zero-power device adds the parity bits S. Furthermore, if there is a bit to be determined in the fourth sequence, the receiver can perform parity checking on the bit to be determined according to a determination method in the parity bit encoding and perform error correction by means of parity checking.

[00260] In this mode, by introducing the CRC bit (or CRC bits) and at least one parity bit, during signal reception, the receiver can support CRC checking and parity checking on the signal sent by the zero-power device, so that error detection in the data sent by the zero-power device is supported at the receiver and error correction can be performed on the bits in the fourth sequence when transmission errors occur, thus further improving the data transmission performance of the zero-power device.

[00261] It can be noted that there are two ways for the zero-power device to add the parity bit and the CRC bit as follows.

[00262] Method 1:

[00263] The zero-power device first adds the parity bit (or bits) (the number of bits is S, S>1) based on the fourth sequence (the number of bits is Y), to obtain a bit sequence with the added parity bits (the number of bits is Y+S), and based on this, the zero-power device adds the CRC bit (or bits) (the number of bits is M), to obtain a bit sequence with Petition 870250078547, dated 03 / 09 / 2025, page 84 / 355 78 / 141 the parity bit and the CRC bit added (the number of bits is Y+S+M), that is, the first sequence. Then, the zero-power device performs repeat encoding based on the first sequence and the redundancy N, to obtain a second sequence with the number of (Y+M+S)χN bits, (Y+M+S)χXχN bits, or (Y+M+S) / UχXχN bits, where X is the number of bits in a third sequence when a bit or encoding group in the first sequence is mapped to the third sequence, and U is the number of bits in an encoding group when the first sequence is split into at least one encoding group and each encoding group is mapped to a third sequence.

[00264] Mode 2:

[00265] The zero-power device first adds the CRC bit (or CRC bits) ((the number of bits is S, S>1) is M) based on the fourth sequence (the number of bits is Y), to obtain a bit sequence with the CRC bits added (the number of bits is Y+M) and, based on this, the zero-power device adds the parity bit (or parity bits) (the number of bits is S, S>1), to obtain a bit sequence with the parity bit and the CRC bit added (the number of bits is Y+M+S), that is, the first sequence.Next, the zero-power device performs repeat encoding based on the first sequence and the redundancy N, to obtain a second sequence with the number of (Y+M+S)χN bits, (Y+M+S)χXχN bits, or (Y+M+S) / UχXχN bits, where X is the number of bits in a third sequence when a bit or encoding group in the first sequence is mapped to the third sequence, and U is the number of bits in an encoding group when the first sequence is split into at least one group. Petition 870250078547, dated 03 / 09 / 2025, p. 85 / 355 79 / 141 encoding and each encoding group is mapped to a third sequence.

[00266] In some modes, the first sequence includes sequentially: the fourth sequence, the CRC bit, and at least one parity bit.

[00267] For example, the final S bits in the first sequence are at least one parity bit, and the M bits preceding at least one parity bit are the CRC bits.

[00268] In some modes, the first sequence includes sequentially: the fourth sequence, at least one parity bit, and the CRC bit.

[00269] For example, the final M bits in the first sequence are the CRC bits, and the S bits preceding the CRC bit are at least one parity bit.

[00270] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split, a first parity bit between at least one parity bit is positioned after a first check group between at least one check group, and the CRC bit is positioned after a sequence formed by the fourth sequence and at least one parity bit.

[00271] For example, W (W is a positive integer) the first parity bits between at least one parity bit are positioned after the first check group between at least one check group. In other words, the fourth sequence includes at least one check group after the division, and each of the at least one check group is followed by W (W>1) parity bits. The CRC bit (or CRC bits) is positioned after the sequence formed by Petition 870250078547, dated 03 / 09 / 2025, page 86 / 355 80 / 141 fourth sequence and at least one parity bit. In other words, the CRC bit can be added after a sequence obtained by interleaving at least one check group and at least one parity bit.

[00272] In some embodiments, a sequence formed by the fourth sequence and the CRC bit is a split sequence, the split sequence includes at least one check group after the split, and the first parity bit between at least one parity bit is positioned after a first check group between at least one check group.

[00273] For example, W (W is a positive integer) the first parity bits between at least one parity bit are positioned after the first check group between at least one check group. In other words, the sequence formed by the fourth sequence and the CRC bit (or CRC bits) includes at least one check group after the division, and each of the at least one check group is followed by W (W>1) parity bits. In other words, the CRC bit can be added after a sequence obtained by interleaving at least one check group and at least one parity bit.

[00274] Figure 17 is an example illustrating a positional relationship between one or more check groups (or check groups) and one or more parity bits in a first sequence given in the embodiments of the present disclosure.

[00275] As illustrated in (a) in Figure 17, the zero-power device can obtain a first sequence by adding only one or more parity bits to the end of the Petition 870250078547, dated 03 / 09 / 2025, p. 87 / 355 81 / 141 fourth sequence. As illustrated in (b) in Figure 17, the zero-power device can obtain a first sequence by adding one or more parity bits after each L bits (i.e., each check group) in the fourth sequence, where L can be specified in the protocol or can be indicated by the network device. In other words, the zero-power device can divide a fourth bit sequence Y into check groups Y / L, and each L consecutive bits are followed by one or more parity bits. As illustrated in (c) in Figure 17, the zero-power device can also add J parity bits, where J can be specified in the protocol or can be indicated by the network device. For example, the zero-power device can divide the sequence to be split (e.g., the fourth sequence or the sequence formed by the fourth sequence and the CRC bit) into check groups P (P>1, P <j), em que cada grupo de verificação é seguido por um ou mais bits paridade. por exemplo, quando p igual a j, o dispositivo potência zero pode dividir sequência ser dividida (por quarta formada pela e bitCRC) in J parity groups, where each parity group is followed by a parity bit, i.e., B1 to Bj are distributed among and interleaved with the J parity groups, to obtain the first sequence.

[00276] In some embodiments, a check group used to determine the first parity bit among at least one check group does not overlap with a check group used to determine a parity bit other than the first parity bit among at least one check group. Petition 870250078547, dated 03 / 09 / 2025, p. 88 / 355 82 / 141

[00277] For example, at least one check group is in one-to-one correspondence with at least one parity bit.

[00278] For example, when the number of at least one parity bit is greater than 1, different parity bits may correspond to different data, respectively (that is, the data used to determine different parity bits do not overlap). For example, assuming there is a parity bit in each of the three positions, namely ki, kj and km (i <j<m), na primeira sequência, então o bit de paridade posição ki é determinado acordo com os bits anteriores a (não há anterior ki), kj entre ki+1 e kj-1 (incluindo kj-1), km kj+1 km-1 km-1).

[00279] In some modes, the first parity bit is determined according to the first check group.

[00280] For example, the first check group is any one of at least one check group. In other words, any one of at least one check group is followed by a parity bit determined based on any check group.

[00281] In some embodiments, the check group used to determine the first parity bit among at least one check group overlaps at least partially with the check group used to determine the parity bit other than the first parity bit among at least one check group. Petition 870250078547, dated 03 / 09 / 2025, p. 89 / 355 83 / 141

[00282] For example, at least one check group is in many-to-one correspondence with at least one parity bit.

[00283] In some modes, the first parity bit is determined according to the first check group and a check group prior to the first check group.

[00284] For example, the first check group is any one of the at least one check group. In other words, any one of the at least one check group is followed by a parity bit determined based on the following information: the any check group and a check group preceding the any check group.

[00285] For example, when the number of at least one parity bit is greater than 1, different parity bits may correspond to different data, respectively (that is, the data used to determine different parity bits do not overlap). For example, assuming there is a parity bit in each of the three positions, namely ki, kj and km (i <j<m), então o bit de paridade na posição ki é determinado acordo com os bits anteriores a (não há anterior ki), kj incluindo e km kj).

[00286] In some modes, the first parity bit is determined according to the first group of Petition 870250078547, dated 03 / 09 / 2025, p. 90 / 355 84 / 141 check, the check group preceding the first check group and a parity bit determined based on the check group preceding the first check group between at least one parity bit.

[00287] For example, the first check group is any one of at least one check group. In other words, any one of at least one check group is followed by a parity bit determined based on the following information: the any check group, a check group preceding the any check group, and a parity bit determined based on the check group preceding the any check group.

[00288] For example, when the number of at least one parity bit is greater than 1, different parity bits may correspond to different data, respectively (that is, the data used to determine different parity bits do not overlap). For example, assuming there is a parity bit in each of the three positions, namely ki, kj and km (i <j<m), então o bit de paridade na posição ki é determinado acordo com os bits anteriores a (não há anterior ki), kj (incluindo e km kj).

[00289] Figure 18 is another example that illustrates a positional relationship between check groups and parity bits in a first sequence provided in modes of Petition 870250078547, dated 03 / 09 / 2025, p. 91 / 355 85 / 141 present revelation.

[00290] Assume that the first sequence or the sequence formed by the first sequence and the CRC bit includes two check groups after the split. As illustrated in (a) in Figure 18, in one embodiment, the first parity bit is determined according to the first check group between the two check groups and then added after the first check group, and the second parity bit is determined according to the second check group between the two check groups and then added after the second check group, thus obtaining the first sequence.As illustrated in (b) of Figure 18, in another embodiment, the first parity bit is determined according to the first check group between the two check groups and then added after the first check group, and the second parity bit is determined according to the two check groups (which may or may not include the first parity bit) and then added after the second check group, thus obtaining the first sequence.

[00291] In some forms, the fourth sequence is a sequence of data bits.

[00292] For example, the sequence of data bits can also be called the original data sequence.

[00293] In some embodiments, the 200 method may further include the following. The zero-power device first obtains the maximum number of bits in each of at least one check group and then divides each consecutive maximum number of bits in the sequence to be divided into at least one check group. Petition 870250078547, dated 03 / 09 / 2025, p. 92 / 355 86 / 141

[00294] For example, the maximum number of bits is a positive integer.

[00295] In some modes, the number of bits in each of at least one check group is the maximum number of bits.

[00296] In some embodiments, when the number of bits in the sequence to be split is equal to an integer multiple of the maximum number of bits, the number of bits in each of at least one check group is the maximum number of bits.

[00297] In some embodiments, when the number of indivisible bits in the sequence to be split is less than the maximum number of bits, a final check group between at least one check group is obtained based on the indivisible bits and a padding bit (padding bits), wherein the total number of indivisible bits and the padding bit (padding bits) is the maximum number of bits.

[00298] For example, if the number of bits in the sequence to be split is not equal to an integer multiple of the maximum number of bits, when the number of indivisible bits in the sequence to be split is less than the maximum number of bits, the zero-power device can obtain the final check group from at least one check group based on the indivisible bits and the padding bit (or padding bits), where the total number of indivisible bits and the padding bit (or padding bits) is the maximum number of bits.

[00299] In other alternative modes, if the number of indivisible bits in the sequence to be divided is Petition 870250078547, dated 03 / 09 / 2025, p. 93 / 355 87 / 141 less than the maximum number of bits, the indivisible bits cannot be discarded, which is not limited in the present disclosure.

[00300] In some embodiments, the number of bits in each of at least one check group, except the final check group, is the maximum number of bits, and the number of bits in the final check group is less than the maximum number of bits.

[00301] For example, if the number of bits in the sequence to be split is not equal to an integer multiple of the maximum number of bits, the number of bits in each of at least one check group, except the final check group, is the maximum number of bits and the number of bits in the final check group is less than the maximum number of bits.

[00302] In other alternative embodiments, the number of bits in another check group may be less than the maximum number of bits, which is not specifically limited in the embodiments of the present disclosure. For example, in a particular embodiment, the number of bits in each of at least one check group, except the first check group, may be the maximum number of bits, and the number of bits in the first check group may be less than the maximum number of bits.

[00303] In some embodiments, when the number of indivisible bits in the sequence to be split is less than the maximum number of bits, the indivisible bits are determined as the final check group among at least one check group.

[00304] For example, if the number of bits in Petition 870250078547, dated 03 / 09 / 2025, p. 94 / 355 88 / 141 sequence to be split is not equal to an integer multiple of the maximum number of bits, when the number of indivisible bits in the sequence to be split is less than the maximum number of bits, the zero-power device can directly determine the indivisible bits as the final check group among at least one check group.

[00305] In some modes, the maximum number of bits is configured by the network device or the maximum number of bits is default.

[00306] The maximum number of bits may be predefined by pre-saving corresponding codes, tables, or other forms that indicate related information on a device (for example, including a terminal device and a network device), which is not limited to the present disclosure. For example, predefined may refer to defined in the protocol. It may also be understood that, in embodiments of the present disclosure, protocol may refer to the standard protocol in the field of communication, such as the LTE protocol, the NR protocol, and related protocols applicable to future communication systems, which is not limited to the present disclosure.

[00307] In some modes, the zero-power device determines the maximum number of bits based on the number of bits in the sequence to be split.

[00308] For example, the relationship between the number of bits in the sequence to be divided and the maximum number of bits is positively correlated. That is, a larger number of bits in the sequence to be divided leads to a larger maximum number of bits. Similarly, a smaller number of bits in the sequence to be divided leads to a smaller maximum number of bits. Petition 870250078547, dated 03 / 09 / 2025, p. 95 / 355 89 / 141

[00309] In some embodiments, the zero-power device first obtains a third mapping relation, wherein the third mapping relation includes a correspondence between several values ​​and several candidate bit numbers, and the several values ​​include a third value with a minimum difference from the number of bits in the sequence to be split. Then the zero-power device determines a candidate bit number corresponding to the third value as the maximum number of bits.

[00310] For example, the third mapping relationship can be configured by the network device, can be predefined, can be determined by the zero-power device, or can be negotiated between the zero-power device and the network device.

[00311] In some embodiments, the third mapping relationship is a mapping relationship determined by the zero-power device from several mapping relationships configured by the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device from several predefined mapping relationships.

[00312] For example, the third mapping relation may be a mapping relation combined with the number of bits in the first sequence (or the type of information in the first sequence, etc.) among the multiple mapping relations. The type of information in the first sequence includes, but is not limited to, a data type, a control type, etc.

[00313] In some embodiments, the zero-power device first obtains a fourth mapping relation, where the fourth mapping relation includes a Petition 870250078547, dated 03 / 09 / 2025, p. 96 / 355 90 / 141 correspondence between various value ranges and various bit numbers, and the number of bits in the sequence to be divided is in a first value range among the various value ranges. Then, the zero-power device determines the number of bits corresponding to the first value range as the maximum number of bits.

[00314] For example, the fourth mapping relationship can be configured by the network device, can be predefined, can be determined by the zero-power device, or can be negotiated between the zero-power device and the network device.

[00315] In some embodiments, the fourth mapping relationship is a zero-power device-determined mapping relationship from the various mapping relationships configured by the network device, or the fourth mapping relationship is a zero-power device-determined mapping relationship from the various predefined mapping relationships.

[00316] For example, the fourth mapping relation may be a mapping relation combined with the number of bits in the first sequence (or the type of information in the first sequence, etc.) among the multiple mapping relations. The type of information in the first sequence includes, but is not limited to, a data type, a control type, etc.

[00317] In some embodiments, the zero-power device obtains a fourth value, where the fourth value indicates the number of at least one check group and / or the number of at least one parity bit. Then, the zero-power device determines the maximum number of bits based on the number of bits in the sequence to be split and on Petition 870250078547, dated 03 / 09 / 2025, p. 97 / 355 91 / 141 room value.

[00318] In some embodiments, the zero-power device determines the maximum number of bits based on a ratio of the number of bits in the sequence to be divided to the fourth value.

[00319] For example, the zero-power device directly determines the ratio between the number of bits in the sequence to be divided and the fourth value as the maximum number of bits.

[00320] For example, the zero-power device determines a value by rounding up the ratio of the number of bits in the sequence to be divided to the fourth value as the maximum number of bits. Alternatively, the zero-power device determines a value by rounding down the ratio of the number of bits in the sequence to be divided to the fourth value as the maximum number of bits.

[00321] In some modes, the fourth value is configured by the network device or the fourth value is the default.

[00322] For example, the fourth value can be a value determined from several values ​​configured by the network device or several predefined values. For instance, the fourth value can be a mapping ratio corresponding to the number of bits in the first sequence (or the information type of the first sequence, etc.) between the various values. The information type of the first sequence includes, but is not limited to, a data type, a control type, etc.

[00323] In some embodiments, method 200 may also include the following. The zero-power device interposes the second sequence. Petition 870250078547, dated 03 / 09 / 2025, p. 98 / 355 92 / 141

[00324] For example, merging can be implemented through row-column merging, that is, row-in and column-out, similar to merging in NR.

[00325] For example, when the zero-power device performs repeat encoding on the bit values ​​in the first sequence, the zero-power device performs interleaving according to the length of the first sequence.

[00326] In the embodiments of the present disclosure, when the zero-power device performs repeat encoding on the bit values ​​in the first sequence, the zero-power device performs interleaving according to the length of the first sequence and can distribute N consecutive 1s or 0s, further improving the data transmission performance of the zero-power device.

[00327] Figure 19 is an example illustrating an interlacing principle provided in embodiments of the present disclosure.

[00328] As illustrated in (a) of Figure 19, when the zero-power device performs repeat encoding on the bit values ​​in the first sequence, if the first sequence includes bit 1 to bit k, the second sequence includes N repetitions of bit 1, N repetitions of bit 2, ..., and N repetitions of bit k. After the zero-power device performs interleaving according to the length of the first sequence, a sequence as illustrated in (b) of Figure 19, that is, N repetitions of the second sequence, can be obtained.

[00329] In some modalities, the 200 method may Petition 870250078547, dated 03 / 09 / 2025, page 99 / 355 93 / 141 also include the following. The first encoding is performed in the second sequence.

[00330] For example, the first encoding is used to implement a digital-to-analog conversion.

[00331] In some embodiments, method 200 may also include the following. The zero-power device obtains a first signal by modulating based on the second sequence or a sequence obtained by performing the first encoding on the second sequence and then sending the first signal.

[00332] For example, the first signal may be a backscattered signal, or the first signal may be a signal actively sent by the zero-power device.

[00333] In some embodiments, the first sequence includes a prefix sequence. The zero-power device obtains the first signal by modulating the second sequence or the sequence obtained by performing the first encoding on the second sequence.

[00334] In some embodiments, the zero-power device obtains a fifth sequence by adding the prefix sequence to the second sequence or the sequence obtained by performing the first encoding on the second sequence and then obtaining the first signal by modulating the fifth sequence.

[00335] For example, the zero-power device adds the prefix sequence before modulating the second sequence.

[00336] For example, the zero-power device adds the prefix sequence after modulating the second sequence.

[00337] In other alternative modalities, the Petition 870250078547, dated 03 / 09 / 2025, page 100 / 355 94 / 141 zero-power devices can also add the prefix sequence before performing repeat encoding, which is not specifically limited in the present disclosure. In other words, the prefix sequence may be involved in encoding (added before encoding) or may not be involved in encoding (added before modulation).

[00338] In some modes, the prefix sequence is configured by the network device, the prefix sequence is predefined, or the prefix sequence is determined according to the number of repetitions of the repeat encoding.

[00339] For example, a different number of repetitions may correspond to a different prefix sequence.

[00340] For example, the prefix sequence is used so that the receiving device can identify an initial data position when receiving data.

[00341] In some embodiments, a modulation scheme used for the second sequence or the sequence obtained by performing the first encoding on the second sequence includes at least one of the following: ASK modulation, OOK modulation, FSK modulation, or PSK modulation.

[00342] For example, the modulation scheme applied to the sequence obtained by performing the first encoding on the second sequence includes OOK modulation and ASK modulation.

[00343] OOK modulation and ASK modulation are used to convert bit 0 and bit 1 to their corresponding levels.

[00344] The modulation schemes are only Petition 870250078547, dated 03 / 09 / 2025, page 101 / 355 95 / 141 examples and should not be interpreted as a limitation to the present disclosure. For example, in other alternative modalities, more complex modulation schemes may be applied.

[00345] In some modalities, the first coding includes at least one of: NRZ coding, unipolar RZ coding, Manchester coding, Miller coding, DBP coding, differential coding, PIE coding or FM0 coding.

[00346] In some modes, method 200 may also include the following. The zero-power device sends the second sequence.

[00347] For example, the zero-power device can directly send the second repeat-encoded sequence.

[00348] For example, the second sequence may be a backscattered signal, or the second sequence may be a signal actively sent by the zero-power device.

[00349] In some embodiments, method 200 may also include the following. The zero-power device determines the number of repetitions of the repeat encoding based on at least one of the following pieces of information from the first sequence: a data block size, a bit rate, or a communication rate.

[00350] For example, a different communication rate corresponds to a different correspondence. For instance, for a given communication rate, a different number of repetitions N can be determined according to a different data block size and / or different bit rate. For another example, for a given rate of Petition 870250078547, dated 03 / 09 / 2025, p. 102 / 355 96 / 141 bits, a different number of repetitions N can be determined according to a different data block size and / or a different communication rate. For example, for a given data block size, a different number of repetitions N can be determined according to a different communication rate and / or a different bit rate. The correspondence can be implemented as a basis graph (BG).

[00351] It can be noted that the value of the number of repetitions N affects not only the data transmission performance but also the communication data rate. Generally, a higher number of repetitions N leads to better data transmission performance and a correspondingly lower data rate. In the embodiments of the present disclosure, in zero-power communication, the size of the data sent is different, and different application scenarios have different requirements for data transmission performance and communication rate.Based on this, the zero-power device can determine the number of repetitions of the repeat encoding based on at least one of the data block sizes, the bit rate, and the communication rate, so that the number of repetitions of the repeat encoding can support various values ​​of N, which means that a suitable value of N can be determined according to real communication scenarios, thus balancing data transmission performance and data transmission rate.

[00352] In other alternative modes, the zero-power device can also determine the number of repetitions of the repeat encoding based on at least one of the following pieces of information from the first sequence: a type of traffic from the first sequence or a scenario of Petition 870250078547, dated 03 / 09 / 2025, p. 103 / 355 97 / 141 application of the zero-power device. The application scenario can also be referred to as the communication scenario.

[00353] In some modes, the number of repetitions of the repeat encoding can be configured by the network device or the number of repetitions of the repeat encoding can be predefined.

[00354] For example, the number of repetitions in the repeat encoding can be a number of repetitions selected by the zero-power device from several repetition numbers. The various repetition numbers can be associated with at least one of the following: various data block sizes, various bit rates, various communication rates, various service types, and various application scenarios.

[00355] Figure 20 is a schematic flowchart illustrating the repetition coding provided in embodiments of the present disclosure.

[00356] After the zero-power device obtains the fourth sequence, the zero-power device can send a signal based on the fourth sequence, and the fourth sequence is a sequence of data bits. For example, in one mode, as illustrated in (a) in Figure 20, a first modulated signal is obtained by sequentially adding the parity bit, adding the CRC bit, performing repeat encoding, interleaving, performing the first encoding and modulation, and then the first signal is sent. By another example, in another mode, as illustrated in (a) in Figure 20, after the zero-power device obtains the fourth sequence, the device Petition 870250078547, dated 03 / 09 / 2025, page 104 / 355 98 / 141 zero power obtains a first modulated signal by sequentially adding the CRC bit, adding the parity bit, performing repeat encoding, interleaving, performing the first encoding and modulation, and then sending the first signal. The dashed boxes in the Figure indicate enhanced (i.e., optional) ways that can be selected according to the design in real implementations.

[00357] Figure 20 is merely an example in the present disclosure and should not be construed as a limitation to the present disclosure.

[00358] For example, repeat encoding in a pre-modulated sequence or bits in the pre-modulated sequence by the zero-power device can be extended to repeat encoding in modulated symbols.

[00359] It may be noted that, in the present disclosure, configuration by the network device includes, but is not limited to, a semi-static configuration and a dynamic indication. When configuration is performed by means of dynamic indication, information can be configured directly, or an index of information can be configured (i.e., configured indirectly), which is not specifically limited in the present disclosure.

[00360] The preferred embodiments of the present disclosure have been described in detail above with reference to the accompanying drawings. However, the present disclosure is not limited to the details described in the previous embodiments. Within the scope of the technical concept of the present disclosure, various simple modifications can be made to the technical solutions of the present disclosure, and these simple modifications are all within the scope of protection of the present disclosure. For example, Petition 870250078547, dated 03 / 09 / 2025, page 105 / 355 99 / 141 Several technical features described in the aforementioned modalities can be combined in any suitable way without contradiction, and to avoid unnecessary redundancy, several possible combinations are not described in this disclosure. By another example, several modalities of this disclosure can also be combined in any way, and as long as the combinations do not deviate from the idea of ​​this disclosure, they can also be considered as contents disclosed in this disclosure.

[00361] It can also be understood that, in various embodiments of the present disclosure, the magnitude of a sequence number for each of the processes mentioned does not signify an order of execution, and an order of execution for each process can be determined according to a function and an internal logic of the process, which should not constitute any limitation to the process of implementing the embodiments of the present disclosure.

[00362] The wireless communication method provided in embodiments of the present disclosure is described in detail above in connection with Figures 16 to 20 from the perspective of repeat encoding by the zero-power device, and a wireless communication method provided in embodiments of the present disclosure will be described below in connection with Figure 21 from the perspective of repeat decoding by the zero-power device.

[00363] Figure 21 is a schematic flowchart of a 300 wireless communication method provided in embodiments of the present disclosure.

[00364] It can be noted that the wireless communication method 300 can be performed by a receiving device, Petition 870250078547, dated 03 / 09 / 2025, page 106 / 355 100 / 141 and the receiving device can be a network device or a terminal device. In other words, the wireless communication method is applied to wireless communication between the receiving device and a sending device (including at least one of the following: the terminal device that receives data sent by the network device, the network device that receives data sent by the terminal device, or the terminal device that receives data sent by the terminal device). For example, the terminal device can be a zero-power device, and the zero-power device can be a device that supports at least one of the following communication modes: backcast communication or active transmission communication. For example, the zero-power device can be a conventional NR terminal loaded with or integrated into a backcast communication module.

[00365] As illustrated in Figure 21, method 300 may include the following.

[00366] In S310, a first sequence is obtained by performing repeat decoding based on a second sequence to be decoded.

[00367] In some modes, operations in S310 may include the following. The first sequence is obtained by performing repeat decoding into bit values ​​in the first sequence based on the second sequence.

[00368] In some modes, operations in S310 may include the following. The first sequence is obtained by performing repeat decoding on the first sequence based on the second sequence.

[00369] In some modalities, when the number of Petition 870250078547, dated 03 / 09 / 2025, page 107 / 355 101 / 141 bits in the second sequence is NχK and the number of repetitions of the decoding repetition is N, the number of bits in the second sequence is K, where N and K are positive integers.

[00370] In some embodiments, operations in S310 may include the following. At least one third sequence is determined by performing repeat decoding based on the second sequence. The first sequence is determined based on at least one third sequence.

[00371] In some embodiments, the first sequence is determined based on at least one third sequence as follows. The bit values ​​in the first sequence are determined based on the third sequence.

[00372] In some embodiments, the bit values ​​in the first sequence are determined based on the third sequence in the following manner. A first mapping relation is obtained, wherein the first mapping relation includes a match between a first value and a first candidate sequence and a match between a second value and a second candidate sequence. When the third sequence is the first candidate sequence, the first value is determined as the value of the first bit in the first sequence. When the third sequence is the second candidate sequence, the second value is determined as the value of the first bit.

[00373] In some modes, the first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

[00374] In some forms, the first sequence is determined based on at least one third sequence as follows. At least one group of Petition 870250078547, dated 03 / 09 / 2025, p. 108 / 355 102 / 141 decoding is determined based on at least one third sequence, where each of at least one decoding group includes one or more bits in the first sequence.

[00375] In some embodiments, at least one decoding group is determined based on at least one third sequence as follows. A second mapping relation, where the second mapping relation includes a correspondence between several values ​​and several candidate sequences, and the several candidate sequences include at least one third sequence. A value corresponding to each of the sequences of at least one third is determined as at least one decoding group.

[00376] In some embodiments, the number of multiple candidate sequences is positively correlated with the number of bits in each of the multiple values.

[00377] In some embodiments, the sequence of at least one third is determined by repeat decoding based on the second sequence as follows. The sequence of at least one third is determined by performing repeat decoding on bit values ​​in the third sequence based on the second sequence.

[00378] In some embodiments, the sequence of at least one third is determined by repeat decoding based on the second sequence as follows. The sequence of at least one third is determined by performing repeat decoding on the third sequence based on the second sequence.

[00379] In some modes, the sequence of at least one third is determined by decoding Petition 870250078547, dated 03 / 09 / 2025, page 109 / 355 103 / 141 repetition based on the second sequence as follows. The sequence of at least one third is determined by performing the repetition decoding on a sequence formed by the sequence of at least one third based on the second sequence.

[00380] In some embodiments, when the number of bits in the second sequence is NχXχK, the number of repetitions of the decoding repetition is N and the number of bits in each of at least one third sequence is X, the number of bits in the first sequence is K, where N, X and K are each a positive integer.

[00381] In some embodiments, the third sequence is combined with any of the following decoding schemes: NRZ decoding, Manchester decoding, unipolar RZ decoding, Miller decoding, DBP decoding, differential decoding, pulse interval decoding, and FM0 decoding.

[00382] In some forms, the first sequence includes a fourth sequence and a CRC bit corresponding to the fourth sequence.

[00383] In some modes, the CRC bit is positioned after the fourth sequence.

[00384] In some forms, the first sequence includes a fourth sequence and at least one parity bit.

[00385] In some modes, at least one parity bit is positioned after the fourth sequence.

[00386] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split and a first parity bit between at least one parity bit Petition 870250078547, dated 03 / 09 / 2025, p. 110 / 355 104 / 141 is positioned after a first check group between at least one check group.

[00387] In some embodiments, the first sequence includes a fourth sequence, a CRC bit corresponding to the fourth sequence, and at least one parity bit.

[00388] In some forms, the first sequence includes sequentially: the fourth sequence, the CRC bit, and at least one parity bit.

[00389] In some modes, the first sequence includes sequentially: the fourth sequence, at least one parity bit, and the CRC bit.

[00390] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split, a first parity bit between at least one parity bit is positioned after a first check group between at least one check group, and the CRC bit is positioned after a sequence formed by the fourth sequence and at least one parity bit.

[00391] In some embodiments, a sequence formed by the fourth sequence and the CRC bit is a sequence to be split, the sequence to be split includes at least one check group after the split, and the first parity bit between at least one parity bit is positioned after a first check group between at least one check group.

[00392] In some embodiments, a check group used to determine the first parity bit between at least one check group does not overlap with a Petition 870250078547, dated 03 / 09 / 2025, page 111 / 355 105 / 141 check group used to determine a parity bit different from the first parity bit among at least one check group.

[00393] In some modes, the first parity bit is determined according to the first check group.

[00394] In some embodiments, the check group used to determine the first parity bit among at least one check group overlaps at least partially with the check group used to determine the parity bits other than the first parity bit among at least one check group.

[00395] In some modes, the first parity bit is determined according to the first check group and a check group prior to the first check group.

[00396] In some embodiments, the first parity bit is determined according to the first check group, a check group prior to the first check group, and a parity bit determined based on the check group prior to the first check group between at least one parity bit.

[00397] In some forms, the fourth sequence is a sequence of data bits.

[00398] In some embodiments, method 300 may also include the following. The maximum number of bits in each of at least one check group is obtained. Each consecutive maximum number of bits in the sequence to be split is split into at least one check group.

[00399] In some modes, the number of bits Petition 870250078547, dated 03 / 09 / 2025, p. 112 / 355 106 / 141 in each of at least one check group is the maximum number of bits.

[00400] In some embodiments, a final check group between at least one check group includes a padding bit.

[00401] In some embodiments, the number of bits in each of at least one check group, except for a final check group, is the maximum number of bits, and the number of bits in the final check group is less than the maximum number of bits.

[00402] In some modes, the maximum number of bits is configured by a network device or the maximum number of bits is predefined.

[00403] In some embodiments, the maximum number of bits in each of at least one check group is obtained as follows. The maximum number of bits is determined based on the number of bits in the sequence to be split.

[00404] In some embodiments, the maximum number of bits is determined based on the number of bits in the sequence to be split as follows. A third mapping relation is obtained, in which the third mapping relation includes a correspondence between several values ​​and several candidate numbers of bits, and the multiple values ​​include a third value with a minimum difference from the number of bits in the sequence to be split. A candidate number of bits corresponding to the third value is determined as the maximum number of bits.

[00405] In some embodiments, the third mapping relation is a mapping relation determined by the zero-power device of multiple mapping relations. Petition 870250078547, dated 03 / 09 / 2025, page 113 / 355 107 / 141 configured by the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device from several predefined mapping relationships.

[00406] In some embodiments, the maximum number of bits is determined based on the number of bits in the sequence to be split as follows. A fourth mapping relation is obtained, wherein the fourth mapping relation includes a correspondence between several value ranges and several bit numbers, and the number of bits in the sequence to be split is in a first value range among the several value ranges. The number of bits corresponding to the first value range is determined as the maximum number of bits.

[00407] In some embodiments, the fourth mapping relationship is a mapping relationship determined by the zero-power device from several mapping relationships configured by the network device, or the fourth mapping relationship is a mapping relationship determined by the zero-power device from several predefined mapping relationships.

[00408] In some embodiments, the maximum number of bits in each of at least one check group is obtained as follows. A fourth value is obtained, where the fourth value indicates the number of at least one check group and / or the number of at least one parity bit. The maximum number of bits is determined based on the number of bits in the sequence to be split and the fourth value.

[00409] In some modes, the maximum number of bits is determined based on the number of bits in the sequence to be Petition 870250078547, dated 03 / 09 / 2025, p. 114 / 355 108 / 141 to be divided into the fourth value as follows. The maximum number of bits is determined based on a ratio of the number of bits in the sequence to be divided to the fourth value.

[00410] In some modes, the fourth value is configured by the network device or the fourth value is the default.

[00411] In some forms, before the repetition decoding is performed based on the second sequence to be decoded, the method also includes the following. The second sequence is deinterleaved.

[00412] In some embodiments, before the repetition decoding is performed based on the second sequence to be decoded, the method also includes the following. The first decoding on the second sequence is performed.

[00413] In some modes, before the S310 operations, method 300 may also include the following. A first signal is received. The second sequence is obtained by demodulating the first signal or by performing the first decoding on a first demodulated signal.

[00414] In some forms, the first sequence includes a prefix sequence.

[00415] In some embodiments, the second sequence is obtained by demodulating the first signal or by first decoding the first demodulated signal as follows. A fifth sequence is obtained by demodulating the first signal or by first decoding the first demodulated signal, wherein the fifth sequence includes the second sequence and a prefix sequence.

[00416] In some modes, the prefix sequence is configured by the network device, the sequence Petition 870250078547, dated 03 / 09 / 2025, page 115 / 355 109 / 141 of prefixes is predefined or the prefix sequence is determined according to the number of repetitions of the repeat decoding.

[00417] In some embodiments, a demodulation scheme applied to the first signal includes at least one of: ASK modulation, OOK modulation, FSK modulation, or PSK modulation.

[00418] In some embodiments, the first decoding includes at least one of the following: NRZ decoding, unipolar RZ decoding, Manchester decoding, Miller decoding, DBP decoding, differential decoding, pulse interval decoding, or FM0 decoding.

[00419] In some modes, before the operations in S310, method 300 may also include the following. The second sequence is received.

[00420] In some embodiments, the number of repetitions of the repeat decoding is determined by the zero-power device based on at least one of the following pieces of information from the first sequence: a data block size, a bit rate, or a communication rate.

[00421] In some modes, the number of repetitions of the decoding loop is configured by the network device or the number of repetitions of the decoding loop is predefined.

[00422] It can be understood that the operations in wireless communication method 300 can be referred to the corresponding operations in wireless communication method 200, which will not be repeated here for the sake of brevity.

[00423] The method modalities of the present Petition 870250078547, dated 03 / 09 / 2025, p. 116 / 355 The 110 / 141 disclosures are described in detail above with reference to Figures 16 to 21, and the apparatus embodiments of the present disclosure will be described in detail below with reference to Figures 22 to 25.

[00424] Figure 22 is a schematic block diagram of a 400 sending device provided in embodiments of the present disclosure. It can be observed that the 400 sending device can be a network device or a terminal device. For example, the terminal device can be a zero-power device, and the zero-power device can be a device that supports at least one of the following communication modes: backcast communication or active transmission communication. For example, the zero-power device can be a conventional NR terminal loaded with or integrated into a backcast communication module.

[00425] As illustrated in Figure 22, the 400 transmission device may include a 410 encoding unit. The 410 encoding unit is configured to obtain a second sequence by performing repeat encoding based on a first sequence to be encoded.

[00426] In some embodiments, the 410 encoding unit is specifically configured to obtain the second sequence, performing repeat encoding on bit values ​​in the first sequence.

[00427] In some embodiments, the 410 encoding unit is specifically configured to obtain a second sequence, performing repeat encoding based on a first sequence to be encoded. Petition 870250078547, dated 03 / 09 / 2025, page 117 / 355 111 / 141

[00428] In some embodiments, when the number of bits in the first sequence is K and the number of repetitions of the repeat encoding is N, the number of bits in the second sequence is NxK, where N and K are each a positive integer.

[00429] In some embodiments, the 410 encoding unit is specifically configured to determine at least a third sequence based on the first sequence. The 410 encoding unit is specifically configured to obtain the second sequence by performing repeat encoding based on at least a third sequence.

[00430] In some embodiments, the 410 encoding unit is specifically configured to determine the third sequence based on the bit values ​​in the first sequence.

[00431] In some embodiments, the 410 encoding unit is specifically configured to obtain a first mapping relation, wherein the first mapping relation includes a match between a first value and a first candidate sequence and a match between a second value and a second candidate sequence. When a first bit value in the first sequence is the first value, the 410 encoding unit is specifically configured to determine the first candidate sequence as the third sequence. When the first bit value is the second value, the 410 encoding unit is specifically configured to determine the second candidate sequence as the third sequence.

[00432] In some modalities, the first Petition 870250078547, dated 03 / 09 / 2025, page 118 / 355 The first candidate sequence, 112 / 141, and the second candidate sequence have different values ​​at the same bit position.

[00433] In some embodiments, the 410 encoding unit is specifically configured to split the first sequence into at least one encoding group. The 410 encoding unit is specifically configured to determine the third sequence based on a value from each of at least one encoding group.

[00434] In some embodiments, the 410 encoding unit is specifically configured to obtain a second mapping relation, wherein the second mapping relation includes a match between multiple values ​​and multiple candidate sequences, and the multiple values ​​include the value of each of at least one encoding group. The 410 encoding unit is specifically configured to determine a candidate sequence corresponding to the value of each of at least one encoding group as the third sequence.

[00435] In some embodiments, the number of multiple candidate sequences is positively correlated with the number of bits in each of the multiple values.

[00436] In some embodiments, the 410 encoding unit is specifically configured to obtain the second sequence, with repeat encoding being performed on bit values ​​in the third sequence.

[00437] In some embodiments, the 410 encoding unit is specifically configured to obtain the second sequence by performing repeat encoding on the third sequence. Petition 870250078547, dated 03 / 09 / 2025, page 119 / 355 113 / 141

[00438] In some embodiments, the 410 encoding unit is specifically configured to obtain the second sequence, performing repeat encoding on a sequence formed by at least one third sequence.

[00439] In some embodiments, when the number of bits in the first sequence is K, the number of repetitions of the repeat encoding is N and the number of bits in each of at least one third sequence is X, the number of bits in the second sequence is NχXχK, where N, X and K are each a positive integer.

[00440] In some embodiments, the third sequence is combined with any of the following coding schemes: NRZ coding, Manchester coding, unipolar Z coding, Miller coding, DBP coding, differential coding, PIE and FM0 coding.

[00441] In some forms, the first sequence includes a fourth sequence and a CRC bit corresponding to the fourth sequence.

[00442] In some modes, the CRC bit is positioned after the fourth sequence.

[00443] In some forms, the first sequence includes a fourth sequence and at least one parity bit.

[00444] In some modes, at least one parity bit is positioned after the fourth sequence.

[00445] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split, and a first parity bit of at least one parity bit is positioned after a first check group of at least Petition 870250078547, dated 03 / 09 / 2025, p. 120 / 355 114 / 141 a verification group.

[00446] In some embodiments, the first sequence includes a fourth sequence, a CRC bit corresponding to the fourth sequence, and at least one parity bit.

[00447] In some forms, the first sequence includes sequentially: the fourth sequence, the CRC bit, and at least one parity bit.

[00448] In some modes, the first sequence includes sequentially: the fourth sequence, at least one parity bit, and the CRC bit.

[00449] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split, a first parity bit between at least one parity bit is positioned after a first check group between at least one check group, and the CRC bit is positioned after a sequence formed by the fourth sequence and at least one parity bit.

[00450] In some embodiments, a sequence formed by the fourth sequence and the CRC bit is a split sequence, the split sequence includes at least one check group after the split and a first parity bit between at least one parity bit is positioned after a first check group between at least one check group.

[00451] In some embodiments, a check group used to determine the first parity bit among at least one check group does not overlap with a check group used to determine a parity bit. Petition 870250078547, dated 03 / 09 / 2025, page 121 / 355 115 / 141 is different from the first parity bit between at least one check group.

[00452] In some modes, the first parity bit is determined according to the first check group.

[00453] In some embodiments, the check group used to determine the first parity bit among at least one check group overlaps at least partially with the check group used to determine the parity bit other than the first parity bit among at least one check group.

[00454] In some modes, the first parity bit is determined according to the first check group and a check group prior to the first check group.

[00455] In some embodiments, the first parity bit is determined according to the first check group, a check group prior to the first check group, and a parity bit determined based on the check group prior to the first check group between at least one parity bit.

[00456] In some forms, the fourth sequence is a sequence of data bits.

[00457] In some embodiments, the 410 encoding unit is further configured to obtain the maximum number of bits in each of at least one check group. Each consecutive maximum number of bits in the sequence to be split is split into at least one check group.

[00458] In some modes, the number of bits Petition 870250078547, dated 03 / 09 / 2025, p. 122 / 355 116 / 141 in each of at least one check group is the maximum number of bits.

[00459] In some embodiments, the 410 encoding unit is specifically configured to obtain a final check group between at least one check group based on indivisible bits and a padding bit when the number of indivisible bits in the sequence to be split is less than the maximum number of bits, where the total number of indivisible bits and the padding bit is the maximum number of bits.

[00460] In some embodiments, the number of bits in each of at least one check group, except for a final check group, is the maximum number of bits, and the number of bits in the final check group is less than the maximum number of bits.

[00461] In some embodiments, the 410 encoding unit is specifically configured to determine the indivisible bits as a final check group among at least one check group when the number of indivisible bits in the sequence to be split is less than the maximum number of bits.

[00462] In some modes, the maximum number of bits is configured by the network device or the maximum number of bits is predefined.

[00463] In some embodiments, the 410 encoding unit is specifically configured to determine the maximum number of bits based on the number of bits in the sequence to be split.

[00464] In some embodiments, the 410 encoding unit is specifically configured to obtain a Petition 870250078547, dated 03 / 09 / 2025, page 123 / 355 117 / 141 third mapping relation, wherein the third mapping relation includes a correspondence between several values ​​and several candidate bit numbers, and the several values ​​include a third value with a minimum difference from the number of bits in the sequence to be split. The 410 encoding unit is specifically configured to determine a candidate bit number corresponding to the third value as the maximum number of bits.

[00465] In some embodiments, the third mapping relationship is a mapping relationship determined by the zero-power device from several mapping relationships configured by the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device from several predefined mapping relationships.

[00466] In some embodiments, the 410 encoding unit is specifically configured to obtain a fourth mapping relation, wherein the fourth mapping relation includes a correspondence between several value ranges and several bit numbers, and the number of bits in the sequence to be divided is in a first value range among the various value ranges. The 410 encoding unit is specifically configured to determine the number of bits corresponding to the first value range as the maximum number of bits.

[00467] In some embodiments, the fourth mapping relationship is a mapping relationship determined by the zero-power device from multiple mapping relationships configured by the network device, or the fourth mapping relationship is a mapping relationship determined by Petition 870250078547, dated 03 / 09 / 2025, page 124 / 355 118 / 141 zero-power device with multiple predefined mapping ratios.

[00468] In some embodiments, the 410 encoding unit is specifically configured to obtain a fourth value, where the fourth value indicates the number of at least one check group and / or the number of at least one parity bit. The 410 encoding unit is specifically configured to determine the maximum number of bits based on the number of bits in the sequence to be split and the fourth value.

[00469] In some embodiments, the 410 encoding unit is specifically configured to determine the maximum number of bits based on a ratio of the number of bits in the sequence to be divided to the fourth value.

[00470] In some modes, the fourth value is configured by the network device or the fourth value is predefined.

[00471] In some modes, the 410 encoding unit is still configured to interleave the second sequence.

[00472] In some modes, the 410 encoding unit is still configured to perform the first encoding in the second sequence.

[00473] In some embodiments, the 410 encoding unit is configured to obtain a first signal by modulating based on the second sequence or a sequence obtained by performing the first encoding on the second sequence and sending the first signal.

[00474] In some forms, the first sequence includes a prefix sequence. The unit of Petition 870250078547, dated 03 / 09 / 2025, page 125 / 355 119 / 141 encoding 410 is specifically configured to obtain the first signal by modulating the second sequence, or the sequence obtained by performing the first encoding on the second sequence.

[00475] In some embodiments, the 410 encoding unit is specifically configured to obtain a fifth sequence by adding a prefix sequence to the second sequence or the sequence obtained by performing the first encoding on the second sequence. The 410 encoding unit is specifically configured to obtain the first signal by modulating the fifth sequence.

[00476] In some modes, the prefix sequence is configured by the network device, the prefix sequence is predefined, or the prefix sequence is determined according to the number of repetitions of the repeat encoding.

[00477] In some embodiments, a modulation scheme applied to the second sequence or the sequence obtained by performing the first encoding on the second sequence includes at least one of the following: ASK modulation, OOK modulation, FSK modulation, or PSK modulation.

[00478] In some modalities, the first coding includes at least one of: NRZ coding, unipolar RZ coding, Manchester coding, Miller coding, DBP coding, differential coding, PIE coding or FM0 coding.

[00479] In some modes, the 410 encoding unit is still configured to send the second sequence.

[00480] In some modalities, the unit of Petition 870250078547, dated 03 / 09 / 2025, page 126 / 355 120 / 141 encoding 410 is further configured to determine the number of repetitions of the repeat encoding based on at least one of the following pieces of information from the first sequence: a data block size, a bit rate, or a communication rate.

[00481] In some modes, the number of repetitions of the repeat encoding is configured by the network device or the number of repetitions of the repeat encoding is predefined.

[00482] It can be understood that the apparatus embodiments and the method embodiments correspond to each other. For similar elaborations, reference can be made to the method embodiments. Specifically, the sending device 400 illustrated in Figure 22 can correspond to a corresponding entity for implementing method 200 in embodiments of the present disclosure, and the above operations and other operations and / or functions of various units of the sending device 400 are intended, respectively, to implement corresponding operations in the method illustrated in Figure 11, which will not be repeated herein for the sake of simplicity.

[00483] Figure 23 is a schematic block diagram of a 500 receiving device provided in embodiments of the present disclosure. It can be observed that the 500 receiving device can be a network device or a terminal device. For example, the terminal device can be a zero-power device, and the zero-power device can be a device that supports at least one of the following communication modes: communication via backscattering or communication via active transmission. For example, the zero-power device can be a terminal. Petition 870250078547, dated 03 / 09 / 2025, p. 127 / 355 121 / 141 conventional NR loaded or integrated into a backscatter communication module.

[00484] As illustrated in Figure 23, the receiving device 500 may include a decoding unit 510. The decoding unit 510 is configured to obtain a first sequence by performing repeat decoding based on a second sequence to be decoded.

[00485] In some embodiments, the 510 decoding unit is specifically configured to obtain the first sequence, performing repeat decoding on bit values ​​in the first sequence based on the second sequence.

[00486] In some embodiments, the 510 decoding unit is specifically configured to obtain the first sequence, with repeat decoding performed on the first sequence based on the second sequence.

[00487] In some embodiments, when the number of bits in the second sequence is NχK and the number of repetitions of the decoding repetition is N, the number of bits in the second sequence is K, where N and K are a positive integer.

[00488] In some embodiments, the 510 decoding unit is specifically configured to determine at least a third sequence, with repeat decoding being performed based on the second sequence. The 510 decoding unit is specifically configured to determine the first sequence based on at least a third sequence.

[00489] In some modes, the 510 decoding unit is specifically configured for Petition 870250078547, dated 03 / 09 / 2025, page 128 / 355 122 / 141 determine the bit values ​​in the first sequence based on the third sequence.

[00490] In some embodiments, the 510 decoding unit is specifically configured to obtain a first mapping relation, wherein the first mapping relation includes a match between a first value and a first candidate sequence and a match between a second value and a second candidate sequence. The 510 decoding unit is specifically configured to determine the first value as the value of a first bit in the first sequence when the third sequence is the first candidate sequence. The 510 decoding unit is specifically configured to determine the second value as the value of the first bit when the third sequence is the second candidate sequence.

[00491] In some modes, the first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

[00492] In some embodiments, the 510 decoding unit is specifically configured to determine at least one decoding group based on at least a third sequence, where each of the at least one decoding group includes one or more bits in the first sequence.

[00493] In some embodiments, the 510 decoding unit is specifically configured to obtain a second mapping relation, wherein the second mapping relation includes a match between multiple values ​​and multiple candidate sequences, and the multiple candidate sequences include at least one third sequence. The unit Petition 870250078547, dated 03 / 09 / 2025, page 129 / 355 The 123 / 141 decoding 510 is specifically configured to determine a value corresponding to each of the sequences of at least one third as at least one decoding group.

[00494] In some embodiments, the number of multiple candidate sequences is positively correlated with the number of bits in each of the multiple values.

[00495] In some embodiments, the 510 decoding unit is specifically configured to determine at least a third sequence, performing repeat decoding on bit values ​​in the third sequence based on the second sequence.

[00496] In some embodiments, the 510 decoding unit is specifically configured to determine at least a third sequence, with repeat decoding being performed on the third sequence based on the second sequence.

[00497] In some embodiments, the 510 decoding unit is specifically configured to determine at least one third sequence by performing repeat decoding on a sequence formed by at least one third sequence based on the second sequence.

[00498] In some embodiments, when the number of bits in the second sequence is NχXχK, the number of repetitions of the decoding repetition is N and the number of bits in each of at least one third sequence is X, the number of bits in the first sequence is K, where N, X and K are each a positive integer. Petition 870250078547, dated 03 / 09 / 2025, page 130 / 355 124 / 141

[00499] In some embodiments, the third sequence is combined with any of the following decoding schemes: NRZ decoding, Manchester decoding, unipolar RZ decoding, Miller decoding, DBP decoding, differential decoding, pulse interval decoding, and FM0 decoding.

[00500] In some forms, the first sequence includes a fourth sequence and a CRC bit corresponding to the fourth sequence.

[00501] In some modes, the CRC bit is positioned after the fourth sequence.

[00502] In some forms, the first sequence includes a fourth sequence and at least one parity bit.

[00503] In some modes, at least one parity bit is positioned after the fourth sequence.

[00504] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split and a first parity bit between at least one parity bit is positioned after a first check group between at least one check group.

[00505] In some embodiments, the first sequence includes a fourth sequence, a CRC bit corresponding to the fourth sequence, and at least one parity bit.

[00506] In some forms, the first sequence includes sequentially: the fourth sequence, the CRC bit, and at least one parity bit.

[00507] In some modalities, the first Petition 870250078547, dated 03 / 09 / 2025, page 131 / 355 The 125 / 141 sequence includes sequentially: the fourth sequence, at least one parity bit, and the CRC bit.

[00508] In some embodiments, the fourth sequence is a sequence to be split, the sequence to be split includes at least one check group after the split, a first parity bit between at least one parity bit is positioned after a first check group between at least one check group, and the CRC bit is positioned after a sequence formed by the fourth sequence and at least one parity bit.

[00509] In some embodiments, a sequence formed by the fourth sequence and the CRC bit is a split sequence, the split sequence includes at least one check group after the split and a first parity bit between at least one parity bit is positioned after a first check group between at least one check group.

[00510] In some embodiments, a check group used to determine the first parity bit among at least one check group does not overlap with a check group used to determine a parity bit other than the first parity bit among at least one check group.

[00511] In some modes, the first parity bit is determined according to the first check group.

[00512] In some embodiments, the check group used to determine the first parity bit between at least one check group overlaps at least partially with the check group used to determine the Petition 870250078547, dated 03 / 09 / 2025, page 132 / 355 126 / 141 parity bits different from the first parity bit between at least one check group.

[00513] In some modes, the first parity bit is determined according to the first check group and a check group prior to the first check group.

[00514] In some embodiments, the first parity bit is determined according to the first check group, a check group prior to the first check group, and a parity bit determined based on the check group prior to the first check group between at least one parity bit.

[00515] In some forms, the fourth sequence is a sequence of data bits.

[00516] In some embodiments, the 510 decoding unit is further configured to obtain the maximum number of bits in each of at least one check group. Each consecutive maximum number of bits in the sequence to be split is split into at least one check group.

[00517] In some modes, the number of bits in each of at least one check group is the maximum number of bits.

[00518] In some embodiments, a final check group between at least one check group includes a padding bit.

[00519] In some embodiments, the number of bits in each of at least one check group, except for a final check group, is the maximum number of bits, and the number of bits in the final check group is less than Petition 870250078547, dated 03 / 09 / 2025, p. 133 / 355 127 / 141 maximum number of bits.

[00520] In some modes, the maximum number of bits is configured by the network device or the maximum number of bits is default.

[00521] In some embodiments, the 510 decoding unit is specifically configured to determine the maximum number of bits based on the number of bits in the sequence to be split.

[00522] In some embodiments, the 510 decoding unit is specifically configured to obtain a third mapping relation, wherein the third mapping relation includes a correspondence between several values ​​and several candidate bit numbers, and the several values ​​include a third value with a minimum difference in the number of bits in the sequence to be split. The 510 decoding unit is specifically configured to determine a candidate bit number corresponding to the third value as the maximum number of bits.

[00523] In some embodiments, the third mapping relationship is a mapping relationship determined by the zero-power device from several mapping relationships configured by the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device from several predefined mapping relationships.

[00524] In some embodiments, the 510 decoding unit is specifically configured to obtain a fourth mapping relation, where the fourth mapping relation includes a correspondence between several value ranges and several bit numbers, and the number of bits in Petition 870250078547, dated 03 / 09 / 2025, pp. 134 / 355 The sequence 128 / 141 to be split is in a first range of values ​​among several ranges of values. The 510 decoding unit is specifically configured to determine the number of bits corresponding to the first range of values ​​as the maximum number of bits.

[00525] In some embodiments, the fourth mapping relationship is a mapping relationship determined by the zero-power device from several mapping relationships configured by the network device, or the fourth mapping relationship is a mapping relationship determined by the zero-power device from several predefined mapping relationships.

[00526] In some embodiments, the 510 decoding unit is specifically configured to obtain a fourth value, where the fourth value indicates the number of at least one check group and / or the number of at least one parity bit. The 510 decoding unit is specifically configured to determine the maximum number of bits based on the number of bits in the sequence to be split and the fourth value.

[00527] In some embodiments, the 510 decoding unit is specifically configured to determine the maximum number of bits based on a ratio of the number of bits in the sequence to be divided to the fourth value.

[00528] In some modes, the fourth value is configured by the network device or the fourth value is predefined.

[00529] In some modes, before the repeat decoding is performed based on the second sequence to be decoded, the decoding unit 510 Petition 870250078547, dated 03 / 09 / 2025, pages 135 / 355 129 / 141 is configured to deinterleave the second sequence.

[00530] In some modes, before the repeat decoding is performed based on the second sequence to be decoded, the 510 decoding unit is configured to perform the first decoding on the second sequence.

[00531] In some embodiments, the 510 decoding unit is still configured to receive a first signal. The 510 decoding unit is configured to obtain the second sequence by demodulating the first signal or by performing the first decoding on a first demodulated signal.

[00532] In some forms, the first sequence includes a prefix sequence.

[00533] In some embodiments, the 510 decoding unit is specifically configured to obtain a fifth sequence by demodulating the first signal or by performing the first decoding on the first demodulated signal, wherein the fifth sequence includes the second sequence and a prefix sequence.

[00534] In some modes, the prefix sequence is configured by the network device, or the prefix sequence is predefined, or the prefix sequence is determined according to the number of repetitions of the repeat decoding.

[00535] In some embodiments, a demodulation scheme applied to the first signal includes at least one of: ASK modulation, OOK modulation, FSK modulation, or PSK modulation.

[00536] In some modalities, the first Petition 870250078547, dated 03 / 09 / 2025, page 136 / 355 130 / 141 decoding includes at least one of the following: NRZ decoding, unipolar RZ decoding, Manchester decoding, Miller decoding, DBP decoding, differential decoding, pulse interval decoding, or FM0 decoding.

[00537] In some modes, before the repeat decoding is performed based on the second sequence to be decoded, the 510 decoding unit is configured to receive the second sequence.

[00538] In some embodiments, the number of repetitions of the repeat decoding is determined by the zero-power device based on at least one of the following pieces of information from the first sequence: a data block size, a bit rate, or a communication rate.

[00539] In some modes, the number of repetitions of the decoding loop is configured by the network device or the number of repetitions of the decoding loop is predefined.

[00540] It can be understood that the apparatus modalities and the method modalities correspond to each other. For similar elaborations, reference can be made to the method modalities. Specifically, the receiving device 500 illustrated in Figure 23 can correspond to a corresponding entity for implementing method 300 in embodiments of the present disclosure, and the above operations and / or functions and others of various units of the receiving device 500 are intended, respectively, to implement corresponding operations in the method illustrated in Figure 11, which will not be repeated herein for the sake of simplicity.

[00541] The communication device in Petition 870250078547, dated 03 / 09 / 2025, pp. 137 / 355 131 / 141 embodiments of the present disclosure have been described above from the perspective of functional modules with reference to the accompanying drawings. It can be understood that the functional module can be implemented in hardware form, or it can be implemented as an instruction in software form, or it can be implemented by a combination of hardware and software modules. Specifically, each step of the embodiments of the method of the present disclosure can be completed by a hardware integrated logic circuit in a processor and / or an instruction in software form. The steps of the method disclosed in the embodiments of the present disclosure can be implemented directly by a hardware decoding processor, or they can be performed by hardware and software modules in the decoding processor.Optionally, the software module may be located on a storage medium, such as random access memory (RAM), flash memory, read-only memory (ROM), programmable read-only memory (PROM), or electrically erasable programmable memory, registers, and the like. The storage medium is located in memory. The processor reads the information from memory and completes the steps of the previously mentioned method modes with the processor hardware.

[00542] For example, the processing unit and the communication unit can be implemented by a processor and a transceiver, respectively.

[00543] Figure 24 is a schematic structural diagram of a 600 communication device provided in the embodiment of the present disclosure.

[00544] As illustrated in Figure 24, the Petition 870250078547, dated 03 / 09 / 2025, page 138 / 355 132 / 141 communication device 600 may include a 610 processor.

[00545] The 610 processor can invoke and execute computer programs stored in memory, to perform the method in the embodiments of the present disclosure.

[00546] As illustrated in Figure 24, communication device 600 may also include memory 620.

[00547] Memory 620 can be configured to store information or store code, instructions, etc., which are executed by processor 610. Processor 610 can invoke and execute the computer programs stored in memory 620, to perform the method in the embodiments of the present disclosure. Memory 620 can be a separate device independent of processor 610, or it can be integrated into processor 610.

[00548] As illustrated in Figure 24, the communication device 600 may also include a transceiver 630.

[00549] Processor 610 can control transceiver 630 to communicate with other devices, specifically, to transmit information or data to other devices or to receive information or data transmitted by other devices. Transceiver 630 may include a transmitter and a receiver. Transceiver 630 may also include an antenna, wherein one or more antennas may be provided.

[00550] It can be understood that several components in the 600 communication device are connected via a bus system. In addition to a data bus, the Petition 870250078547, dated 03 / 09 / 2025, page 139 / 355 133 / 141 The bus system may also include a power bus, a control bus and a status signal bus.

[00551] It can also be understood that the communication device 600 can operate as both the sending device and the receiving device in the embodiments of this disclosure, and the communication device 600 can implement the operations performed by the sending device and the receiving device in various methods in the embodiments of this disclosure. In other words, the communication device 600 in the embodiments of this disclosure may correspond to the sending device 400 in the embodiments of this disclosure, and may correspond to a corresponding entity for implementing method 200 according to the embodiments of this disclosure, which will not be repeated herein for the sake of simplicity.Similarly, communication device 600 in the embodiments of this disclosure may correspond to receiving device 500 in the embodiments of this disclosure, and may correspond to a corresponding entity for implementing method 300 in accordance with the embodiments of this disclosure, which will not be repeated herein for the sake of simplicity.

[00552] In addition, the embodiments of the present disclosure provide a chip.

[00553] For example, the chip may be an integrated circuit chip with signal processing capabilities, which may implement or execute various methods, steps, or logic blocks disclosed in the embodiments of the present disclosure. The chip may also be referred to as a system-on-a-chip (SOC). Petition 870250078547, dated 03 / 09 / 2025, p. 140 / 355 134 / 141 Optionally, the chip is applicable to various communication devices, enabling a communication device equipped with the chip to execute various methods, steps, or logic blocks disclosed in the embodiments of this disclosure.

[00554] Figure 25 is a schematic structural diagram of a 700 chip according to the embodiments of the present disclosure.

[00555] As illustrated in Figure 25, the 700 chip includes a 710 processor.

[00556] The 710 processor can invoke and execute computer programs stored in memory to perform the method in the embodiments of the present disclosure.

[00557] As illustrated in Figure 25, the 700 chip may also include 720 memory.

[00558] Processor 710 can invoke and execute computer programs stored in memory 720 to perform the method in the embodiments of the present disclosure. Memory 720 can be configured to store indication information or to store codes, instructions, etc. executable by processor 710. Memory 720 can be a separate device independent of processor 710, or it can be integrated into processor 710.

[00559] As illustrated in Figure 25, the 700 chip may also include a 730 input interface.

[00560] Processor 710 can control input interface 730 to communicate with other devices or chips and, specifically, to obtain information or data transmitted by other devices or chips.

[00561] As illustrated in Figure 25, the chip Petition 870250078547, dated 03 / 09 / 2025, page 141 / 355 135 / 141 700 may also include a 740 output interface.

[00562] The 710 processor can control the 740 output interface to communicate with other devices or chips, specifically, to output information or data to other devices or chips.

[00563] It can be understood that chip 700 is applicable to the zero-power device in the embodiments of the present disclosure. The chip can implement the operations performed by the zero-power device in various methods in embodiments of the present disclosure, which will not be repeated in this document for the sake of simplicity.

[00564] It can also be understood that various components on the 700 chip are connected to each other through a bus system. In addition to a data bus, the bus system may also include a power bus, a control bus, and a status signal bus.

[00565] The processor described above may include, but is not limited to, a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc.

[00566] The processor can be configured to perform or execute the methods, steps, and logical blocks disclosed in the embodiments of this disclosure. The method steps disclosed in the embodiments of this disclosure can be implemented directly by a hardware decoding processor, or they can be implemented by modules. Petition 870250078547, dated 03 / 09 / 2025, page 142 / 355 136 / 141 hardware and software in the decoding processor. The software module may be located in a storage medium such as RAM, flash memory, ROM, PROM, erasable programmable memory, registers, etc. The storage medium is located in memory. The processor reads the information in memory and completes the steps of the method described above with the processor hardware.

[00567] The memory described above may include, but is not limited to, volatile and / or non-volatile memory. Non-volatile memory may be ROM, PROM, or a Erasable PROM (EPROM), an electrical EPROM (EEPROM), or flash memory. Volatile memory can be RAM that acts as an external cache. By way of example, but without limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double-rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronization link DRAM (SLDRAM), and direct rambus RAM (DR RAM).

[00568] It may be observed that the memory described in the present disclosure is intended to include, but not limited to, these and any other suitable types of memory.

[00569] Embodiments of the present disclosure further provide a computer-readable storage medium. The computer-readable storage medium is configured to store a computer program. The computer-readable storage medium stores one or more programs. One or more programs include instructions that, when executed by a portable electronic device, including various application programs, cause the portable electronic device to perform the wireless communication method. Petition 870250078547, dated 03 / 09 / 2025, page 143 / 355 137 / 141 provided in the embodiments of this disclosure. For example, computer-readable storage media is applicable to the sending device in the embodiments of this disclosure. Computer programs are operable with a computer to implement the operations performed by the sending device in various methods in the embodiments of this disclosure, which will not be repeated herein for simplicity. By another example, computer-readable storage media is applicable to the receiving device in the embodiments of this disclosure. Computer programs are operable with a computer to implement the operations performed by the receiving device in various methods in the embodiments of this disclosure, which will not be repeated herein for simplicity.

[00570] Embodiments of the present disclosure further provide a computer program product. The computer program product includes a computer program. For example, the computer program product is applicable to the sending device in the embodiments of the present disclosure. The computer programs are operable with a computer to implement the operations performed by the sending device in various methods in the embodiments of the present disclosure, which will not be repeated herein for simplicity. By another example, the computer program product is applicable to the receiving device in the embodiments of the present disclosure. The computer programs are operable with a computer to implement the operations performed by the receiving device in various methods in the embodiments of the present disclosure, which will not be repeated. Petition 870250078547, dated 03 / 09 / 2025, page 144 / 355 138 / 141 in this document to maintain simplicity.

[00571] Embodiments of the present disclosure further provide a computer program. The computer program, when run by a computer, is operable with the computer to perform the wireless communication method provided in the embodiments of the present disclosure. For example, the computer program is applicable to the sending device in the embodiments of the present disclosure. The computer program, when run by a computer, is operable with the computer to implement the operations performed by the sending device in various methods in the embodiments of the present disclosure, which will not be repeated herein for simplicity. For example, the computer program is applicable to the receiving device in the embodiments of the present disclosure.The computer program, when executed by a computer, is operable with the computer to implement the operations performed by the receiving device in various methods as described in this disclosure, which will not be repeated herein for the sake of simplicity.

[00572] In addition, embodiments of the present disclosure also provide a communication system. The communication system may include the sending device and the receiving device described above, to constitute the communication system 100 illustrated in Figure 1, which will not be repeated in the present document for the sake of simplicity. It should be noted that the term system or similar in the present disclosure may also be referred to as network management architecture or network architecture etc.

[00573] It may also be understood that the terms used in the modalities of the present disclosure and in Petition 870250078547, dated 03 / 09 / 2025, pp. 145 / 355 139 / 141 appended claims are intended only to describe embodiments, rather than to limit embodiments, of the present disclosure. For example, the singular forms a / an, said, above and the used in embodiments of the present disclosure and in the appended claims are also intended to include multiple forms, unless otherwise specified in the context.

[00574] Those with common skill in the art will recognize that algorithmic units and operations of various examples described in connection with embodiments of the present disclosure can be implemented by electronic hardware or by a combination of computer software and electronic hardware. Whether these functions are performed by hardware or software depends on the application and design constraints of the associated technique solution. Those skilled in the art may use different methods with respect to each particular application to implement the described functionality, but such methods should not be considered to be outside the scope of the present disclosure. If the functions are implemented as functional software units and sold or used as stand-alone products, they may be stored on a computer-readable storage medium.Based on such understanding, the essential technical solution, or the portion that contributes to the prior art, or part of the technical solution of the present disclosure, may be incorporated as software products. Computer software products may be stored on a storage medium and may include various instructions that, when executed, may cause a computing device, for example, a personal computer, a server, a device. Petition 870250078547, dated 03 / 09 / 2025, page 146 / 355 Network 140 / 141 etc., perform some or all of the operations of the methods described in various embodiments of the present disclosure. The above storage media may include various types of media that can store program code, such as a Universal Serial Bus (USB) flash disk, a portable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

[00575] It will be evident to persons skilled in the art that, for convenience and simplicity, in terms of the specific working processes of the systems, apparatus, and units mentioned above, reference may be made to the corresponding processes in the embodiments of the method mentioned above, which will not be repeated in this document. It should be understood that the systems, apparatus, and methods disclosed in the embodiments of this disclosure may also be implemented in various other ways. For example, the division of units, modules, or assemblies in the apparatus embodiments mentioned is only a division of logical functions, and there may be other ways of division available in practice, for example, multiple units, modules, or assemblies may be combined or integrated into another system, or some features may be ignored or skipped.Separate units / modules / assemblies, as illustrated, may or may not be physically separated; that is, they may reside in one location or may be distributed to multiple networked units. Some or all of the units / modules / assemblies may be selectively adopted according to practical needs to achieve the desired objectives of the present disclosure. It is important to note that coupling or direct coupling or communication connection, as illustrated or discussed, may be a coupling. Petition 870250078547, dated 03 / 09 / 2025, page 147 / 355 141 / 141 indirect or communication connection through some interface, device or unit, and may be electrical, mechanical or otherwise.

[00576] The preceding elaborations are merely embodiments of the present disclosure, but are not intended to limit the scope of protection of the present disclosure. Any variation or substitution readily devised by those skilled in the art within the scope of the art disclosed in the present disclosure shall fall within the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure shall be subject to the scope of protection of the claims. Petition 870250078547, dated 03 / 09 / 2025, pages 148 / 355

Claims

1 / 5 CLAIMS 1. WIRELESS COMMUNICATION METHOD (200), applied to a zero-energy device, characterized by comprising: obtaining (S210) a second sequence by performing repeat encoding based on a first sequence to be encoded.

2. METHOD (200), according to claim 1, characterized by obtaining the second sequence by performing repetition encoding based on the first sequence to be encoded comprising: obtaining the second sequence by performing repetition encoding on the first sequence.

3. METHOD (200), according to claim 2, characterized in that, when a number of bits in the first sequence is K and a number of repetitions of the repeat encoding is N, a number of bits in the second sequence is N χ K, N and K each being a positive integer.

4. METHOD (200), according to claim 1, characterized by obtaining the second sequence by performing repetition coding based on the first sequence to be coded comprising: determining at least one third sequence based on the first sequence; and obtaining the second sequence by performing repetition coding based on at least one third sequence, wherein obtaining the second sequence by repeat coding based on at least one third sequence comprises: obtaining the second sequence by repeat coding on the third sequence.

5. METHOD (200), according to claim 4, characterized by determining at least one third sequence based on the first sequence comprising: determining the third sequence based on the bit values ​​in the first sequence, wherein the determination of the third sequence based on the bit values ​​in the first sequence comprises: obtaining a first mapping relation, wherein the first mapping relation comprises a correspondence between a first value and a first candidate sequence and a correspondence between a second value and a second candidate sequence; when a value of a first bit in the first sequence is the first value, determining the first candidate sequence as the third sequence; and when the value of the first bit is the second value, determining the second candidate sequence as the third sequence, wherein the first candidate sequence and the second candidate sequence have different values ​​in the same bit position.

6. METHOD (200), according to claim 4, characterized by the determination of at least one third sequence based on the first sequence comprising: dividing the first sequence into at least one coding group; and determining the third sequence based on a value from each of the at least one coding group, wherein the determination of the third sequence based on the value of each Petition 870250078547, dated 03 / 09 / 2025, page.150 / 355 3 / 5 one of the at least one encoding group comprises: obtaining a second mapping relation, wherein the second mapping relation comprises a correspondence between a plurality of values ​​and a plurality of candidate sequences, and the plurality of values ​​comprises the value of each of the at least one encoding group; and determining a candidate sequence corresponding to the value of each of the at least one encoding group as the third sequence, wherein a number of the plurality of candidate sequences is positively correlated with a number of bits of each of the pluralities of values.

7. METHOD (200), according to any one of claims 1 to 6, characterized in that the first sequence comprises a fourth sequence and a cyclic redundancy check bit, CRC, corresponding to the fourth sequence and in that the CRC bit is positioned after the fourth sequence.

8. METHOD (200), according to claim 7, characterized in that the fourth sequence is a sequence of data bits.

9. METHOD (200), according to any one of claims 1 to 8, characterized by further comprising: interleaving the second sequence.

10. METHOD (200), according to any one of claims 1 to 9, further characterized by comprising: performing the first encoding on the second sequence and / or obtaining a first signal by modulation based on the second sequence or a sequence obtained by performing the first encoding on the second sequence; and sending the first signal. Petition 870250078547, dated 03 / 09 / 2025, p. 151 / 355 4 / 5 11. METHOD (200), according to claim 10, characterized by obtaining the first signal by modulation based on the second sequence or on the sequence obtained by performing the first encoding on the second sequence comprising: obtaining a fifth sequence by adding a prefix sequence to the second sequence or to the sequence obtained by performing the first encoding on the second sequence; and obtaining the first signal by modulating the fifth sequence, wherein the prefix sequence is configured by a network device, or the prefix sequence is predefined, or the prefix sequence is determined according to a number of repetitions of the repeat encoding.

12. METHOD (200), according to claim 10 or 11, characterized by a modulation scheme applied to the second sequence or to the sequence obtained by performing the first encoding on the second sequence comprising at least one of the following: amplitude keying modulation, ASK, on-off keying modulation, OOK, frequency keying modulation, FSK, or phase keying modulation, PSK, and / or by a number of repetitions of the repeat encoding being configured by a network device or a number of repetitions of the repeat encoding being predefined.

13. WIRELESS COMMUNICATION METHOD (300), applied to a zero-energy device, characterized by comprising: obtaining (S310) a first sequence by performing repeat decoding based on a second sequence Petition 870250078547, dated 03 / 09 / 2025, page 152 / 355 5 / 5 to be decoded.

14. ZERO POWER DEVICE (400) characterized by comprising: an encoding unit (410) configured to obtain a second sequence by performing repeat encoding based on a first sequence to be encoded.

15. ZERO POWER DEVICE (500) characterized by comprising: a decoding unit (510) configured to obtain a first sequence by performing repeat decoding based on a second sequence to be decoded. Petition 870250078547, dated 03 / 09 / 2025, page 153 / 355

Images