WO2023072168A1 - 一种信息处理方法及通信装置 - Google Patents

一种信息处理方法及通信装置 Download PDF

Info

Publication number
WO2023072168A1
WO2023072168A1 PCT/CN2022/127779 CN2022127779W WO2023072168A1 WO 2023072168 A1 WO2023072168 A1 WO 2023072168A1 CN 2022127779 W CN2022127779 W CN 2022127779W WO 2023072168 A1 WO2023072168 A1 WO 2023072168A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
element node
node
nodes
element nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2022/127779
Other languages
English (en)
French (fr)
Inventor
王献斌
张华滋
童佳杰
戴胜辰
李榕
王俊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP22886043.3A priority Critical patent/EP4398503A4/en
Publication of WO2023072168A1 publication Critical patent/WO2023072168A1/zh
Priority to US18/648,918 priority patent/US12542621B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0059—Convolutional codes
    • H04L1/006—Trellis-coded modulation
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
    • H03M13/256—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with trellis coding, e.g. with convolutional codes and TCM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H04L1/0058—Block-coded modulation
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Definitions

  • the embodiments of the present application relate to the field of communication technologies, and in particular, to an information processing method and a communication device.
  • High-order modulation technology can map multiple codeword bits to the same modulation symbol, which can further improve spectral efficiency. For example, 16QAM maps 4 bits to one modulation symbol, and 64QAM maps 6 bits to one modulation symbol.
  • 16QAM maps 4 bits to one modulation symbol
  • 64QAM maps 6 bits to one modulation symbol.
  • different modulation symbols correspond to different energies, and sending more low-energy modulation symbols and less high-energy modulation symbols can save average energy.
  • Gaussian white noise channel when the distribution of the transmitted modulation symbols obeys the Gaussian distribution, the amount of information transferred per unit energy is the largest.
  • shaping techniques such as geometric shaping and probability shaping, are introduced in the coding and modulation process.
  • the implementation complexity of shaping process will affect the implementability of the scheme.
  • Embodiments of the present application provide an information processing method and a communication device, which are used to reduce the complexity of implementing channel coding shaping processing and improve channel coding and transmission efficiency.
  • an embodiment of the present application provides an information processing method, including: acquiring information bits, the information bits including K bits, K being a positive integer; mapping the information bits into a target symbol sequence according to the trellis diagram ; Wherein, the target symbol sequence includes M symbols, M is a positive integer greater than K, and the M symbols include m symbols whose value is the first value; the grid map includes at least M directed Edges, one of the directed edges corresponds to the value of a symbol in the target symbol sequence.
  • the grid map is used to indicate the value of the symbol, and the mapping from the information bit to the target symbol sequence can be realized by reading the grid map, which reduces the computational complexity of the shaping process and can improve the channel coding and transmission rate.
  • the mapping the information bits into a target symbol sequence according to the trellis diagram includes: sequentially determining M+1 element nodes in the trellis diagram according to the information bits, so The directed edge between two adjacent element nodes in the M+1 element nodes is used to determine the value of a symbol in the target symbol sequence; wherein, the first element node in the M+1 element nodes An element node is related to the value of M and the value of m; the first element node is any one of the first M element nodes among the M+1 element nodes; among the M+1 element nodes Among the nodes, the next node of the first element node is a second element node; in the grid graph, the first element node points to one or more element nodes, and the second element node is the An element node among one or more element nodes.
  • directed edges are formed between adjacent element nodes of the grid graph, forming multi-level nesting.
  • multiple element nodes are read in sequence, and the target symbol sequence can be determined quickly according to the directed edges traversed by reading the multiple element nodes.
  • the embodiment of the present application provides an information processing method, including: obtaining a target symbol sequence; wherein, the target symbol sequence includes M symbols, M is a positive integer, and the M symbols include m values is a symbol of the first value; according to the trellis diagram and the target symbol sequence, determine information bits; wherein, the information bits include K bits, K is a positive integer, and K is less than M; the trellis diagram includes at least M a directed edge, and one directed edge corresponds to the value of a symbol in the target symbol sequence.
  • the value of the symbol indicated by the trellis graph is used, and the information bits can be recovered from the target symbol sequence by reading the trellis graph, which can reduce the computational complexity of the unshaping process.
  • the determining information bits according to the grid graph and the target symbol sequence includes: according to the value of at least one element node among the M+1 element nodes in the grid graph, The first bit sequence is updated to obtain the information bits; wherein, the first bit sequence includes K bits, and the value of each bit in the first bit sequence is a second value; in the target symbol sequence The value of a symbol corresponds to the directed edge between two adjacent element nodes in the M+1 element nodes; the value of the first element node and M in the M+1 element nodes and The value of m is related; the first element node is any one of the first M element nodes in the M+1 element nodes; among the M+1 element nodes, the first element node The next node is a second element node; in the grid graph, the first element node points to one or more element nodes, and the second element node is an element in the one or more element nodes node.
  • the embodiment of the present application provides a communication device.
  • the communication device may be a sending end, or a device in the sending end, or a device that can be matched with the sending end.
  • the communication device may include a one-to-one corresponding module for executing the method/operation/step/action described in the first aspect.
  • the module may be a hardware circuit, or software, or a combination of hardware circuit and software.
  • the communication device may include a processing module and a communication module. Exemplarily: a communication module, configured to acquire information bits, where the information bits include K bits, where K is a positive integer.
  • a processing module configured to map the information bits into a target symbol sequence according to the trellis diagram; wherein, the target symbol sequence includes M symbols, M is a positive integer greater than K, and the M symbols include m A symbol whose value is the first value; the grid graph includes at least M directed edges, one of which corresponds to the value of a symbol in the target symbol sequence.
  • the processing module is specifically configured to: sequentially determine M+1 element nodes in the grid graph according to the information bits, and two of the M+1 element nodes The directed edge between adjacent element nodes is used to determine the value of a symbol in the target symbol sequence; wherein, the first element node in the M+1 element nodes and the value of M and m is related to the value; the first element node is any one of the first M element nodes in the M+1 element nodes; among the M+1 element nodes, the next element node of the first element node One node is a second element node; in the grid graph, the first element node points to one or more element nodes, and the second element node is an element node in the one or more element nodes .
  • the embodiment of the present application provides a communication device.
  • the communication device may be a receiving end, or a device in the receiving end, or a device that can be matched with the receiving end.
  • the communication device may include a one-to-one corresponding module for executing the method/operation/step/action described in the first aspect.
  • the module may be a hardware circuit, or software, or a combination of hardware circuit and software.
  • the communication device may include a processing module and a communication module. Exemplarily: a communication module, configured to acquire a target symbol sequence; wherein, the target symbol sequence includes M symbols, M is a positive integer, and the M symbols include m symbols whose value is the first value.
  • a processing module configured to determine information bits according to the trellis diagram and the target symbol sequence; wherein, the information bits include K bits, K is a positive integer, and K is less than M; the trellis diagram includes at least M A directed edge corresponds to a value of a symbol in the target symbol sequence.
  • the processing module is specifically configured to: update the first bit sequence according to the value of at least one element node in the M+1 element nodes in the grid graph to obtain the information bit ;
  • the first bit sequence includes K bits, and the value of each bit in the first bit sequence is a second value;
  • the value of a symbol in the target symbol sequence corresponds to the M+1 A directed edge between two adjacent element nodes in the element node;
  • the first element node in the M+1 element nodes is related to the value of M and the value of m;
  • the first element node is all Any one of the first M element nodes among the M+1 element nodes; among the M+1 element nodes, the next node of the first element node is a second element node;
  • the first element node points to one or more element nodes, and the second element node is one of the one or more element nodes.
  • the first element node when the first element node points to multiple element nodes, the first element node is different from the element node pointed to by the first element node
  • the values of the symbols corresponding to the directed edges between are different.
  • each element node in the grid graph has a value, and when the first element node points to multiple element nodes, the second The value of an element node is less than or equal to the sum of the values of multiple element nodes pointed to by the first element node.
  • the grid graph includes at least M+1 element nodes, and the third element node is one of the at least M+1 element nodes Any element node, the third element node is used to indicate the number of combinations The value of the third element node is less than or equal to the number of combinations Wherein, 0 ⁇ i ⁇ I, 0 ⁇ I ⁇ N, N ⁇ M; i, I, N are all integers; the number of combinations indicated by different element nodes in the grid diagram is different.
  • the value of each element node in the grid graph represents the number of combinations of the current remaining symbol value types.
  • the grid graph can meet the requirements of determining the target symbol sequence and the symbol sequence longer than the target symbol sequence. When determining the target symbol sequence by reading the grid graph, it is not necessary to start traversing from the element node indicating the largest number of combinations, so that the network The application of grid chart is more flexible.
  • any aspect from the first aspect to the fourth aspect if the number of combinations The effective digit of the corresponding binary number is greater than the target effective digit, and the value of the third element node is less than the combination number And the effective digit of the binary number corresponding to the value of the third element node is the target effective digit; or, if the combined number The effective digit of the corresponding binary number is less than or equal to the target effective digit, and the value of the third element node is equal to the combination number
  • the introduction of target effective digits can effectively reduce the effective digits of each element node in the grid graph, and can compress the storage space occupied by the grid graph.
  • the embodiment of the present application provides a communication device, the communication device includes a processor, configured to implement the method described in the first aspect above.
  • the communication device may also include memory for storing instructions and data.
  • the memory is coupled to the processor, and when the processor executes the instructions stored in the memory, the method described in the first aspect above can be implemented.
  • the communication device may further include a communication interface, which is used for the device to communicate with other devices.
  • the communication interface may be a transceiver, a circuit, a bus, a module or other types of communication interfaces.
  • the communication device includes: a memory, configured to store program instructions; a processor, configured to use a communication interface to acquire information bits, where the information bits include K bits, where K is a positive integer.
  • the processor is further configured to map the information bits into a target symbol sequence according to the trellis diagram; wherein, the target symbol sequence includes M symbols, M is a positive integer greater than K, and the M symbols include m values of A symbol of the first value; the grid graph includes at least M directed edges, and one of the directed edges corresponds to the value of a symbol in the target symbol sequence.
  • an embodiment of the present application provides a communication device, where the communication device includes a processor, configured to implement the method described in the second aspect above.
  • the communication device may also include memory for storing instructions and data.
  • the memory is coupled to the processor, and when the processor executes the instructions stored in the memory, the method described in the second aspect above can be implemented.
  • the communication device may further include a communication interface, which is used for the device to communicate with other devices.
  • the communication interface may be a transceiver, a circuit, a bus, a module or other types of communication interfaces.
  • the communication device includes: a memory, used for storing program instructions; a processor, used for obtaining a target symbol sequence through a communication interface; wherein, the target symbol sequence includes M symbols, and M is a positive integer , the M symbols include m symbols whose value is the first value.
  • the processor is further configured to determine information bits according to the trellis diagram and the target symbol sequence; wherein the information bits include K bits, K is a positive integer, and K is less than M; the trellis diagram includes at least M A directed edge, where one directed edge corresponds to the value of a symbol in the target symbol sequence.
  • the embodiment of the present application provides a communication system, including the communication device described in the third aspect or the fifth aspect, and the communication device described in the fourth aspect or the sixth aspect.
  • the embodiment of the present application further provides a computer program, which, when the computer program is run on a computer, causes the computer to execute the method provided in the first aspect or the second aspect.
  • the embodiment of the present application further provides a computer program product, including instructions, which, when run on a computer, cause the computer to execute the method provided in the first aspect or the second aspect.
  • the embodiment of the present application also provides a computer-readable storage medium, where a computer program or instruction is stored in the computer-readable storage medium, and when the computer program or instruction is run on a computer, the The computer executes the method provided in the first aspect or the second aspect above.
  • the embodiment of the present application further provides a chip, the chip is used to read the computer program stored in the memory, so as to execute the method provided in the first aspect or the second aspect above.
  • an embodiment of the present application further provides a system on chip, where the system on chip includes a processor, configured to support a computer device to implement the method provided in the first aspect or the second aspect above.
  • the chip system further includes a memory, and the memory is used to store necessary programs and data of the computer device.
  • the system-on-a-chip may consist of chips, or may include chips and other discrete devices.
  • FIG. 1 is a schematic structural diagram of a communication system provided by an embodiment of the present application.
  • FIG. 2 is a schematic flowchart of a channel coding transmission scheme
  • FIG. 3A is one of the schematic diagrams of the encoding process of polar shaping
  • FIG. 3B is one of the schematic diagrams of the encoding process of polar shaping
  • Figure 4A is one of the schematic diagrams of sequence mapping based on arithmetic coding
  • Figure 4B is one of the schematic diagrams of sequence mapping based on arithmetic coding
  • FIG. 5 is a schematic diagram of a grid graph-based DM implementation provided by an embodiment of the present application.
  • FIG. 6 is a schematic flowchart of an information processing method provided in an embodiment of the present application.
  • FIG. 7A is one of the structural schematic diagrams of the grid diagram provided by the embodiment of the present application.
  • FIG. 7B is one of the structural schematic diagrams of the grid diagram provided in the embodiment of the present application.
  • FIG. 7C is one of the structural schematic diagrams of the grid diagram provided in the embodiment of the present application.
  • FIG. 8A is one of the structural schematic diagrams of the grid diagram provided by the embodiment of the present application.
  • FIG. 8B is one of the structural schematic diagrams of the grid diagram provided by the embodiment of the present application.
  • FIG. 8C is one of the structural schematic diagrams of the grid diagram provided by the embodiment of the present application.
  • FIG. 9 is a schematic diagram of the application of the grid diagram provided by the embodiment of the present application.
  • FIG. 10 is one of the structural schematic diagrams of the communication device provided by the embodiment of the present application.
  • FIG. 11 is one of the schematic structural diagrams of a communication device provided by an embodiment of the present application.
  • the aforementioned wireless communication systems can include but are not limited to 5th generation (5th generation, 5G) communication systems, future communication systems (such as 6G communication systems), satellite communication systems, Device-to-device (D2D) communication system, machine-to-machine (M2M) communication system, Internet of Things (IoT), UAV communication system, narrowband Internet of Things system (narrow band-internet of things, NB-IoT), global system for mobile communications (GSM), enhanced data rate GSM evolution system (enhanced data rate for GSM evolution, EDGE), wideband code division multiple access system ( wideband code division multiple access, WCDMA), code division multiple access 2000 system (code division multiple access, CDMA2000), time division synchronous code division multiple access system (time division-synchronization code division multiple access, TD-SCDMA), long term evolution system ( The three application scenarios of long term evolution (LTE) and 5G mobile communication systems are eMBB, ultra reliable low latency communication (LTE) and 5G mobile communication systems) are eMBB, ultra reliable
  • a communication device in a communication system may send signals to or receive signals from another communication device.
  • a communication device that sends a signal may be called a sending end, and a communication device that receives a signal may be called a receiving end.
  • the signal may include one or more of information, configuration information, or data;
  • a communication device may also be called a device, an entity, a network entity, a communication module, a node, a communication node, etc.
  • a device is Examples are described.
  • the communication system may include at least one terminal device and at least one access network device.
  • the terminal device can be used as the sending end, and the access network device can be used as the receiving end; or, one terminal device can be used as the sending end, and the other terminal device can be used as the receiving end; or, the access network device can be used as the sending end, and the terminal device can be used as the receiving end. ; Or, one access network device acts as a sending end, and another access network device acts as a receiving end. That is, it can be understood that the terminal device and the access network device can send signals to each other; if the communication system includes multiple terminal devices, the multiple terminal devices can also send signals to each other.
  • a communication system includes an access network device 110 and two terminal devices, that is, a terminal device 120 and a terminal device 130 . At least one of the terminal device 120 and the terminal device 130 may send a signal to the access network device 110, and the access network device 110 may receive the signal. The access network device may also send a signal to at least one of the terminal device 120 and the terminal device 130 .
  • the terminal equipment and access network equipment in the communication system will be described in detail below.
  • the access network device may be a base station (base station, BS), and the access network device may also be called a network device, an access node (access node, AN), or a wireless access node (radio access node, RAN).
  • the access network device can be connected to a core network (such as an LTE core network or a 5G core network, etc.), and the access network device can provide wireless access services for terminal devices.
  • the access network equipment includes, but is not limited to, at least one of the following: a base station, a next-generation node B (generation nodeB, gNB) in 5G, and an access network equipment in an open radio access network (O-RAN) , evolved node B (evolved node B, eNB), radio network controller (radio network controller, RNC), node B (node B, NB), base station controller (base station controller, BSC), base transceiver station (base transceiver station, BTS), home base station (for example, home evolved nodeB, or home node B, HNB), base band unit (base band unit, BBU), sending and receiving point (transmitting and receiving point, TRP), transmitting point (transmitting point, TP), and/or mobile switching center, etc.
  • a base station a next-generation node B (generation nodeB, gNB) in 5G
  • OFD open radio access network
  • RNC radio network controller
  • node B node B
  • the access network device may also be a centralized unit (centralized unit, CU), a distributed unit (distributed unit, DU), a centralized unit control plane (CU control plane, CU-CP) node, or a centralized unit user plane (CU user plane, CU-UP) node.
  • the access network device may be a relay station, an access point, a vehicle-mounted device, a wearable device, or an access network device in a future evolved public land mobile network (public land mobile network, PLMN).
  • PLMN public land mobile network
  • a wireless communication system is generally composed of cells, each cell includes a base station (base station, BS), and the base station provides communication services to multiple mobile stations (mobile station, MS).
  • the base station includes a BBU (baseband unit, baseband unit) and a remote radio unit (remote radio unit, RRU).
  • BBU baseband unit, baseband unit
  • RRU remote radio unit
  • the BBU and RRU can be placed in the same or different places.
  • the RRU is remote and placed in a high traffic area, and the BBU is placed in the central computer room.
  • the BBU and RRU can also be placed in the same equipment room.
  • the BBU and the RRU may also be different components under one rack.
  • the communication device used to realize the function of the access network device may be the access network device, or may be a network device with some functions of the access network device, or may be capable of supporting the access network device to realize the function
  • An apparatus such as a chip system, a hardware circuit, a software module, or a hardware circuit plus a software module, can be installed in the access network equipment.
  • description is made by taking the communication device for implementing the function of the access network device as an example.
  • Terminal equipment also known as terminal, user equipment (UE), mobile station (mobile station, MS), mobile terminal (mobile terminal, MT), etc.
  • Terminal equipment can communicate with one or more core networks through access network equipment.
  • End devices include handheld devices with wireless connectivity, other processing devices connected to wireless modems, or vehicle-mounted devices.
  • the terminal device may be a portable, pocket, hand-held, computer built-in or vehicle-mounted mobile device.
  • terminal equipment are: personal communication service (PCS) telephones, cordless telephones, session initiation protocol (SIP) telephones, wireless local loop (WLL) stations, personal digital assistants (personal digital assistant, PDA), wireless network camera, mobile phone (mobile phone), tablet computer, notebook computer, palmtop computer, mobile Internet device (mobile internet device, MID), wearable device such as smart watch, virtual reality (virtual reality) , VR) equipment, augmented reality (augmented reality, AR) equipment, wireless terminals in industrial control (industrial control), terminals in car networking systems, wireless terminals in self driving (self driving), smart grid (smart grid) ), wireless terminals in transportation safety, wireless terminals in smart city (smart city) such as smart refueling devices, terminal equipment on high-speed rail, and wireless terminals in smart home (smart home), such as Smart speakers, smart coffee machines, smart printers, etc.
  • PCS personal communication service
  • SIP session initiation protocol
  • WLL wireless local loop
  • PDA personal digital assistants
  • wireless network camera mobile phone (
  • the communication device used to realize the function of the terminal device may be a terminal device, or a terminal device with some terminal functions, or a device capable of supporting the terminal device to realize this function, such as a chip system, the device Can be installed in terminal equipment.
  • the system-on-a-chip may be composed of chips, or may include chips and other discrete devices.
  • description is made by taking a terminal equipment (UE) as an example in which the communication device for realizing the function of the terminal equipment is used as an example.
  • UE terminal equipment
  • At least one of the following embodiments of the present application refers to one or more. Multiple means two or more.
  • “And/or” describes the association relationship of associated objects, indicating that there may be three types of relationships, for example, A and/or B may indicate: A exists alone, A and B exist simultaneously, and B exists independently.
  • the character "/" generally indicates that the contextual objects are an "or” relationship.
  • first, second, etc. may be used to describe objects in the embodiments of the present application, these objects should not be limited to these terms. These terms are only used to distinguish one object from another.
  • the embodiments of the present application relate to channel coding in a wireless communication system, and channel coding is generally used in a wireless communication system to improve data transmission performance.
  • the information source at the sending end is sent out on the channel after undergoing information source coding, channel coding and modulation in sequence.
  • the receiving end undergoes demodulation, channel decoding and source decoding in sequence to obtain the destination.
  • the coding based on polar code (polar) is a commonly used channel coding method.
  • the introduction of shaping technology in polar coding can make the transmitted modulation symbols conform to Gaussian distribution, and the amount of information transmitted per unit energy is the largest.
  • the shaping technology includes geometric shaping and probability shaping, etc.
  • the characteristics of geometric shaping are: maintain the equiprobable distribution of the input symbols, but make a special design for the constellation points, the distribution of constellation points with low energy is denser, and the distribution of constellation points with high energy Sparse.
  • the characteristics of probability shaping are: keep the constellation distribution unchanged, adjust the probability of constellation points, the symbol with low energy has a higher probability, and the symbol with high energy has a lower probability.
  • the polar encoding that introduces shaping technology can be understood as the encoding operation of polar shaping.
  • the encoding operation of polar shaping can be understood with reference to FIG. 3A and FIG. 3B .
  • the information bit grouping in Figure 3A is specifically shown in Figure 3B: the sending end can divide the information bit sequence of length K' into three groups, denoted as and
  • the interleaving in FIG. 3A is specifically shown in FIG. 3B as follows: performing intra-block interleaving on C 1 , C 2 and S 3 respectively to obtain C 1 , C 2 and S 3 .
  • the modulation in FIG. 3A is embodied in FIG. 3B as mapping C 1 , C 2 , and S 3 to 8 amplitude-shift keying (amplitude-shift keying, ASK) modulation symbols, denoted as X.
  • c 1,i , c 2,i , s 3,i are mapped to xi .
  • the symbols obtained after modulation obey a similar Gaussian distribution, which can achieve the effect of probability shaping and improve spectral efficiency.
  • the distribution matcher DM is mainly based on its own algorithm, and is responsible for mapping a uniformly distributed binary bit sequence to a symbol sequence conforming to a certain distribution.
  • the implementation of the DM algorithm in the related art will be further introduced in detail below.
  • the DM is specifically a constant composition distribution matching (CCDM).
  • CCDM usually sets a symbol sequence conforming to a certain distribution, such as a target sequence, and determines the number of information bits that can be carried by the target sequence, that is, the shaping bits, according to the possible number of the target sequence.
  • CCDM can map the information bits that can be carried to a symbol sequence that conforms to a certain distribution according to the arithmetic coding method.
  • CCDM can map information bits (or information bit sequences) such as 00/01/10/11 to target sequences through arithmetic coding.
  • the arithmetic coding process can be understood with reference to the following steps:
  • Step 1 There may be 6 problems in the permutation and combination of the target sequence, which is regarded as dividing the line segment with a length of 1 into 6 sub-line segments, corresponding to these 6 specific sequences: 0011/0101/0110/1001/1010/1100 .
  • this division process denote this division process as B, which is used to realize the correspondence between the sub-line segment and the target sequence. Specifically, this division B can be understood by taking one ball from the bag at a time and not putting it back:
  • segment 1 can be divided into two sub-segments, the sub-segment [0.5,1] of the upper part corresponds to the first bit of the target sequence being 1, and the lower part The sub-segment [0,0.5] corresponds to the first bit of the target sequence being 0.
  • the sub-line segment of the lower half determined last time can be divided into two parts according to the ratio of 2:1, where the length of the sub-line segment corresponding to the second ball is 1 and the length of the sub-line segment corresponding to the second ball is 0 is 2 :1. Or, in the case where the first ball drawn is a 1, then the second ball is taken. If the second ball is 1, the remaining two balls in the bag are 0, that is, there is only one case.
  • the sub-line segment of the upper half determined last time can be divided into two parts according to the ratio of 2:1, where the length of the sub-line segment corresponding to the second ball is 0 and the length of the sub-line segment corresponding to the second ball is 1 is 2 :1. Based on this, referring to (b) schematic diagram in Fig.
  • the sub-line segment The first bit corresponding to the target sequence is 0 and the second bit sequence is 0, the sub-line segment The first bit corresponding to the target sequence is 0 and the second bit sequence is 1, the sub-line segment The first bit corresponding to the target sequence is 1 and the second bit sequence is 0, the sub-line segment The first bit corresponding to the target sequence is 1 and the second bit sequence is 1.
  • Step 2 Similarly, there may be 4 problems in arranging and combining information bits, which can be regarded as dividing a line segment with a length of 1 into 4 sub-segments, corresponding to these 4 specific sequences: 00/01/10/11. Denote this division process as A, which is used to realize the correspondence between the sub-line segment and the information bit sequence.
  • the division method of A can be understood with reference to the division method of B in step 1, which will not be described in detail.
  • the line segment with a length of 1 is divided into 4 equal parts, and the sub-line segment Corresponding to the information bit sequence 00, the sub-line segment Corresponding to the information bit sequence 01, the sub-line segment Corresponding to the information bit sequence 10, the sub-line segment Corresponds to the information bit sequence 11.
  • the corresponding relationship between 4 kinds of information bit sequences and 6 kinds of target information bit sequences satisfies for an information bit sequence and its corresponding target sequence:
  • the value belongs to the range of the corresponding sub-segment in B of the target sequence.
  • the information bit sequence 00 corresponds to the target sequence 0011
  • the bit sequence 01 corresponds to the target sequence 0110, and so on.
  • an embodiment of the present application provides an information processing method, which implements mapping between bit sequences and symbol sequences based on a trellis graph (trellis).
  • the grid graph can be applied to DM to reduce the complexity of DM.
  • a grid graph may be constructed or defined, and the grid graph may be optimized.
  • the sending end side can realize DM by reading the mesh graph, that is, the shaping processing function; the receiving end side can realize inverse DM (inv-DM), that is, the unshaping processing function by reading the mesh graph.
  • the method mainly includes the following processes:
  • the sending end acquires information bits, where the information bits include K bits, where K is a positive integer.
  • information bits can also be understood as shaping bits.
  • the information bits when applied to the encoding operation of polar shaping, the information bits may be information bits in a group of information bit sequences of the aforementioned information bit group.
  • the value of K may be determined by the number of bits required for shaping, or may also be determined by setting the length of the shaped target symbol sequence.
  • the sending end maps the information bits into a target symbol sequence according to the trellis diagram.
  • the target symbol sequence includes M symbols, where M is a positive integer greater than K, and the M symbols include m symbols whose value is the first value.
  • the first value is any one of the p values, and the p values can be understood as the value range of a symbol in the target symbol sequence, that is, the value of a symbol in the target symbol sequence is among the p values A value of , p is a positive integer greater than 1.
  • the symbols in the target symbol sequence may include bits or other types of symbols.
  • the value of p is 2, that is, the value of the corresponding bit is 0 or 1; and for a symbol that is not a bit but other types of symbols, the value of p can be 2 or
  • the positive integer greater than 2 can be specifically determined by referring to the value of the symbol in the actual application, which is not limited in this embodiment of the present application.
  • the corresponding mapping requirement is that when a uniformly distributed symbol sequence is mapped to a symbol sequence with a certain distribution, the target symbol sequence should meet the p bias requirement: m is expressed as That is, the sequence of target symbols should have symbols take the first value, there should be symbols take the value of the third value. in, Indicates the rounding down operator.
  • the value of p bias can be a decimal between 0 and 1. For example, the value of p bias is 0.3.
  • the target symbol sequence can also be called the target bit sequence, then when a bit in the target bit sequence takes the first value or the third value, the first value is 0, and the third value is 1; or, the first value is 1, and the third value is 0.
  • the grid graph can be understood as a directed graph, and the grid graph can include at least M directed edges, and one directed edge corresponds to a value of a symbol.
  • the directed edge it can be understood as: the two endpoints of a directed edge include the start node and the end node, and the start node points to the end node; an element node in the grid graph points to another element node adjacent to it, forming a There is an edge.
  • the sending end can sequentially determine M+1 element nodes in the grid graph according to the information bits, and the directed edges between two adjacent element nodes among the M+1 element nodes are used to determine The value of a symbol in the target symbol sequence.
  • the jth element node in M+1 element nodes points to the j+1th element node, and the directed edge between the jth element node and the j+1th element node is used to determine the The value of j symbols.
  • j is taken from 1 to M, and j is a positive integer.
  • the sending end can determine a path including M directed edges in the trellis graph according to the information bits.
  • the first element node among the M+1 element nodes is related to the parameter M of the aforementioned target symbol sequence and the value of m. That is, the sending end can determine the first element node among the M+1 element nodes in the grid graph according to the values of M and m. The scheme for the sender to determine the first element node among the M+1 element nodes will be described in detail below.
  • the first element node is recorded as any one of the first M element nodes among the M+1 element nodes.
  • the next node of the first element node is the second element node pointed to by the first element node.
  • the first element node may point to one or more element nodes.
  • the second element node is one of the one or more element nodes pointed to by the first element node.
  • the values of symbols corresponding to directed edges between the first element node and different element nodes pointed to by the first element node are different.
  • the directed edge between the first element node and the second element node is recorded as the first A directed edge
  • the directed edge between the first element node and the fourth element node is recorded as a second directed edge.
  • the value of a symbol corresponding to the first directed edge is different from the value of a symbol corresponding to the second directed edge.
  • the last element node among the M+1 element nodes can be understood as a leaf node. From the point of view of the start node and end node with a directed edge, the leaf node will not be used as the start node of the directed edge, but will only be used as a directed edge node. To the end node of the edge.
  • the grid graph can be understood by referring to the following definitions (1) to (4):
  • the grid graph includes multiple element nodes (at least M+1 element nodes).
  • the third element node is any element node in the grid graph, and the third element node can be used to indicate the number of combinations
  • 0 ⁇ i ⁇ I; 0 ⁇ I ⁇ N, N ⁇ M; i, I, N are all integers.
  • N represents the maximum number of symbols for generating the target symbol sequence based on the trellis graph, that is, the longest target symbol sequence that can be mapped by the trellis graph includes N symbols, or a symbol sequence that is less than N symbols can be mapped.
  • the trellis graph supports variable code length and code rate, which is more flexible and adapts to different requirements of wireless communication.
  • I may represent part or all of the aforementioned N symbols, which are denoted as I symbols.
  • i may represent the number of symbols that take the first value among the I symbols. Based on this, the first element node among the aforementioned M+1 element nodes can be understood as indicating the number of combinations when I takes M and i takes m The third element node of . When I is M and i is m, the number of combinations It can be expressed as In addition, it can be understood that the maximum value of i is greater than or equal to m.
  • the maximum values of the corresponding parameters N and i can be predefined, and both the sending end and the receiving end can be determined.
  • the maximum value of i can be designed according to actual needs, that is, the maximum number of symbols whose value is the first value in the longest target symbol sequence that can be mapped by the grid map can be based on The design is based on actual requirements, which is not limited in this embodiment of the present application.
  • the third element node is any element node in the grid graph
  • the third element node can form a directed edge with its adjacent element nodes, and a directed edge corresponds to the value of a symbol.
  • the third element node can be specifically used to indicate Any element node other than the element node of the third element node can point to one or more element nodes in the grid graph.
  • the third element node is a leaf node. This third element node can be indicated with element nodes and/or directives for element node connections.
  • the first element node indicates the number of combinations
  • the number of combinations indicated by the second element node can be expressed as That is, it means that when the first element node points to the second element node, the number of symbols whose value is the first value does not change.
  • the first element node indicates the number of combinations
  • the number of combinations indicated by the second element node can be expressed as
  • the third element node is used to indicate the number of combinations That is, when the first element node points to the second element node, the number of symbols whose value is the first value is reduced by one.
  • each element node has a value. If the third element node points to multiple element nodes, the value of the third element node is less than or equal to the sum of the values of the multiple element nodes pointed to by the third element node.
  • the value of the first element node is less than or equal to the value of the multiple element nodes pointed to by the first element node Sum.
  • the value of the first element node is less than or equal to the sum of the values of the second element node and the fourth element node.
  • the number of combinations indicated by different element nodes in the grid is different, and the value of each element node is less than or equal to the number of combinations indicated by it.
  • the value of the third element node can be less than or equal to the number of combinations indicated by the third element node
  • the value of the third element node can be implemented with reference to Design 1 or Design 2 as follows:
  • the value of the third element node can be equal to the number of combinations it indicates
  • the value of the third element node can be embodied as a decimal number or a binary number, or it can indicate
  • a symbol corresponding to a directed edge in the grid graph takes the first value or the third value as an example.
  • a trellis diagram is illustrated, and the longest target symbol sequence that can be mapped by the trellis diagram includes 5 (N) symbols.
  • the maximum number of symbols taking the first value in the longest target symbol sequence is three.
  • Any element node in the grid graph is indicated by the third element node Among them, the value range of i is 0 ⁇ i ⁇ 3, and i ⁇ I; the value range of I is 0 ⁇ I ⁇ 5.
  • each element node in the grid graph is reflected in its indicated
  • the element node in the lower left corner of the grid graph is Starting from the element node in the lower left corner: when I is greater than 0, the third element node (indicating ) connected right neighbor node indicates and/or the upper right neighbor node connected by the third element node indicates
  • the right neighbor node of the element node at the bottom left corner is
  • the upper right neighbor node of the element node in the lower left corner is Or when I is equal to 0, the number of combinations indicated by the third element node is
  • a symbol corresponding to a directed edge in the grid graph takes the first value or the third value as an example.
  • a trellis diagram is illustrated, and the longest target symbol sequence that can be mapped by the trellis diagram includes 5 (N) symbols.
  • the maximum number of symbols taking the first value in the longest target symbol sequence is three.
  • Any element node in the grid graph is indicated by the third element node Among them, the value range of i is 0 ⁇ i ⁇ 3, and i ⁇ I; the value range of I is 0 ⁇ I ⁇ 5.
  • each element node in the grid graph is represented as a decimal number, for example, the element node in the lower left corner of the grid graph indicates The value of the element node in the lower left corner can be 10, starting from the element node in the lower left corner: when 1 is greater than 0, the third element node (indicating ) connected right neighbor node indicates and/or the upper right neighbor node connected to the third element node indicates For example, the right neighbor node of the bottom left most element node indicates The value is 6; the upper right neighbor node of the element node in the lower left corner indicates The value is 4. Or when I is equal to 0, the number of combinations indicated by the third element node is The value is 1.
  • a target effective digit can be set, and the effective digit of the binary number corresponding to the value of the third element node is less than or equal to the target effective digit. Specifically, if the number of combinations indicated by the third element node The effective digit of the corresponding binary number is greater than the target effective digit, then the value of the third element node is less than the combined number And the effective digit of the binary number corresponding to the value of the third element node is the target effective digit.
  • the specific value of the third element node is in line with the target effective number of digits and is less than the number of combinations the maximum value. If the number of combinations indicated by the third element node If the effective digit of the corresponding binary number is less than or equal to the target effective digit, then the value of the third element node is equal to the combination number
  • the longest target symbol sequence that can be mapped by the trellis diagram includes 5 (N) symbols, the first value is 0, and the third value is 1.
  • the maximum number of symbols that take the first value in the longest target symbol sequence is three. Indicated by any element node in the grid graph Among them, the value range of i is 0 ⁇ i ⁇ 3, and i ⁇ I; the value range of I is 0 ⁇ I ⁇ 5.
  • each element node in the grid graph is represented as a decimal number, the target effective digit is 1, and the element node in the lower left corner of the grid graph indicates The value of the element node in the lower left corner can be less than And it conforms to the maximum value of the target effective digit of 8, corresponding to the binary number 1000.
  • the third element node (indicating ) connected right neighbor node indicates and/or the upper right neighbor node connected to the third element node indicates
  • the right neighbor node of the bottom left most element node indicates The value can be less than And it conforms to the maximum value of the target effective number of 4, corresponding to the binary number 100; the upper right neighbor node of the element node in the lower left corner indicates The corresponding binary number conforms to the target effective number of digits, and the value is 4, which corresponds to the binary number 100.
  • the number of combinations indicated by the third element node is The value is 1.
  • design 2 the effective number of digits of each element node in the grid graph is reduced by introducing the target effective number of bits, which can reduce the storage resources occupied by the grid graph. Setting each element node in the grid graph as close as possible to the integer power of 2 is helpful for DM to map evenly distributed binary bits to target symbol sequences that obey a certain distribution.
  • design 2 can also be understood as a design for optimizing the grid graph based on design 1, which can be recorded as trellis optimization.
  • the symmetry of the combination number can also be used to eliminate some unnecessary element nodes in the grid graph to realize the optimization of the grid graph, that is, to optimize the grid graph of compression.
  • the value range of i can be or For example, when I takes 4, there may be an indication in the grid diagram element nodes of , or there may be indications in the grid diagram An element node, but no indication that neither exists The element node of the indicator exists again An element node that does not both exist indicates The element node of the indicator exists again element node.
  • the value range of i can be or That is, if I takes 3, there may be indications in the grid diagram element nodes of , or there may be indications in the grid diagram An element node, but no indication that neither exists The element node of the indicator exists again element node. In this way, the storage of grid graphs can be compressed to realize effective and reasonable utilization of storage resources.
  • FIG. 8A shows a compressed grid graph.
  • a dotted line box is used to illustrate the unnecessary element nodes that can be eliminated according to the symmetry of the combination number in the grid graph of FIG. 7A, such as and Figure 8B shows a compressed grid graph
  • the dotted line box shows the unnecessary element nodes that can be eliminated according to the symmetry of the combination number in the grid graph of Figure 7B, as indicated element node, indicating The element nodes and instructions for element node.
  • Figure 8C a compressed grid diagram is shown.
  • the dotted line box shows the unnecessary element nodes that can be eliminated according to the symmetry of the combination number in the grid diagram of Figure 7C, as indicated element node, indicating The element nodes and instructions for element node.
  • the method for the sending end to determine M+1 element nodes in the grid graph can be implemented according to the following steps A1 and A2:
  • the sender can indicate in the grid diagram according to the parameters M and m of the given target symbol sequence
  • the fifth element node of , the fifth element node represents the first element node among the aforementioned M+1 element nodes.
  • the sender can specifically determine the M-m+1th element node from top to bottom in the M+1th column from right to left in the grid graph as the fifth element node, That is, the first element node among the M+1 element nodes.
  • the sending end moves from right to left in the grid diagram of Figure 8C Read the fourth column from the left, and then read the second element node in the fourth column from top to bottom, and the read element node is the aforementioned fifth element node.
  • column numbers from right to left are marked on the basis of FIG. 8C .
  • M is 3 and m is 2, the position of the fifth element node (marked by a rectangular dotted line frame).
  • the sender starts from the fifth element node and traverses the remaining M element nodes in sequence.
  • the value of a symbol in the target symbol sequence is the first value or one of the third values
  • the first element node is any one of the first M element nodes in the M+1 element nodes
  • the first As an example, there are at most 2 element nodes pointed to by element nodes.
  • This A2 can be implemented in the following manner:
  • next element node of the fifth element node that is, the second element node among the M+1 element nodes can be determined according to the following A21 or A22:
  • A21 if the value corresponding to the information bit described in S601 is smaller than the value of the right neighbor node of the fifth element node, traverse from the fifth element node to the right neighbor node.
  • the information bits in S601 are denoted as K shaping corresponds to the aforementioned K, and indicates that the information bits include K bits.
  • F represent the value of the right neighbor node of an element node, as described in Design 1 or Design 2 above, this F can be expressed as a decimal number or a binary number. The following takes F as a decimal number as an example. The way of this step can be further described as:
  • bi2de means converting binary data to decimal numbers. It can be understood that if F itself is a binary number, no bi2de conversion is required.
  • A22 if the value corresponding to the information bit described in S601 is greater than or equal to the value of the right neighbor node of the fifth element node, traverse from the fifth element node to the upper right neighbor node.
  • the information bits in S601 are denoted as K shaping corresponds to the aforementioned K, and indicates that the information bits include K bits.
  • F represent the value of the right neighbor node of an element node, as described in Design 1 or Design 2 above, this F can be expressed as a decimal number or a binary number. The following takes F as a decimal number as an example. The way of this step can be further described as:
  • bi2de means converting binary data to decimal numbers
  • de2bi means converting decimal data to binary numbers. It can be understood that if F itself is a binary number, there is no need to perform bi2de and de2bi conversion.
  • A23 if the value corresponding to the information bit obtained after the last traversal is smaller than the value of the right neighbor node of the current element node, traverse from the current element node to the right neighbor node.
  • bi2de means converting binary data to decimal numbers.
  • here is the information bits obtained after the last traversal.
  • the current element node is the second element node, here It can be the information bits obtained after executing A22 or A23. If A22 is executed, here Still corresponding to the information bits described in S601, if A23 is executed, here Corresponding to the updated information bits described in A22.
  • F itself is a binary number, no bi2de conversion is required.
  • A24 if the value corresponding to the last information bit is greater than or equal to the value of the right neighbor node of the current element node, traverse from the current element node to the upper right neighbor node.
  • the left side of the equation is the updated while the right-hand side of the equation Refers to the information bits obtained after the last traversal.
  • the right side of the equation can be the information bits obtained after executing A21 or A22. If A21 is executed, the right side of the equation still corresponds to the information bits described in S601; if A22 is performed, the right side of the equation Corresponding to the updated information bits described in A22.
  • bi2de means converting binary data to decimal numbers
  • de2bi means converting decimal data to binary numbers. It can be understood that if F itself is a binary number, there is no need to perform bi2de and de2bi conversion.
  • the M+1 element node can be determined from the above A1 and A2, and the sender can determine the target symbol according to the directed edge between the j-th element node and the j+1-th element node among the M+1 element nodes The value of the jth symbol in the sequence.
  • j is taken from 1 to M, and j is a positive integer.
  • the uniformly distributed bit sequence (that is, the aforementioned information bits) can be mapped to the target symbol sequence with a certain distribution, without involving complex and frequent division operations.
  • the grid graph can be deployed in the polar coded DM to realize the shaping processing or shaping capability of the DM and reduce the complexity of the DM.
  • the sending end outputs the target symbol sequence.
  • the sending end can output the target symbol sequence to the channel.
  • the sending end can obtain the coding sequence through polar channel coding and concatenated long codes according to the description of the foregoing Figure 3A/3B, which is the embodiment of the present application. No further elaboration.
  • the sending end can also modulate the coded sequence and output it to the channel according to the modulation described in the aforementioned FIG. 3A/FIG. 3B.
  • the receiving end acquires a target symbol sequence, where the target symbol sequence includes M symbols, where M is a positive integer, and the M symbols include m symbols whose value is the first value.
  • the target symbol sequence obtained by the receiving end can be understood as being similar to the target symbol sequence output by the sending end in S603.
  • the receiving end may obtain the coded modulation sequence on the channel, perform demodulation and decoding to obtain the target symbol sequence.
  • the receiving end can decode the coded modulation sequence to obtain the target bit sequence in a manner related to channel decoding.
  • the channel decoding corresponds to the channel coding of the sending end. For example, if the sending end uses polar coding, the receiving end correspondingly uses a polar coding decoding method to perform channel decoding. This embodiment of the present application does not limit this.
  • the receiving end judges whether the target symbol sequence satisfies the p bias requirement.
  • the value of a symbol in the target symbol sequence is one of the first value or the third value. Determine whether the number m of symbols whose value is the first value in the target symbol sequence is And/or judge whether the symbol number Mm of the third value in the target symbol sequence is If the judging result satisfies the p bias requirement, execute S605; if not, output information indicating that the deshaping fails.
  • the receiving end determines information bits according to the trellis diagram and the target symbol sequence; wherein, the information bits include K bits, K is a positive integer, and M is greater than K.
  • the way the receiver determines the information bits can be understood as follows:
  • the first bit sequence is updated to obtain the information bits; wherein the first bit sequence includes K bits, so The value of each bit in the first bit sequence is a second value, and the second value may specifically be 0.
  • the value of a symbol in the target symbol sequence corresponds to the directed edge between two adjacent element nodes in the M+1 element nodes; the first element node in the M+1 element nodes It is related to the value of M and the value of m; the first element node is any one of the first M element nodes among the M+1 element nodes; among the M+1 element nodes, the The node next to the first element node is the second element node.
  • this method can be implemented according to the following steps B1 and B2.
  • the first bit sequence can be expressed as Wherein, the second value is 0,
  • B2 corresponding to S602, record the first element node among the M+1 element nodes as the fifth element node.
  • the sending end starts from the fifth element node in the grid graph, and traverses the remaining M element nodes sequentially according to the values of the M bits in the target sequence.
  • the first element node is any one of the first M element nodes among the M+1 element nodes, For example, there are at most 2 element nodes pointed to by the first element node.
  • This B2 can be implemented in the following manner:
  • next element node of the fifth element node that is, the second element node among the M+1 element nodes can be determined according to the following B21 or B22:
  • F represent the value of the right neighbor node of an element node, as described in Design 1 or Design 2 above, this F can be expressed as a decimal number or a binary number.
  • the way of this step can be further described as:
  • the first bit sequence is not updated, and the fifth element node is shifted to the right to the right neighbor node to continue execution.
  • F represent the value of the right neighbor node of an element node, as described in Design 1 or Design 2 above, this F can be expressed as a decimal number or a binary number.
  • the way of this step can be further described as:
  • bi2de means converting binary data to decimal numbers
  • de2bi means converting decimal data to binary numbers. It can be understood that if F itself is a binary number, there is no need to perform bi2de and de2bi conversion.
  • the first bit sequence is not updated, and the xth element node is shifted to the right to the right neighbor node to continue execution.
  • the first bit sequence is updated according to the value of the right node of the xth element node in the M+1 element nodes, and the xth Element nodes traverse to the right neighbor node to continue execution.
  • the third value if is the third value, then traverse the xth element node to its upper right neighbor node along the diagonal upward arrow to continue execution, and obtain the first bit sequence after the last (ie x-1th) traversal Update as follows: column Among them, the left side of the equation is the updated while the right-hand side of the equation Refers to the first bit sequence obtained after the last traversal. For example, when the current element node is the second element node, that is, the corresponding x is 2 this time, the right side of the equation It can be the first bit sequence obtained after executing B21 or B22.
  • bi2de means converting binary data to decimal numbers
  • de2bi means converting decimal data to binary numbers. It can be understood that if F itself is a binary number, there is no need to perform bi2de and de2bi conversion.
  • x takes an integer from 2 to M, repeats the above B22/B23 until the last element node among the M+1 element nodes is traversed, and the finally updated first bit sequence can be determined as the aforementioned information bit.
  • the grid graph applied to the receiving end can provide deshaping, or deshaping capability, which can reduce decoding complexity and shorten decoding delay.
  • the grid graph can be deployed in the inverse DM (inv-DM) at the receiving end to implement the unshaping processing or unshaping capability of the inv-DM and reduce the complexity of the inv-DM.
  • the sending end and the receiving end may include hardware structures and/or software modules, and realize the above functions in the form of hardware structures, software modules, or hardware structures plus software modules. Whether one of the above-mentioned functions is executed in the form of a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application and design constraints of the technical solution.
  • an embodiment of the present application provides a communication device 1000 , where the communication device 1000 includes a processing module 1001 and a communication module 1002 .
  • the communication device 1000 may be the sending end, or it may be a communication device that is applied to the sending end or matched with the sending end, and can realize the method performed by the sending end; or, the communication device 1000 may be the receiving end, or it may be an application A communication device that is used at the receiving end or matched with the receiving end to implement the method performed on the receiving end side.
  • the communication module may also be referred to as a transceiver module, a transceiver, a transceiver, a transceiver device, and the like.
  • a processing module may also be called a processor, a processing board, a processing unit, a processing device, and the like.
  • the device used to implement the receiving function in the communication module can be regarded as a receiving unit. It should be understood that the communication module is used to perform the sending and receiving operations on the access network device side or the terminal device side in the above method embodiments, The device used to implement the sending function in the communication module is regarded as a sending unit, that is, the communication module includes a receiving unit and a sending unit.
  • the processing module 1001 can be used to realize the processing function of the sending end in the embodiment shown in FIG. 6
  • the communication module 1002 can be used to realize all the sending and receiving functions of the sending end in the embodiment shown in FIG. Or part of the transceiver function.
  • the communication device can also be understood with reference to the third aspect in the summary of the invention and possible designs in the third aspect.
  • the processing module 1001 can be used to realize the processing function of the receiving end in the embodiment shown in FIG. Or part of the transceiver function.
  • the communication device can also be understood with reference to the third aspect in the summary of the invention and possible designs in the third aspect.
  • the aforementioned communication module and/or processing module may be realized by a virtual module, for example, the processing module may be realized by a software function unit or a virtual device, and the communication module may be realized by a software function or a virtual device.
  • the processing module or the communication module may also be implemented by a physical device, for example, if the device is implemented by a chip/chip circuit, the communication module may be an input and output circuit and/or a communication interface, and perform an input operation (corresponding to the aforementioned receiving operation), Output operation (corresponding to the aforementioned sending operation); the processing module is an integrated processor or a microprocessor or an integrated circuit.
  • each functional module in each embodiment of the embodiment of the present application can be integrated in In one processor, it may also exist separately physically, or two or more modules may be integrated into one module.
  • the above-mentioned integrated modules can be implemented in the form of hardware or in the form of software function modules.
  • the embodiment of the present application also provides a communication device 1100 .
  • the communication device 1100 may be a chip or a chip system.
  • the system-on-a-chip may be composed of chips, or may include chips and other discrete devices.
  • the communication device 1100 may be used to realize the function of any network element in the communication system shown in FIG. 1 .
  • the communication device 1100 may include at least one processor 1110, and the processor 1110 is coupled to a memory.
  • the memory may be located within the device, the memory may be integrated with the processor, or the memory may be located outside the device.
  • the communication device 1100 may further include at least one memory 1120 .
  • the memory 1120 stores necessary computer programs, configuration information, computer programs or instructions and/or data for implementing any of the above embodiments; the processor 1110 may execute the computer programs stored in the memory 1120 to complete the method in any of the above embodiments.
  • the communication device 1100 may further include a communication interface 1130, and the communication device 1100 may perform information exchange with other devices through the communication interface 1130.
  • the communication interface 1130 may be a transceiver, a circuit, a bus, a module, a pin or other types of communication interfaces.
  • the communication interface 1130 in the device 1100 may also be an input and output circuit, which can input information (or call it receiving information) and output information (or call it sending information)
  • the processor is an integrated processor or a microprocessor or an integrated circuit or a logic circuit, and the processor can determine output information according to input information.
  • the coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information exchange between devices, units or modules.
  • the processor 1110 may cooperate with the memory 1120 and the communication interface 1130 .
  • a specific connection medium among the processor 1110, the memory 1120, and the communication interface 1130 is not limited.
  • the bus 1140 may be a peripheral component interconnect standard (peripheral component interconnect, PCI) bus or an extended industry standard architecture (extended industry standard architecture, EISA) bus or the like.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • the bus can be divided into address bus, data bus, control bus and so on. For ease of representation, only one thick line is used in FIG. 11 , but it does not mean that there is only one bus or one type of bus.
  • the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, which may implement or Various methods, steps, and logic block diagrams for executing the application embodiments in the embodiments of the present application.
  • a general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method in the embodiments of the application in combination with the embodiments of the present application may be directly implemented by a hardware processor, or executed by a combination of hardware and software modules in the processor.
  • the memory may be a non-volatile memory, such as a hard disk (hard disk drive, HDD) or a solid-state drive (solid-state drive, SSD), etc., and may also be a volatile memory (volatile memory), such as Random-access memory (RAM).
  • a memory is, but is not limited to, any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
  • the memory in the embodiment of the present application may also be a circuit or any other device capable of implementing a storage function, and is used for storing program instructions and/or data.
  • the communication device 1100 can be applied to the sending end, and the specific communication device 1100 can be the sending end, or a device that can support the sending end and realize the functions of the sending end in any of the above-mentioned embodiments .
  • the memory 1120 stores necessary computer programs, computer programs or instructions and/or data for realizing the functions of the sending end in any of the above-mentioned embodiments.
  • the processor 1110 may execute the computer program stored in the memory 1120 to complete the method performed by the sending end in any of the foregoing embodiments.
  • the communication interface in the communication device 1100 can be used to interact with the receiving end, such as sending information to the receiving end.
  • the communication device 1100 can be applied to the receiving end, and the specific communication device 1100 can be the receiving end, or it can support the receiving end to realize the functions of the receiving end in any of the above-mentioned embodiments. device.
  • the memory 1120 stores necessary computer programs, computer programs or instructions and/or data for realizing the functions of the receiver in any of the above-mentioned embodiments.
  • the processor 1110 may execute the computer program stored in the memory 1120 to complete the method executed by the receiving end in any of the foregoing embodiments.
  • the communication interface in the communication device 1100 can be used to interact with the sending end, such as receiving information from the sending end.
  • the communication device 1100 provided in this embodiment can be applied to the sending end to complete the above method performed by the sending end, or applied to the receiving end to complete the method executed by the receiving end. Therefore, the technical effects that can be obtained can refer to the above-mentioned method embodiments, and will not be repeated here.
  • this embodiment of the present application also provides a computer program, which, when the computer program is run on a computer, enables the computer to execute the embodiment shown in FIG. 6 from the perspective of the sending end or the receiving end. provided methods.
  • this embodiment of the present application also provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a computer, the computer makes the The side angle implements the method provided in the embodiment shown in FIG. 6 .
  • the storage medium may be any available medium that can be accessed by a computer.
  • computer-readable media may include RAM, read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), CD- ROM or other optical disk storage, magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
  • an embodiment of the present application provides a communication system, including a sending end and a receiving end, where the sending end and the receiving end can implement the method provided in the embodiment shown in FIG. 6 .
  • the embodiment of the present application also provides a chip, the chip is used to read the computer program stored in the memory, and realize the implementation provided in the embodiment shown in FIG. 6 from the perspective of the sending end or the receiving end. Methods.
  • an embodiment of the present application provides a chip system
  • the chip system includes a processor, configured to support a computer device to implement the functions involved in the sending end or receiving end in the embodiment shown in FIG. 6 .
  • the chip system further includes a memory, and the memory is used to store necessary programs and data of the computer device.
  • the system-on-a-chip may consist of chips, or may include chips and other discrete devices.
  • the technical solutions provided by the embodiments of the present application may be fully or partially implemented by software, hardware, firmware or any combination thereof.
  • software When implemented using software, it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer program instructions When the computer program instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present application will be generated in whole or in part.
  • the computer may be a general computer, a special computer, a computer network, an access network device, a terminal device or other programmable devices.
  • the computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website, computer, server or data center Transmission to another website site, computer, server or data center by wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.).
  • the computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or a data center integrated with one or more available media.
  • the available medium may be a magnetic medium (for example, a floppy disk, a hard disk, or a magnetic tape), an optical medium (for example, a digital video disc (digital video disc, DVD)), or a semiconductor medium.
  • the various embodiments may refer to each other, for example, the methods and/or terms between the method embodiments may refer to each other, such as the functions and/or terms between the device embodiments Or terms may refer to each other, for example, functions and/or terms between the apparatus embodiment and the method embodiment may refer to each other.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请提供一种信息处理方法及通信装置，能够降低分布匹配器的实现复杂度，提升编码效率。该方法包括：获取信息比特，信息比特包括K个比特，K为正整数；根据网格图，将信息比特映射成目标符号序列；其中，目标符号序列包括M个符号，M为大于K的正整数，M个符号中包括m个取值为第一值的符号；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。

Description

一种信息处理方法及通信装置
相关申请的交叉引用
本申请要求在2021年10月31日提交中华人民共和国知识产权局、申请号为202111278886.2、申请名称为“一种信息处理方法及通信装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及通信技术领域，尤其涉及一种信息处理方法及通信装置。
背景技术
高阶调制技术可以将多个码字比特映射到同一个调制符号，该方式可以进一步提升频谱效率。例如，16QAM是将4个比特映射到一个调制符号中，64QAM是指将6个比特映射到一个调制符号。高阶调制中，不同的调制符号对应的能量不同，多发送低能量的调制符号、少发送高能量的调制符号，可以节省平均能量。对于高斯白噪声信道，当发送的调制符号分布服从高斯分布时，单位能量传递的信息量最大。
为了使得发送的调制符号符合高斯分布，在编码调制过程中引入了成形(shaping)技术，例如几何成形，概率成形。成形处理的实现复杂度会影响方案的可实施程度。
发明内容
本申请实施例提供一种信息处理方法及通信装置，用于降低信道编码成形处理实现的复杂度，提升信道编码及传输效率。
第一方面，本申请实施例提供一种信息处理方法，包括：获取信息比特，所述信息比特包括K个比特，K为正整数；根据网格图，将所述信息比特映射成目标符号序列；其中，所述目标符号序列包括M个符号，M为大于K的正整数，所述M个符号中包括m个取值为第一值的符号；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
在上述设计中，利用网格图指示符号的取值，通过读取网格图即可实现信息比特到目标符号序列的映射，减少成形处理的运算复杂度，能够提升信道编码及传输速率。
在一种可能的设计中，所述根据网格图，将所述信息比特映射成目标符号序列，包括：根据所述信息比特在所述网格图中依次确定M+1个元素节点，所述M+1个元素节点中两个相邻的元素节点之间的有向边用于确定所述目标符号序列中的一个符号的取值；其中，所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
上述设计中，网格图的相邻元素节点之间构成有向边，形成多级嵌套。按照目标符号 序列的参数配置，依次读取多个元素节点，能够快速根据读取该多个元素节点所遍历的有向边，确定出目标符号序列。
第二方面，本申请实施例提供一种信息处理方法，包括：获取目标符号序列；其中，所述目标符号序列包括M个符号，M为正整数，所述M个符号中包括m个取值为第一值的符号；根据网格图和所述目标符号序列，确定信息比特；其中，所述信息比特包括K个比特，K为正整数，K小于M；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
在上述设计中，利用网格图指示符号的取值，通过读取网格图即可从目标符号序列恢复信息比特，能够降低解成形处理的运算复杂度。
在一种可能的设计中，所述根据网格图和所述目标符号序列，确定信息比特，包括：根据所述网格图中M+1个元素节点中的至少一个元素节点的取值，对第一比特序列进行更新得到所述信息比特；其中，所述第一比特序列包括K个比特，所述第一比特序列中每个比特的取值为第二值；所述目标符号序列中一个符号的取值对应所述M+1个元素节点中两个相邻的元素节点之间的有向边；所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
第三方面，本申请实施例提供一种通信装置，该通信装置可以是发送端，也可以是发送端中的装置，或者是能够和发送端匹配使用的装置。一种设计中，该通信装置可以包括执行第一方面中所描述的方法/操作/步骤/动作所一一对应的模块，该模块可以是硬件电路，也可是软件，也可以是硬件电路结合软件实现。一种设计中，该通信装置可以包括处理模块和通信模块。示例性地：通信模块，用于获取信息比特，所述信息比特包括K个比特，K为正整数。
处理模块，用于根据网格图，将所述信息比特映射成目标符号序列；其中，所述目标符号序列包括M个符号，M为大于K的正整数，所述M个符号中包括m个取值为第一值的符号；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
在一种可能的设计中，所述处理模块，具体用于：根据所述信息比特在所述网格图中依次确定M+1个元素节点，所述M+1个元素节点中两个相邻的元素节点之间的有向边用于确定所述目标符号序列中的一个符号的取值；其中，所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
第四方面，本申请实施例提供一种通信装置，该通信装置可以是接收端，也可以是接收端中的装置，或者是能够和接收端匹配使用的装置。一种设计中，该通信装置可以包括执行第一方面中所描述的方法/操作/步骤/动作所一一对应的模块，该模块可以是硬件电路，也可是软件，也可以是硬件电路结合软件实现。一种设计中，该通信装置可以包括处理模块和通信模块。示例性地：通信模块，用于获取目标符号序列；其中，所述目标符号序列 包括M个符号，M为正整数，所述M个符号中包括m个取值为第一值的符号。处理模块，用于根据网格图和所述目标符号序列，确定信息比特；其中，所述信息比特包括K个比特，K为正整数，K小于M；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
在一种可能的设计中，处理模块，具体用于：根据所述网格图中M+1个元素节点中的至少一个元素节点的取值，对第一比特序列进行更新得到所述信息比特；其中，所述第一比特序列包括K个比特，所述第一比特序列中每个比特的取值为第二值；所述目标符号序列中一个符号的取值对应所述M+1个元素节点中两个相邻的元素节点之间的有向边；所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
在第一方面至第四方面任一方面的一种可能的设计中，所述第一元素节点指向多个元素节点时，所述第一元素节点与所述第一元素节点指向的不同元素节点之间的有向边对应的符号的取值不同。
在第一方面至第四方面任一方面的一种可能的设计中，所述网格图中每个元素节点均具有取值，所述第一元素节点指向多个元素节点时，所述第一元素节点的取值小于或者等于所述第一元素节点指向的多个元素节点的取值之和。
在第一方面至第四方面任一方面的一种可能的设计中，所述网格图中包括至少M+1个元素节点，第三元素节点为所述至少M+1个元素节点中的任意一个元素节点，所述第三元素节点用于指示组合数
Figure PCTCN2022127779-appb-000001
所述第三元素节点的取值小于或者等于所述组合数
Figure PCTCN2022127779-appb-000002
其中，0≤i≤I，0≤I≤N，N≥M；i，I，N均为整数；所述网格图中不同元素节点所指示的组合数不同。
上述设计中，网格图中的每个元素节点的取值表示当前剩余符号取值类型的组合数情况。网格图可以满足确定目标符号序列以及比目标符号序列的长度更长的符号序列，在通过读取网格图确定目标符号序列时，可以不用从指示组合数最大的元素节点开始遍历，使得网格图的应用更为灵活。
在第一方面至第四方面任一方面的一种可能的设计中，若所述组合数
Figure PCTCN2022127779-appb-000003
对应二进制数的有效位数大于目标有效位数，所述第三元素节点的取值小于所述组合数
Figure PCTCN2022127779-appb-000004
且所述第三元素节点的取值对应的二进制数的有效位数为所述目标有效位数；或者，若所述组合数
Figure PCTCN2022127779-appb-000005
对应二进制数的有效位数小于或者等于目标有效位数，所述第三元素节点的取值等于所述组合数
Figure PCTCN2022127779-appb-000006
上述设计中，引入目标有效位数，可有效降低网格图中各元素节点的有效位数，能够压缩网格图占用的存储空间。
在第一方面至第四方面任一方面的一种可能的设计中，I的取值为偶数时，
Figure PCTCN2022127779-appb-000007
或
Figure PCTCN2022127779-appb-000008
或者，I的取值为奇数时，
Figure PCTCN2022127779-appb-000009
或
Figure PCTCN2022127779-appb-000010
该设计中，利用组合数的对称性，对于指示组合数对称的两个元素节点，在网格图中保留其中一个，可以实现对网格图的存储压缩，避免不必要的资源浪费。
第五方面，本申请实施例提供一种通信装置，所述通信装置包括处理器，用于实现上 述第一方面所描述的方法。所述通信装置还可以包括存储器，用于存储指令和数据。所述存储器与所述处理器耦合，所述处理器执行所述存储器中存储的指令时，可以实现上述第一方面描述的方法。所述通信装置还可以包括通信接口，所述通信接口用于该装置与其它设备进行通信，示例性的，通信接口可以是收发器、电路、总线、模块或其它类型的通信接口。
在一种可能的设备中，该通信装置包括：存储器，用于存储程序指令；处理器，用于利用通信接口获取信息比特，所述信息比特包括K个比特，K为正整数。处理器，还用于根据网格图，将所述信息比特映射成目标符号序列；其中，目标符号序列包括M个符号，M为大于K的正整数，M个符号中包括m个取值为第一值的符号；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
第六方面，本申请实施例提供一种通信装置，所述通信装置包括处理器，用于实现上述第二方面所描述的方法。所述通信装置还可以包括存储器，用于存储指令和数据。所述存储器与所述处理器耦合，所述处理器执行所述存储器中存储的指令时，可以实现上述第二方面描述的方法。所述通信装置还可以包括通信接口，所述通信接口用于该装置与其它设备进行通信，示例性的，通信接口可以是收发器、电路、总线、模块或其它类型的通信接口。
在一种可能的设备中，该通信装置包括：存储器，用于存储程序指令；处理器，用于利用通信接口获取目标符号序列；其中，所述目标符号序列包括M个符号，M为正整数，M个符号中包括m个取值为第一值的符号。处理器，还用于根据网格图和所述目标符号序列，确定信息比特；其中，所述信息比特包括K个比特，K为正整数，K小于M；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
第七方面，本申请实施例提供了一种通信系统，包括如上述第三方面或第五方面所描述的通信装置，以及如上述第四方面或第六方面所描述的通信装置。
第八方面，本申请实施例还提供了一种计算机程序，当所述计算机程序在计算机上运行时，使得所述计算机执行上述第一方面或第二方面提供的方法。
第九方面，本申请实施例还提供了一种计算机程序产品，包括指令，当所述指令在计算机上运行时，使得计算机执行上述第一方面或第二方面提供的方法。
第十方面，本申请实施例还提供了一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机程序或指令，当所述计算机程序或者指令在计算机上运行时，使得所述计算机执行上述第一方面或第二方面中提供的方法。
第十一方面，本申请实施例还提供了一种芯片，所述芯片用于读取存储器中存储的计算机程序，以执行上述第一方面或第二方面中提供的方法。
第十二方面，本申请实施例还提供了一种芯片系统，该芯片系统包括处理器，用于支持计算机装置实现上述第一方面或第二方面中提供的方法。在一种可能的设计中，所述芯片系统还包括存储器，所述存储器用于保存该计算机装置必要的程序和数据。该芯片系统可以由芯片构成，也可以包含芯片和其他分立器件。
上述第二方面至第十二方面中任一方面可以达到的有益效果，请具体参照上述第一方面中任一可能设计可以达到的有益效果描述，重复之处不再论述。
附图说明
图1为本申请实施例提供的一种通信系统的架构示意图；
图2为一种信道编码传输方案的流程示意图；
图3A为polar整形的编码流程示意图之一；
图3B为polar整形的编码流程示意图之一；
图4A为基于算术编码的序列映射示意图之一；
图4B为基于算术编码的序列映射示意图之一；
图5为本申请实施例提供的一种基于网格图的DM实现示意图；
图6为本申请实施例提供的一种信息处理方法的流程示意图；
图7A为本申请实施例提供的网格图的结构示意图之一；
图7B为本申请实施例提供的网格图的结构示意图之一；
图7C为本申请实施例提供的网格图的结构示意图之一；
图8A为本申请实施例提供的网格图的结构示意图之一；
图8B为本申请实施例提供的网格图的结构示意图之一；
图8C为本申请实施例提供的网格图的结构示意图之一；
图9为本申请实施例提供的网格图的应用示意图；
图10为本申请实施例提供的通信装置的结构示意图之一；
图11为本申请实施例提供的通信装置的结构示意图之一。
具体实施方式
下面结合附图对本申请实施例进行详细描述。
本申请实施例可以应用于各种无线通信系统，例如前述无线通信系统可以包括但不限于第5代(5th generation，5G)通信系统、未来的通信系统(如6G通信系统)、卫星通信系统、设备到设备(device-to-device，D2D)通信系统、机器到机器(machine to machine，M2M)通信系统、物联网(Internet of Things，IoT)、无人机通信系统、窄带物联网系统(narrow band-internet of things，NB-IoT)、全球移动通信系统(global system for mobile communications，GSM)、增强型数据速率GSM演进系统(enhanced data rate for GSM evolution，EDGE)、宽带码分多址系统(wideband code division multiple access，WCDMA)、码分多址2000系统(code division multiple access，CDMA2000)、时分同步码分多址系统(time division-synchronization code division multiple access，TD-SCDMA)，长期演进系统(long term evolution，LTE)以及5G移动通信系统的三大应用场景即eMBB，超高可靠与低延迟的通信(ultra reliable low latency communication，URLLC)以及大规模机器通信(massive machine-type communications，mMTC)。
通信系统中的一个通信设备可以向另一个通信设备发送信号或从另一个设备接收信号。发送信号的通信设备可以称为发送端，接收信号的通信设备可以称为接收端。其中，信号可以包括信息、配置信息或者数据中的一个或多个；通信设备也可以被称为设备、实体、网络实体、通信模块、节点、通信节点等等，本申请实施例中以设备为例进行描述。具体地，通信系统可以包括至少一个终端设备和至少一个接入网设备。其中，可以是终端设备作为发送端，接入网设备作为接收端；或者，一个终端设备作为发送端，另一个终端 设备作为接收端；或者，接入网设备作为发送端，终端设备作为接收端；又或者，一个接入网设备作为发送端，另一个接入网设备作为接收端。即可以理解的是，终端设备和接入网设备之间可以互发信号；若通信系统中包括多个终端设备，多个终端设备之间也可以互发信号。
作为示例，参见图1示意一种通信系统，该通信系统包括接入网设备110以及两个终端设备，即终端设备120和终端设备130。终端设备120和终端设备130中的至少一个可以发送信号给接入网设备110，接入网设备110可以接收该信号。接入网设备也可以向终端设备120和终端设备130中的至少一个发送信号。
下面对通信系统中的终端设备和接入网设备进行详细说明。
接入网设备可以为基站(base station，BS)，接入网设备还可以称为网络设备、接入节点(access node，AN)、无线接入节点(radio access node，RAN)。接入网设备可以与核心网(如LTE的核心网或者5G的核心网等)连接，接入网设备可以为终端设备提供无线接入服务。接入网设备例如包括但不限于以下至少一个：基站、5G中的下一代节点B(generation nodeB，gNB)、开放无线接入网(open radio access network，O-RAN)中的接入网设备、演进型节点B(evolved node B，eNB)、无线网络控制器(radio network controller，RNC)、节点B(node B，NB)、基站控制器(base station controller，BSC)、基站收发台(base transceiver station，BTS)、家庭基站(例如，home evolved nodeB，或home node B，HNB)、基带单元(base band unit，BBU)、收发点(transmitting and receiving point，TRP)、发射点(transmitting point，TP)、和/或移动交换中心等。或者，接入网设备还可以是集中单元(centralized unit，CU)、分布单元(distributed unit,DU)、集中单元控制面(CU control plane，CU-CP)节点、或集中单元用户面(CU user plane，CU-UP)节点。或者，接入网设备可以为中继站、接入点、车载设备、可穿戴设备或者未来演进的公共陆地移动网络(public land mobile network，PLMN)中的接入网设备等。
示例性的，无线通信系统通常由小区组成，每个小区包含一个基站(base station，BS)，基站向多个移动台(mobile station，MS)提供通信服务。其中，基站包含BBU(baseband unit，基带单元)和远端射频单元(remote radio unit，RRU)。BBU和RRU可以放置在相同或者不同的地方，例如：RRU拉远，放置于高话务量的区域，BBU放置于中心机房。或者，BBU和RRU也可以放置在同一机房。或者，BBU和RRU也可以为一个机架下的不同部件。
本申请实施例中，用于实现接入网设备功能的通信装置可以是接入网设备，也可以是具有接入网设备部分功能的网络设备，也可以是能够支持接入网设备实现该功能的装置，例如芯片系统，硬件电路、软件模块、或硬件电路加软件模块，该装置可以被安装在接入网设备中。本申请实施例的方法中，以用于实现接入网设备功能的通信装置是接入网设备为例进行描述。
终端设备又称之为终端、用户设备(user equipment，UE)、移动台(mobile station，MS)、移动终端(mobile terminal，MT)等，是一种向用户提供语音和/或数据连通性的设备。终端设备可通过接入网设备与一个或多个核心网进行通信。终端设备包括具有无线连接功能的手持式设备、连接到无线调制解调器的其他处理设备或车载设备等。终端设备可以是便携式、袖珍式、手持式、计算机内置的或者车载的移动装置。一些终端设备的举例为：个人通信业务(personal communication service，PCS)电话、无绳电话、会话发起协 议(session initiation protocol，SIP)话机、无线本地环路(wireless local loop，WLL)站、个人数字助理(personal digital assistant，PDA)、无线网络摄像头、手机(mobile phone)、平板电脑、笔记本电脑、掌上电脑、移动互联网设备(mobile internet device，MID)、可穿戴设备如智能手表、虚拟现实(virtual reality，VR)设备、增强现实(augmented reality，AR)设备、工业控制(industrial control)中的无线终端、车联网系统中的终端、无人驾驶(self driving)中的无线终端、智能电网(smart grid)中的无线终端、运输安全(transportation safety)中的无线终端、智慧城市(smart city)中的无线终端如智能加油器，高铁上的终端设备以及智慧家庭(smart home)中的无线终端，如智能音响、智能咖啡机、智能打印机等。
本申请实施例中，用于实现终端设备功能的通信装置可以是终端设备，也可以是具有终端部分功能的终端设备，也可以是能够支持终端设备实现该功能的装置，例如芯片系统，该装置可以被安装在终端设备中。本申请实施例中，芯片系统可以由芯片构成，也可以包括芯片和其他分立器件。本申请实施例提供的技术方案中，以用于实现终端设备功能的通信装置是终端设备(UE)为例进行描述。
本申请实施例如下涉及的至少一个，指示一个或多个。多个，是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。字符“/”一般表示前后关联对象是一种“或”的关系。另外，应当理解，尽管在本申请实施例中可能采用术语第一、第二等来描述各对象、但这些对象不应限于这些术语。这些术语仅用来将各对象彼此区分开。
本申请实施例如下描述中所提到的术语“包括”和“具有”以及它们的任何变形，意图在于覆盖不排他的包含。例如包含了一系列步骤或单元的过程、方法、系统、产品或设备没有限定于已列出的步骤或单元，而是可选地还包括其他没有列出的步骤或单元，或可选地还包括对于这些过程、方法、产品或设备固有的其它步骤或单元。需要说明的是，本申请实施例中，“示例性的”或者“例如”等词用于表示作例子、例证或说明。本申请实施例中被描述为“示例性的”或者“例如”的任何方法或设计方案不应被解释为比其它方法或设计方案更优选或更具优势。确切而言，使用“示例性的”或者“例如”等词旨在以具体方式呈现相关概念。
本申请实施例涉及无线通信系统中的信道编码，无线通信系统中通常采用信道编码提升数据传输性能。如图2示意，发送端的信源依次经过信源编码、信道编码和调制后在信道上发出。接收端收到信号后依次经过解调、信道解码和信源解码后获得信宿。
基于极化码(polar)的编码是一种常用的信道编码方式，在polar编码中引入成形技术，可以使得发送的调制符号符合高斯分布，单位能量传递的信息量最大。其中，成形技术包括几何成形和概率成形等，几何成形的特点是：保持输入符号的等概分布，但对星座点做特殊的设计，能量低的星座点分布密一些，能量高的星座点分布稀疏一些。概率成形的特点是：保持星座分布不变，调整星座点的概率，能量低的符号概率高一些，能量高的符号概率低一些。
引入成形技术的polar编码又可以理解为polar整形的编码操作。具体地，可参阅图3A和图3B来理解polar整形的编码操作。图3A中的信息位分组在图3B中具体表现为：发送端可将长度为K′的信息比特序列分成三组，记为
Figure PCTCN2022127779-appb-000011
和
Figure PCTCN2022127779-appb-000012
图3A中的成形 (shaping)与信道编码在图3B中具体表现为：将序列U 3通过分布匹配器DM进行映射，得到S′ 3＝s’ 3,1,…,s’ 3,N。N是符号序列长度。将S′ 3经polar变换(transform)得到m 3,1,…,m 3,N。取序列M 3,F＝{m 3,i,i∈F}与U 1、U 2一起进行polar信道编码得C′ 1＝c’ 1,1,…,c’ 1,N,C′ 2＝c’ 2,1,…,c’ 2,N。图3A中的级联成长码在图3B中具体表现为：将C′ 1，C′ 2与S′ 3级联成长码，得到C 1,C 2与S 3。其中，c’ 1,i，c’ 2,i与s’ 3,i进行polar transform得到c 1,i，c 2,i与s 3,i。其中，对于不是母码长度的polar transform，可以从后往前按自然顺序(nature，NAT)缩短执行，即将最后若干个比特置0。图3A中的交织在图3B中具体表现为：将C 1，C 2与S 3分别进行块内交织，得到C 1，C 2与S 3。图3A中的调制在图3B中具体表现为将C 1、C 2、S 3映射到8幅移键控(amplitude-shift keying，ASK)调制符号，记为X。其中，c 1,i，c 2,i，s 3,i映射到x i。调制之后得到的符号服从类似高斯分布，可以实现概率成形的效果，提升频谱效率。
在上述成形与信道编码过程中，分布匹配器DM主要基于自身的算法，负责将均匀分布的二进制比特序列映射到符合一定分布的符号序列。下面进一步对相关技术中DM的算法实现进行详细介绍。
在相关技术中，DM具体是同构成分布匹配器(constant composition distribution matching，CCDM)。CCDM通常会设定符合一定分布的符号序列，如记作目标(target)序列，并依据该目标序列可能的数量，确定其能够承载的信息比特数目，即shaping比特位。进而CCDM可以按照算术编码的方式，将能够承载的信息比特映射到符合一定分布的符号序列。示例性的，假设目标序列是一个长度为4比特且均含有2个0和2个1的序列，这样的序列可能有6个，其所能够承载的信息比特数目为
Figure PCTCN2022127779-appb-000013
即CCDM通过算术编码可以将00/01/10/11这样的信息比特(或称信息比特序列)映射到目标序列。具体地，算术编码过程可参照如下步骤理解：
步骤1：将目标序列排列组合可能有6个的问题，视为对长度为1的线段等分成6个子线段，分别对应到这6个具体的序列：0011/0101/0110/1001/1010/1100。记这一划分过程为B，用于实现子线段与目标序列的对应。具体地，这一划分B可以通过从包里每次取一个球，不放回的过程进行理解：
假设一个包里面有两种球，分别是2个0和2个1。
首先，当从包里取出第一个球后，如果是0，则包里面还有两个1，一个0，根据不同的排列，存在三种情况。如果从包里取出来的第一个球是1，则包里面还有两个0，一个1，根据不同的排列，也是三种情况。基于此，参见图4A中的(a)示意，可将线段1一分为2个子线段，上半部分的子线段[0.5,1]对应于目标序列的第一个比特是1，下半部分的子线段[0,0.5]对应于目标序列的第一个比特是0。
在取出的第一个球是0的情况下，接着取第二个球。如果第二个球是0，则包里剩余的两个球均为1，即只有一种情况。如果第二个球是1，则包里剩余的球是一个0和一个1，共两种情况。因此可以将上一次确定的下半部分的子线段按2：1的比例分成两份，其中第二个球是1所对应子线段的长度与第二个球是0所子线段的长度为2:1。或者，在取出的第一个球是1的情况下，接着取第二个球。如果第二个球是1，则包里剩余的两个球均为0，即只有一种情况。如果第二个球是0，则包里剩余的球是一个0和一个1，共两种情况。因此可以将上一次确定的上半部分的子线段按2：1的比例分成两份，其中第二个球是0所对应子线段的长度与第二个球是1所子线段的长度为2:1。基于此，参见图4A中的(b)示意，子线段
Figure PCTCN2022127779-appb-000014
对应于目标序列的第一个比特为0且第二个比特序列为0，子线 段
Figure PCTCN2022127779-appb-000015
对应于目标序列的第一个比特为0且第二个比特序列为1，子线段
Figure PCTCN2022127779-appb-000016
对应于目标序列的第一个比特为1且第二个比特序列为0，子线段
Figure PCTCN2022127779-appb-000017
对应于目标序列的第一个比特为1且第二个比特序列为1。
重复上述过程，依次类推，直到将线段1等分为止。参见图4A中的(c)示意，子线段
Figure PCTCN2022127779-appb-000018
对应于目标序列0011，子线段
Figure PCTCN2022127779-appb-000019
对应于目标序列0101，子线段
Figure PCTCN2022127779-appb-000020
对应于目标序列0110，子线段
Figure PCTCN2022127779-appb-000021
对应于目标序列1001，子线段
Figure PCTCN2022127779-appb-000022
对应于目标序列1010，子线段
Figure PCTCN2022127779-appb-000023
对应于目标序列1100。
步骤2：类似地，将信息比特排列组合可能有4个问题，视为对长度为1的线段等分成4个子线段，分别对应到这4个具体的序列：00/01/10/11。记这一划分过程为A，用于实现子线段与信息比特序列的对应。A的划分方式可参照步骤1中B的划分方式理解，对此不予赘述。其中，长度为1的线段划分为4等分，子线段
Figure PCTCN2022127779-appb-000024
对应于信息比特序列00，子线段
Figure PCTCN2022127779-appb-000025
对应于信息比特序列01，子线段
Figure PCTCN2022127779-appb-000026
对应于信息比特序列10，子线段
Figure PCTCN2022127779-appb-000027
对应于信息比特序列11。
进一步，参见图4B示意，4种信息比特序列与6种目标信息比特序列之间的对应关系，对于一个信息比特序列与其对应的目标序列满足：信息比特序列在A中对应子线段的中点取值属于目标序列在B中对应子线段的范围。例如信息比特序列00对应于目标序列0011，比特序列01对应于目标序列0110等。
由上可知，基于算术编码的DM实现，会涉及到许多线段分割，且每一步的分割均需要除法运算即求平均。这样的设计复杂度较大，容易增大时延，影响信道编码的通信性能。因此，本申请实施例提供一种信息处理方法，基于网格图(trellis)实现比特序列及符号序列之间的映射。该网格图能够应用于DM，降低DM的复杂度。例如参见图5，可以构造或定义网格图，以及对网格图进行优化。发送端侧可以通过读取网格图来实现DM，即成形处理功能；接收端侧可以通过读取网格图来实现逆DM(inv-DM)，即解成形处理功能。
下面进一步对本申请实施例提供的信息处理方法进行详细说明。
参见图6示意一种信息处理方法，该方法主要包括如下流程：
S601，发送端获取信息比特，所述信息比特包括K个比特，K为正整数。
其中，信息比特也可以被理解为shaping比特。例如，应用在polar整形的编码操作中，该信息比特可以是前述信息位分组的一组信息比特序列中的信息比特。K的取值可以由需要shaping的比特位数确定，或者也可以由设定成形的目标符号序列的长度所确定。
S602，发送端根据网格图，将所述信息比特映射成目标符号序列。
其中，目标符号序列包括M个符号，M为大于K的正整数，M个符号中包括m个取值为第一值的符号。第一取值为p个取值中的任意一个取值，p个取值可以理解为目标符号序列中一个符号的取值范围，即目标符号序列中一个符号的取值是p个取值中的一个取值，p为大于1的正整数。可选的，目标符号序列中的符号可以包括比特也可以是其他种类的符号。对于一个符号具体是比特而言，p的取值为2，即对应比特的取值为0或者1；而对于一个符号不是比特而是其他种类的符号而言，p的取值可以是2或者大于2的正整数，具体可以参照实际应用中符号取值来确定，本申请实施例对此不予限制。
以p为2目标符号序列包括的M个符号中m个符号的取值为第一值，M-m个符号的 取值均为第三值为例。可选的，对应映射需求是均匀分布符号序列映射到呈一定分布的符号序列时，目标符号序列应该满足p bias要求：m表示为
Figure PCTCN2022127779-appb-000028
即目标符号序列中应该有
Figure PCTCN2022127779-appb-000029
个符号取值为第一值，目标符号序列中应该有
Figure PCTCN2022127779-appb-000030
个符号取值为第三值。其中，
Figure PCTCN2022127779-appb-000031
表示向下取整运算符，p bias的取值可以为0到1之间的小数，例如p bias取值为0.3。另外可以理解的是，目标符号序列中的符号全为比特时，目标符号序列也可以称为目标比特序列，那么目标比特序列中一个比特取值为第一值或者第三值时，第一值为0，第三值为1；或者，第一值为1，第三值为0。
具体地，网格图可以理解为一个有向图，网格图中可以包括至少M个有向边，一个有向边对应一个符号的取值。关于有向边可以理解为：一个有向边的两个端点包括起始节点和终止节点，起始节点指向终止节点；网格图中一个元素节点指向与其相邻的另一个元素节点，构成一个有向边。基于此，发送端可以根据信息比特在所述网格图中依次确定M+1个元素节点，所述M+1个元素节点中两个相邻的元素节点之间的有向边用于确定所述目标符号序列中的一个符号的取值。例如，M+1个元素节点中第j个元素节点指向第j+1个元素节点，第j个元素节点和第j+1个元素节点之间的有向边用于确定目标符号序列中第j个符号的取值。其中，j取遍1至M，j为正整数。或者可以理解为，发送端可以根据信息比特，在网格图中确定一条包含M个有向边的路径。
其中，M+1个元素节点中的第一个元素节点与前述目标符号序列的参数M以及m的取值有关。即发送端可以根据M以及m的取值，在网格图中确定M+1个元素节点中的第一个元素节点。关于发送端确定M+1个元素节点中的第一个元素节点的方案将在下文中进行详细说明。
进一步，将第一元素节点记作所述M+1个元素节点中前M个元素节点中的任意一个元素节点。在所述M+1个元素节点中，所述第一元素节点的下一个节点为第一元素节点指向的第二元素节点。可以理解的是，在所述网格图中，第一元素节点可以指向一个或多个元素节点。第二元素节点为该第一元素节点指向的一个或多个元素节点中的一个元素节点。此外，所述第一元素节点与所述第一元素节点指向的不同元素节点之间的有向边对应的符号的取值不同。示例性的，如所述第一元素节点指向的元素节点包括第二元素节点和第四元素节点，将所述第一元素节点与所述第二元素节点之间的有向边记作第一有向边，将所述第一元素节点与第四元素节点之间的有向边记作第二有向边。第一有向边对应一个符号的取值和第二有向边对应的一个符号的取值不同。
M+1个元素节点中的最后一个元素节点可以理解为叶子节点，从有一个向边的起始节点和终止节点来看，叶子节点不会作为有向边的起始节点，只会作为有向边的终止节点。
下面进一步对网格图的相关定义以及发送端确定M+1个元素节点的方式进行详细说明。
首先，关于网格图可以参照如下定义(1)～(4)理解：
(1)网格图中包括多个元素节点(至少M+1个元素节点)。
记第三元素节点为网格图中的任意一个元素节点，所述第三元素节点可以用于指示组合数
Figure PCTCN2022127779-appb-000032
其中，0≤i≤I；0≤I≤N，N≥M；i，I，N均为整数。N表示基于网格图生成目标符号序列的最大符号数，即由该网格图可以映射的最长目标符号序列包括N个符号，也可以映射少于N个符号的符号序列。或者可以理解网格图支持可变的码长码率，较为灵活，适应于无线通信的不同需求。I可以表示前述N个符号中的部分或全部符号，记作I个符 号。i可以表示I个符号中取值为第一取值的符号数量。基于此，前述M+1个元素节点中的第一个元素节点可以理解为用于指示I取M，i取m时的组合数
Figure PCTCN2022127779-appb-000033
的第三元素节点。I为M，i为m时，组合数
Figure PCTCN2022127779-appb-000034
可以表示为
Figure PCTCN2022127779-appb-000035
另外可以理解的是，i的最大值大于或者等于m。
对于一个网格图，其所对应的参数N、i的最大值可以是预先定义的，发送端和接收端均可确定。可选的，I取值为N时，i的最大值可以根据实际需求来设计，也即关于网格图能够映射的最长目标符号序列中取值为第一取值的符号最大数目可以根据实际需求来设计，本申请实施例对此不进行限制。
(2)网格图中的元素节点之间存在连接关系。
记第三元素节点为网格图中的任意一个元素节点，第三元素节点可以与其相邻的元素节点构成有向边，一个有向边对应一个符号的取值。具体地，结合第三元素节点指示组合数
Figure PCTCN2022127779-appb-000036
而言，当I大于0时，第三元素节点具体可以是网格图中除用于指示
Figure PCTCN2022127779-appb-000037
的元素节点之外的任意一个元素节点，第三元素节点在所述网格图中可以指向一个或多个元素节点。当I等于0时，第三元素节点用于指示
Figure PCTCN2022127779-appb-000038
此时第三元素节点为叶子节点。该第三元素节点可以与指示
Figure PCTCN2022127779-appb-000039
的元素节点和/或指示
Figure PCTCN2022127779-appb-000040
的元素节点连接。
以前述第一元素节点为例，对应前述i表示I个符号中取值为第一取值的符号数量，第一元素节点与第二元素节点之间的有向边对应一个符号的取值不是第一值时，第一元素节点指示组合数
Figure PCTCN2022127779-appb-000041
所述第二元素节点指示的组合数可以表示为
Figure PCTCN2022127779-appb-000042
即表示第一元素节点指向第二元素节点时，取值为第一值的符号数目不变化。又如，第一元素节点与第二元素节点之间的有向边对应一个符号的取值是第一值时，第一元素节点指示组合数
Figure PCTCN2022127779-appb-000043
所述第二元素节点指示的组合数可以表示为
Figure PCTCN2022127779-appb-000044
所述第三元素节点用于指示组合数
Figure PCTCN2022127779-appb-000045
即表示第一元素节点指向第二元素节点时，取值为第一值的符号数目减少一个。
(3)在网格图中，每个元素节点均具有取值。若第三元素节点指向多个元素节点，第三元素节点的取值小于或者等于第三元素节点指向的多个元素节点的取值之和。
例如，在前述网格图的M+1个元素节点中，第一元素节点指向多个元素节点时，第一元素节点的取值小于或者等于第一元素节点指向的多个元素节点的取值之和。具体地，例如第一元素节点指向第二元素节点和第四元素节点时，第一元素节点的取值小于或者等于第二元素节点和第四元素节点的取值之和。
(4)网格中不同元素节点所指示的组合数不同，每个元素节点的取值小于或者等于其所指示的组合数。以第三元素节点表示网格图中任意一个元素节点举例来说，第三元素节点的取值可以小于或者等于该第三元素节点指示的组合数
Figure PCTCN2022127779-appb-000046
具体地，第三元素节点的取值可参照如下设计1或者设计2实施：
设计1，第三元素节点的取值可以等于其指示的组合数
Figure PCTCN2022127779-appb-000047
第三元素节点的取值可以体现为十进制数或者二进制数，又或者是其指示的
Figure PCTCN2022127779-appb-000048
示例性的，以网格图中有向边对应的一个符号取值为第一值或者第三值为例。参见图7A示意一种网格图，该网格图可以映射的最长目标符号序列包括5(N)个符号。最长目标符号序列中取值为第一值的符号最大数目为3。网格图中任意一个元素节点即第三元素节点指示的
Figure PCTCN2022127779-appb-000049
中，i的取值范围为0≤i≤3，且，i≤I；I的取值范围为0≤I≤5。网格图中每个元素节点的取值体现为其指示的
Figure PCTCN2022127779-appb-000050
例如网格图中最左下角的元素节点为
Figure PCTCN2022127779-appb-000051
从该最左下角的元素节点开始：当I大于0时，第三元素节点(指示
Figure PCTCN2022127779-appb-000052
)连接的右侧邻居节点指示
Figure PCTCN2022127779-appb-000053
和/ 或第三元素节点连接的右上侧邻居节点指示
Figure PCTCN2022127779-appb-000054
例如，最左下角的元素节点的右侧邻居节点为
Figure PCTCN2022127779-appb-000055
左下角的元素节点的右上侧邻居节点为
Figure PCTCN2022127779-appb-000056
或者当I等于0时，第三元素节点指示的组合数为
Figure PCTCN2022127779-appb-000057
示例性的，以网格图中有向边对应的一个符号取值为第一值或者第三值为例。参见图7B示意一种网格图，该网格图可以映射的最长目标符号序列包括5(N)个符号。最长目标符号序列中取值为第一值的符号最大数目为3。网格图中任意一个元素节点即第三元素节点指示的
Figure PCTCN2022127779-appb-000058
中，i的取值范围为0≤i≤3，且，i≤I；I的取值范围为0≤I≤5。网格图中每个元素节点的取值体现为十进制数，例如网格图中最左下角的元素节点指示
Figure PCTCN2022127779-appb-000059
最左下角的元素节点的取值可以为10，从该最左下角的元素节点开始：当I大于0时，第三元素节点(指示
Figure PCTCN2022127779-appb-000060
)连接的右侧邻居节点指示
Figure PCTCN2022127779-appb-000061
和/或第三元素节点连接的右上侧邻居节点指示
Figure PCTCN2022127779-appb-000062
例如，最左下角的元素节点的右侧邻居节点指示
Figure PCTCN2022127779-appb-000063
取值为6；最左下角的元素节点的右上侧邻居节点指示
Figure PCTCN2022127779-appb-000064
取值为4。或者当I等于0时，第三元素节点指示的组合数为
Figure PCTCN2022127779-appb-000065
取值为1。
设计2，可以设定目标有效位数，第三元素节点的取值对应的二进制数的有效位数小于或者等于该目标有效位数。具体地，若第三元素节点所指示组合数
Figure PCTCN2022127779-appb-000066
对应二进制数的有效位数大于目标有效位数，则所述第三元素节点的取值小于所述组合数
Figure PCTCN2022127779-appb-000067
且所述第三元素节点的取值对应的二进制数的有效位数为所述目标有效位数。可选的，第三元素节点具体取值为符合目标有效位数且小于组合数
Figure PCTCN2022127779-appb-000068
的最大值。若所述第三元素节点所指示组合数
Figure PCTCN2022127779-appb-000069
对应二进制数的有效位数小于或者等于所述目标有效位数，则所述第三元素节点的取值等于组合数
Figure PCTCN2022127779-appb-000070
以网格图中有向边对应的一个符号取值为第一值或者第三值为例。参见图7C示意一种网格图，该网格图可以映射的最长目标符号序列包括5(N)个符号，第一值为0，第三值为1。最长目标符号序列中取值为第一取值的符号最大数目为3。网格图中任意一个元素节点指示的
Figure PCTCN2022127779-appb-000071
中，i的取值范围为0≤i≤3，且，i≤I；I的取值范围为0≤I≤5。网格图中每个元素节点的取值体现为十进制数，目标有效位数为1，网格图中最左下角的元素节点指示
Figure PCTCN2022127779-appb-000072
最左下角的元素节点的取值可以为小于
Figure PCTCN2022127779-appb-000073
且符合目标有效位数的最大值8，对应二进制数1000。从该最左下角的元素节点开始：当I大于0时，第三元素节点(指示
Figure PCTCN2022127779-appb-000074
)连接的右侧邻居节点指示
Figure PCTCN2022127779-appb-000075
和/或第三元素节点连接的右上侧邻居节点指示
Figure PCTCN2022127779-appb-000076
例如，最左下角的元素节点的右侧邻居节点指示
Figure PCTCN2022127779-appb-000077
取值可以为小于
Figure PCTCN2022127779-appb-000078
且符合目标有效位数的最大值4，对应二进制数100；最左下角的元素节点的右上侧邻居节点指示
Figure PCTCN2022127779-appb-000079
对应的二进制数符合目标有效位数，取值为4，对应二进制数100。当I等于0时，第三元素节点指示的组合数为
Figure PCTCN2022127779-appb-000080
取值为1。
上述设计2中，引入目标有效位数，降低网格图中各元素节点的有效位数，可以减少网格图所占的存储资源。设定网格图中每个元素节点尽可能接近于2的整数次方，有助于DM实现将均匀分布的二进制比特映射到服从一定分布的目标符号序列。可选的，设计2也可以理解为在设计1的基础上对网格图进行优化的设计，可以记作trellis优化。
(5)进一步可选的，考虑到组合数的对称性，如
Figure PCTCN2022127779-appb-000081
等。在前述(1)～(4)描述网格图基础上，还可以利用组合数的对称性，剔除掉前述网格图中一些不必要的元素节点，实现网格图优化，即对网格图的压缩。例如，设定对于网格图中任意一个元素节点即第三元素节点而言，在该第三元素节点指示的组合数
Figure PCTCN2022127779-appb-000082
中，如果I的取值 为偶数，那么i的取值范围可以是
Figure PCTCN2022127779-appb-000083
或
Figure PCTCN2022127779-appb-000084
例如I取4时，网格图中可能存在指示
Figure PCTCN2022127779-appb-000085
Figure PCTCN2022127779-appb-000086
的元素节点，或者网格图中可能存在指示
Figure PCTCN2022127779-appb-000087
的元素节点，但不会既存在指示
Figure PCTCN2022127779-appb-000088
的元素节点又存在指示
Figure PCTCN2022127779-appb-000089
的元素节点，不会既存在指示
Figure PCTCN2022127779-appb-000090
的元素节点又存在指示
Figure PCTCN2022127779-appb-000091
的元素节点。如果I的取值为奇数，那么i的取值范围可以是
Figure PCTCN2022127779-appb-000092
或
Figure PCTCN2022127779-appb-000093
即如I取3时，网格图中可能存在指示
Figure PCTCN2022127779-appb-000094
的元素节点，或者网格图中可能存在指示
Figure PCTCN2022127779-appb-000095
的元素节点，但不会既存在指示
Figure PCTCN2022127779-appb-000096
的元素节点又存在指示
Figure PCTCN2022127779-appb-000097
的元素节点。通过这样的方式，可以压缩网格图的存储，实现存储资源的有效合理利用。
示例性的，如图8A示意一种压缩网格图，在图7A的基础上，以虚线框示意出图7A的网格图中可以按照组合数对称性，剔除的不必要元素节点，如
Figure PCTCN2022127779-appb-000098
和
Figure PCTCN2022127779-appb-000099
如图8B示意一种压缩网格图，在图7B的基础上，以虚线框示意出图7B的网格图中可以按照组合数对称性，剔除的不必要元素节点，如指示
Figure PCTCN2022127779-appb-000100
的元素节点，指示
Figure PCTCN2022127779-appb-000101
的元素节点和指示
Figure PCTCN2022127779-appb-000102
的元素节点。如图8C示意一种压缩网格图，在图7C的基础上，以虚线框示意出图7C的网格图中可以按照组合数对称性，剔除的不必要元素节点，如指示
Figure PCTCN2022127779-appb-000103
的元素节点，指示
Figure PCTCN2022127779-appb-000104
的元素节点和指示
Figure PCTCN2022127779-appb-000105
的元素节点。
结合上述网格图定义(1)～(5)中的至少一个，发送端在网格图中确定M+1个元素节点的方式可按照如下步骤A1和A2实施：
A1，发送端可以根据给定目标符号序列的参数M和m，在网格图中可以指示
Figure PCTCN2022127779-appb-000106
的第五元素节点，第五元素节点表示前述M+1个元素节点中的第一个元素节点。
基于按照上述网格图的结构，发送端具体可以将网格图中从右向左的第M+1列中从上向下的第M-m+1个元素节点确定为第五元素节点，也即所述M+1个元素节点中的第一个元素节点。例如对于图8C示意的网格图，假设给定M为3，m为2，可承载的信息比特数目K为1(即shaping一个比特)，发送端在图8C的网格图中从右向左读取第4列，再从上向下读取该第4列中第2个元素节点，该读取出的元素节点即为前述第五元素节点。进一步的，参见图9，在图8C的基础上标注出了从右向左的列编号。以及M为3，m为2时，第五元素节点的位置(以矩形虚线框进行标注)。
A2，发送端从第五元素节点开始，依次遍历剩余的M个元素节点。
以目标符号序列中的一个符号的取值为第一值或者第三值中的一个取值，第一元素节点是M+1个元素节点中的前M个元素节点中的任意一个，第一元素节点指向的元素节点最多有2个为例，该A2可以参照如下方式具体实施：
(1)对于第五元素节点的下一个元素节点，即M+1个元素节点中的第二个元素节点可以按照如下A21或A22确定：
A21，如果S601所描述信息比特对应的取值小于第五元素节点的右侧邻居节点的取值，则由第五元素节点遍历至右侧邻居节点。
具体地，将S601中的信息比特记作
Figure PCTCN2022127779-appb-000107
K shaping对应前述K，指示信息比特包括K个比特。以F表示一个元素节点的右侧邻居节点的取值，如前面设计1或设计2中的描述，该F可以表现为十进制数或者二进制数。下面以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000108
则将第五元素节点向右平移到右侧邻居节点继续执行。其中，bi2de表示将二进制数据转换为十进制数。可以理解是如果F本身是二进制数， 则不需要进行bi2de的转换。
A22,如果S601所描述信息比特对应的取值大于或者等于第五元素节点的右侧邻居节点的取值，则由第五元素节点遍历至右上侧邻居节点。
具体地，将S601中的信息比特记作
Figure PCTCN2022127779-appb-000109
K shaping对应前述K，指示信息比特包括K个比特。以F表示一个元素节点的右侧邻居节点的取值，如前面设计1或设计2中的描述，该F可以表现为十进制数或者二进制数。下面以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000110
则沿斜向上箭头将第五元素节点遍历至其右上侧邻居节点继续执行，且对信息比特
Figure PCTCN2022127779-appb-000111
按如下方式更新：
Figure PCTCN2022127779-appb-000112
其中，等式左边是更新后的
Figure PCTCN2022127779-appb-000113
而等式右边的
Figure PCTCN2022127779-appb-000114
指的是S601中的信息比特。bi2de表示将二进制数据转换为十进制数，de2bi表示将十进制数据转换为二进制数。可以理解是如果F本身是二进制数，则不需要进行bi2de及de2bi的转换。
(2)对于M+1个元素节点中的第二个元素节点至第M+1个元素节点可以重复按照如下A23或A24确定：
A23，如果上次遍历后得到的信息比特对应的取值小于当前元素节点的右侧邻居节点的取值，则由当前元素节点遍历至右侧邻居节点。
参照A21中的描述，以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000115
则将当前元素节点向右平移到右侧邻居节点继续执行。其中，bi2de表示将二进制数据转换为十进制数。其中，这里的
Figure PCTCN2022127779-appb-000116
是上一次遍历后得到的信息比特。例如当前元素节点为第二个元素节点时，这里的
Figure PCTCN2022127779-appb-000117
可以是执行A22或者A23之后得到的信息比特，如果执行的是A22，这里的
Figure PCTCN2022127779-appb-000118
仍然对应S601中描述的信息比特，如果执行的是A23，这里的
Figure PCTCN2022127779-appb-000119
对应A22中描述更新后的信息比特。另外，可以理解是如果F本身是二进制数，则不需要进行bi2de的转换。
A24，如果上一次信息比特对应的取值大于或者等于当前元素节点的右侧邻居节点的取值，则由当前元素节点遍历至右上侧邻居节点。
参照A22中的描述，以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000120
则沿斜向上箭头将当前元素节点遍历至其右上侧邻居节点继续执行，且对信息比特
Figure PCTCN2022127779-appb-000121
按如下方式更新：
Figure PCTCN2022127779-appb-000122
其中，等式左边是本次更新后的
Figure PCTCN2022127779-appb-000123
而等式右边的
Figure PCTCN2022127779-appb-000124
指的是上一次遍历后得到的信息比特。例如当前元素节点为第二个元素节点时，等式右边的
Figure PCTCN2022127779-appb-000125
可以是执行A21或者A22之后得到的信息比特，如果执行的是A21，等式右边的
Figure PCTCN2022127779-appb-000126
仍然对应S601中描述的信息比特；如果执行的是A22，等式右边的
Figure PCTCN2022127779-appb-000127
对应A22中描述更新后的信息比特。另外，bi2de表示将二进制数据转换为十进制数，de2bi表示将十进制数据转换为二进制数。可以理解是如果F本身是二进制数，则不需要进行bi2de及de2bi的转换。
由上述A1和A2可以确定出M+1的元素节点，发送端则可以根据M+1个元素节点中第j个元素节点和第j+1个元素节点之间的有向边，确定目标符号序列中第j个符号的取值。其中，j取遍1至M，j为正整数。
在S602中，通过读取网格图，即可实现均匀分布的比特序列(即前述信息比特)映射到呈一定分布的目标符号序列，不涉及复杂频繁的除法运算。该网格图可以部署到polar编码的DM中，实现DM的成形处理或称shaping能力，降低DM的复杂度。
S603，发送端输出所述目标符号序列。
具体地，发送端可以将目标符号序列输出至信道。
可选的，在采用信道编码传输是，如采用polar编码传输时，发送端可以根据前述图3A/图3B的描述，经由polar信道编码和级联成长码得到编码序列，本申请实施例对此不进行赘述。此外，发送端还可以按照前述图3A/图3B中描述的调制，对编码序列调制后输出到信道。
S604，接收端获取目标符号序列，所述目标符号序列包括M个符号，M为正整数，M个符号中包括m个取值为第一值的符号。
其中，接收端获取的目标符号序列可以理解为近似于S603中发送端输出的目标符号序列。
具体地，接收端可以是在信道上获取编码调制序列，进行解调制以及解码后得到目标符号序列。接收端可以按照与相关信道解码的方式，对编码调制序列进行解码得到目标比特序列。可以理解的是信道解码和发送端的信道编码相对应，如前述发送端采用polar编码的方式，接收端对应采用polar编码的译码手段进行信道解码。本申请实施例对此不进行限制。
可选的，接收端在确定目标符号序列之后，判断该目标符号序列是否满足p bias要求。如以目标符号序列中一个符号的取值为第一值或者第三值中的一个为例。判断目标符号序列中取值为第一值的符号数目m是否为
Figure PCTCN2022127779-appb-000128
和/或判断目标符号序列中取值为第三值的符号数目M-m是否为
Figure PCTCN2022127779-appb-000129
如果判断结果满足p bias要求则执行S605；如果不满足，则输出用于指示解成形失败的信息。
S605，接收端根据网格图和所述目标符号序列，确定信息比特；其中，所述信息比特包括K个比特，K为正整数，M大于K。
其中网格图的定义可参照前述S601以及S602中的描述理解，本申请实施例对此不再进行赘述。
具体地，结合S601以及S602中描述的网格图，接收端确定信息比特的方式可按照如下内容理解：
根据所述网格图中M+1个元素节点中的至少一个元素节点的取值，对第一比特序列进行更新得到所述信息比特；其中，所述第一比特序列包括K个比特，所述第一比特序列中每个比特的取值为第二值，第二值具体可以为0。所述目标符号序列中一个符号的取值对应所述M+1个元素节点中两个相邻的元素节点之间的有向边；所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点。
具体地，该方式可以按照如下步骤B1以及B2实施。
B1,初始化定义第一比特序列，所述第一比特序列包括K个比特，所述第一比特序列中每个比特的取值为第二值。
例如，第一比特序列可以表示为
Figure PCTCN2022127779-appb-000130
其中，第二值为0，
Figure PCTCN2022127779-appb-000131
Figure PCTCN2022127779-appb-000132
B2，对应S602将所述M+1个元素节点中的第一个元素节点记作第五元素节点。发送端从网格图中的第五元素节点开始，根据目标序列中M个比特的取值，依次遍剩余的M个元素节点。
以目标符号序列中的一个符号的取值为第一取值或者第三取值中的一个取值，第一元素节点是M+1个元素节点中的前M个元素节点中的任意一个，第一元素节点指向的元素节点最多有2个为例，该B2可以参照如下方式具体实施：
(1)对于第五元素节点的下一个元素节点，即M+1个元素节点中的第二个元素节点可以按照如下B21或B22确定：
B21，如果目标符号序列的第一个符号取值为第一值，则由第五元素节点遍历至右侧邻居节点。
具体地，将目标符号序列记作
Figure PCTCN2022127779-appb-000133
以F表示一个元素节点的右侧邻居节点的取值，如前面设计1或设计2中的描述，该F可以表现为十进制数或者二进制数。下面以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000134
为第一值，则不更新第一比特序列，并将第五元素节点向右平移到右侧邻居节点继续执行。
B22，如果目标符号序列的第一个符号取值为第三值，则根据第五元素节点的右侧节点的取值更新第一比特序列，且由第五元素节点遍历至右侧邻居节点继续执行。
具体地，将目标比特序列记作
Figure PCTCN2022127779-appb-000135
以F表示一个元素节点的右侧邻居节点的取值，如前面设计1或设计2中的描述，该F可以表现为十进制数或者二进制数。下面以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000136
为第三值，则沿斜向上箭头将第五元素节点遍历至其右上侧邻居节点继续执行，且对第一比特序列
Figure PCTCN2022127779-appb-000137
按如下方式更新：列
Figure PCTCN2022127779-appb-000138
Figure PCTCN2022127779-appb-000139
其中，等式左边是更新后的
Figure PCTCN2022127779-appb-000140
而等式右边的
Figure PCTCN2022127779-appb-000141
指的是B21中的第一比特序列。bi2de表示将二进制数据转换为十进制数，de2bi表示将十进制数据转换为二进制数。可以理解是如果F本身是二进制数，则不需要进行bi2de及de2bi的转换。
(2)对于M+1个元素节点中的第二个元素节点至第M+1个元素节点可以按照如下B23或B24遍历：
B23，如果目标符号序列的第x个符号取值为第一值，则由M+1个元素节点中的第x个元素节点遍历至右侧邻居节点。x取遍2至M的整数。
参照B21中的描述，以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000142
为第一值，则不更新第一比特序列，并将第x个元素节点向右平移到右侧邻居节点继续执行。
B24，如果目标符号序列的第x个符号取值为第三值，则根据由M+1个元素节点中第x个元素节点的右侧节点的取值更新第一比特序列，且将第x个元素节点遍历至右侧邻居 节点继续执行。
参照B22中的描述，以F表现为十进制数进行举例。本步骤的方式进一步可以描述为：
如果
Figure PCTCN2022127779-appb-000143
为第三值，则沿斜向上箭头将第x个元素节点遍历至其右上侧邻居节点继续执行，且对上一次(即第x-1次)遍历后得到第一比特序列
Figure PCTCN2022127779-appb-000144
按如下方式更新：列
Figure PCTCN2022127779-appb-000145
其中，等式左边是本次更新后的
Figure PCTCN2022127779-appb-000146
而等式右边的
Figure PCTCN2022127779-appb-000147
指的是上一次遍历后得到的第一比特序列。例如当前元素节点为第二个元素节点时，即本次对应x为2，等式右边的
Figure PCTCN2022127779-appb-000148
可以是执行B21或者B22之后得到的第一比特序列，如果执行的是B21，等式右边的
Figure PCTCN2022127779-appb-000149
仍然对应B1中初始化定义的第一比特序列，如果执行的是B23，等式右边的
Figure PCTCN2022127779-appb-000150
对应B22中描述更新后的信息比特。bi2de表示将二进制数据转换为十进制数，de2bi表示将十进制数据转换为二进制数。可以理解是如果F本身是二进制数，则不需要进行bi2de及de2bi的转换。
x取遍2至M的整数，重复执行上述B22/B23，直到遍历出M+1个元素节点中的最后一个元素节点为止，最终得到更新的第一比特序列即可确定为前述信息比特。
在S605中，通过读取网格图，即可实现从呈一定分布的目标符号序列恢复出均匀分布的二进制比特，不涉及复杂频繁的除法运算。该网格图应用于接收端可以提供解成形，或称解shaping能力，可以降低解码复杂度，缩小解码时延。例如，该网格图可以部署到接收端的逆DM(inv-DM)中，实现inv-DM的解成形处理或称解shaping能力，降低inv-DM的复杂度。
上述分别从发送端、接收端以及它们交互的角度对本申请实施例提供的方法进行了介绍。为了实现上述方法中的各功能，发送端、接收端可以包括硬件结构和/或软件模块，以硬件结构、软件模块、或硬件结构加软件模块的形式来实现上述各功能。上述各功能中的某个功能以硬件结构、软件模块、还是硬件结构加软件模块的方式来执行，取决于技术方案的特定应用和设计约束条件。
基于同一构思，参见图10，本申请实施例提供了一种通信装置1000，该通信装置1000包括处理模块1001和通信模块1002。该通信装置1000可以是发送端，也可以是应用于发送端或者和发送端匹配使用，能够实现发送端侧执行的方法的通信装置；或者，该通信装置1000可以是接收端，也可以是应用于接收端或者和接收端匹配使用，能够实现接收端侧执行的方法的通信装置。
其中，通信模块也可以称为收发模块、收发器、收发机、收发装置等。处理模块也可以称为处理器，处理单板，处理单元、处理装置等。可选的，可以将通信模块中用于实现接收功能的器件视为接收单元，应理解，通信模块用于执行上述方法实施例中接入网设备侧或终端设备侧的发送操作和接收操作，将通信模块中用于实现发送功能的器件视为发送单元，即通信模块包括接收单元和发送单元。
该通信装置1000应用于发送端时，处理模块1001可用于实现图6所示实施例中所述发送端的处理功能，通信模块1002可用于实现图6所述实施例中所述发送端的全部收发功能或者部分收发功能。或者也可以参照发明内容中第三方面以及第三方面中可能的设计理解该通信装置。
该通信装置1000应用于接收端时，处理模块1001可用于实现图6所示实施例中所述接收端的处理功能，通信模块1002可用于实现图6所述实施例中所述接收端的全部收发功能或者部分收发功能。或者也可以参照发明内容中第三方面以及第三方面中可能的设计理解该通信装置。
此外需要说明的是，前述通信模块和/或处理模块可通过虚拟模块实现，例如处理模块可通过软件功能单元或虚拟装置实现，通信模块可以通过软件功能或虚拟装置实现。或者，处理模块或通信模块也可以通过实体装置实现，例如若该装置采用芯片/芯片电路实现，所述通信模块可以是输入输出电路和/或通信接口，执行输入操作(对应前述接收操作)、输出操作(对应前述发送操作)；处理模块为集成的处理器或者微处理器或者集成电路。
本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，另外，在本申请实施例各个实施例中的各功能模块可以集成在一个处理器中，也可以是单独物理存在，也可以两个或两个以上模块集成在一个模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。
基于相同的技术构思，本申请实施例还提供了一种通信装置1100。该通信装置1100可以是芯片或者芯片系统。可选的，在本申请实施例中芯片系统可以由芯片构成，也可以包含芯片和其他分立器件。
通信装置1100可用于实现图1所示的通信系统中任一网元的功能。通信装置1100可以包括至少一个处理器1110，该处理器1110与存储器耦合，可选的，存储器可以位于该装置之内，存储器可以和处理器集成在一起，存储器也可以位于该装置之外。例如，通信装置1100还可以包括至少一个存储器1120。存储器1120保存实施上述任一实施例中必要计算机程序、配置信息、计算机程序或指令和/或数据；处理器1110可能执行存储器1120中存储的计算机程序，完成上述任一实施例中的方法。
通信装置1100中还可以包括通信接口1130，通信装置1100可以通过通信接口1130和其它设备进行信息交互。示例性的，所述通信接口1130可以是收发器、电路、总线、模块、管脚或其它类型的通信接口。当该通信装置1100为芯片类的装置或者电路时，该装置1100中的通信接口1130也可以是输入输出电路，可以输入信息(或称，接收信息)和输出信息(或称，发送信息)，处理器为集成的处理器或者微处理器或者集成电路或则逻辑电路，处理器可以根据输入信息确定输出信息。
本申请实施例中的耦合是装置、单元或模块之间的间接耦合或通信连接，可以是电性，机械或其它的形式，用于装置、单元或模块之间的信息交互。处理器1110可能和存储器1120、通信接口1130协同操作。本申请实施例中不限定上述处理器1110、存储器1120以及通信接口1130之间的具体连接介质。
可选的，参见图11，所述处理器1110、所述存储器1120以及所述通信接口1130之间通过总线1140相互连接。所述总线1140可以是外设部件互连标准(peripheral component interconnect，PCI)总线或扩展工业标准结构(extended industry standard architecture，EISA)总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示，图11中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
在本申请实施例中，处理器可以是通用处理器、数字信号处理器、专用集成电路、现场可编程门阵列或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件， 可以实现或者执行本申请实施例中的申请实施例的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者任何常规的处理器等。结合本申请实施例所申请实施例的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。
在本申请实施例中，存储器可以是非易失性存储器，比如硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)等，还可以是易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)。存储器是能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。本申请实施例中的存储器还可以是电路或者其它任意能够实现存储功能的装置，用于存储程序指令和/或数据。
在一种可能的实施方式中，该通信装置1100可以应用于发送端，具体通信装置1100可以是发送端，也可以是能够支持发送端，实现上述涉及的任一实施例中发送端的功能的装置。存储器1120保存实现上述任一实施例中的发送端的功能的必要计算机程序、计算机程序或指令和/或数据。处理器1110可执行存储器1120存储的计算机程序，完成上述任一实施例中发送端执行的方法。应用于发送端，该通信装置1100中的通信接口可用于与接收端进行交互，如向接收端发送信息。
在另一种可能的实施方式中，该通信装置1100可以应用于接收端，具体通信装置1100可以是接收端，也可以是能够支持接收端，实现上述涉及的任一实施例中接收端的功能的装置。存储器1120保存实现上述任一实施例中的接收端的功能的必要计算机程序、计算机程序或指令和/或数据。处理器1110可执行存储器1120存储的计算机程序，完成上述任一实施例中接收端执行的方法。应用于接收端，该通信装置1100中的通信接口可用于与发送端进行交互，如接收来自发送端的信息。
由于本实施例提供的通信装置1100可应用于发送端，完成上述发送端执行的方法，或者应用于接收端，完成接收端执行的方法。因此其所能获得的技术效果可参考上述方法实施例，在此不再赘述。
基于以上实施例，本申请实施例还提供了一种计算机程序，当所述计算机程序在计算机上运行时，使得所述计算机从发送端侧或者接收端侧角度执行图6所示的实施例中所提供的方法。
基于以上实施例，本申请实施例还提供了一种计算机可读存储介质，该计算机可读存储介质中存储有计算机程序，所述计算机程序被计算机执行时，使得计算机从发送端侧或者接收端侧角度执行图6所示的实施例中所提供的方法。其中，存储介质可以是计算机能够存取的任何可用介质。以此为例但不限于：计算机可读介质可以包括RAM、只读存储器(read-only memory，ROM)、电可擦可编程只读存储器(electrically erasable programmable read-only memory，EEPROM)、CD-ROM或其他光盘存储、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质。
基于以上实施例，本申请实施例提供了一种通信系统，包括发送端和接收端，其中，所述发送端和接收端可以实现图6所示的实施例中所提供的方法。
基于以上实施例，本申请实施例还提供了一种芯片，所述芯片用于读取存储器中存储的计算机程序，从发送端侧或者接收端侧角度实现图6所示的实施例中所提供的方法。
基于以上实施例，本申请实施例提供了一种芯片系统，该芯片系统包括处理器，用于 支持计算机装置实现图6所示的实施例中发送端或接收端所涉及的功能。在一种可能的设计中，所述芯片系统还包括存储器，所述存储器用于保存该计算机装置必要的程序和数据。该芯片系统，可以由芯片构成，也可以包含芯片和其他分立器件。
本申请实施例提供的技术方案可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、接入网设备、终端设备或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机可以存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，数字视频光盘(digital video disc，DVD))、或者半导体介质等。
在本申请实施例中，在无逻辑矛盾的前提下，各实施例之间可以相互引用，例如方法实施例之间的方法和/或术语可以相互引用，例如装置实施例之间的功能和/或术语可以相互引用，例如装置实施例和方法实施例之间的功能和/或术语可以相互引用。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实施例的范围。这样，倘若本申请实施例的这些修改和变型属于本申请实施例权利要求及其等同技术的范围之内，则本申请实施例也意图包含这些改动和变型在内。

Claims (32)

  1. 一种信息处理方法，其特征在于，包括：
    获取信息比特，所述信息比特包括K个比特，K为正整数；
    根据网格图，将所述信息比特映射成目标符号序列；其中，所述目标符号序列包括M个符号，M为大于K的正整数，所述M个符号中包括m个取值为第一值的符号；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
  2. 如权利要求1所述的方法，其特征在于，所述根据网格图，将所述信息比特映射成目标符号序列，包括：
    根据所述信息比特在所述网格图中依次确定M+1个元素节点，所述M+1个元素节点中两个相邻的元素节点之间的有向边用于确定所述目标符号序列中的一个符号的取值；
    其中，所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
  3. 如权利要求2所述的方法，其特征在于，所述第一元素节点指向多个元素节点时，所述第一元素节点与所述第一元素节点指向的不同元素节点之间的有向边对应的符号的取值不同。
  4. 如权利要求3所述的方法，其特征在于，所述网格图中每个元素节点均具有取值，所述第一元素节点指向多个元素节点时，所述第一元素节点的取值小于或者等于所述第一元素节点指向的多个元素节点的取值之和。
  5. 如权利要求1-4任一项所述的方法，其特征在于，所述网格图中包括至少M+1个元素节点，第三元素节点为所述至少M+1个元素节点中的任意一个元素节点，所述第三元素节点用于指示组合数
    Figure PCTCN2022127779-appb-100001
    所述第三元素节点的取值小于或者等于所述组合数
    Figure PCTCN2022127779-appb-100002
    其中，0≤i≤I，0≤I≤N，N≥M；i，I，N均为整数；所述网格图中不同元素节点所指示的组合数不同。
  6. 如权利要求5所述的方法，其特征在于，若所述组合数
    Figure PCTCN2022127779-appb-100003
    对应二进制数的有效位数大于目标有效位数，所述第三元素节点的取值小于所述组合数
    Figure PCTCN2022127779-appb-100004
    且所述第三元素节点的取值对应的二进制数的有效位数为所述目标有效位数；或者，
    若所述组合数
    Figure PCTCN2022127779-appb-100005
    对应二进制数的有效位数小于或者等于目标有效位数，所述第三元素节点的取值等于所述组合数
    Figure PCTCN2022127779-appb-100006
  7. 如权利要求5或6所述的方法，其特征在于，I的取值为偶数时，
    Figure PCTCN2022127779-appb-100007
    或
    Figure PCTCN2022127779-appb-100008
    或者，I的取值为奇数时，
    Figure PCTCN2022127779-appb-100009
    或
    Figure PCTCN2022127779-appb-100010
  8. 一种信息处理方法，其特征在于，包括：
    获取目标符号序列；其中，所述目标符号序列包括M个符号，M为正整数，所述M个符号中包括m个取值为第一值的符号；
    根据网格图和所述目标符号序列，确定信息比特；其中，所述信息比特包括K个比特，K为正整数，K小于M；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
  9. 如权利要求8所述的方法，其特征在于，所述根据网格图和所述目标符号序列，确定信息比特，包括：
    根据所述网格图中M+1个元素节点中的至少一个元素节点的取值，对第一比特序列进行更新得到所述信息比特；其中，所述第一比特序列包括K个比特，所述第一比特序列中每个比特的取值为第二值；
    所述目标符号序列中一个符号的取值对应所述M+1个元素节点中两个相邻的元素节点之间的有向边；所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
  10. 如权利要求9所述的方法，其特征在于，所述第一元素节点指向多个元素节点时，所述第一元素节点与所述第一元素节点指向的不同元素节点之间的有向边对应的符号的取值不同。
  11. 如权利要求10所述的方法，其特征在于，所述网格图中每个元素节点均具有取值，所述第一元素节点指向多个元素节点时，所述第一元素节点的取值小于或者等于所述第一元素节点指向的多个元素节点的取值之和。
  12. 如权利要求8-11任一项所述的方法，其特征在于，所述网格图中包括至少M+1个元素节点，第三元素节点为所述至少M+1个元素节点中的任意一个元素节点，所述第三元素节点用于指示组合数
    Figure PCTCN2022127779-appb-100011
    所述第三元素节点的取值小于或者等于所述组合数
    Figure PCTCN2022127779-appb-100012
    其中，0≤i≤I，0≤I≤N，N≥M；i，I，N均为整数；所述网格图中不同元素节点所指示的组合数不同。
  13. 如权利要求12所述的方法，其特征在于，若所述组合数
    Figure PCTCN2022127779-appb-100013
    对应二进制数的有效位数大于目标有效位数，所述第三元素节点的取值小于所述组合数
    Figure PCTCN2022127779-appb-100014
    且所述第三元素节点的取值对应的二进制数的有效位数为所述目标有效位数；或者，
    若所述组合数
    Figure PCTCN2022127779-appb-100015
    对应二进制数的有效位数小于或者等于目标有效位数，所述第三元素节点的取值等于所述组合数
    Figure PCTCN2022127779-appb-100016
  14. 如权利要求12或13所述的方法，其特征在于，I的取值为偶数时，
    Figure PCTCN2022127779-appb-100017
    或
    Figure PCTCN2022127779-appb-100018
    或者，I的取值为奇数时，
    Figure PCTCN2022127779-appb-100019
    或
    Figure PCTCN2022127779-appb-100020
  15. 一种通信装置，其特征在于，包括通信模块和处理模块；
    所述通信模块，用于获取信息比特，所述信息比特包括K个比特，K为正整数；
    所述处理模块，用于根据网格图，将所述信息比特映射成目标符号序列；其中，所述目标符号序列包括M个符号，M为大于K的正整数，所述M个符号中包括m个取值为第一值的符号；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
  16. 如权利要求15所述的通信装置，其特征在于，所述处理模块，具体用于：
    根据所述信息比特在所述网格图中依次确定M+1个元素节点，所述M+1个元素节点中两个相邻的元素节点之间的有向边用于确定所述目标符号序列中的一个符号的取值；
    其中，所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第 一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
  17. 如权利要求16所述的通信装置，其特征在于，所述第一元素节点指向多个元素节点时，所述第一元素节点与所述第一元素节点指向的不同元素节点之间的有向边对应的符号的取值不同。
  18. 如权利要求17所述的通信装置，其特征在于，所述网格图中每个元素节点均具有取值，所述第一元素节点指向多个元素节点时，所述第一元素节点的取值小于或者等于所述第一元素节点指向的多个元素节点的取值之和。
  19. 如权利要求15-18任一项所述的通信装置，其特征在于，所述网格图中包括至少M+1个元素节点，第三元素节点为所述至少M+1个元素节点中的任意一个元素节点，所述第三元素节点用于指示组合数
    Figure PCTCN2022127779-appb-100021
    所述第三元素节点的取值小于或者等于所述组合数
    Figure PCTCN2022127779-appb-100022
    其中，0≤i≤I，0≤I≤N，N≥M；i，I，N均为整数；所述网格图中不同元素节点所指示的组合数不同。
  20. 如权利要求19所述的通信装置，其特征在于，若所述组合数
    Figure PCTCN2022127779-appb-100023
    对应二进制数的有效位数大于目标有效位数，所述第三元素节点的取值小于所述组合数
    Figure PCTCN2022127779-appb-100024
    且所述第三元素节点的取值对应的二进制数的有效位数为所述目标有效位数；或者，
    若所述组合数
    Figure PCTCN2022127779-appb-100025
    对应二进制数的有效位数小于或者等于目标有效位数，所述第三元素节点的取值等于所述组合数
    Figure PCTCN2022127779-appb-100026
  21. 如权利要求19或20所述的通信装置，其特征在于，I的取值为偶数时，
    Figure PCTCN2022127779-appb-100027
    或
    Figure PCTCN2022127779-appb-100028
    或者，I的取值为奇数时，
    Figure PCTCN2022127779-appb-100029
    或
    Figure PCTCN2022127779-appb-100030
  22. 一种通信装置，其特征在于，包括通信模块和处理模块；
    所述通信模块，用于获取目标符号序列；其中，所述目标符号序列包括M个符号，M为正整数，所述M个符号中包括m个取值为第一值的符号；
    所述处理模块，用于根据网格图和所述目标符号序列，确定信息比特；其中，所述信息比特包括K个比特，K为正整数，K小于M；所述网格图包括至少M个有向边，一个所述有向边对应所述目标符号序列中一个符号的取值。
  23. 如权利要求22所述的通信装置，其特征在于，所述处理模块，具体用于：
    根据所述网格图中M+1个元素节点中的至少一个元素节点的取值，对第一比特序列进行更新得到所述信息比特；其中，所述第一比特序列包括K个比特，所述第一比特序列中每个比特的取值为第二值；
    所述目标符号序列中一个符号的取值对应所述M+1个元素节点中两个相邻的元素节点之间的有向边；所述M+1个元素节点中的第一个元素节点和M的取值以及m的取值有关；第一元素节点为所述M+1个元素节点中前M个元素节点中的任意一个元素节点；在所述M+1个元素节点中，所述第一元素节点的下一个节点为第二元素节点；在所述网格图中，所述第一元素节点指向一个或多个元素节点，所述第二元素节点为所述一个或多个元素节点中的一个元素节点。
  24. 如权利要求23所述的通信装置，其特征在于，所述第一元素节点指向多个元素节 点时，所述第一元素节点与所述第一元素节点指向的不同元素节点之间的有向边对应的符号的取值不同。
  25. 如权利要求24所述的通信装置，其特征在于，所述网格图中每个元素节点均具有取值，所述第一元素节点指向多个元素节点时，所述第一元素节点的取值小于或者等于所述第一元素节点指向的多个元素节点的取值之和。
  26. 如权利要求22-25任一项所述的通信装置，其特征在于，所述网格图中包括至少M+1个元素节点，第三元素节点为所述至少M+1个元素节点中的任意一个元素节点，所述第三元素节点用于指示组合数
    Figure PCTCN2022127779-appb-100031
    所述第三元素节点的取值小于或者等于所述组合数
    Figure PCTCN2022127779-appb-100032
    其中，0≤i≤I，0≤I≤N，N≥M；i，I，N均为整数；所述网格图中不同元素节点所指示的组合数不同。
  27. 如权利要求26所述的通信装置，其特征在于，若所述组合数
    Figure PCTCN2022127779-appb-100033
    对应二进制数的有效位数大于目标有效位数，所述第三元素节点的取值小于所述组合数
    Figure PCTCN2022127779-appb-100034
    且所述第三元素节点的取值对应的二进制数的有效位数为所述目标有效位数；或者，
    若所述组合数
    Figure PCTCN2022127779-appb-100035
    对应二进制数的有效位数小于或者等于目标有效位数，所述第三元素节点的取值等于所述组合数
    Figure PCTCN2022127779-appb-100036
  28. 如权利要求26或27所述的通信装置，其特征在于，I的取值为偶数时，
    Figure PCTCN2022127779-appb-100037
    或
    Figure PCTCN2022127779-appb-100038
    或者，I的取值为奇数时，
    Figure PCTCN2022127779-appb-100039
    或
    Figure PCTCN2022127779-appb-100040
  29. 一种通信装置，其特征在于，包括：
    处理器，所述处理器和存储器耦合，所述处理器用于执行所述存储器中的程序指令，以实现如权利要求1-7任一项所述的方法或如权利要求8-14任一项所述的方法。
  30. 一种通信系统，其特征在于，包括：如权利要求15-21任一项所述的通信装置以及如权利要求22-28任一项所述的通信装置。
  31. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质上存储有指令，当所述指令在计算机上运行时，使得所述计算机执行如权利要求1-7任一项所述的方法或如权利要求8-14任一项所述的方法。
  32. 一种计算机程序产品，其特征在于，包括指令，当所述指令在计算机上运行时，使得所述计算机执行如权利要求1-7任一项所述的方法或如权利要求8-14任一项所述的方法。
PCT/CN2022/127779 2021-10-31 2022-10-26 一种信息处理方法及通信装置 Ceased WO2023072168A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP22886043.3A EP4398503A4 (en) 2021-10-31 2022-10-26 Information processing method and communication device
US18/648,918 US12542621B2 (en) 2021-10-31 2024-04-29 Information processing method and communication apparatus for improving channel encoding between devices

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111278886.2 2021-10-31
CN202111278886.2A CN116073945A (zh) 2021-10-31 2021-10-31 一种信息处理方法及通信装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/648,918 Continuation US12542621B2 (en) 2021-10-31 2024-04-29 Information processing method and communication apparatus for improving channel encoding between devices

Publications (1)

Publication Number Publication Date
WO2023072168A1 true WO2023072168A1 (zh) 2023-05-04

Family

ID=86160477

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/127779 Ceased WO2023072168A1 (zh) 2021-10-31 2022-10-26 一种信息处理方法及通信装置

Country Status (4)

Country Link
US (1) US12542621B2 (zh)
EP (1) EP4398503A4 (zh)
CN (1) CN116073945A (zh)
WO (1) WO2023072168A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115473536A (zh) * 2021-06-11 2022-12-13 华为技术有限公司 一种极化码编码方法、译码方法及装置
CN120834976A (zh) * 2024-04-16 2025-10-24 中兴通讯股份有限公司 一种符号确定、解析方法、装置及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008154202A (ja) * 2006-11-22 2008-07-03 Yokohama National Univ 符号化変調システムおよび受信装置ならびに符号化変調方法および復号方法
WO2008126047A1 (en) * 2007-04-13 2008-10-23 Koninklijke Philips Electronics N.V. Trellis coded modulation with unequal error protection
CN104539393A (zh) * 2015-01-07 2015-04-22 北京邮电大学 一种基于极化码的信源编码方法
CN109561037A (zh) * 2017-09-27 2019-04-02 株式会社Ntt都科摩 比特到符号的映射方法和通信装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8627189B2 (en) * 2009-12-03 2014-01-07 Microsoft Corporation High performance digital signal processing in software radios
US8630362B1 (en) * 2011-05-02 2014-01-14 Urbain A. von der Embse QLM co-state MAP trellis
US9749028B2 (en) * 2015-09-10 2017-08-29 Huawei Technologies Co., Ltd. System and method for trellis coded quantization based channel feedback
US10601629B2 (en) 2017-08-09 2020-03-24 Futurewei Technologies, Inc. Virtual lookup table for probabilistic constellation shaping
US10608749B1 (en) 2018-01-24 2020-03-31 Inphi Corporation Probabilistic shaping techniques for high performance coherent optical transceivers
GB2597791B (en) * 2020-08-06 2022-11-23 Cisco Tech Inc Quadrature amplitude modulation with constellation shaping

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008154202A (ja) * 2006-11-22 2008-07-03 Yokohama National Univ 符号化変調システムおよび受信装置ならびに符号化変調方法および復号方法
WO2008126047A1 (en) * 2007-04-13 2008-10-23 Koninklijke Philips Electronics N.V. Trellis coded modulation with unequal error protection
CN104539393A (zh) * 2015-01-07 2015-04-22 北京邮电大学 一种基于极化码的信源编码方法
CN109561037A (zh) * 2017-09-27 2019-04-02 株式会社Ntt都科摩 比特到符号的映射方法和通信装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4398503A4 *

Also Published As

Publication number Publication date
EP4398503A1 (en) 2024-07-10
US12542621B2 (en) 2026-02-03
EP4398503A4 (en) 2025-04-23
US20240283562A1 (en) 2024-08-22
CN116073945A (zh) 2023-05-05

Similar Documents

Publication Publication Date Title
WO2020147526A1 (zh) 一种级联crc码的极化码编码方法及装置
US12542621B2 (en) Information processing method and communication apparatus for improving channel encoding between devices
WO2020135616A1 (zh) 极化编码调制的方法和装置
CN107408953A (zh) 编码方法、装置、基站和用户设备
US20240405916A1 (en) Encoding method and encoding apparatus based on systematic polar code
US20240322939A1 (en) Information processing method and device
CN113784356B (zh) 一种通信参数的确定方法、装置、设备以及存储介质
US20250266939A1 (en) Communication method and related apparatus
WO2022022516A1 (zh) 无线通信的方法和装置
US20240405786A1 (en) Encoding method and encoding apparatus based on polar code
CN114077605A (zh) 一种数据处理方法及装置
WO2021244403A1 (zh) 一种信号发送方法、信号接收方法与相关装置
WO2024130465A1 (zh) 数据传输的方法和装置
WO2024119379A1 (zh) 一种信息比特的确定方法及装置
WO2023071901A1 (zh) 通信方法和通信装置
US20260074830A1 (en) Polar Code Encoding Method and Apparatus
WO2024259713A1 (zh) 通信方法及相关装置
CN108023677B (zh) 信息处理的方法、装置及无线通信设备
US20260121784A1 (en) Communication method and related apparatus
WO2024031268A1 (en) Methods and devices for determining target cell id for mac-i calculation
WO2025103203A1 (zh) 极化码编码的方法和装置
WO2025113455A1 (zh) 通信方法和通信装置
WO2025223321A1 (zh) 编码和译码的方法及通信装置
WO2025148789A1 (zh) 一种编码方法、解码方法及装置
WO2024159980A1 (zh) 信号传输方法、装置及设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22886043

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2022886043

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2022886043

Country of ref document: EP

Effective date: 20240403

NENP Non-entry into the national phase

Ref country code: DE