WO2023093411A1 - 一种信息处理方法及设备 - Google Patents

一种信息处理方法及设备 Download PDF

Info

Publication number
WO2023093411A1
WO2023093411A1 PCT/CN2022/127004 CN2022127004W WO2023093411A1 WO 2023093411 A1 WO2023093411 A1 WO 2023093411A1 CN 2022127004 W CN2022127004 W CN 2022127004W WO 2023093411 A1 WO2023093411 A1 WO 2023093411A1
Authority
WO
WIPO (PCT)
Prior art keywords
matrix
source
coding
channel coding
information
Prior art date
Application number
PCT/CN2022/127004
Other languages
English (en)
French (fr)
Inventor
牛凯
董昊
戴金晟
王碧钗
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP22897494.5A priority Critical patent/EP4422079A1/en
Publication of WO2023093411A1 publication Critical patent/WO2023093411A1/zh
Priority to US18/670,138 priority patent/US20240322939A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
    • 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/0076—Distributed coding, e.g. network coding, involving 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0014—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the source coding
    • 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
    • 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/033—Theoretical methods to calculate these checking codes
    • H03M13/036—Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error
    • 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • 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/255—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 Low Density Parity Check [LDPC] codes
    • 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/615—Use of computational or mathematical techniques
    • H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
    • 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/63—Joint error correction and other techniques
    • H03M13/6312—Error control coding in combination with data compression
    • 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
    • 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/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
    • H04L1/0016—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy involving special memory structures, e.g. look-up tables
    • 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
    • H04L1/0047—Decoding adapted to other signal detection operation
    • H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
    • 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/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/04—Error control

Definitions

  • the present application relates to the field of communication technologies, and in particular to an information processing method and device.
  • Double LDPC double LDPC, D-LDPC
  • Embodiments of the present application provide an information processing method and device for providing a codec solution that can be adapted to a 5G NR system.
  • a first information processing method is provided, which can be executed by a terminal device, or by a larger device including a terminal device, or by a chip system or other functional modules, and the chip system or functional modules can realize terminal device function, the chip system or functional module is set in a terminal device, for example.
  • the method may be executed by an access network device, or by other devices including access network device functions, or by a chip system or other functional modules, where the chip system or functional module can implement the functions of the access network device, the The chip system or functional modules are, for example, set in the access network equipment.
  • the access network device is, for example, a base station.
  • the method includes: determining a first source coding rate; determining a source coding matrix according to the first source coding rate and a channel coding base matrix; inputting a source sequence into the source coding matrix, so as to The source sequence is used for source encoding.
  • the source coding matrix can be determined according to the channel coding base matrix, which is equivalent to determining the information of the source coding according to the information of the channel coding, and realizes the joint coding of the source channel.
  • the number of output bits of source coding can be matched with the number of input bits of channel coding, so that the technical solution of the embodiment of the present application can be adapted to the 5G NR system.
  • the method further includes: determining the first Source coding rate, the first information includes the correspondence between source coding rate and source code length and entropy rate, and the number of source coding rates included in the first information is greater than 6.
  • the first information provided by the embodiment of the present application includes a large number of source coding rates, for example, the number of source coding rates included in the first information is greater than 6, so the source coding rate granularity provided by the first information is more granular Fine, the first device has high flexibility when selecting the code rate of the source code, and can select a more appropriate code rate of the source code according to the entropy rate of the source sequence and the length of the source code, which improves the flexibility and accuracy of code rate selection sex.
  • the source coding matrix includes: determining a source coding matrix according to the first source coding rate and the channel coding matrix; and determining the source coding matrix according to the source coding matrix.
  • the source coding matrix can be determined first, and then the source coding matrix can be determined according to the source coding matrix.
  • the source coding basis is determined according to the first source coding rate and the channel coding basis matrix A matrix, including: determining the set number to which the lifting coefficient corresponding to the first source coding code rate belongs; determining the first channel coding base matrix corresponding to the set number; transposing the first channel coding base matrix , to obtain a second channel coding basis matrix; and clipping the rows and/or columns of the second channel coding basis matrix to obtain the information source coding basis matrix.
  • the first channel coding basis matrix after obtaining the first channel coding basis matrix, it may not be transposed, but the rows and/or columns of the first channel coding basis matrix are cut to obtain the source coding basis matrix; or, after obtaining After the first channel coding basis matrix, first cut the rows and/or columns of the first channel coding basis matrix, and then perform transposition to obtain the source coding basis matrix; or, it is also possible to obtain the source coding basis by other means Matrix is more flexible.
  • clipping the rows and/or columns of the second channel coding base matrix includes: reserving The first N 1 rows of the second channel coding base matrix, N 1 is a positive integer less than or equal to the total number of rows of the second channel coding base matrix; and/or, retaining N of the second channel coding base matrix 2 columns, N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix. This method is more effective for performance improvement.
  • N 1 22.
  • the N 2 column is the 13th column to the N 2 +12th column of the second channel coding base matrix; or, if N 2 is greater than the first value, the N 2 column is the second channel coding Columns 46-N 2 to 45 of the base matrix. In this column pruning method, the performance is better.
  • the seventh alternative implementation manner of the first aspect may be In an optional implementation manner, the method further includes: performing channel coding on the bits output by the source coding matrix through a first matrix, wherein the output dimension of the source coding matrix is the same as the input dimension of the first matrix Dimensions are equal.
  • the first matrix is, for example, also called a channel generation matrix, etc., and can be used in the channel coding process.
  • the output dimension of the source coding matrix is equal to the input dimension of the first matrix, which makes the technical solution provided by the embodiment of the present application applicable to the 5G system.
  • performing channel coding on the bits output by the source coding matrix through the first matrix including: The bits output by the source coding matrix are scrambled through the second matrix; channel coding is performed on the scrambled bits through the first matrix.
  • the second matrix is, for example, an identity matrix, or may be a matrix obtained from the identity matrix, or the like.
  • a second information processing method is provided.
  • the method can be executed by a terminal device, or by a larger device including a terminal device, or by a chip system or other functional modules, which can realize the functions of the terminal device, and the chip system or functional modules are, for example, set in in the terminal device.
  • the method may be executed by an access network device, or by other devices including access network device functions, or by a chip system or other functional modules, where the chip system or functional module can implement the functions of the access network device, the The chip system or functional modules are, for example, set in the access network equipment.
  • the access network device is, for example, a base station.
  • the method includes: obtaining a joint check matrix according to a second matrix, the second matrix being a matrix obtained from an identity matrix; decoding the received second information according to the joint check matrix.
  • a third information processing method is provided.
  • the method can be executed by a terminal device, or by a larger device including a terminal device, or by a chip system or other functional modules, which can realize the functions of the terminal device, and the chip system or functional modules are, for example, set in in the terminal device.
  • the method may be executed by an access network device, or by other devices including access network device functions, or by a chip system or other functional modules, where the chip system or functional module can implement the functions of the access network device, the The chip system or functional modules are, for example, set in the access network equipment.
  • the access network device is, for example, a base station.
  • the method includes: determining a first information source encoding code rate; determining an information source encoding matrix according to the first information source encoding code rate; decoding the received second information according to the information source encoding matrix.
  • a communication device may be a device for performing the method described in the first aspect above.
  • the communication device has the function of a device for performing the method of the first aspect above.
  • the communication device is, for example, a terminal device, or a functional module in the terminal device, such as a baseband device or a chip system.
  • the communication device is, for example, an access network device, or a functional module in the access network device, such as a baseband device or a chip system.
  • the communication device includes a baseband device and a radio frequency device.
  • the communication device includes a processing unit (also called a processing module sometimes) and a transceiver unit (also called a transceiver module sometimes).
  • the transceiver unit can realize the sending function and the receiving function.
  • the sending unit sometimes also called the sending module
  • the receiving unit sometimes also called receiving module.
  • the sending unit and the receiving unit can be the same functional module, which is called the transceiver unit, and this functional module can realize the sending function and the receiving function; or, the sending unit and the receiving unit can be different functional modules, and the transceiver unit is for these A general term for functional modules.
  • the communication device further includes a storage unit, and the processing unit is configured to be coupled to the storage unit, and execute programs or instructions in the storage unit to enable the communication device to Execute the method described in the first aspect above.
  • a communication device may be a device for performing the method described in the second aspect above.
  • the communication device has the function of a device for performing the method of the second aspect above.
  • the communication device is, for example, a terminal device, or a functional module in the terminal device, such as a baseband device or a chip system.
  • the communication device is, for example, an access network device, or a functional module in the access network device, such as a baseband device or a chip system.
  • the communication device includes a baseband device and a radio frequency device.
  • the communication device includes a processing unit (also called a processing module sometimes) and a transceiver unit (also called a transceiver module sometimes).
  • a processing unit also called a processing module sometimes
  • a transceiver unit also called a transceiver module sometimes.
  • the communication device further includes a storage unit, and the processing unit is configured to be coupled to the storage unit, and execute programs or instructions in the storage unit to enable the communication device to Execute the method described in the second aspect above.
  • a communication device may be a device for performing the method described in the fourth aspect above.
  • the communication device has the function of a device for performing the method of the third aspect above.
  • the communication device is, for example, a terminal device, or a functional module in the terminal device, such as a baseband device or a chip system.
  • the communication device is, for example, an access network device, or a functional module in the access network device, such as a baseband device or a chip system.
  • the communication device includes a baseband device and a radio frequency device.
  • the communication device includes a processing unit (also called a processing module sometimes) and a transceiver unit (also called a transceiver module sometimes).
  • a processing unit also called a processing module sometimes
  • a transceiver unit also called a transceiver module sometimes.
  • the communication device further includes a storage unit, and the processing unit is configured to be coupled to the storage unit, and execute programs or instructions in the storage unit to enable the communication device to Execute the method described in the third aspect above.
  • a computer-readable storage medium is provided, the computer-readable storage medium is used to store a computer program or an instruction, and when it is executed, the method performed by the terminal device or the access network device in the above-mentioned aspects be realized.
  • a computer program product containing instructions which enables the methods described in the above aspects to be implemented when it is run on a computer.
  • an apparatus including one or more units for performing the method described in any embodiment of the present application.
  • a tenth aspect provides a communication system, including the communication device described in the fourth aspect and the communication device described in the fifth aspect.
  • a communication system including the communication device described in the fourth aspect and the communication device described in the sixth aspect.
  • FIG. 1 is a schematic diagram of an application scenario of an embodiment of the present application
  • FIG. 2 is a flow chart of the first information processing method provided by the embodiment of the present application.
  • FIG. 3A is a flowchart of determining a first channel coding base matrix by a first device in an embodiment of the present application
  • FIG. 3B is a flowchart of selecting the first N1 rows from the second channel coding base matrix by the first device in the embodiment of the present application;
  • FIGS. 3C to Figure 3H are schematic diagrams of several performances when the first value is different in the embodiment of the present application.
  • FIG. 3I is a flowchart of cutting the number of columns of the fourth channel coding base matrix by the first device in the embodiment of the present application;
  • FIG. 4 is a flow chart of the repetition-interleaving process in the embodiment of the present application.
  • FIG. 5A is a schematic diagram of the connection relationship between check nodes and variable nodes in the embodiment of the present application.
  • FIG. 5B and FIG. 5C are two schematic diagrams of LLR transmission between the check node and the variable node in the embodiment of the present application.
  • FIG. 6 is a schematic diagram of a joint source-channel decoding process in an embodiment of the present application.
  • FIG. 7 is a flow chart of the second information processing method provided by the embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of a joint parity check matrix in an embodiment of the present application.
  • Fig. 9 is a flow chart of obtaining the second matrix through the search algorithm in the embodiment of the present application.
  • Figures 10 to 12 are flowcharts of several ways of generating permutation matrices in the embodiments of the present application.
  • Figures 13 to 14 are schematic diagrams of the performance comparison between the embodiment of the present application and the traditional solution
  • Fig. 15 is a schematic diagram of a device provided by an embodiment of the present application.
  • Fig. 16 is a schematic diagram of another device provided by the embodiment of the present application.
  • the terminal device is a device with wireless transceiver function, which can be a fixed device, a mobile device, a handheld device (such as a mobile phone), a wearable device, a vehicle-mounted device, or a wireless device built into the above-mentioned devices (such as , communication module, modem, or chip system, etc.).
  • the terminal device is used to connect people, things, machines, etc., and can be widely used in various scenarios, including but not limited to the following scenarios: cellular communication, device-to-device communication (device-to-device, D2D), car-to-everything (vehicle to everything, V2X), machine-to-machine/machine-type communications (machine-to-machine/machine-type communications, M2M/MTC), Internet of things (Internet of things, IoT), virtual reality (virtual reality, VR) , augmented reality (augmented reality, AR), industrial control (industrial control), unmanned driving (self driving), telemedicine (remote medical), smart grid (smart grid), smart furniture, smart office, smart wear, smart transportation , Terminal equipment for smart cities, drones, robots and other scenarios.
  • cellular communication device-to-device communication
  • D2D device-to-device, D2D
  • car-to-everything vehicle to everything
  • V2X machine-to-machine/mach
  • the terminal equipment may sometimes be referred to as user equipment (user equipment, UE), terminal, access station, UE station, remote station, wireless communication device, or user device, etc.
  • user equipment user equipment
  • UE user equipment
  • access station UE station
  • remote station wireless communication device
  • wireless communication device or user device, etc.
  • the terminal device is taken as an example for description.
  • the network devices in this embodiment of the present application may include, for example, access network devices and/or core network devices.
  • the access network device is a device with a wireless transceiver function, and is used for communicating with the terminal device.
  • the access network equipment includes but is not limited to a base station (base transceiver station (BTS), Node B, eNodeB/eNB, or gNodeB/gNB), a transmission reception point (TRP), a third generation 3rd generation partnership project (3GPP) subsequent evolution base station, wireless fidelity (wireless fidelity, Wi-Fi) system access node, wireless relay node, wireless backhaul node, etc.
  • BTS base transceiver station
  • TRP transmission reception point
  • 3GPP third generation 3rd generation partnership project
  • the base station may be: a macro base station, a micro base station, a pico base station, a small station, a relay station, and the like. Multiple base stations can support networks of the same access technology or networks of different access technologies.
  • a base station may contain one or more co-sited or non-co-sited transmission and reception points.
  • the access network device may also be a wireless controller, a centralized unit (centralized unit, CU), and/or a distributed unit (distributed unit, DU) in a cloud radio access network (cloud radio access network, CRAN) scenario.
  • the access network device may also be a server or the like.
  • a network device in a vehicle to everything (V2X) technology may be a road side unit (RSU).
  • V2X vehicle to everything
  • RSU road side unit
  • the base station is used as an example for the access network device to be described.
  • the base station can communicate with the terminal equipment, and can also communicate with the terminal equipment through the relay station.
  • a terminal device can communicate with multiple base stations in different access technologies.
  • the core network equipment is used to implement functions such as mobility management, data processing, session management, policy and charging.
  • the names of devices implementing core network functions in systems with different access technologies may be different, which is not limited in this embodiment of the present application.
  • the core network equipment includes: access and mobility management function (access and mobility management function, AMF), session management function (session management function, SMF), policy control function (policy control function, PCF) or User plane function (user plane function, UPF), etc.
  • the communication device for realizing the function of the network device may be a network device, or a device capable of supporting the network device to realize the function, such as a chip system, and the device may be installed in the network device.
  • the technical solution provided by the embodiment of the present application the technical solution provided by the embodiment of the present application is described by taking the network device as an example for realizing the function of the network device.
  • nouns for the number of nouns, unless otherwise specified, it means “singular noun or plural noun", that is, “one or more". “At least one” means one or more, and “plurality” means two or more. "And/or” describes the association relationship of associated objects, indicating that there can be three types of relationships, for example, A and/or B, which can mean: A exists alone, A and B exist at the same time, and B exists alone, where A, B can be singular or plural. The character “/" generally indicates that the contextual objects are an "or” relationship. For example, A/B means: A or B. “At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items.
  • At least one item (piece) of a, b, or c means: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, c Can be single or multiple.
  • first and second mentioned in this embodiment of the application are used to distinguish multiple objects, and are not used to limit the size, content, order, timing, priority, or importance of multiple objects.
  • first information and the second information may be the same information or different information, and this name does not mean that the content, application scenarios, priority or importance of the two information are different .
  • the numbering of the steps in the various embodiments introduced in this application is only for distinguishing different steps, and is not used to limit the order of the steps. For example, S201 may occur before S202, or may occur after S202, or may occur simultaneously with S202.
  • the source coding matrix can be determined according to the channel coding base matrix, which is equivalent to determining the information of the source coding according to the information of the channel coding, and realizes joint coding of the source channel.
  • the number of output bits of source coding can be matched with the number of input bits of channel coding, so that the technical solution of the embodiment of the present application can be adapted to the 5G NR system.
  • the technical solutions provided by the embodiments of the present application can be applied to the fourth generation mobile communication technology (the 4th generation, 4G) system, such as the long term evolution (long term evolution, LTE) system, or can be applied to the 5G system, such as the new wireless (new radio, NR) system, or may also be applied to a next-generation mobile communication system or other similar communication systems, without specific limitations.
  • the technical solutions provided by the embodiments of the present application can be applied to device-to-device (D2D) scenarios, such as NR-D2D scenarios, etc., or can be applied to vehicle to everything (V2X) scenarios, such as NR-V2X scenarios, etc.
  • D2D device-to-device
  • V2X vehicle to everything
  • both communication parties may be UEs; if it is applied to a non-D2D scenario, the communication party may be a UE, and the other party may be a network device (such as an access network device or a core network device), or the communication parties may are network devices. Alternatively, any one or both of the communication parties may also be other types of electronic equipment except the network equipment and the terminal equipment.
  • the communicating parties are a first device and a second device respectively.
  • the first device is, for example, a terminal device, network device or other types of electronic devices
  • the second device is, for example, a terminal Other types of electronic equipment.
  • FIG. 1 shows a communication network architecture provided by an embodiment of the present application, and various embodiments provided later can be applicable to this architecture.
  • the first device and the second device can communicate, for example, the first device is a data sending end, and the second device is a data receiving end.
  • the first device can perform operations such as source coding and channel coding on the data when sending data
  • the second device can perform operations such as joint source and channel decoding on the data after receiving data from the first device.
  • FIG. 2 is a flowchart of the method.
  • the method can be applied to the network architecture shown in FIG. 1 , for example, the first device involved in the method is the first device in FIG. 1 , and the second device involved in the method is the second device in FIG. 1 .
  • the first device determines a first source coding rate.
  • the first device may determine the source coding rate of the source sequence according to the corresponding characteristics of the source sequence, that is, determine the first source coding rate.
  • the source sequence is the original data to be sent by the first device.
  • the first device needs to perform source coding and channel coding processing on the source sequence, and then send the processed source sequence to the second device.
  • the source sequence is expressed as c 0 , c 1 ,...,c N-1 , N represents the length of the source sequence, and the subscript used to represent the character of the source sequence is from 0 to (N-1) Integers of , incremented by 1 sequentially. Where N is a positive integer.
  • the characteristics of the source sequence include, for example, the entropy rate of the source sequence and the source code length (the embodiment of the present application also refers to the source code length as the code length for short), then the first device can The length determines the coding rate of the first information source.
  • the information source coding code rate may also be referred to as code rate for short
  • the entropy rate of the information source sequence may be referred to as information source entropy rate, or entropy rate for short.
  • the first device may evaluate the entropy rate of the information source sequence, for example, the entropy rate of the information source sequence is expressed as H.
  • the first device can also determine the code length of the source sequence, for example, the code length of the source sequence is related to N. For example, after obtaining the entropy rate and the code length of the information source sequence, the first device can determine the first information source encoding code rate by querying the first information.
  • the first information includes the correspondence between the source code rate and the entropy rate, or the first information includes the correspondence between the source code rate and the source code length, or the first information includes the source Correspondence between code rate, source code length, and entropy rate; considering that there is a correspondence between source code length and lifting size, the first information may also include source code rate, lifting size and the corresponding relationship between entropy rates; or, the first information may also include the corresponding relationship between information source coding rate, information source code length, lifting size, and entropy rate.
  • the first device can determine the source coding rate of the source sequence from the first information, that is, determine the first source coding rate.
  • the first information includes the correspondence between the source code rate, the source code length, and the entropy rate, or the first information includes the correspondence between the source code rate, the source code length, the lifting size, and the entropy rate, then After obtaining the entropy rate and code length of the source sequence, the first device may directly determine the first source coding rate from the first information; or, the first information includes the source coding rate, lifting size, and entropy rate After obtaining the entropy rate and code length of the source sequence, the first device can determine the lifting size according to the code length of the source sequence, and then determine the first source coding rate according to the first information.
  • the first information is presented, for example, in the form of a table, or may also be presented in other forms. Taking the first information presented in table form as an example, please refer to Table 1, which is an example of the first information.
  • a row in Table 1 is regarded as one item, and the first information may only include one or more items in Table 1; or, the first information includes one or more items in Table 1, and other item; or, the first information does not include all items in Table 1, but includes other items.
  • the first information provided by the embodiment of the present application includes a large number of source coding rates. For example, if the first information is in Table 1, the number of source coding rates included in the first information is greater than 6. Therefore, the source code rate granularity provided by the first information is finer, and the first device has higher flexibility in selecting the source code rate, and can select a more appropriate source code according to the entropy rate of the source sequence and the source code length. Bit rate, which improves the flexibility and accuracy of bit rate selection.
  • Z c represents the lifting size
  • R sc represents the code rate. If the lifting size is greater than or equal to 40 and less than 160, the corresponding code length is regarded as a short code length; if the lifting size is greater than or equal to 160, the corresponding code length is regarded as a long code length.
  • the first device determines that the entropy rate H is less than or equal to 0.3469, and the source code length is a short code length, or determines that the entropy rate H is less than or equal to 0.3469, and the lifting size is greater than or equal to 40 and less than 160, then according to Table 1, Determine the corresponding code rate is 22/46.
  • the first device needs to process the information source sequence.
  • a processing method is to process the information source sequence through an information source encoding matrix, and this processing process can be regarded as a process of encoding and compressing the information source sequence.
  • the bits output by the source coding matrix may be used as input bits in the channel coding process, and the first device performs channel coding and other processing on the bits output by the source coding matrix.
  • LDPC low-density
  • the embodiment of this application proposes that when the information source entropy rate is constant and the error floor phenomenon is within an acceptable range, the information source code rate should be as high as possible to reduce the coding as much as possible. Waste of resources.
  • Table 1 There are many ways to obtain Table 1. For example, one way is that the code rate of channel coding is fixed. On this basis, given a source code rate and lifting size, the corresponding source code matrix can be obtained. Apply the source coding matrix to the joint source-channel coding system provided by the embodiment of the present application, and obtain the bit error rate of the source coding matrix under different signal-to-noise ratios by simulating at a specific source entropy rate (bit error rate, BER), and evaluate its error floor. If the error floor is low, try to increase the source entropy rate within an acceptable range to determine whether the source encoding matrix can handle a higher entropy rate source sequence. After several times of similar processing, the highest entropy rate that can be processed by the source coding matrix corresponding to different source code lengths and source code rates can be synthesized, and Table 1 can be obtained.
  • bit error rate bit error rate
  • the first device does not perform the process of determining the first source coding rate, but directly applies the first source coding rate, so S201 is an optional step.
  • the first device determines a source coding matrix according to a channel coding base matrix.
  • the first device may first determine the source coding matrix according to the channel coding matrix, and then determine the source coding matrix according to the source coding matrix. These two steps are introduced separately below.
  • the first device determines the source coding basis matrix according to the channel coding basis matrix.
  • the channel coding base matrix is information related to the channel coding process, which is equivalent to the first device determining the source coding information according to the channel coding information, so that the channel coding process matches the source coding process, making the technical solution of the embodiment of the application Can be adapted to 5G NR system.
  • the first device determines the source coding matrix, in addition to referring to the channel coding base matrix, it may also refer to the first source coding rate, that is, the first device may refer to the first source coding rate and The channel coding basis matrix determines the source coding matrix.
  • the first device determines the source coding matrix according to the channel coding matrix.
  • One implementation may be that the first device determines the source coding matrix according to the first source coding rate and the channel coding matrix.
  • the first device determines the source coding matrix according to the first source coding rate and the channel coding matrix. For example, a determination process is that the first device processes the first channel coding matrix to obtain the source coding matrix .
  • the processing method includes, for example, transposition and/or cropping, and if the processing method includes transposition and cropping, the sequence between the two steps of transposition and cropping is not limited.
  • the determining process may further include a step in which the first device obtains the first basic channel coding matrix.
  • the first device needs to obtain the first channel coding base matrix.
  • One way of obtaining it is, for example, the first device determines the set number to which the lifting size corresponding to the first source coding code rate belongs, and then determines the matrix corresponding to the set number.
  • the matrix It can be used as the first channel coding base matrix.
  • the first channel coding base matrix can be denoted as H cc_BG .
  • the first device may query the third information, and determine from the third information the set number to which the lifting size corresponding to the first source code rate belongs.
  • the first device queries the fourth information, and determines the matrix corresponding to the set number from the fourth information, and this matrix can be used as the first channel coding basic matrix H cc_BG .
  • the third information is presented, for example, in the form of a table.
  • the third information may include one or more items in the following Table 2, wherein a row in Table 2 is regarded as one item.
  • the lifting size corresponding to the code rate of the first information source is 2, then according to Table 2, it can be determined that the set number to which the lifting size belongs is 0.
  • the third information may also be presented in other forms, or even if the third information is presented in a table form, it may be other tables instead of Table 2.
  • the fourth information is presented, for example, in the form of a table.
  • the fourth information may include one or more items in the following Table 3, wherein a row in Table 3 is regarded as one item.
  • the fourth information may also be presented in other forms, or even if the fourth information is presented in a table form, it may be other tables instead of Table 3.
  • FIG. 3A it is a flow chart of determining the first channel coding basis matrix according to Table 2 and Table 3 for the first device.
  • the first device queries Table 2 for the set number to which the lifting size corresponding to the coding rate of the first information source belongs, for example, denote the lifting size as Z c and the set number as i LS .
  • the first device determines the matrix corresponding to i LS according to Table 3, and this matrix can be used as the first channel coding base matrix H cc_BG .
  • H cc_BG For each element in H cc_BG , some elements may have been defined in Table 3, and some elements may not be defined in Table 3.
  • the assignment process of H cc_BG is the process of obtaining the first basic channel coding matrix. After the assignment of H cc_BG is completed, the first device obtains the first basic channel coding matrix.
  • the first device may perform transposition and/or clipping on the first basic channel coding matrix to obtain the basic source coding matrix.
  • the first device performs processing such as transposition and/or clipping on the first channel coding base matrix, which may include several situations. For example, in case 1, the first device first performs transposition processing on the first channel coding base matrix, and the obtained matrix is called the second channel coding base matrix; the first device then performs tailoring processing on the second channel coding base matrix (for example , pruning the rows and/or columns of the second channel coding basis matrix) to obtain the source coding basis matrix.
  • the first device first performs clipping processing on the first channel coding matrix (for example, clipping the rows and/or columns of the first channel coding matrix), and the obtained matrix is called the third channel coding matrix.
  • An encoding basis matrix the first device then transposes the third channel encoding basis matrix to obtain a source encoding basis matrix.
  • the first device performs clipping processing on the first channel coding base matrix (for example, clipping the rows and/or columns of the first channel coding base matrix) to obtain the source coding base matrix. In this case, there is no need for transposition processing, which can simplify the processing process. Examples of these situations are given below.
  • the first device first transposes the first channel coding matrix to obtain the second channel coding matrix; the first device then performs tailoring processing on the second channel coding matrix (for example, the second channel coding matrix The rows and/or columns are cut), and the source coding basis matrix is obtained.
  • the first device first determines the first basic channel coding matrix. After determining the first basic channel coding matrix, the first device transposes the first basic channel coding matrix to obtain the second basic channel coding matrix, for example, the second basic channel coding matrix
  • the base matrix is expressed as H sc1_BG
  • H sc1_BG is, for example, a matrix with 68 rows and 46 columns.
  • the first device clips the rows and/or columns of the second channel coding base matrix to obtain the information source coding base matrix.
  • Clipping the rows of the second channel coding base matrix by the first device means that the first device selects some rows from the second channel coding base matrix.
  • Clipping the columns of the second channel coding base matrix by the first device means that the first device selects some columns from the second channel coding base matrix.
  • the first device may only crop the rows of the second channel coding base matrix, while the number of columns remains unchanged; or, the first device may only crop the columns of the second channel coding base matrix, while the number of rows remains unchanged ; Or, the first device prunes both the rows and columns of the second channel coding base matrix. Specifically how to cut can be determined according to the performance of the actual encoding and decoding system or according to the adaptability of the embodiment of this application to the 5G NR system and other factors. The following uses an example in which the first device clips the rows and columns of the second channel coding base matrix as an example.
  • the second channel coding base matrix includes a large number of rows, and the technical solution provided in the embodiment of this application is expected to be applicable to the 5G NR system.
  • the number of input bits in the channel coding process is small, so the first device can perform row selection on the second channel coding base matrix, that is, select some rows in the second channel coding base matrix, so that the second channel coding
  • the number of remaining rows of the base matrix can match the number of input bits for the channel coding process in the 5G NR system.
  • the number of remaining rows of the second channel coding base matrix can be equal to the number of input bits of the channel coding process in the 5G NR system.
  • the number of input bits in the channel coding process in the 5G NR system is 22, then in the embodiment of this application, the first device can select 22 rows from the second channel coding matrix, so that in the embodiment of the application, the information source coding process
  • the number of output bits of is equal to the number of input bits of the channel coding process, so that the embodiment of the present application can be applied to the 5G NR system. If the number of input bits of the channel coding process in the 5G NR system changes, for example, to a value other than 22, the remaining number of rows of the second channel coding base matrix can also be changed accordingly.
  • the first device needs to select N 1 rows from the second basic channel coding matrix, where N 1 is a positive integer less than or equal to the total number of rows of the second basic channel coding matrix.
  • N 1 is determined according to the number of input bits in the channel coding process, for example, N 1 is 22, or it can be other values, as long as N 1 can match the number of input bits in the channel coding process.
  • a way of selecting N1 rows is, for example, that the first device may select the first N1 rows of the second channel coding base matrix, for example, the 0th row to the N1-1th row of the second channel coding base matrix, this selection The method can make the selected matrix have better performance.
  • the first device can also select N 1 rows in other ways, for example, the first device can select the last N 1 rows in the second channel coding basis matrix, or the first device can also randomly select from the second channel coding basis matrix Select N 1 rows in the matrix and so on.
  • the first device selects N 1 rows from the second basic channel coding matrix, and these N 1 rows may constitute a matrix, for example called a fourth basic channel coding matrix, and the fourth basic channel coding matrix is represented as H sc2_BG , for example.
  • the second basic channel coding matrix is a matrix with 68 rows and 46 columns
  • the fourth basic channel coding matrix is, for example, a matrix with N1 rows and 46 columns.
  • the first device assigns the first 22 rows of the second basic channel coding matrix H sc1_BG to H sc2_BG to obtain the fourth basic channel coding matrix.
  • H sc2_BG is the obtained source coding basis matrix. If the first device needs to clip both the rows and the columns of the second channel coding base matrix, the following steps may be continued.
  • the first device may determine the number of columns that need to be reserved, for example, the first device may determine the number of columns that need to be reserved according to the coding rate of the first information source.
  • N 2 is used to indicate the number of columns to be reserved, and N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix.
  • R sc represents the coding rate of the first information source
  • an optional way to determine N2 according to the coding rate of the first information source is,
  • the number of columns of the channel coding base matrix is generally 46, so optionally, N 2 may be less than or equal to 46.
  • N 2 is an integer greater than 22 and less than or equal to 46, or, considering improving the compression capability of source coding, N 2 can be greater than or equal to 27 and less than or equal to 46 an integer of .
  • N2 may also be other values.
  • the first device clipping the number of columns in the second channel coding base matrix as an example.
  • N 2 is less than or equal to the first value
  • N 2 columns are the 13th to N 2 +12th columns of the second channel coding base matrix; or, if N 2 is greater than the first value, then N 2
  • the columns are the 46-N 2 columns to the 45th columns of the second channel coding base matrix.
  • the selection of the first value may have an impact on the performance of the dual LDPC system.
  • the first value is an integer greater than or equal to 27 and less than or equal to 46.
  • the first value is 33, or it can be other values .
  • the performance of the dual LDPC system provided by the embodiment of the application is better; when the first value is 34, 35, 36, or 37, the performance of the dual LDPC system provided by the embodiment of the application is comparable It is slightly worse than when the first value is 33; when the first value is greater than 37, the performance of the dual LDPC system provided in the embodiment of the present application may be poor.
  • the first value should not be too small. For example, when the first value is less than 33, the first value may only function at a relatively high source code rate. Please refer to FIG. 3C to FIG. 3H , which are schematic performance diagrams of the dual LDPC system provided by the embodiment of the present application when different first values are used.
  • Figure 3C includes three kinds of lines, the first value corresponding to the solid line is 33, the first value corresponding to the dotted line with relatively sparse granularity is 34, and the first value corresponding to the dotted line with denser granularity is 35.
  • Figure 3D includes three kinds of lines, the first value corresponding to the solid line is 33, the first value corresponding to the dotted line with relatively sparse granularity is 36, and the first value corresponding to the dotted line with denser granularity is 37.
  • Figure 3E includes three kinds of lines, the first value corresponding to the solid line is 33, the first value corresponding to the dotted line with relatively sparse granularity is 38, and the first value corresponding to the dotted line with denser granularity is 39.
  • Figure 3F includes three kinds of lines, the first value corresponding to the solid line is 33, the first value corresponding to the dotted line with relatively sparse granularity is 40, and the first value corresponding to the dotted line with denser granularity is 41.
  • Figure 3G includes three kinds of lines, the first value corresponding to the solid line is 33, the first value corresponding to the dotted line with relatively sparse granularity is 42, and the first value corresponding to the dotted line with denser granularity is 43.
  • Figure 3H includes four kinds of lines, the first value corresponding to the solid line is 33, the first value corresponding to the dotted line with relatively sparse granularity is 44, the first value corresponding to the dotted line with denser granularity is 45, and the first value corresponding to the dotted dotted line is the first The value is 46. It can be seen from FIG. 3C to FIG. 3H that when the first value is 33, the performance of the dual LDPC system provided by the embodiment of the present application is better.
  • the first device may also use other methods to trim the number of columns in the second channel coding base matrix, for example, the first device may also select the first N 2 columns or the last N 2 columns of the second channel coding base matrix, or the first device may also select N 2 columns can be randomly selected from the second channel coding basis matrix and so on. If the first device is to clip the fourth channel coding base matrix, the clipping manner is also similar.
  • the matrix obtained by the first device after trimming the number of columns of the second base channel coding matrix or the number of columns of the fourth base channel coding matrix may be called a fifth base channel coding matrix, and the fifth base channel coding matrix may be expressed as H sc3_BG .
  • FIG. 3I the process of cutting the number of columns of the fourth channel coding base matrix for the first device.
  • FIG. 3I takes the first value equal to 33 as an example.
  • the first device determines N 2 , if N 2 >33, the first device assigns the 46-N 2 to 45th columns of the fourth channel coding base matrix H sc2_BG to H sc3_BG , if N 2 ⁇ 33, then the first device assigns the 13th column to the N 2 +12th column of the fourth basic channel coding matrix H sc2_BG to H sc3_BG .
  • H sc3_BG is the obtained signal Source encoding basis matrix.
  • the first device needs to cut both the rows and columns of the second channel coding base matrix, and first cuts the columns and then cuts the rows, then after obtaining H sc3_BG , it can then cut the number of rows of H sc3_BG , and obtain The matrix of can be used as the source coding basis matrix.
  • the second channel coding base matrix is a matrix with 68 rows and 46 columns.
  • the first device cuts the number of rows of the second channel coding base matrix, and the obtained fourth channel coding base matrix is a matrix with N 1 rows and 46 columns. After that, the first The device cuts the number of columns of the fourth channel coding base matrix, and the obtained source coding base matrix is a matrix with N 1 rows and N 2 columns.
  • the source coding basis matrix is denoted as H sc_BG .
  • the first device first performs clipping processing on the first channel coding base matrix (for example, clipping the rows and/or columns of the first channel coding base matrix) to obtain the third channel coding base matrix;
  • the three-channel coding basis matrix is transposed to obtain the source coding basis matrix.
  • the first device first obtains the first basic channel coding matrix, and then prunes the rows and/or columns of the first basic channel coding matrix to obtain the third basic channel coding matrix.
  • the first device For the first device to trim the rows and/or columns of the first channel coding base matrix, reference may be made to the introduction of content of the first device clipping the second channel coding base matrix in case 1 above. The difference is that in case 2, when the first device cuts the rows of the first channel coding base matrix, it can refer to the way of cutting the columns of the second channel coding base matrix for the first device in case 1; the first device When pruning the columns of the first channel coding base matrix, reference may be made to the manner of pruning the rows of the second channel coding base matrix for the first device in Case 1. For example, in case 2, if the first device cuts out the rows of the first channel coding matrix, it needs to select N 2 rows from the first channel coding matrix. The selection method can refer to the selection of N 2 in case 1. The introduction of the column; if the first device cuts the columns of the first channel coding base matrix, it needs to select N1 columns from the first channel coding base matrix, and the selection method can refer to the selection of N1 rows in case 1 introduce.
  • the third basic channel coding matrix is obtained.
  • the first device then transposes the third channel coding basis matrix to obtain the source coding basis matrix.
  • the first device cuts the rows and columns of the first channel coding matrix, then the third channel coding matrix is a matrix of N 2 rows and N 1 columns, and the source coding matrix is N 1 rows and N 2 columns matrix.
  • the source coding basis matrix is denoted as H sc_BG .
  • the first device performs clipping processing on the first basic channel coding matrix (for example, clipping rows and/or columns of the first basic channel coding matrix) to obtain a basic source coding matrix.
  • the first basic channel coding matrix for example, clipping rows and/or columns of the first basic channel coding matrix
  • the first device For the first device to trim the rows and/or columns of the first channel coding base matrix, reference may be made to the introduction of content of the first device clipping the second channel coding base matrix in case 1 above. Similar to case 1, in case 3, if the first device cuts out the rows of the first channel coding base matrix, it needs to select N 1 rows from the first channel coding base matrix, and the selection method can refer to case 1 Introduction about selecting N 1 rows; if the first device trims the columns of the first channel coding base matrix, it needs to select N 2 columns from the first channel coding base matrix. The selection method can refer to the selection in Case 1 Presentation of N 2 columns. After the first device prunes the rows and/or columns of the first channel coding basis matrix, the source coding basis matrix is obtained.
  • the first device cuts out the rows and columns of the first channel coding base matrix
  • the information source coding base matrix is a matrix with N1 rows and N2 columns.
  • the source coding basis matrix is denoted as H sc_BG .
  • the first device can also obtain the source coding basis matrix in other ways, which is not limited in the embodiment of this application.
  • the first device in the embodiment of the present application determines the source coding base matrix according to the channel coding base matrix, thereby realizing the source-channel joint coding, and also making the number of output bits of the source coding process the same as the input bits of the channel coding process
  • the numbers can be matched, so that the technical solution provided by the embodiment of the present application can be adapted to the 5G NR system.
  • the first device determines an information source coding matrix according to the information source coding basis matrix.
  • the first device may perform a repetition-interleaving operation according to the source coding matrix to obtain the source coding matrix.
  • repetition-interleaving refers to a process of generating a source coding matrix according to a source coding basis matrix.
  • the source coding matrix is denoted as H sc .
  • the process of repetition-interleaving is to use the source coding matrix H sc_BG with the dimension of N 1 rows and N 2 columns to generate the source coding matrix H with the dimension of (N 1 ⁇ Z c ) rows (N 2 ⁇ Z c ) columns sc process.
  • Z c represents the lifting size corresponding to the coding rate of the first information source.
  • each element of the source coding matrix H sc_BG is corresponding to each square matrix whose size is Z c ⁇ Z c in the source coding matrix H sc , if the element of the source coding matrix H sc_BG If the value is -1, the square matrix corresponding to this element in the source coding matrix H sc is a 0 square matrix; if the value of an element in the source coding matrix H sc_BG is a non-negative integer v, then the signal
  • the square matrix corresponding to the element in the source coding matrix H sc is the square matrix obtained by cyclically shifting the identity matrix v times to the right.
  • FIG. 4 which is a flow chart of the repetition-interleaving process.
  • H sc_BG initially has a 0-matrix of (22 ⁇ Z c ) rows (N 2 ⁇ Z c ) columns, and then starts to assign values to the 0-matrix.
  • H sc_BG For the source coding base matrix H sc_BG with 22 rows and N 2 columns, it can be determined whether the value of the element in row i and column k is -1, where [H sc_BG ] i,k means row i in H sc_BG The element of the kth column. If the value of this element is -1, add 1 to the number of columns.
  • the first device inputs the source sequence into the source coding matrix, so as to perform source coding on the source sequence.
  • the source sequence is c 0 , c 1 , whil,c N-1 , after it is encoded and compressed by the source encoding matrix, the bits output by the source encoding matrix are expressed as d 0 ,d 1 ,...,d S-1 .
  • the number of input bits N of the source coding matrix can be equal to N 2 ⁇ Z c
  • the bits output by the source coding matrix may also be used as input bits in the channel coding process, that is, the first device also needs to perform channel coding on the bits output by the source coding matrix.
  • the first device may input the bits output by the source coding matrix into the first matrix, and the process of processing the bits by the first matrix is the process of channel coding the bits.
  • the first matrix may also be called a channel generation matrix, or a channel coding matrix, or may have other names.
  • the first matrix is determined, for example, according to a channel coding base matrix (for example, a first channel coding base matrix) and a lifting size corresponding to a channel coding process.
  • the lifting size corresponding to the channel coding process and the lifting size corresponding to the source coding process may be the same.
  • the information source coding matrix is obtained according to the channel coding base matrix. Therefore, the output dimension of the information source coding matrix and the input dimension of the channel generation matrix can be equal, so that the technical solution of the embodiment of the application can be Applied to 5G NR system.
  • the first device may directly use the bits output by the source coding matrix as the input bits of the channel coding process; or, the first device may process the bits output by the source coding matrix according to the second matrix, and then process the bits output by the source coding matrix
  • the bits are used as input bits for the channel coding process.
  • the first device scrambles the bits output by the source coding matrix according to the second matrix, and uses the scrambled bits as input bits in the channel coding process.
  • the manner in which the first device obtains the second matrix will be introduced in the embodiment of FIG. 7 . Although the embodiment in FIG. 7 describes the manner in which the second device obtains the second matrix, the manners in which the first device and the second device obtain the second matrix may be the same.
  • the information output by the channel coding process is called second information.
  • the first device sends the second information.
  • the second device receives the second information from the first device.
  • the first device may send the second information to the second device.
  • the first device may also perform processing such as scrambling and constellation mapping on the second information, and then send the second information, which is not limited in this embodiment of the present application.
  • the first device may also send auxiliary information to the second device to help the second device decode the second information.
  • the auxiliary information includes one or more of the first source coding rate, the channel coding rate corresponding to the second information (that is, the channel coding rate corresponding to the source sequence of the first device), or the lifting size .
  • the auxiliary information includes the code rate of the first source code.
  • the first device may pass physical layer control information, or a media access control (media access control, MAC) control element (control element, CE), or wireless Sending the first source code rate to the second device by way of resource control (radio resource control, RRC) signaling or the like.
  • resource control radio resource control, RRC
  • the auxiliary information includes the first source coding rate
  • both the first device and the second device have pre-stored source coding matrices corresponding to different source coding rates, and/or stored information source coding matrices corresponding to different channel coding rates.
  • a channel generation matrix also referred to as a channel coding matrix, etc., which is also referred to as a first matrix in this embodiment of the application.
  • the first device sends data to the second device, it may indicate information related to the source coding rate and/or channel coding rate in the control information for scheduling the data, and the second device determines the information used by the first device according to the control information.
  • the source coding matrix and/or channel generation matrix of the source coding matrix can further obtain a joint parity check matrix.
  • the protocol may define a process for generating the source coding matrix and/or channel generation matrix according to the source coding rate
  • the second device may use information related to the source coding rate indicated by the first device (for example, indicating that the first source coding rate), and the source coding matrix and/or channel generation matrix used by the first device can be obtained according to the generation process.
  • the first device may also send one or more of the source coding matrix, the channel generation matrix, or the joint parity check matrix to the second device, but this method requires relatively large overhead.
  • the second device decodes the second information to obtain a source sequence.
  • the source sequence obtained by the second device should be the same sequence as the source sequence processed by the first device.
  • the second device performs joint source-channel decoding on the second information, and the decoding process is briefly introduced below.
  • the second device When the second information arrives at the second device, due to interference, the second device needs to first judge whether the received information is 0 or 1, or in other words, it needs to judge how much probability of the received information is 0 (P0) and how much probability is 1 (P1).
  • the log-likelihood ratio (log-likelihood ratio, LLR) is the value obtained by dividing the probability that the received information is 0 by the probability that the received information is 1, and then taking the logarithm of the obtained result.
  • the initial LLR can be set as:
  • P1 is, for example, the prior information of the information source.
  • the process of joint source-channel decoding usually includes multiple iterations, and the LLR is updated in each iteration.
  • One iteration includes two sub-processes: LLR update of check nodes, and LLR update of variable nodes.
  • LLR update of check nodes In the sub-process of the LLR update of the check node, it needs to be clear which variable nodes are connected to a check node; in the sub-process of the LLR update of the variable node, it is necessary to be clear which check nodes are connected to a variable node .
  • the definite connection relationship between check nodes and variable nodes can be determined according to the joint check matrix.
  • the elements of the joint parity check matrix include two values of "0" and "1". Generally speaking, there are more “0”s and less “1”s in the matrix. If the value of an element in the joint check matrix is "1", it means that there is a connection between the check node represented by the row where the element is located and the variable node represented by the column where the element is located.
  • FIG. 5A is a schematic diagram of a connection relationship between a check node and a variable node.
  • the check nodes may include information source check nodes and channel check nodes
  • the variable nodes may include information source variable nodes and channel variable nodes.
  • the three box-shaped nodes shown in the left half of Figure 5A represent three source check nodes, the four circular nodes shown in the left half represent four source variable nodes, and the Three box-shaped nodes represent three channel check nodes, and four circular nodes shown in the right half represent four channel variable nodes.
  • the solid line in Fig. 5A represents the connection between the information source verification node and the information source variable node, or represents the connection between the channel verification node and the channel variable node; the dotted line represents the node of the channel encoding process and the information source encoding process Connections between nodes.
  • variable node When the first iteration starts, the variable node transmits the current LLR to the check node.
  • the dotted arrows indicate the transmission paths of the LLRs.
  • the three box-shaped nodes shown in the left half of FIG. 5B represent source check nodes 1 to 3
  • the four circular nodes shown in the left half represent source variable nodes 1 to 4
  • the right half The three box-shaped nodes shown in the part represent channel check nodes 4-6
  • the four circular nodes shown in the right half represent channel variable nodes 5-8.
  • FIG. 5B only shows the LLR transmission process related to the source check node 2 .
  • the source variable node 2, the source variable node 3 and the channel variable node 6 all transmit their respective LLRs to the source check node 2 (the arrows in FIG. 5B indicate LLR transmission).
  • LLR 1 the LLR transmitted by source variable node 2 to source check node 2
  • LLR 2 the LLR transmitted by source variable node 3 to source check node 2
  • LLR 3 the LLR transmitted by source variable node 3 to source check node 2
  • the channel variable node 6 transmits to source check node 2.
  • the LLR of verification node 2 is called LLR 3.
  • the check node After the check node receives the LLR from the variable node, it calculates a new LLR based on the received LLR, and returns the new LLR to the variable node.
  • the source check node 2 can calculate a A new LLR, for example called LLR 4, source check node 2 can transmit LLR 4 to channel variable node 6; LLR 3 calculated to obtain a new LLR, for example called LLR 5, the source check node 2 can transmit LLR 5 to the source variable node 3; the source check node 2 can use the LLR from the source variable node 3 2 and the LLR 3 from the channel variable node 6 calculate a new LLR, for example called LLR 6, and the source check node 2 can transmit LLR 6 to the source variable node 2.
  • the source checking node 2 can calculate a new LLR based on the LLR 1 from the source variable node 2, the LLR 2 from the source variable node 3, and the LLR 3 from the channel variable node 6, for example called LLR 8 , source check node 2 subtracts the influence of LLR 3 from LLR 8 to obtain LLR 9, and source check node 2 can transmit LLR 9 to channel variable node 6; source check node 2 obtains LLR 9 from LLR 8 Subtracting the influence of LLR 2, LLR 10 can be obtained, and source check node 2 can transmit LLR 10 to source variable node 3; source check node 2 can obtain LLR by subtracting the influence of LLR 1 from LLR 8 11.
  • the information source check node 2 can transmit the LLR 11 to the information source variable node 2. That is, the LLR transmitted by the check node i to the variable node j does not include the information of the LLR previously transmitted by the variable node j to the check node i.
  • FIG. 5C for the process of transmitting the LLR from the check node to the variable node.
  • the arrow in FIG. 5C indicates the LLR transmission.
  • 5C represent source check nodes 1-3
  • the four circular nodes shown in the left half represent source variable nodes 1-4
  • the right half The three box-shaped nodes shown in the part represent channel check nodes 4-6
  • the four circular nodes shown in the right half represent channel variable nodes 5-8.
  • variable node For a variable node, it is possible to receive new LLRs from one or more check nodes, the variable node can An LLR is obtained, and the LLR can participate in the subsequent iterative process.
  • the variable node obtains an LLR according to information such as the received LLR and the LLR from the channel (or according to the received LLR and prior information), for example, one way is that the variable node combines the received LLR and the LLR from the channel (or prior information) and so on add up to get a new LLR.
  • the LLRs transmitted from the variable nodes to the check nodes will be slightly different.
  • the source variable node 2 needs to transmit the LLR to the source verification node 2
  • the LLR transmitted by the source variable node 2 is the LLR obtained by the source variable node 2 after the previous round of iteration The difference between the source variable node 2 and the LLR transmitted to the source check node 2 in the previous round.
  • the LLR transmitted by the source variable node 2 to the source check node 2 in the last round is LLR 1
  • the LLR obtained by the source variable node 2 after the last round of iteration is the LLR obtained by the source variable node 2 according to
  • the LLR transmitted to the source verification node 2 during the process is the value of LLR 7 minus LLR 6.
  • the second device completes the joint source-channel decoding of the second information.
  • FIG. 6 it is a schematic diagram of a joint source-channel decoding process.
  • the dotted arrow pointing to "+” indicates that the variable node transmits information to the check node (for example, LLR) during the iteration process
  • the solid arrow pointing to "+” indicates that the check node transmits information to the variable node during the iteration process ( For example, transfer LLR).
  • "+” in Fig. 6 represents an addition operation
  • a special arrow in Fig. 6 that is, an arrow with a break in the middle
  • a "-" in the middle of the arrow represents a minus sign.
  • the source decoder receives the prior information of the source, and the information of the source check node will reach the source variable node (through the first "+” and "+” at the top reaches).
  • the second device can obtain the channel LLR from the amplitude of the received radio signal, which channel LLR can be input to the channel decoder.
  • the channel variable node can receive information from the channel check node, and can also receive information from the source check node.
  • the "+” and “-" corresponding to the dotted arrow pointing to "+” indicate the operation of calculating the difference
  • the "-" refers to the arithmetic subtraction operation.
  • the source checking node 2 can calculate a new LLR based on the LLR 1 from the source variable node 2, the LLR 2 from the source variable node 3 and the LLR 3 from the channel variable node 6, for example called LLR 8 , the source check node 2 subtracts the influence of LLR 3 from LLR 8 to obtain LLR 9, the source check node 2 can transmit LLR 9 to the channel variable node 6, and the real
  • the "-" corresponding to the line arrow refers to the operation described here that the source check node subtracts the influence of a certain LLR from the calculated LLR.
  • the first device may not necessarily send the second information after obtaining it, so S204 and S205 are optional steps.
  • the first device may determine the first source code rate from the first information according to the entropy rate of the source sequence and the source code length.
  • the number of source code rates included in the first information is relatively large.
  • the selection flexibility is high, and a more appropriate source code rate can be selected according to the entropy rate of the source sequence and the source code length, which improves the flexibility and accuracy of the code rate selection.
  • the first device can determine the source coding matrix according to the channel coding base matrix, which is equivalent to determining the information of the source coding according to the information of the channel coding, and realizing joint coding of the source and channel. Through joint coding of source and channel, the number of output bits of source coding can be matched with the number of input bits of channel coding, so that the technical solution of the embodiment of the present application can be adapted to the 5G NR system.
  • the second device needs to use a joint check matrix.
  • the second device may determine the source coding matrix according to the auxiliary information, and then obtain the joint parity check matrix according to the source coding matrix, the channel parity check matrix, and the identity matrix. Based on this, the embodiment of the present application proposes that the joint parity check matrix can be improved to obtain better decoding performance.
  • the second information processing method provided by the embodiment of the present application is introduced, through which the joint check matrix can be improved. Please refer to FIG. 7 , which is a flowchart of the method.
  • the second device determines a second matrix.
  • the embodiment of the present application considers that the joint check matrix can be improved by changing the identity matrix.
  • the second device obtains the joint parity check matrix according to the source coding matrix, the channel parity check matrix and the unit matrix, then in the embodiment of the present application, the second device can and the second matrix to obtain a joint parity check matrix to improve decoding performance.
  • the second device may obtain the joint check matrix according to the source coding matrix, the channel check matrix, and the second matrix, which is not specifically limited.
  • the channel check matrix may correspond to the channel generation matrix, for example, the channel check matrix and the channel generation matrix have a one-to-one correspondence.
  • H JSC joint check matrix
  • FIG. 8 shows how several matrices are concatenated to obtain H JSC , where P represents the second matrix, 0 represents the square matrix of 0, H CC represents the channel check matrix, and H SC represents the source coding matrix.
  • the second matrix may be a matrix obtained from an identity matrix.
  • the second matrix may also be referred to as a permutation matrix or the like.
  • the embodiment of the present application does not limit the symbol used to represent the second matrix, the name of the second matrix, and the like.
  • An optional way to obtain the second matrix according to the identity matrix is to process the identity matrix through a search algorithm to obtain the second matrix.
  • the search algorithm may include many kinds, such as simulated annealing algorithm, cuckoo algorithm or genetic algorithm and so on.
  • the identity matrix is processed through a search algorithm to obtain the second matrix.
  • a processing method may refer to FIG. 9 .
  • the maximum number of iterations may be specified by the algorithm itself, or set by itself.
  • a benchmark matrix or called an initial matrix, needs to be set, for example, a benchmark matrix is an identity matrix, or other matrices can also be used as the benchmark matrix.
  • one or more matrices to be screened can be obtained through some processing (such as random combination and/or mutation processing) based on the reference matrix. By testing one or more matrices to be screened, the decoding performance of the one or more matrices to be screened can be obtained.
  • Q matrices with better decoding performance can be selected from the one or more matrices to be screened, and these Q matrices are set as new reference matrices, Q is a positive integer.
  • the number of iterations can be increased by 1, or the number of iterations can be increased by 1 when the iteration is started. If the current number of iterations is equal to the maximum number of iterations, the iterative process ends, and Q matrices are output, and part or all of these Q matrices can be used as the second matrix. Or, if the current number of iterations is less than the maximum number of iterations, continue to execute the above iterative process.
  • the identity matrix can be subjected to simulated annealing algorithm processing to obtain the second matrix; for another example, if the source code length is longer, For example, if the source code length belongs to the long code length described in Table 1, the unit matrix can also be processed by simulated annealing algorithm to obtain the second matrix, or, the unit matrix can also be processed by simulated annealing algorithm first, and the obtained matrix can be temporarily It is called the third matrix, and the second matrix can be obtained according to the third matrix, and the source code length corresponding to the second matrix is greater than the source code length corresponding to the third matrix.
  • the permutation matrix corresponding to the short code length can be used to regenerate the permutation matrix corresponding to the long code length.
  • the permutation matrix corresponding to the short code length can also be called the basic permutation matrix
  • the permutation matrix corresponding to the long code length may also be called a derived permutation matrix.
  • the derived permutation matrix is generated according to the basic permutation matrix instead of directly generating the second matrix according to the simulated annealing algorithm, which can accelerate the generation of the second matrix and improve the generation efficiency of the second matrix.
  • the variable matrix PS is an identity matrix (expressed as I).
  • the current temperature is set as the initial temperature, and the initial temperature is denoted as T 0 .
  • Determine whether ⁇ 2 is smaller than ⁇ 1 , if ⁇ 2 is smaller than ⁇ 1 , accept matrix I 1 , let PS be matrix I 1 , and let ⁇ 1 ⁇ 2 .
  • the temperature drops, and if the dropped temperature T is less than or equal to the temperature threshold T th , then the output matrix PS is the second matrix (or the third matrix ) obtained at this time. ), and can also output performance gain ⁇ 1 - ⁇ 0 .
  • randomly shuffle some rows in the matrix I 1 to generate a new matrix, denoted as I 2 and continue to perform a similar judgment process.
  • the matrix outputted through FIG. 10 is, for example, a basic permutation matrix, and the basic permutation matrix is, for example, an S ⁇ S square matrix.
  • the number of iterations is pre-configured by the simulated annealing algorithm and can be greater than or equal to 1.
  • the first device receives a certain matrix with a certain probability, and there may be multiple ways of receiving it. For example, if the current temperature is high, the probability of acceptance is high, and if the current temperature is low, it indicates that the system is relatively stable, and you may not want to accept a matrix with a larger decoding threshold, because the larger the decoding threshold, the worse the performance may be. So if the current temperature is low, the probability of acceptance is small.
  • the acceptance probability is larger, and if the difference is larger, The probability of acceptance is small.
  • the specific acceptance probability can be specified by the simulated annealing algorithm.
  • the derived permutation matrix corresponding to the longer source code length can also be generated according to the basic permutation matrix corresponding to the shorter source code length.
  • the source code length corresponding to the derived permutation matrix is corresponding to the basic permutation matrix Take 2 times the length of the source code as an example.
  • the basic permutation matrix is, for example, a matrix obtained according to the process shown in FIG. 10 .
  • a 2S ⁇ 2S square matrix is assumed, denoted as P 2S
  • the basic permutation matrix is denoted as P S .
  • PS is obtained by executing the flow shown in FIG. 10 .
  • For the element in row 2i and column j of P 2S assign it the value of the element in row i and column j in PS , and for the element in row 2i+1 and column j+S of P 2S , Assign it as the value of the element in row i and column j in PS .
  • the source code length corresponding to the derived permutation matrix is k times the source code length corresponding to the basic permutation matrix, and this derived permutation matrix can be generated by repeatedly executing the process shown in FIG. 11 . That is to say, if the basic permutation matrix P S corresponding to the source code length m is obtained according to the identity matrix, the derived permutation matrix corresponding to the source code length 2 k m can be generated accordingly, for example, the derived permutation matrix is expressed as The basic permutation matrix is, for example, a matrix obtained according to the process shown in FIG. 10 .
  • FIG. 12 is the process of generating a derived permutation matrix according to the basic permutation matrix.
  • FIG. 12 takes an example in which the source code length corresponding to the derived permutation matrix is m times the source code length corresponding to the basic permutation matrix.
  • i is the number of repetitions.
  • P 0 the initial input basic permutation matrix
  • P S the basic permutation matrix
  • P i ' can be output. If i is smaller than m at this time, then continue to input P i ′ into the process shown in Figure 11 to perform similar processing; and if i is equal to m at this time, then output the obtained matrix, for example expressed as P m , at this time P m is The resulting derived permutation matrix.
  • the derived permutation matrix can be generated through the basic permutation matrix, then for the first device or the second device, it is sufficient to store the basic permutation matrix, and there is no need to store the derived permutation matrix. Helps save storage space.
  • the second matrix may be a matrix obtained according to the process shown in Figure 10, or a matrix obtained according to the process shown in Figure 11, or a matrix obtained according to the process shown in Figure 12 The matrix obtained by the process shown.
  • any permutation matrix in Table 4 may be used as the second matrix, or in the embodiment of the present application, other matrices other than the matrices shown in Table 4 may be used as the second matrix.
  • the permutation matrix involved in Table 4 can be a basic permutation matrix or a derived permutation matrix.
  • Z c represents the lifting size
  • Z c of each row in Table 4 represents the lifting size corresponding to the permutation matrix of the row.
  • the eight permutation matrices A 1 to A 8 involved in Table 4 are introduced as follows.
  • the permutation matrix given above is not a complete matrix, but only shows the position of the element which takes "1" in the permutation matrix.
  • the above values are used to sequentially represent rows in the permutation matrix, the first value represents row 0, the second value represents row 1, and so on.
  • the specific value above indicates the position of the element that takes "1" in the row corresponding to the value. Except for this position, the elements in other positions in the row are all 0.
  • the first value is 144, indicating that the value of the 144th element in row 0 of the permutation matrix A 8 is 1, and the values of other elements in row 0 are all 0;
  • the second value is 587, indicating that the value of the 587th element in the first row of the permutation matrix A 8 is 1, and the values of other elements in the first row are all 0;
  • the third value is 283, indicating that the value of the second element in the permutation matrix A 8 is The value of the 283rd element in the row is 1, and the other elements in the second row are all 0; and so on.
  • the understanding of the above permutation matrices A 1 -A 7 is also similar.
  • the connection matrix between the source code and the channel code is required to be a permutation matrix.
  • the number of permutation matrices is limited. Therefore, in the embodiment of the present application, a more reasonable permutation matrix can be searched out through the search algorithm to improve the connection between the source code and the channel code, which can effectively improve the performance of the dual LDPC system provided in the embodiment of the present application.
  • the source coding matrix is obtained from the channel coding matrix, there is a correlation between the source coding matrix and the channel parity check matrix.
  • a reasonable search algorithm to search and select a reasonable interleaving matrix (eg, the second matrix)
  • the correlation between the source coding matrix and the channel parity check matrix can also be effectively released.
  • the second device obtains a joint parity check matrix according to the second matrix.
  • the second device may obtain a joint check matrix according to the source coding matrix, the channel check matrix, and the second matrix.
  • For the joint check matrix refer to FIG. 8 .
  • the second device may perform decoding according to the joint check matrix.
  • the embodiment shown in Figure 7 and the embodiment shown in Figure 2 can be applied in combination, then the second device can decode the second information according to the joint check matrix, that is, the embodiment shown in Figure 7 can be used
  • the joint check matrix replaces the joint check matrix in the embodiment shown in FIG. 2 .
  • the embodiment shown in FIG. 7 and the embodiment shown in FIG. 2 can also be applied independently, then the information decoded by the second device according to the joint check matrix may be provided according to the embodiment shown in FIG. 2 method, or may also be obtained according to a traditional method (such as the existing double LDPC encoding method, etc.), which is not limited in this embodiment of the present application.
  • the second device may perform corresponding processing on the unit matrix to obtain a joint check matrix, and decoding by using the joint check matrix can effectively reduce a decoding threshold, thereby improving decoding performance.
  • Figure 13 is a performance comparison between the encoding and decoding method provided by the embodiment shown in Figure 2 and the existing dual LDPC system solution schematic diagram.
  • the information source entropy rate is 0.4 as an example.
  • the embodiment of the present application adopts dual LDPC with a code length of 880, and the decoding method is joint source and channel decoding; the existing dual LDPC system uses R4JA and AR4JA as the source code and channel code respectively. , the code length is 1024.
  • the solid curve in FIG. 13 represents the solution of the embodiment of the present application (referred to as 5G-based dual LDPC in FIG.
  • the dashed curve represents the solution of the existing dual LDPC system (referred to as traditional dual LDPC in FIG. 13 ).
  • the vertical axis represents the bit error rate, and the horizontal axis represents Among them, E b represents bit energy, and N 0 represents channel noise energy. if The larger the value of , the better the performance. It can be seen from FIG. 13 that the encoding and decoding scheme provided by the embodiment of the present application can bring about a performance gain of about 0.5 dB, and at the same time, problems such as error floors can also be suppressed.
  • FIG. 14 is a schematic diagram of a performance comparison between the encoding and decoding method provided by the embodiment shown in FIG. 2 and the existing separate encoding and decoding system solution.
  • the separate encoding and decoding system is a single LDPC system, the channel code uses LDPC, but the source code does not use LDPC.
  • the information source entropy rate is 0.4 as an example, and the embodiment shown in FIG. 2 is applied alone, and the embodiment shown in FIG. 2 and the embodiment shown in FIG. 7 are used as examples.
  • the embodiment of the present application adopts dual LDPC with a code length of 880, and the decoding method is joint source-channel decoding;
  • the existing separate encoding and decoding system adopts context-based adaptive binary arithmetic coding (context -based adaptive binary arithmetic coding (CABAC) and 5G NR LDPC are used as source code and channel code respectively, where the code length of 5G NR LDPC is 1024, and the input bit length of CABAC is 2 ⁇ 10 7 bits.
  • CABAC context -based adaptive binary arithmetic coding
  • 5G NR LDPC 5G NR LDPC
  • the curve at the top represents the existing separate codec system scheme (referred to as separate codec in Fig. 14);
  • the dotted curve in the middle represents the scheme of the embodiment shown in Fig.
  • the vertical axis represents the bit error rate
  • the horizontal axis represents As shown in Figure 14, if the joint parity check matrix is obtained according to the identity matrix, the technical solution of the embodiment of the present application brings a performance gain of about 0.8dB compared with the traditional encoding and decoding system; if according to the second matrix to obtain a joint parity check matrix, the technical solution of the embodiment of the present application brings about a performance gain of about 1 dB compared with the traditional encoding and decoding system. It can be seen that generating a permutation matrix (basic permutation matrix or derived permutation matrix, etc.) according to the identity matrix can effectively reduce the decoding threshold, thereby improving performance.
  • FIG. 15 shows a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • the communication device 1500 may also be called an information processing device 1500 .
  • the communication device 1500 may be the first device described in the embodiment shown in FIG. 2 or the embodiment shown in FIG. 7 or the circuit system of the first device, and is used to implement the method corresponding to the first device in the above method embodiment .
  • the communication device 1500 may be the second device or the circuit system of the second device described in the embodiment shown in FIG. 2 or the embodiment shown in FIG. Two device methods.
  • a circuit system is a chip system.
  • the communication device 1500 includes at least one processor 1501 .
  • the processor 1501 can be used for internal processing of the device to realize certain control processing functions.
  • processor 1501 includes instructions.
  • processor 1501 may store data.
  • different processors may be separate devices, may be located in different physical locations, and may be located on different integrated circuits.
  • different processors may be integrated within one or more processors, eg, on one or more integrated circuits.
  • the communication device 1500 includes one or more memories 1503 for storing instructions.
  • data may also be stored in the memory 1503 .
  • the processor and memory can be set separately or integrated together.
  • the communication device 1500 includes a communication line 1502 and at least one communication interface 1504 .
  • the communication line 1502 and the communication interface 1504 are all indicated by dotted lines in FIG. 15 .
  • the communication device 1500 may further include a transceiver and/or an antenna.
  • a transceiver may be used to send information to or receive information from other devices.
  • the transceiver may be referred to as a transceiver, a transceiver circuit, an input-output interface, etc., and is used to realize the transceiver function of the communication device 1500 through an antenna.
  • the transceiver includes a transmitter (transmitter) and a receiver (receiver).
  • the transmitter can be used to generate a radio frequency (radio frequency) signal from a baseband signal
  • the receiver can be used to convert the radio frequency signal into a baseband signal.
  • the processor 1501 may include a general-purpose central processing unit (central processing unit, CPU), a microprocessor, a specific application integrated circuit (application specific integrated circuit, ASIC), or one or more integrated circuits for controlling the program execution of the application program. circuit.
  • CPU central processing unit
  • ASIC application specific integrated circuit
  • Communication line 1502 may include a pathway for communicating information between the above-described components.
  • Communication interface 1504 using any device such as a transceiver, for communicating with other devices or communication networks, such as Ethernet, radio access network (radio access network, RAN), wireless local area networks (wireless local area networks, WLAN), Wired access network, etc.
  • radio access network radio access network
  • WLAN wireless local area networks
  • Wired access network etc.
  • the memory 1503 can be a read-only memory (read-only memory, ROM) or other types of static storage devices that can store static information and instructions, random access memory (random access memory, RAM) or other types that can store information and instructions It can also be an electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can be programmed by a computer Any other medium accessed, but not limited to.
  • the memory 1503 may exist independently, and is connected to the processor 1501 through the communication line 1502 . Alternatively, the memory 1503 may also be integrated with the processor 1501 .
  • the memory 1503 is used to store computer-executed instructions for implementing the solutions of the present application, and the execution is controlled by the processor 1501 .
  • the processor 1501 is configured to execute computer-executed instructions stored in the memory 1503, so as to implement the information processing method provided in the above-mentioned embodiments of the present application.
  • the computer-executed instructions in the embodiments of the present application may also be referred to as application program codes, which is not specifically limited in the embodiments of the present application.
  • the processor 1501 may include one or more CPUs, for example, CPU0 and CPU1 in FIG. 15 .
  • the communication device 1500 may include multiple processors, for example, the processor 1501 and the processor 1508 in FIG. 15 .
  • Each of these processors may be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor.
  • a processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (eg, computer program instructions).
  • the chip When the apparatus shown in FIG. 15 is a chip, such as a chip of an access network device, or a chip of a UPF, or a chip of an SMF, or a chip of a terminal device, the chip includes a processor 1501 (may also include a processor 1508 ), communication line 1502, memory 1503 and communication interface 1504.
  • the communication interface 1504 may be an input interface, a pin, or a circuit.
  • the memory 1503 may be a register, a cache, and the like.
  • the processor 1501 and the processor 1508 may be a general-purpose CPU, a microprocessor, an ASIC, or one or more integrated circuits for controlling program execution of the information processing method of any of the above embodiments.
  • the communication apparatus 1500 may be used to implement the method corresponding to the terminal device in the above embodiment of the application, and for specific functions, refer to the description in the above embodiment.
  • the communications apparatus 1500 includes a processor 1501, and the processor 1501 is configured to execute a computer program or an instruction, so that the method corresponding to the first device in the above application embodiment is executed.
  • the method corresponding to the first device in the above-mentioned application embodiment includes: determining the first source coding rate; determining the source coding matrix according to the first source coding rate and the channel coding basis matrix; A source sequence is input into the source encoding matrix to perform source encoding on the source sequence.
  • the communication apparatus 1500 may be used to implement the method corresponding to the second device in the above-mentioned application embodiment, and for specific functions, refer to the description in the above-mentioned embodiment.
  • the communication device 1500 includes a processor 1501, and the processor 1501 is configured to execute a computer program or an instruction, so that the method corresponding to the second device in the above application embodiment is executed.
  • the method corresponding to the second device in the above-mentioned application embodiment includes: obtaining a joint check matrix according to a second matrix, and the second matrix is a matrix obtained according to an identity matrix; The second information is decoded.
  • the method corresponding to the second device in the above application embodiment includes: determining the first source coding rate; determining the source coding matrix according to the first source coding rate; determining the source coding matrix according to the source coding rate The matrix decodes the received second information.
  • the embodiment of the present application may divide the device into functional modules according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module.
  • the above-mentioned integrated modules can be implemented in the form of hardware or in the form of software function modules.
  • FIG. 16 shows a schematic diagram of an apparatus.
  • the apparatus 1600 may be the access network device or terminal device involved in the above method embodiments, or an access network device A chip in a network access device or a chip in a terminal device.
  • the apparatus 1600 includes a sending unit 1601 , a processing unit 1602 and a receiving unit 1603 .
  • apparatus 1600 may be used to implement the steps performed by the access network device or the terminal device in the method of the embodiment of the present application, and related features may refer to the above embodiments, and details are not repeated here.
  • the functions/implementation process of the sending unit 1601, the receiving unit 1603, and the processing unit 1602 in FIG. 16 may be implemented by the processor 1501 in FIG. 15 invoking computer execution instructions stored in the memory 1503.
  • the function/implementation process of the processing unit 1602 in FIG. 16 can be implemented by calling the computer execution instructions stored in the memory 1503 by the processor 1501 in FIG. The process may be implemented through communication interface 1504 in FIG. 15 .
  • the functions/implementation process of the sending unit 1601 and the receiving unit 1603 may also be implemented through pins or circuits.
  • the present application also provides a computer-readable storage medium, where the computer-readable storage medium stores computer programs or instructions, and when the computer programs or instructions are executed, the above method embodiments performed by the access network device or the terminal device can be implemented. method of execution.
  • the functions described in the above embodiments can be realized in the form of software function units and sold or used as independent products.
  • the technical solution of the present application can be embodied in the form of a software product in essence or the part that contributes to it or the part of the technical solution.
  • the computer software product is stored in a storage medium, including several instructions for So that a computer device (which may be a personal computer, a server, or a network device, etc.) executes all or part of the steps of the methods described in the various embodiments of the present application.
  • the storage medium includes: U disk, mobile hard disk, ROM, RAM, magnetic disk or optical disk and other various media that can store program codes.
  • the present application also provides a computer program product, the computer program product including: computer program code, when the computer program code is run on the computer, the computer is made to execute any of the preceding method embodiments by the terminal device or the access network device The method executed.
  • An embodiment of the present application further provides a processing apparatus, including a processor and an interface; the processor is configured to execute the method performed by the terminal device or the access network device involved in any one of the above method embodiments.
  • all or part of them may be 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. 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 can be a general purpose computer, a special purpose computer, a computer network, 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 (eg, coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (eg, 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 (such as a floppy disk, a hard disk, or a magnetic tape), an optical medium (such as a DVD), or a semiconductor medium (such as a solid state disk (solid state disk, SSD)), etc.
  • the various illustrative logic units and circuits described in the embodiments of the present application can be programmed through general-purpose processors, digital signal processors (digital signal processors, DSPs), application specific integrated circuits (application specific integrated circuits, ASICs), field programmable A field-programmable gate array (FPGA), or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to implement or operate the described functions.
  • the general-purpose processor may be a microprocessor, and optionally, the general-purpose processor may also be any conventional processor, controller, microcontroller or state machine.
  • a processor may also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors combined with a digital signal processor core, or any other similar configuration to accomplish.
  • the steps of the method or algorithm described in the embodiments of the present application may be directly embedded in hardware, a software unit executed by a processor, or a combination of both.
  • the software unit may be stored in RAM, flash memory, ROM, erasable programmable read-only memory (EPROM), EEPROM, registers, hard disk, removable disk, CD-ROM or any other form in the art in the storage medium.
  • the storage medium can be connected to the processor, so that the processor can read information from the storage medium, and can write information to the storage medium.
  • the storage medium can also be integrated into the processor.
  • the processor and the storage medium can be set in the ASIC, and the ASIC can be set in the terminal device.
  • the processor and the storage medium may also be disposed in different components in the terminal device.
  • Embodiment 1 An information processing method, comprising:
  • Embodiment 2 The method according to embodiment 1, said method further comprising:
  • the entropy rate and the source code length of the source sequence determine the first source code rate from the first information, and the first information includes the source code rate, the source code length and the entropy rate correspondence, and the number of information source coding rates included in the first information is greater than 6.
  • Embodiment 3 According to the method described in embodiment 1 or 2, according to the method described in embodiment 1 or 2, according to the first source coding code rate and the channel coding base matrix, determine the source coding matrix, including:
  • Embodiment 4 According to the method described in embodiment 3, according to the method described in embodiment 3, according to the first source coding rate and the channel coding matrix, determine the source coding matrix, including:
  • Embodiment 5 According to the method described in embodiment 4, the row and/or column of the second channel coding base matrix is clipped, including:
  • N 1 is a positive integer less than or equal to the total number of rows of the second channel coding base matrix
  • N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix.
  • Embodiment 7 The method according to embodiment 5 or 6,
  • the N 2 column is the 13th column to the N 2 +12th column of the second channel coding base matrix
  • the N 2 columns are the 46-N 2 columns to the 45th columns of the second channel coding base matrix.
  • Embodiment 8 The method according to any one of embodiments 1 to 7, further comprising:
  • Embodiment 9 According to the method described in embodiment 8, channel coding is performed on the bits output by the source coding matrix through the first matrix, including:
  • Embodiment 10 An information processing method, comprising:
  • the second matrix is a matrix obtained according to an identity matrix
  • Embodiment 11 According to the method described in Embodiment 10, the second matrix is obtained by processing the identity matrix through a search algorithm.
  • Embodiment 12 The method according to embodiment 11, further comprising:
  • the second matrix is obtained according to the third matrix, where the source code length corresponding to the second matrix is greater than the source code length corresponding to the third matrix.
  • Embodiment 13 According to the method described in any one of embodiments 10 to 12, obtaining a joint check matrix according to the second matrix includes:
  • Embodiment 14 The method of embodiment 13, further comprising:
  • Embodiment 15 The method of embodiment 14, further comprising:
  • the entropy rate of the information source sequence and the information source code length determine the first information source coding code rate from the first information, and the first information includes the corresponding relationship between the information source coding code rate and the information source code length and the entropy rate , and the number of information source coding rates included in the first information is greater than 6.
  • determining the source coding matrix according to the first source coding rate includes:
  • Embodiment 17 According to the method described in Embodiment 16, according to the method described in Embodiment 16, according to the first source coding code rate and the channel coding base matrix, determining the source coding base matrix includes:
  • Embodiment 18 According to the method described in Embodiment 17, tailoring the rows and/or columns of the second channel coding base matrix includes:
  • N 1 is a positive integer less than or equal to the total number of rows of the second channel coding base matrix
  • N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix.
  • Embodiment 20 The method according to embodiment 18 or 19,
  • the N 2 column is the 13th column to the N 2 +12th column of the second channel coding base matrix
  • the N 2 columns are the 46-N 2 columns to the 45th columns of the second channel coding base matrix.
  • Embodiment 21 An information processing method, comprising:
  • Embodiment 22 The method of embodiment 21, further comprising:
  • the entropy rate of the information source sequence and the information source code length determine the first information source coding code rate from the first information, and the first information includes the corresponding relationship between the information source coding code rate and the information source code length and the entropy rate , and the number of information source coding rates included in the first information is greater than 6.
  • Embodiment 23 According to the method described in embodiment 21 or 22, according to the first information source code rate, determine the source coding matrix, including:
  • Embodiment 24 According to the method described in embodiment 23, according to the method described in embodiment 23, according to the first source coding code rate and the channel coding base matrix, determining the source coding base matrix includes:
  • Embodiment 25 According to the method described in Embodiment 24, tailoring the rows and/or columns of the second channel coding base matrix includes:
  • N 1 is a positive integer less than or equal to the total number of rows of the second channel coding base matrix
  • N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix.
  • Embodiment 27 The method according to embodiment 25 or 26,
  • the N 2 column is the 13th column to the N 2 +12th column of the second channel coding base matrix
  • the N 2 columns are the 46-N 2 columns to the 45th columns of the second channel coding base matrix.
  • Embodiment 28 According to the method described in any one of Embodiments 21 to 27, decoding the received second information according to the source coding matrix includes:
  • Embodiment 29 According to the method described in Embodiment 28, determining a joint check matrix according to the source coding matrix includes:
  • the joint check matrix is determined according to the information source coding matrix and a second matrix, and the second matrix is a matrix obtained according to an identity matrix.
  • Embodiment 30 The method according to embodiment 29, the second matrix is obtained by processing the identity matrix through a search algorithm.
  • Embodiment 31 The method of embodiment 29, further comprising:
  • the second matrix is obtained according to the third matrix, where the source code length corresponding to the second matrix is greater than the source code length corresponding to the third matrix.
  • Embodiment 32 An information processing device, comprising:
  • a processing unit configured to determine a coding rate of the first information source
  • the processing unit is further configured to determine a source coding matrix according to the first source coding rate and a channel coding base matrix;
  • the processing unit is further configured to input a source sequence into the source coding matrix, so as to perform source coding on the source sequence.
  • Embodiment 33 The device according to Embodiment 32, the processing unit is further configured to determine the first information source encoding code rate from the first information according to the entropy rate of the information source sequence and the information source code length , the first information includes a correspondence between source coding rates, source code lengths, and entropy rates, and the number of source coding rates included in the first information is greater than six.
  • Embodiment 34 The device according to embodiment 33 or 34, the processing unit is configured to determine the source coding matrix according to the first source coding rate and the channel coding base matrix in the following manner:
  • Embodiment 35 The device according to Embodiment 34, the processing unit is configured to determine the source coding matrix according to the first source coding rate and the channel coding matrix in the following manner:
  • Embodiment 36 The device according to Embodiment 35, the processing unit is configured to tailor the rows and/or columns of the second channel coding base matrix in the following manner:
  • N 1 is a positive integer less than or equal to the total number of rows of the second channel coding base matrix
  • N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix.
  • Embodiment 38 The device of embodiment 36 or 37,
  • the N 2 column is the 13th column to the N 2 +12th column of the second channel coding base matrix
  • the N 2 columns are the 46-N 2 columns to the 45th columns of the second channel coding base matrix.
  • Embodiment 39 The device according to any one of Embodiments 32 to 38, the processing unit is further configured to perform channel coding on the bits output by the source coding matrix through the first matrix, wherein the signal The output dimension of the source encoding matrix is equal to the input dimension of the first matrix.
  • Embodiment 40 The device according to embodiment 39, the processing unit is configured to perform channel coding on the bits output by the source coding matrix through the first matrix in the following manner:
  • Embodiment 41 The device according to any one of embodiments 32-40, further comprising a transceiver unit configured to send second information, where the second information is information obtained through channel coding.
  • Embodiment 42 An information processing device comprising:
  • a processing unit configured to obtain a joint check matrix according to a second matrix, the second matrix being a matrix obtained according to an identity matrix;
  • the processing unit is further configured to decode the received second information according to the joint check matrix.
  • Embodiment 43 The apparatus of embodiment 42, further comprising a transceiving unit configured to receive the second information.
  • Embodiment 44 The device according to Embodiment 42 or 43, wherein the second matrix is obtained by processing the identity matrix through a search algorithm.
  • Embodiment 45 The device of embodiment 44, the processing unit further configured to:
  • the second matrix is obtained according to the third matrix, where the source code length corresponding to the second matrix is greater than the source code length corresponding to the third matrix.
  • Embodiment 46 The device according to any one of Embodiments 42 to 45, the processing unit is configured to obtain a joint parity check matrix according to the second matrix in the following manner:
  • Embodiment 47 The device of embodiment 46, the processing unit further configured to:
  • Embodiment 48 The device according to Embodiment 47, the processing unit is further configured to determine the first information source coding rate from the first information according to the entropy rate of the information source sequence and the information source code length, the The first information includes the correspondence between source coding rates, source code lengths, and entropy rates, and the number of source coding rates included in the first information is greater than six.
  • Embodiment 49 According to the device described in Embodiment 47 or 48, the processing unit is configured to determine the source coding matrix according to the first source coding rate in the following manner:
  • Embodiment 50 The device according to Embodiment 49, the processing unit is configured to determine the source coding matrix according to the first source coding rate and the channel coding matrix in the following manner:
  • Embodiment 51 The device according to Embodiment 50, the processing unit is configured to tailor the rows and/or columns of the second channel coding base matrix in the following manner:
  • N 1 is a positive integer less than or equal to the total number of rows of the second channel coding base matrix
  • N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix.
  • Embodiment 53 The device of embodiment 51 or 52,
  • the N 2 column is the 13th column to the N 2 +12th column of the second channel coding base matrix
  • the N 2 columns are the 46-N 2 columns to the 45th columns of the second channel coding base matrix.
  • Embodiment 54 An information processing device comprising:
  • a processing unit configured to determine a coding rate of the first information source
  • the processing unit is further configured to determine a source coding matrix according to the first source coding rate
  • the processing unit is further configured to decode the received second information according to the source coding matrix.
  • Embodiment 55 The apparatus of embodiment 54, further comprising a transceiving unit for receiving the second information.
  • Embodiment 56 The device according to Embodiment 54 or 55, the processing unit is further configured to determine the first information source coding rate from the first information according to the entropy rate of the information source sequence and the information source code length , the first information includes a correspondence between source coding rates, source code lengths, and entropy rates, and the number of source coding rates included in the first information is greater than six.
  • Embodiment 57 According to the method according to any one of embodiments 54-56, the processing unit is configured to determine the source coding matrix according to the first source coding rate in the following manner:
  • Embodiment 58 the processing unit is configured to determine the source coding base matrix according to the first source coding code rate and the channel coding base matrix in the following manner:
  • Embodiment 59 The device according to Embodiment 58, the processing unit is configured to tailor the rows and/or columns of the second channel coding base matrix in the following manner:
  • N 1 is a positive integer less than or equal to the total number of rows of the second channel coding base matrix
  • N 2 is a positive integer less than or equal to the total number of columns of the second channel coding base matrix.
  • Embodiment 61 The device of embodiment 59 or 60,
  • the N 2 column is the 13th column to the N 2 +12th column of the second channel coding base matrix
  • the N 2 columns are the 46-N 2 columns to the 45th columns of the second channel coding base matrix.
  • Embodiment 62 The device according to any one of embodiments 54-61, the processing unit is configured to decode the received second information according to the source coding matrix in the following manner:
  • Embodiment 63 The device according to Embodiment 62, the processing unit is configured to determine a joint check matrix according to the source coding matrix in the following manner:
  • the joint check matrix is determined according to the information source coding matrix and a second matrix, and the second matrix is a matrix obtained according to an identity matrix.
  • Embodiment 64 The device according to embodiment 63, the second matrix is obtained by processing the identity matrix through a search algorithm.
  • Embodiment 65 The apparatus of embodiment 63, the processing unit further configured to:
  • the second matrix is obtained according to the third matrix, where the source code length corresponding to the second matrix is greater than the source code length corresponding to the third matrix.
  • Embodiment 66 An apparatus comprising means for performing the method described in any embodiment of the present application.
  • Embodiment 67 A computer program product, the computer program product comprising a computer program, when the computer program is run on a computer, the computer is made to perform the method according to any one of embodiments 1-9, Or make the computer execute the method described in any one of Embodiments 10-20, or make the computer execute the method described in any one of Embodiments 21-31.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Quality & Reliability (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Pure & Applied Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Algebra (AREA)
  • Computing Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

本申请涉及一种信息处理方法及设备。第一设备确定第一信源编码码率。第一设备根据第一信源编码码率以及信道编码基矩阵确定信源编码矩阵。第一设备将信源序列输入信源编码矩阵，以对信源序列进行信源编码。本申请实施例中，可以根据信道编码基矩阵确定信源编码矩阵，相当于根据信道编码的信息确定了信源编码的信息，实现了信源信道联合编码。通过信源信道联合编码，可以使得信源编码的输出比特数与信道编码的输入比特数相匹配，从而使得本申请实施例的技术方案能够适配于5G NR系统。

Description

一种信息处理方法及设备
相关申请的交叉引用
本申请要求在2021年11月23日提交中国国家知识产权局、申请号为202111395441.2、申请名称为“一种通信方法、UE及网络设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中；本申请要求在2022年01月14日提交中国国家知识产权局、申请号为202210045064.8、申请名称为“一种信息处理方法及设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种信息处理方法及设备。
背景技术
目前，研究者提出使用两个低密度奇偶校验码(low density parity check code，LDPC)分别进行信源编码和信道编码，在接收端使用联合译码器来译码，这种方法被称为双LDPC(double LDPC，D-LDPC)的联合信源信道编译码方案，这种方案相比于独立的信源信道编译码方法能够获得更优的误码率性能。
后来，又有研究者提出了一种双LDPC码的码率自适应分配方案。该方案中，研究人员分别使用R4JA和AR3A作为信源码和信道码。但是这种方案可以支持的信源编码码率数量受限，难以集成到第五代移动通信技术(the 5th generation，5G)新空口(new radio，NR)现有的LDPC信道编码方案中。
发明内容
本申请实施例提供一种信息处理方法及设备，用于提供一种能够适配于5G NR系统的编解码方案。
第一方面，提供第一种信息处理方法，该方法可由终端设备执行，或由包括终端设备的更大设备执行，或由芯片系统或其他功能模块执行，该芯片系统或功能模块能够实现终端设备的功能，该芯片系统或功能模块例如设置在终端设备中。或者，该方法可由接入网设备执行，或由包括接入网设备功能的其他设备执行，或由芯片系统或其他功能模块执行，该芯片系统或功能模块能够实现接入网设备的功能，该芯片系统或功能模块例如设置在接入网设备中。接入网设备例如为基站。该方法包括：确定第一信源编码码率；根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵；将信源序列输入所述信源编码矩阵，以对所述信源序列进行信源编码。
本申请实施例中，可以根据信道编码基矩阵确定信源编码矩阵，相当于根据信道编码的信息确定了信源编码的信息，实现了信源信道联合编码。通过信源信道联合编码，可以使得信源编码的输出比特数与信道编码的输入比特数相匹配，从而使得本申请实施例的技术方案能够适配于5G NR系统。
结合第一方面，在第一方面的第一种可选的实施方式中，所述方法还包括：根据所述 信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。本申请实施例提供的第一信息包括的信源编码码率的数量较多，例如第一信息包括的信源编码码率的数量大于6，因此第一信息提供的信源编码码率粒度更细，第一设备在选择信源编码码率时灵活性较高，能够根据信源序列的熵率和信源码长选择到较为合适的信源编码码率，提高了码率选择的灵活性和准确性。
结合第一方面或第一方面的第一种可选的实施方式，在第一方面的第二种可选的实施方式中，根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵，包括：根据所述第一信源编码码率以及所述信道编码基矩阵，确定信源编码基矩阵；根据所述信源编码基矩阵，确定所述信源编码矩阵。可以先确定信源编码基矩阵，再根据信源编码基矩阵确定信源编码矩阵。
结合第一方面的第二种可选的实施方式，在第一方面的第三种可选的实施方式中，根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵，包括：确定所述第一信源编码码率对应的提升系数所属的集合编号；确定所述集合编号所对应的第一信道编码基矩阵；将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。这只是得到信源编码基矩阵的一种方式，信源编码基矩阵还可能通过其他方式得到。例如，在得到第一信道编码基矩阵后，也可以不对其进行转置，而是对第一信道编码基矩阵的行和/或列进行裁剪，以得到信源编码基矩阵；或者，在得到第一信道编码基矩阵后，先对第一信道编码基矩阵的行和/或列进行裁剪，再进行转置，以得到信源编码基矩阵；或者，还可能通过其他方式得到信源编码基矩阵，较为灵活。
结合第一方面的第三种可选的实施方式，在第一方面的第四种可选的实施方式中，对所述第二信道编码基矩阵的行和/或列进行裁剪，包括：保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。这种方式对于性能的提升较为有效。
结合第一方面的第四种可选的实施方式，在第一方面的第五种可选的实施方式中，N 1＝22。或者，N 1也可能是其他取值。当N 1＝22时性能较优。
结合第一方面的第四种可选的实施方式或第一方面的第五种可选的实施方式，在第一方面的第六种可选的实施方式中，如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。在这种列裁剪方式下，性能较优。
结合第一方面或第一方面的第一种可选的实施方式至第一方面的第六种可选的实施方式中的任一种可选的实施方式，在第一方面的第七种可选的实施方式中，所述方法还包括：通过第一矩阵，对所述信源编码矩阵输出的比特进行信道编码，其中，所述信源编码矩阵的输出维度与所述第一矩阵的输入维度相等。第一矩阵例如也称为信道生成矩阵等，可用于信道编码过程。信源编码矩阵的输出维度与第一矩阵的输入维度相等，这就使得本申请实施例提供的技术方案能够应用于5G系统。
结合第一方面的第七种可选的实施方式，在第一方面的第八种可选的实施方式中，通过第一矩阵，对所述信源编码矩阵输出的比特进行信道编码，包括：通过第二矩阵打乱所 述信源编码矩阵输出的比特；通过所述第一矩阵对打乱后的比特进行信道编码。第二矩阵例如为单位矩阵，或者也可能是根据单位矩阵所得到的矩阵等。
第二方面，提供第二种信息处理方法。该方法可由终端设备执行，或由包括终端设备的更大设备执行，或由芯片系统或其他功能模块执行，该芯片系统或功能模块能够实现终端设备的功能，该芯片系统或功能模块例如设置在终端设备中。或者，该方法可由接入网设备执行，或由包括接入网设备功能的其他设备执行，或由芯片系统或其他功能模块执行，该芯片系统或功能模块能够实现接入网设备的功能，该芯片系统或功能模块例如设置在接入网设备中。接入网设备例如为基站。该方法包括：根据第二矩阵获得联合校验矩阵，所述第二矩阵是根据单位矩阵得到的矩阵；根据所述联合校验矩阵对接收的第二信息进行译码。
关于第二方面的技术效果，可参考对于第一方面或相应的实施方式的技术效果的介绍。
第三方面，提供第三种信息处理方法。该方法可由终端设备执行，或由包括终端设备的更大设备执行，或由芯片系统或其他功能模块执行，该芯片系统或功能模块能够实现终端设备的功能，该芯片系统或功能模块例如设置在终端设备中。或者，该方法可由接入网设备执行，或由包括接入网设备功能的其他设备执行，或由芯片系统或其他功能模块执行，该芯片系统或功能模块能够实现接入网设备的功能，该芯片系统或功能模块例如设置在接入网设备中。接入网设备例如为基站。该方法包括：确定第一信源编码码率；根据所述第一信源编码码率，确定信源编码矩阵；根据所述信源编码矩阵对接收的第二信息进行译码。
关于第三方面的技术效果，可参考对于第一方面或相应的实施方式的技术效果的介绍。
第四方面，提供一种通信装置。所述通信装置可以为用于执行上述第一方面所述的方法的设备。所述通信装置具备用于执行上述第一方面的方法的设备的功能。所述通信装置例如为终端设备，或为终端设备中的功能模块，例如基带装置或芯片系统等。或者，所述通信装置例如为接入网设备，或为接入网设备中的功能模块，例如基带装置或芯片系统等。一种可选的实现方式中，所述通信装置包括基带装置和射频装置。另一种可选的实现方式中，所述通信装置包括处理单元(有时也称为处理模块)和收发单元(有时也称为收发模块)。收发单元能够实现发送功能和接收功能，在收发单元实现发送功能时，可称为发送单元(有时也称为发送模块)，在收发单元实现接收功能时，可称为接收单元(有时也称为接收模块)。发送单元和接收单元可以是同一个功能模块，该功能模块称为收发单元，该功能模块能实现发送功能和接收功能；或者，发送单元和接收单元可以是不同的功能模块，收发单元是对这些功能模块的统称。
在一种可选的实现方式中，所述通信装置还包括存储单元，所述处理单元用于与所述存储单元耦合，并执行所述存储单元中的程序或指令，使能所述通信装置执行上述第一方面所述的方法。
第五方面，提供一种通信装置。所述通信装置可以为用于执行上述第二方面所述的方法的设备。所述通信装置具备用于执行上述第二方面的方法的设备的功能。所述通信装置例如为终端设备，或为终端设备中的功能模块，例如基带装置或芯片系统等。或者，所述通信装置例如为接入网设备，或为接入网设备中的功能模块，例如基带装置或芯片系统等。一种可选的实现方式中，所述通信装置包括基带装置和射频装置。另一种可选的实现方式中，所述通信装置包括处理单元(有时也称为处理模块)和收发单元(有时也称为收发模块)。关于收发单元的实现方式可参考第四方面的相关介绍。
在一种可选的实现方式中，所述通信装置还包括存储单元，所述处理单元用于与所述存储单元耦合，并执行所述存储单元中的程序或指令，使能所述通信装置执行上述第二方面所述的方法。
第六方面，提供一种通信装置。所述通信装置可以为用于执行上述第四方面所述的方法的设备。所述通信装置具备用于执行上述第三方面的方法的设备的功能。所述通信装置例如为终端设备，或为终端设备中的功能模块，例如基带装置或芯片系统等。或者，所述通信装置例如为接入网设备，或为接入网设备中的功能模块，例如基带装置或芯片系统等。一种可选的实现方式中，所述通信装置包括基带装置和射频装置。另一种可选的实现方式中，所述通信装置包括处理单元(有时也称为处理模块)和收发单元(有时也称为收发模块)。关于收发单元的实现方式可参考第四方面的相关介绍。
在一种可选的实现方式中，所述通信装置还包括存储单元，所述处理单元用于与所述存储单元耦合，并执行所述存储单元中的程序或指令，使能所述通信装置执行上述第三方面所述的方法。
第七方面，提供一种计算机可读存储介质，所述计算机可读存储介质用于存储计算机程序或指令，当其被运行时，使得上述各方面中终端设备或接入网设备所执行的方法被实现。
第八方面，提供一种包含指令的计算机程序产品，当其在计算机上运行时，使得上述各方面所述的方法被实现。
第九方面，提供一种装置，包含用于执行本申请任一实施例所述方法的一个或多个单元。
第十方面，提供一种通信系统，包含第四方面所述的通信装置以及第五方面所述的通信装置。
第十一方面，提供一种通信系统，包含第四方面所述的通信装置以及第六方面所述的通信装置。
附图说明
图1为本申请实施例的一种应用场景示意图；
图2为本申请实施例提供的第一种信息处理方法的流程图；
图3A为本申请实施例中第一设备确定第一信道编码基矩阵的一种流程图；
图3B为本申请实施例中第一设备从第二信道编码基矩阵中选择前N 1行的流程图；
图3C～图3H为本申请实施例中第一值不同时的几种性能示意图；
图3I为本申请实施例中第一设备裁剪第四信道编码基矩阵的列数的一种流程图；
图4为本申请实施例中重复-交织过程的流程图；
图5A为本申请实施例中校验节点与变量节点之间的连接关系的一种示意图；
图5B和图5C为本申请实施例中校验节点与变量节点之间传送LLR的两种示意图；
图6为本申请实施例中联合信源信道译码过程的一种示意图；
图7为本申请实施例提供的第二种信息处理方法的流程图；
图8为本申请实施例中联合校验矩阵的一种结构示意图；
图9为本申请实施例中通过搜索算法得到第二矩阵的一种流程图；
图10～图12为本申请实施例中生成置换矩阵的几种方式的流程图；
图13～图14为本申请实施例与传统方案之间的性能比较示意图；
图15为本申请实施例提供的一种装置的示意图；
图16为本申请实施例提供的又一种装置的示意图。
具体实施方式
为了使本申请实施例的目的、技术方案和优点更加清楚，下面将结合附图对本申请实施例作进一步地详细描述。
以下，对本申请实施例中的部分用语或概念进行解释说明，以便于本领域技术人员理解。
本申请实施例中，终端设备是一种具有无线收发功能的设备，可以是固定设备，移动设备、手持设备(例如手机)、穿戴设备、车载设备，或内置于上述设备中的无线装置(例如，通信模块，调制解调器，或芯片系统等)。所述终端设备用于连接人，物，机器等，可广泛用于各种场景，例如包括但不限于以下场景：蜂窝通信、设备到设备通信(device-to-device，D2D)、车到一切(vehicle to everything，V2X)、机器到机器/机器类通信(machine-to-machine/machine-type communications，M2M/MTC)、物联网(internet of things，IoT)、虚拟现实(virtual reality，VR)、增强现实(augmented reality，AR)、工业控制(industrial control)、无人驾驶(self driving)、远程医疗(remote medical)、智能电网(smart grid)、智能家具、智能办公、智能穿戴、智能交通，智慧城市(smart city)、无人机、机器人等场景的终端设备。所述终端设备有时可称为用户设备(user equipment，UE)、终端、接入站、UE站、远方站、无线通信设备、或用户装置等等。为描述方便，本申请实施例中将终端设备以UE为例进行说明。
本申请实施例中的网络设备，例如可以包括接入网设备，和/或核心网设备。所述接入网设备为具有无线收发功能的设备，用于与所述终端设备进行通信。所述接入网设备包括但不限于基站(基站收发信站点(base transceiver station，BTS)，Node B,eNodeB/eNB，或gNodeB/gNB)、收发点(transmission reception point，TRP)，第三代合作伙伴计划(3rd generation partnership project，3GPP)后续演进的基站，无线保真(wireless fidelity，Wi-Fi)系统中的接入节点，无线中继节点，无线回传节点等。所述基站可以是：宏基站，微基站，微微基站，小站，中继站等。多个基站可以支持同一种接入技术的网络，也可以支持不同接入技术的网络。基站可以包含一个或多个共站或非共站的传输接收点。所述接入网设备还可以是云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器、集中单元(centralized unit，CU)，和/或分布单元(distributed unit，DU)。所述接入网设备还可以是服务器等。例如，车到一切(vehicle to everything，V2X)技术中的网络设备可以为路侧单元(road side unit，RSU)。以下对接入网设备以为基站为例进行说明。基站可以与终端设备进行通信，也可以通过中继站与终端设备进行通信。终端设备可以与不同接入技术中的多个基站进行通信。所述核心网设备用于实现移动管理，数据处理，会话管理，策略和计费等功能。不同接入技术的系统中实现核心网功能的设备名称可以不同，本申请实施例并不对此进行限定。以5G系统为例，所述核心网设备包括：访问和移动管理功能(access and mobility management function，AMF)、会话管理功能(session management function，SMF)、策略控制功能(policy control function，PCF)或用户面功能(user plane function，UPF)等。
本申请实施例中，用于实现网络设备功能的通信装置可以是网络设备，也可以是能够支持网络设备实现该功能的装置，例如芯片系统，该装置可以被安装在网络设备中。在本申请实施例提供的技术方案中，以用于实现网络设备的功能的装置是网络设备为例，描述本申请实施例提供的技术方案。
本申请实施例中，对于名词的数目，除非特别说明，表示“单数名词或复数名词”，即"一个或多个”。“至少一个”是指一个或者多个，“多个”是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B的情况，其中A,B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。例如，A/B，表示：A或B。“以下至少一项(个)”或其类似表达，是指的这些项中的任意组合，包括单项(个)或复数项(个)的任意组合。例如，a,b,或c中的至少一项(个)，表示：a,b,c,a和b,a和c,b和c,或a和b和c，其中a,b,c可以是单个，也可以是多个。
本申请实施例提及“第一”、“第二”等序数词是用于对多个对象进行区分，不用于限定多个对象的大小、内容、顺序、时序、优先级或者重要程度等。例如，第一信息和第二信息，可以是同一个信息，也可以是不同的信息，且，这种名称也并不是表示这两个信息的内容、应用场景、优先级或者重要程度等的不同。另外，本申请所介绍的各个实施例中对于步骤的编号，只是为了区分不同的步骤，并不用于限定步骤之间的先后顺序。例如，S201可以发生在S202之前，或者可能发生在S202之后，或者也可能与S202同时发生。
本申请实施例可以根据信道编码基矩阵确定信源编码矩阵，相当于根据信道编码的信息确定了信源编码的信息，实现了信源信道联合编码。通过信源信道联合编码，可以使得信源编码的输出比特数与信道编码的输入比特数相匹配，从而使得本申请实施例的技术方案能够适配于5G NR系统。
本申请实施例提供的技术方案可以应用于第四代移动通信技术(the 4th generation，4G)系统中，例如长期演进(long term evolution，LTE)系统，或可以应用于5G系统中，例如新无线(new radio，NR)系统，或者还可以应用于下一代移动通信系统或其他类似的通信系统，具体的不做限制。另外本申请实施例提供的技术方案可以应用于设备到设备(device-to-device，D2D)场景，例如NR-D2D场景等，或者可以应用于车到一切(vehicle to everything，V2X)场景，例如NR-V2X场景等。例如可应用于车联网，例如V2X、车与车(vehicle-to-vehicle，V2V)等，或可用于智能驾驶、辅助驾驶、或智能网联车等领域。如果应用于D2D场景，则通信双方可以均为UE；如果应用于非D2D场景，则通信的一方可以是UE，另一方是网络设备(例如接入网设备或核心网设备)，或者通信双方可能均为网络设备。或者，通信双方中的任意一方或两方也可能是除了网络设备和终端设备外的其他类型的电子设备。在下文的介绍过程中，以通信双方分别是第一设备和第二设备为例，第一设备例如为终端设备、网络设备或其他类型的电子设备，第二设备例如为终端设备、网络设备或其他类型的电子设备。
图1示出了本申请实施例提供的一种通信网络架构，后续提供的各个实施例均可适用于该架构。第一设备与第二设备能够进行通信，例如第一设备为数据的发送端，第二设备为数据的接收端。第一设备在发送数据时可对数据进行信源编码和信道编码等操作，第二设备在从第一设备接收数据后可对数据执行联合信源信道译码等操作。
为了更好地介绍本申请实施例，下面结合附图介绍本申请实施例所提供的方法。在本 申请的各个实施例对应的附图中，凡是可选的步骤均用虚线表示。
本申请实施例提供第一种信息处理方法，请参见图2，为该方法的流程图。该方法可应用于图1所示的网络架构，例如该方法所涉及的第一设备即为图1中的第一设备，该方法所涉及的第二设备即为图1中的第二设备。
S201、第一设备确定第一信源编码码率。
可选的，第一设备可根据信源序列的相应特性，确定该信源序列的信源编码码率，即，确定第一信源编码码率。信源序列是第一设备待发送的原始数据，第一设备需要对信源序列进行信源编码以及信道编码等处理，之后再将处理后的信源序列发送给第二设备。例如信源序列表示为c 0,c 1,……,c N-1，N表示该信源序列的长度，用于表示该信源序列的字符的下标为从0至(N-1)的整数，顺次增加1。其中N为正整数。
可选的，信源序列的特性例如包括信源序列的熵率和信源码长(本申请实施例也将信源码长简称为码长)，那么第一设备可根据信源序列的熵率以及码长确定第一信源编码码率。本申请实施例也可将信源编码码率简称为码率，以及将信源序列的熵率称为信源熵率，或简称为熵率。
第一设备获得信源序列后，可以评估信源序列的熵率，例如信源序列的熵率表示为H。另外第一设备还能确定信源序列的码长，例如该信源序列的码长与N有关。例如，第一设备在得到信源序列的熵率以及码长后，通过查询第一信息可确定第一信源编码码率。可选的，第一信息包括信源编码码率与熵率之间的对应关系，或者，第一信息包括信源编码码率与信源码长之间的对应关系，或者，第一信息包括信源编码码率、信源码长以及熵率之间的对应关系；考虑到信源码长与提升系数(lifting size)之间具有对应关系，因此，第一信息也可以包括信源编码码率、lifting size以及熵率之间的对应关系；或者，第一信息也可以包括信源编码码率、信源码长、lifting size以及熵率之间的对应关系。在得到信源序列的熵率和码长后，第一设备就可以从第一信息中确定该信源序列的信源编码码率，即，确定第一信源编码码率。例如第一信息包括信源编码码率、信源码长以及熵率之间的对应关系，或者第一信息包括信源编码码率、信源码长、lifting size以及熵率之间的对应关系，则在得到信源序列的熵率和码长后，第一设备可直接从第一信息中确定第一信源编码码率；或者，第一信息包括信源编码码率、lifting size以及熵率之间的对应关系，在得到信源序列的熵率和码长后，第一设备可根据该信源序列的码长确定lifting size，再根据第一信息就可确定第一信源编码码率。
第一信息例如以表格的形式呈现，或者也可能以其他形式呈现。以第一信息以表格形式呈现为例，请参考表1，为第一信息的一种示例。
表1
Figure PCTCN2022127004-appb-000001
Figure PCTCN2022127004-appb-000002
表1中的一行视为一项，第一信息可以仅包括表1中的一项或多项；或者，第一信息包括表1中的一项或多项，以及除此之外还包括其他项；或者，第一信息并不包括表1中的所有项，而是包括其他项。根据表1可见，本申请实施例提供的第一信息包括的信源编码码率的数量较多，例如第一信息为表1，则第一信息包括的信源编码码率的数量大于6，因此第一信息提供的信源编码码率粒度更细，第一设备在选择信源编码码率时灵活性较高，能够根据信源序列的熵率和信源码长选择到较为合适的信源编码码率，提高了码率选择的灵活性和准确性。
表1中，Z c表示lifting size，R sc表示码率。如果lifting size大于或等于40且小于160，则对应的码长视为短码长；如果lifting size大于或等于160，则对应的码长视为长码长。例如，第一设备确定熵率H小于或等于0.3469，且信源码长为短码长，或者，确定熵率H小于或等于0.3469，且lifting size大于或等于40且小于160，则根据表1可以确定对应的码率为22/46。
第一设备要处理信源序列，例如一种处理方式为，通过信源编码矩阵对信源序列进行处理，该处理过程视为对信源序列的编码和压缩过程。信源编码矩阵输出的比特可以作为信道编码过程的输入比特，第一设备再对信源编码矩阵输出的比特进行信道编码等处理。而采用LDPC作为信源码，信源编码矩阵对信源序列所执行的压缩是一种有损压缩。经测试，信源码率、信源码长或信源熵率的不同，会影响作为信源码的LDPC的错误平层(error floor)的高度。总结而言，在信源码率和信源码长一定时，信源熵率越高，错误平层越严重；在信源熵率和信源码长一定时，信源码率越高，错误平层越严重；在信源熵率和信源码率一定时，信源码长的增长可以缓解错误平层。为了信源编码的有效性，本申请实施例提出，在信源熵率一定时，在错误平层现象在可接受的范围内的前提下，使得信源码率尽可能高，以尽可能减少编码资源的浪费。例如，信源码率与信源熵率越接近，则信源压缩编码的有效性更高，编码资源的浪费也更少。可参考表1，在短码长的情况下，熵率H为0.3508时，对应的码长为22/45，22/45约等于0.48，与0.3508的差距较小，可以认为二者较为接近。可见，本申请实施例提供的第一信息可以使得信源压缩编码的有效性更高。
得到表1的方式有多种，例如一种方式为，信道编码的码率固定，在此基础上，给定一个信源编码码率和lifting size，可得到对应的信源编码矩阵。将该信源编码矩阵应用于本申请实施例提供的联合信源-信道编译码系统中，在特定的信源熵率下仿真得到该信源编码矩阵在不同的信噪比下的误比特率(bit error rate，BER)，并评估其错误平层。如果错误平层较低，则在可接受的范围内尝试提高信源熵率，以确定该信源编码矩阵是否能够处理更高熵率的信源序列。经过多次类似处理后，将不同的信源码长以及信源码率对应的信源编码矩阵所能处理的最高熵率进行综合，就可以得到表1。
还有可能，第一设备并不会执行确定第一信源编码码率的过程，而是直接应用第一信源编码码率，因此S201是可选的步骤。
S202、第一设备根据信道编码基矩阵确定信源编码矩阵。
例如，第一设备可以先根据信道编码基矩阵确定信源编码基矩阵，再根据信源编码基矩阵确定信源编码矩阵。下面对这两个步骤分别介绍。
S2021、第一设备根据信道编码基矩阵确定信源编码基矩阵。
信道编码基矩阵是与信道编码过程相关的信息，相当于第一设备根据信道编码信息确定信源编码信息，由此使得信道编码过程与信源编码过程相匹配，使得本申请实施例的技术方案能够适配于5G NR系统。
可选的，第一设备在确定信源编码矩阵时除了参考信道编码基矩阵外，还可参考第一信源编码码率，也就是说，第一设备可根据第一信源编码码率和信道编码基矩阵确定信源编码矩阵。那么相应的，第一设备根据信道编码基矩阵确定信源编码基矩阵，一种实现方式可以是，第一设备根据第一信源编码码率和信道编码基矩阵确定信源编码基矩阵。第一设备根据第一信源编码码率和信道编码基矩阵确定信源编码基矩阵，例如一种确定过程为，第一设备对第一信道编码基矩阵进行处理，以得到信源编码基矩阵。处理方式例如包括转置和/或裁剪等，且如果处理方式包括转置和裁剪，则不限制转置和裁剪这两个步骤之间的顺序。在这种确定过程中用到了第一信道编码基矩阵，那么可选的，该确定过程还可包括第一设备获得第一信道编码基矩阵的步骤。第一设备要获得第一信道编码基矩阵，一种获取方式例如为，第一设备确定第一信源编码码率对应的lifting size所属的集合编号，再确定该集合编号对应的矩阵，该矩阵就可作为第一信道编码基矩阵。第一信道编码基矩阵可表示为H cc_BG。例如，第一设备可查询第三信息，从第三信息中确定第一信源编码码率对应的lifting size所属的集合编号。第一设备再查询第四信息，从第四信息中确定该集合编号对应的矩阵，该矩阵就可作为第一信道编码基矩阵H cc_BG。
可选的，第三信息例如以表格形式呈现。例如第三信息可包括如下表2中的一项或多项，其中，表2中的一行视为一项。
表2
集号(i LS) lifting size(Z c)
0 {2,4,8,16,32,64,128,256}
1 {3,6,12,24,48,96,192,384}
2 {5,10,20,40,80,160,320}
3 {7,14,28,56,112,224}
4 {9,18,36,72,144,288}
5 {11,22,44,88,176,352}
6 {13,26,52,104,208}
7 {15,30,60,120,240}
例如第一信源编码码率对应的lifting size为2，那么根据表2可以确定该lifting size所属的集号为0。
或者，第三信息还可能以其他形式呈现，或者即使第三信息以表格形式呈现，也可能是其他表格而不是表2。
可选的，第四信息例如以表格形式呈现。例如第四信息可包括如下表3中的一项或多项，其中，表3中的一行视为一项。
表3
Figure PCTCN2022127004-appb-000003
Figure PCTCN2022127004-appb-000004
Figure PCTCN2022127004-appb-000005
或者，第四信息还可能以其他形式呈现，或者即使第四信息以表格形式呈现，也可能是其他表格而不是表3。
可参考图3A，为第一设备根据表2和表3确定第一信道编码基矩阵的流程图。例如，第一设备从表2中查询第一信源编码码率对应的lifting size所属的集合编号，例如将该lifting size表示为Z c，将该集合编号表示为i LS。第一设备再根据表3，确定i LS对应的矩阵，该矩阵就可作为第一信道编码基矩阵H cc_BG。对于H cc_BG中的各个元素，可能有一些元素在表3中已被定义，而还有一些元素在表3中可能未被定义。如果H cc_BG中的某个元素已在表3中定义，则该元素的取值为V i,j，即，[H cc_BG] i,j＝V i,j，[H cc_BG] i,j表示H cc_BG中第i行第j列的元素。其中，V i,j也已定义在表3中。或者，如果H cc_BG中的某个元素未在表3中定义，则该元素的取值为-1，即，[H cc_BG] i,j＝-1。H cc_BG的赋值过程就是得到第一信道编码基矩阵的过程，在对H cc_BG赋值结束后，第一设备就得到了第一信道编码基矩阵。
在前文介绍了，第一设备确定第一信道编码基矩阵后，可对第一信道编码基矩阵进行转置和/或裁剪等处理，以得到信源编码基矩阵。第一设备对第一信道编码基矩阵进行转置和/或裁剪等处理，可能包括几种情况。例如情况1为，第一设备先对第一信道编码基矩阵进行转置处理，将得到的矩阵称为第二信道编码基矩阵；第一设备再对第二信道编码基矩阵进行裁剪处理(例如，对第二信道编码基矩阵的行和/或列进行裁剪)，得到信源编码基矩阵。又例如，情况2为，第一设备先对第一信道编码基矩阵进行裁剪处理(例如，对第一信道编码基矩阵的行和/或列进行裁剪)，将得到的矩阵称为第三信道编码基矩阵；第一设备再对第三信道编码基矩阵进行转置处理，得到信源编码基矩阵。又例如，情况3为，第一设备对第一信道编码基矩阵进行裁剪处理(例如，对第一信道编码基矩阵的行和/或列进行裁剪)，得到信源编码基矩阵，在这种情况下，无需转置处理，能够简化处理过程。下面分别对这几种情况举例介绍。
1、情况1。即，第一设备先对第一信道编码基矩阵进行转置处理，得到第二信道编码 基矩阵；第一设备再对第二信道编码基矩阵进行裁剪处理(例如，对第二信道编码基矩阵的行和/或列进行裁剪)，得到信源编码基矩阵。
第一设备先确定第一信道编码基矩阵，在确定第一信道编码基矩阵后，第一设备对第一信道编码基矩阵进行转置处理，得到第二信道编码基矩阵，例如第二信道编码基矩阵表示为H sc1_BG，H sc1_BG例如为68行46列的矩阵。
接着，第一设备对第二信道编码基矩阵的行和/或列进行裁剪，得到信源编码基矩阵。
第一设备对第二信道编码基矩阵的行进行裁剪，是指第一设备从第二信道编码基矩阵中选择部分行。第一设备对第二信道编码基矩阵的列进行裁剪，是指第一设备从第二信道编码基矩阵中选择部分列。第一设备可以只对第二信道编码基矩阵的行进行裁剪，而列数保持不变；或者，第一设备也可以只对第二信道编码基矩阵的列进行裁剪，而行数保持不变；或者，第一设备对第二信道编码基矩阵的行和列均进行裁剪。具体如何裁剪，可根据实际编译码系统的性能或根据本申请实施例与5G NR系统的适配性等因素来确定。下面以第一设备对第二信道编码基矩阵的行和列均进行裁剪为例来介绍。
第二信道编码基矩阵包括的行数较多，而本申请实施例所提供的技术方案希望能够应用于5G NR系统。5G NR系统中，信道编码过程的输入比特数较少，因此第一设备可以对第二信道编码基矩阵进行行选择，即，选择第二信道编码基矩阵中的部分行，使得第二信道编码基矩阵的剩余行数能够与5G NR系统中信道编码过程的输入比特数相匹配。可选的，可以使得第二信道编码基矩阵的剩余行数能够与5G NR系统中信道编码过程的输入比特数相等。例如5G NR系统中信道编码过程的输入比特数为22，那么本申请实施例中，第一设备可以从第二信道编码基矩阵中选出22行，使得本申请实施例中，信源编码过程的输出比特数与信道编码过程的输入比特数相等，从而使得本申请实施例能够应用于5G NR系统。如果5G NR系统中信道编码过程的输入比特数发生变化，例如变更为除了22之外的其他取值，那么第二信道编码基矩阵的剩余行数也可相应改变。
例如第一设备要从第二信道编码基矩阵中选出N 1行，N 1为小于或等于第二信道编码基矩阵的总行数的正整数。N 1例如根据信道编码过程的输入比特数确定，例如N 1为22，或者也可以是其他取值，只要N 1能够与信道编码过程的输入比特数匹配即可。一种选择N 1行的方式例如为，第一设备可以选择第二信道编码基矩阵的前N 1行，例如第二信道编码基矩阵的第0行至第N 1-1行，这种选择方式可以使得选择得到的矩阵具有较好的性能。除此之外，第一设备还可以通过其他方式选择N 1行，例如第一设备可以选择第二信道编码基矩阵中的后N 1行，或者第一设备也可以随机从第二信道编码基矩阵中选择N 1行等。第一设备从第二信道编码基矩阵中选择N 1行，这N 1行可以构成一个矩阵，例如称为第四信道编码基矩阵，第四信道编码基矩阵例如表示为H sc2_BG。例如第二信道编码基矩阵为68行46列的矩阵，则第四信道编码基矩阵例如为N 1行46列的矩阵。例如参考图3B，为第一设备从第二信道编码基矩阵中选择前N 1行的流程，且图3B以N 1＝22为例。第一设备将第二信道编码基矩阵H sc1_BG的前22行赋给H sc2_BG，就得到了第四信道编码基矩阵。
其中，如果第一设备只需对第二信道编码基矩阵的行进行裁剪，无需对列进行裁剪，则H sc2_BG就是得到的信源编码基矩阵。如果第一设备需要对第二信道编码基矩阵的行和列都裁剪，则可继续执行下述步骤。
第一设备可以确定需要保留的列数，例如第一设备根据第一信源编码码率可以确定需要保留的列数。采用N 2表示需要保留的列数，N 2为小于或等于第二信道编码基矩阵的总列 数的正整数。例如R sc表示第一信源编码码率，则根据第一信源编码码率确定N 2的一种可选的方式为，
Figure PCTCN2022127004-appb-000006
在5G的LDPC编码中，信道编码基矩阵的列数一般为46，因此可选的，N 2可以小于或等于46。另一方面，由于信源码率小于1，如果N 2过小，可能会导致信源编码的压缩能力过低，失去实际的应用意义，因此N 2可以大于22。那么可选的，本申请实施例中，N 2为大于22且小于或等于46的整数，或者，考虑到提高信源编码的压缩能力，可以令N 2为大于或等于27且小于或等于46的整数。或者，N 2还可以是其他取值。
如果第一设备已对第二信道编码基矩阵的行进行了裁剪，则第一设备在裁剪列时，是对第四信道编码基矩阵进行裁剪，则N 3表示第四信道编码基矩阵的行数，即，N 3＝N 1；或者，如果第一设备并未对第二信道编码基矩阵的行进行裁剪，例如第一设备无需裁剪行数，或者第一设备先裁剪列数再裁剪行数，那么第一设备在裁剪列时，是对第二信道编码基矩阵进行裁剪，则N 3表示第二信道编码基矩阵的行数。
以第一设备裁剪第二信道编码基矩阵中的列数为例。可选的，如果N 2小于或等于第一值，则N 2列为第二信道编码基矩阵的第13列至第N 2+12列；或者，如果N 2大于第一值，则N 2列为第二信道编码基矩阵的第46-N 2列至第45列。第一值的选取可能会对双LDPC系统的性能产生影响，可选的，第一值为大于或等于27且小于或等于46的整数，例如第一值为33，或者也可以是其他取值。经过测试，第一值为33时，本申请实施例提供的双LDPC系统的性能较好；第一值为34、35、36、或37时，本申请实施例提供的双LDPC系统的性能相较于第一值为33时稍差；当第一值大于37时，本申请实施例提供的双LDPC系统的性能可能较差。而第一值不宜取得过小，例如当第一值小于33时，第一值可能只是在较高的信源码率下才能发挥作用。请参考图3C～图3H，为采用不同的第一值时，本申请实施例提供的双LDPC系统的性能示意图。图3C包括三种线条，实线对应的第一值为33，粒度较为稀疏的虚线对应的第一值为34，粒度较为稠密的虚线对应的第一值为35。图3D包括三种线条，实线对应的第一值为33，粒度较为稀疏的虚线对应的第一值为36，粒度较为稠密的虚线对应的第一值为37。图3E包括三种线条，实线对应的第一值为33，粒度较为稀疏的虚线对应的第一值为38，粒度较为稠密的虚线对应的第一值为39。图3F包括三种线条，实线对应的第一值为33，粒度较为稀疏的虚线对应的第一值为40，粒度较为稠密的虚线对应的第一值为41。图3G包括三种线条，实线对应的第一值为33，粒度较为稀疏的虚线对应的第一值为42，粒度较为稠密的虚线对应的第一值为43。图3H包括四种线条，实线对应的第一值为33，粒度较为稀疏的虚线对应的第一值为44，粒度较为稠密的虚线对应的第一值为45，点状虚线对应的第一值为46。根据图3C～图3H可见，当第一值为33时，本申请实施例提供的双LDPC系统的性能较优。
按照这种方式选择N 2列，可以使得选择的N 2列构成的矩阵性能较好。或者，第一设备也可以采用其他方式裁剪第二信道编码基矩阵中的列数，例如第一设备也可以选择第二信道编码基矩阵前N 2列或后N 2列，或者第一设备也可以从第二信道编码基矩阵中随机选择N 2列等。如果第一设备是裁剪第四信道编码基矩阵，则裁剪方式也是类似的。第一设备裁剪第二信道编码基矩阵的列数或第四信道编码基矩阵的列数后得到的矩阵可称为第五信道编码基矩阵，第五信道编码基矩阵可表示为H sc3_BG。请参考图3I，为第一设备裁剪第四信道编码基矩阵的列数的流程，图3I以第一值等于33为例。根据图3I可知，第一设备在确 定N 2后，如果N 2>33，则第一设备将第四信道编码基矩阵H sc2_BG的第46-N 2列至第45列赋给H sc3_BG，如果N 2≤33，则第一设备将第四信道编码基矩阵H sc2_BG的第13列至第N 2+12列赋给H sc3_BG。
如果第一设备只需对第二信道编码基矩阵的列进行裁剪，无需对行进行裁剪，或者，第一设备需要裁剪行和列，且先裁剪行后裁剪列，则H sc3_BG就是得到的信源编码基矩阵。或者，如果第一设备需要对第二信道编码基矩阵的行和列都裁剪，且先裁剪列后裁剪行，则在得到H sc3_BG后，可以再对H sc3_BG的行数进行裁剪，裁剪后得到的矩阵可作为信源编码基矩阵。
例如第二信道编码基矩阵为68行46列的矩阵，第一设备裁剪了第二信道编码基矩阵的行数，得到的第四信道编码基矩阵是N 1行46列的矩阵，之后第一设备又裁剪了第四信道编码基矩阵的列数，得到的信源编码基矩阵就是N 1行N 2列的矩阵。例如将信源编码基矩阵表示为H sc_BG。
2、情况2。即，第一设备先对第一信道编码基矩阵进行裁剪处理(例如，对第一信道编码基矩阵的行和/或列进行裁剪)，得到第三信道编码基矩阵；第一设备再对第三信道编码基矩阵进行转置处理，得到信源编码基矩阵。
第一设备首先得到第一信道编码基矩阵，之后对第一信道编码基矩阵的行和/或列进行裁剪，得到第三信道编码基矩阵。
第一设备对第一信道编码基矩阵的行和/或列进行裁剪，可参考前文情况1中对于第一设备裁剪第二信道编码基矩阵的内容的介绍。与之不同的是，在情况2中，第一设备在裁剪第一信道编码基矩阵的行时，可参考情况1中对于第一设备裁剪第二信道编码基矩阵的列的方式；第一设备在裁剪第一信道编码基矩阵的列时，可参考情况1中对于第一设备裁剪第二信道编码基矩阵的行的方式。例如在情况2中，第一设备如果对第一信道编码基矩阵的行进行裁剪，则是要从第一信道编码基矩阵中选出N 2行，选择方式可参考情况1中关于选择N 2列的介绍；第一设备如果对第一信道编码基矩阵的列进行裁剪，则是要从第一信道编码基矩阵中选出N 1列，选择方式可参考情况1中关于选择N 1行的介绍。
第一设备对第一信道编码基矩阵的行和/或列裁剪后，就得到了第三信道编码基矩阵。第一设备再对第三信道编码基矩阵进行转置，就得到了信源编码基矩阵。例如第一设备对第一信道编码基矩阵的行和列都进行了裁剪，则第三信道编码基矩阵是N 2行N 1列的矩阵，信源编码基矩阵就是N 1行N 2列的矩阵。例如将信源编码基矩阵表示为H sc_BG。
3、情况3。即，第一设备对第一信道编码基矩阵进行裁剪处理(例如，对第一信道编码基矩阵的行和/或列进行裁剪)，得到信源编码基矩阵。
第一设备对第一信道编码基矩阵的行和/或列进行裁剪，可参考前文情况1中对于第一设备裁剪第二信道编码基矩阵的内容的介绍。与情况1类似的，情况3中，第一设备如果对第一信道编码基矩阵的行进行裁剪，则是要从第一信道编码基矩阵中选出N 1行，选择方式可参考情况1中关于选择N 1行的介绍；第一设备如果对第一信道编码基矩阵的列进行裁剪，则是要从第一信道编码基矩阵中选出N 2列，选择方式可参考情况1中关于选择N 2列的介绍。第一设备对第一信道编码基矩阵的行和/或列裁剪后，就得到了信源编码基矩阵。例如第一设备对第一信道编码基矩阵的行和列都进行了裁剪，则信源编码基矩阵是N 1行N 2列的矩阵。例如将信源编码基矩阵表示为H sc_BG。
除了如上三种情况外，第一设备还可以通过其他方式得到信源编码基矩阵，本申请实 施例不做限制。
可见，本申请实施例中第一设备是根据信道编码基矩阵确定信源编码基矩阵，由此实现了信源信道联合编码，也使得信源编码过程的输出比特数与信道编码过程的输入比特数能够相匹配，使得本申请实施例提供的技术方案能够适配5G NR系统。
S2022、第一设备根据信源编码基矩阵确定信源编码矩阵。
例如，第一设备可根据信源编码基矩阵进行重复-交织操作，以得到信源编码矩阵。其中，重复-交织，指的是根据信源编码基矩阵生成信源编码矩阵的过程。
例如将信源编码矩阵表示为H sc。重复—交织的过程，就是用维度为N 1行N 2列的信源编码基矩阵H sc_BG，生成维度为(N 1×Z c)行(N 2×Z c)列的信源编码矩阵H sc的过程。其中，Z c表示第一信源编码码率对应的lifting size。例如，将信源编码基矩阵H sc_BG的每一个元素与信源编码矩阵H sc中每一个大小为Z c×Z c的方阵对应起来，如果信源编码基矩阵H sc_BG中的某元素的取值为-1，则信源编码矩阵H sc中与该元素对应的方阵就是0方阵；如果信源编码基矩阵H sc_BG中的某个元素的取值为非负整数v，则信源编码矩阵H sc中与该元素的对应方阵，就是将单位矩阵进行循环右移位v次后所得到的方阵。可参考图4，为重复-交织过程的流程图，图4以N 1＝22为例。
根据图4可知，假设H sc_BG初始时(22×Z c)行(N 2×Z c)列的0矩阵，后续开始对该0矩阵赋值。对于22行N 2列的信源编码基矩阵H sc_BG，可以确定其中的第i行第k列的元素的取值是否为-1，其中[H sc_BG] i,k表示H sc_BG中第i行第k列的元素。如果该元素的取值为-1，则将列数加1。如果列数加1后小于N 2，则继续确定第i行第k+1列的元素的取值是否为-1；如果列数加1后等于N 2，确定行数是否小于21，如果行数小于21，则将行数加1，并继续确定第i+1行第k+1列的元素的取值是否为-1；如果行数等于21，则流程结束。另外，如果[H sc_BG] i,k不等于-1，例如等于v，则将[H sc_BG] i,k在信源编码矩阵H sc中对应的方阵所对应的单位阵的第0行进行循环右移，共循环右移v次，完毕后再将该单位阵的第1行循环右移v次，以此类推，直到将该单位阵的最后一行循环右移v次为止。在将该单位阵的最后一行循环右移v次后，将k加1，如果k加1后小于N 2，则继续确定第i行第k+1列的元素的取值是否为-1；如果k加1后等于N 2，确定当前的行数是否小于21，如果当前的行数小于21，则将行数加1，并继续确定第i+1行第k+1列的元素的取值是否为-1；如果当前的行数等于21，则流程结束。
S203、第一设备将信源序列输入信源编码矩阵，以对信源序列进行信源编码。
例如信源序列为c 0,c 1,……,c N-1，经过信源编码矩阵对其进行编码压缩后，信源编码矩阵输出的比特表示为d 0,d 1,……,d S-1。其中，信源编码矩阵的输入比特数N可以等于N 2×Z c，S表示信源编码矩阵输出的比特数，也是信源编码矩阵的行数，或者说是信源编码矩阵的高度，例如S＝N 1×Z c。通过信源编码矩阵对信源序列进行处理，该过程可表示为[d 0,d 1,……,d S-1] T＝H SC[c 0,c 1,……,c N-1] T，其中T表示转置。
信源编码矩阵输出的比特，还可以作为信道编码过程的输入比特，即，第一设备还要对信源编码矩阵输出的比特进行信道编码。例如，第一设备可将信源编码矩阵输出的比特输入第一矩阵，第一矩阵对这些比特进行处理的过程，也就是对这些比特进行信道编码的过程。第一矩阵例如又可称为信道生成矩阵，或者称为信道编码矩阵，或者还可能有其他名称。其中，第一矩阵例如根据信道编码基矩阵(例如第一信道编码基矩阵)和信道编码过程对应的lifting size确定。可选的，在进行信道编码时，信道编码过程所对应的lifting size 与信源编码过程对应的lifting size(即，第一信源编码码率对应的lifting size)可以相同。另外，本申请实施例中信源编码矩阵是根据信道编码基矩阵得到的，因此，信源编码矩阵的输出维度与信道生成矩阵的输入维度可以相等，这样就使得本申请实施例的技术方案能够应用于5G NR系统。
可选的，第一设备可将信源编码矩阵输出的比特直接作为信道编码过程的输入比特；或者，第一设备可根据第二矩阵将信源编码矩阵输出的比特进行处理，再将处理后的比特作为信道编码过程的输入比特。例如第一设备根据第二矩阵打乱信源编码矩阵输出的比特，再将打乱后的比特作为信道编码过程的输入比特。关于第一设备获得第二矩阵的方式，将在图7的实施例中介绍。图7的实施例虽然介绍的是第二设备获得第二矩阵的方式，而第一设备和第二设备获得第二矩阵的方式可以相同。
例如将信道编码过程输出的信息称为第二信息。
S204、第一设备发送第二信息。相应的，第二设备从第一设备接收第二信息。
第一设备得到第二信息后，可以向第二设备发送第二信息。可选的，第一设备还可以对第二信息进行加扰、星座映射等处理，之后再发送第二信息，本申请实施例对此不做限制。
另外可选的，第一设备除了向第二设备发送第二信息外，还可以向第二设备发送辅助信息以帮助第二设备对第二信息进行译码。例如，辅助信息包括第一信源编码码率、第二信息对应的信道编码码率(即，第一设备的信源序列对应的信道编码码率)、或lifting size中的一项或多项。例如辅助信息包括第一信源编码码率，可选的，第一设备可以通过物理层的控制信息、或者媒体接入控制(media access control，MAC)控制元素(control element，CE)、或无线资源控制(radio resource control，RRC)信令等方式向第二设备发送第一信源编码码率。
例如辅助信息包括第一信源编码码率，第一设备和第二设备都预先存储了不同的信源编码码率对应的信源编码矩阵，和/或，存储了不同信道编码码率对应的信道生成矩阵(也可称为信道编码矩阵等，本申请实施例也将其称为第一矩阵)。第一设备向第二设备发送数据时，可以在调度该数据的控制信息中指示信源编码码率和/或信道编码码率相关的信息，第二设备根据该控制信息确定第一设备所采用的信源编码矩阵和/或信道生成矩阵，进一步可以获得联合校验矩阵。
或者，协议可能会定义根据信源编码码率生成信源编码矩阵和/或信道生成矩阵的流程，第二设备根据第一设备指示的信源编码码率相关的信息(例如指示第一信源编码码率)，根据生成流程可获得第一设备所采用的信源编码矩阵和/或信道生成矩阵。
或者，第一设备也可以将信源编码矩阵、信道生成矩阵或者联合校验矩阵中的一种或多种发送给第二设备，但这种方式需要的开销较大。
S205、第二设备对第二信息进行译码，以得到信源序列。在理想情况下，第二设备得到的信源序列与第一设备处理的信源序列应该是相同的序列。
例如，第二设备对第二信息进行联合信源信道译码，下面简单介绍译码过程。
当第二信息到达第二设备时，由于受到干扰，第二设备需要先判断接收的信息是0还是1，或者说，需要判断接收的信息有多少概率是0(P0)，有多少概率是1(P1)。
Figure PCTCN2022127004-appb-000007
公式1中，对数似然比(log-likelihood ratio，LLR)就是用接收的信息是0的概率除 以接收的信息是1的概率，再对得到的结果取对数所得到的值。可选的，本申请实施例中，对于信源变量节点来说，可将初始LLR设置为：
Figure PCTCN2022127004-appb-000008
公式2中，P1例如为信源先验信息。
联合信源信道译码的过程通常包含多次迭代，每次迭代都更新LLR。一次迭代包括两个子过程：校验节点的LLR更新，以及变量节点的LLR更新。在校验节点的LLR更新的子过程中需要明确的是，一个校验节点连接了哪些变量节点；在变量节点的LLR更新的子过程中需要明确的是，一个变量节点连接了哪些校验节点。而校验节点与变量节点之间的这种需要明确的连接关系，可以根据联合校验矩阵确定。
联合校验矩阵的元素包括“0”和“1”这两种取值，在该矩阵中，一般来说“0”比较多，而“1”比较少。如果联合校验矩阵中的某个元素的取值为“1”，就表示该元素所在的行所代表的校验节点与该元素所在的列所代表的变量节点之间有连接。可参考图5A，为校验节点与变量节点之间的连接关系示意图。其中，校验节点可包括信源校验节点和信道校验节点，变量节点可包括信源变量节点和信道变量节点。图5A左半部分所示的三个方框形状的节点表示三个信源校验节点，左半部分所示的四个圆形的节点表示四个信源变量节点，右半部分所示的三个方框形状的节点表示三个信道校验节点，右半部分所示的四个圆形的节点表示四个信道变量节点。图5A中的实线表示信源校验节点与信源变量节点之间的连接，或表示信道校验节点与信道变量节点之间的连接；虚线表示信道编码过程的节点与信源编码过程的节点之间的连接。下面简单介绍联合信源信道译码的迭代过程。
当第一次迭代开始时，变量节点将当前的LLR传送给校验节点。可参考图5B，其中的虚线箭头表示LLR的传输路径。另外，图5B左半部分所示的三个方框形状的节点表示信源校验节点1～3，左半部分所示的四个圆形的节点表示信源变量节点1～4，右半部分所示的三个方框形状的节点表示信道校验节点4～6，右半部分所示的四个圆形的节点表示信道变量节点5～8。为了简便起见，图5B只画出了与信源校验节点2有关的LLR传送过程。可以看到，信源变量节点2、信源变量节点3以及信道变量节点6，都会将各自的LLR传送给信源校验节点2(图5B中的箭头表示LLR传送)。例如信源变量节点2传送给信源校验节点2的LLR称为LLR 1，信源变量节点3传送给信源校验节点2的LLR称为LLR 2，信道变量节点6传送给信源校验节点2的LLR称为LLR 3。
校验节点从变量节点接收LLR后，会根据所接收的LLR计算得到新的LLR，并将新的LLR再返回给变量节点。继续以信源校验节点2接收了来自变量节点的LLR为例，例如，信源校验节点2可以根据来自信源变量节点2的LLR 1和来自信源变量节点3的LLR 2计算得到一个新的LLR，例如称为LLR 4，信源校验节点2可将LLR 4传送给信道变量节点6；信源校验节点2可以根据来自信源变量节点2的LLR 1和来自信道变量节点6的LLR 3计算得到一个新的LLR，例如称为LLR 5，信源校验节点2可将LLR 5传送给信源变量节点3；信源校验节点2可以根据来自信源变量节点3的LLR 2和来自信道变量节点6的LLR 3计算得到一个新的LLR，例如称为LLR 6，信源校验节点2可将LLR 6传送给信源变量节点2。或者，信源校验节点2可以根据来自信源变量节点2的LLR 1、来自信源变量节点3的LLR 2和来自信道变量节点6的LLR 3计算得到一个新的LLR，例如称为LLR 8，信源校验节点2从LLR 8中减去LLR 3的影响，可得到LLR 9，信源校验节点2可将LLR 9传送给信道变量节点6；信源校验节点2从LLR 8中减去LLR 2的影响，可得 到LLR 10，信源校验节点2可将LLR 10传送给信源变量节点3；信源校验节点2从LLR 8中减去LLR 1的影响，可得到LLR 11，信源校验节点2可将LLR 11传送给信源变量节点2。即，校验节点i传送给变量节点j的LLR中，不包括变量节点j之前传送给校验节点i的LLR的信息。对于校验节点向变量节点传送LLR的过程可参考图5C，图5C中的箭头表示LLR传送。另外，图5C左半部分所示的三个方框形状的节点表示信源校验节点1～3，左半部分所示的四个圆形的节点表示信源变量节点1～4，右半部分所示的三个方框形状的节点表示信道校验节点4～6，右半部分所示的四个圆形的节点表示信道变量节点5～8。
对于一个变量节点来说，可能从一个或多个校验节点接收新的LLR，该变量节点根据所接收的LLR以及来自信道的LLR(或者根据所接收的LLR以及先验信息)等信息，可得到一个LLR，该LLR可参与后续迭代过程。该变量节点根据所接收的LLR以及来自信道的LLR(或者根据所接收的LLR以及先验信息)等信息得到一个LLR，例如一种方式为，该变量节点将所接收的LLR以及来自信道的LLR(或者先验信息)等加起来，就得到了新的LLR。
在后续的迭代过程中，变量节点传输给校验节点的LLR会有稍许不同。例如在后续迭代过程中，信源变量节点2需要向信源校验节点2传送LLR，则信源变量节点2所传送的LLR，是信源变量节点2在上一轮迭代结束后得到的LLR与信源变量节点2在上一轮中传送给信源校验节点2的LLR之间的差值。例如，信源变量节点2在上一轮中传送给信源校验节点2的LLR为LLR 1，信源变量节点2在上一轮迭代结束后得到的LLR，也就是信源变量节点2根据在上一轮迭代过程中所接收的LLR 6以及来自信道的LLR(或者根据所接收的LLR以及先验信息)等信息得到的LLR，例如称为LLR 7，则信源变量节点2本轮迭代过程中传送给信源校验节点2的LLR就是LLR 7减去LLR 6的取值。
多次迭代结束后，第二设备就完成了对第二信息的联合信源信道译码。
可再参考图6，为联合信源信道译码过程的示意图。图6中，指向“+”的虚线箭头表示迭代过程中变量节点向校验节点传送信息(例如传送LLR)，指向“+”的实线箭头表示迭代过程中校验节点向变量节点传送信息(例如传送LLR)。图6中的“+”表示加法操作，图6中的特殊箭头(即，中间有间断的箭头)表示相减的关系，箭头中间的“-”表示减号。
图6中，信源译码器接收信源先验信息，信源校验节点的信息会到达信源变量节点(通过图6中信源译码器最左侧的第一个“+”和最上方的“+”到达)。第二设备可通过所接收的无线电信号的幅度得到信道LLR，该信道LLR可输入信道译码器。在信道译码器中，信道变量节点可接收来自信道校验节点的信息，以及，也可以接收来自信源校验节点的信息。
图6中，指向“+”的虚线箭头所对应的“+”以及“-”，表示求差值的操作，其中的“-”指的是算术减法操作。以上文为例，在上文介绍了，在后续迭代过程中，信源变量节点2需要向信源校验节点2传送LLR，则信源变量节点2所传送的LLR，是信源变量节点2在上一轮迭代结束后得到的LLR与信源变量节点2在上一轮中传送给信源校验节点2的LLR之间的差值，图6中指向“+”的虚线箭头所对应的“-”，指的就是该求两个LLR之间的差值的操作。
图6中，指向“+”的实线箭头所对应的“-”，并不是指算术减法操作。继续以上文为例，在上文介绍信源校验节点向变量节点发送LLR的过程，且上文以信源校验节点2为例。例如，信源校验节点2可以根据来自信源变量节点2的LLR 1、来自信源变量节点3的LLR  2和来自信道变量节点6的LLR 3计算得到一个新的LLR，例如称为LLR 8，信源校验节点2从LLR 8中减去LLR 3的影响，可得到LLR 9，信源校验节点2可将LLR 9传送给信道变量节点6，而图6中指向“+”的实线箭头所对应的“-”，指的就是这里所述的，信源校验节点从计算的LLR中减去某个LLR的影响的操作。
其中，第一设备得到第二信息后并不一定会发送，因此S204和S205为可选的步骤。
本申请实施例中，第一设备可以根据信源序列的熵率和信源码长从第一信息中确定第一信源编码码率，第一信息包括的信源编码码率的数量较多，在选择时灵活性较高，能够根据信源序列的熵率和信源码长选择到较为合适的信源编码码率，提高了码率选择的灵活性和准确性。且第一设备可以根据信道编码基矩阵确定信源编码矩阵，相当于根据信道编码的信息确定了信源编码的信息，实现了信源信道联合编码。通过信源信道联合编码，可以使得信源编码的输出比特数与信道编码的输入比特数相匹配，从而使得本申请实施例的技术方案能够适配于5G NR系统。
根据图2所示的实施例可知，第二设备在对第二信息进行译码的过程中，需要用到联合校验矩阵。在图2所示的实施例中，第二设备可以根据辅助信息确定信源编码矩阵，再根据信源编码矩阵、信道校验矩阵以及单位矩阵获得联合校验矩阵。基于此，本申请实施例提出，可以对联合校验矩阵进行改进，以获得更好的译码性能。接下来介绍本申请实施例提供的第二种信息处理方法，通过该方法可改进联合校验矩阵。请参考图7，为该方法的流程图。
S701、第二设备确定第二矩阵。本申请实施例认为，可通过改变单位矩阵的方式来改进联合校验矩阵。例如在图2所示的实施例中，第二设备是根据信源编码矩阵、信道校验矩阵以及单位矩阵获得联合校验矩阵，那么本申请实施例中，第二设备可根据信源编码矩阵以及第二矩阵来获得联合校验矩阵，以提高译码性能。可选的，本申请实施例中，第二设备可根据信源编码矩阵、信道校验矩阵以及第二矩阵来获得联合校验矩阵，具体不做限制。可选的，信道校验矩阵与信道生成矩阵可以相对应，例如信道校验矩阵与信道生成矩阵是一一对应的关系。
例如将联合校验矩阵表示为H JSC，则H JSC的实现方式可参考图8。图8表示几个矩阵拼接得到H JSC的方式，其中的P表示第二矩阵，0表示0方阵，H CC表示信道校验矩阵，H SC表示信源编码矩阵。
第二矩阵可以是根据单位矩阵所得到的矩阵。其中，第二矩阵也可以称为置换矩阵等。本申请实施例对于用于表示第二矩阵的符号、以及第二矩阵的名称等均不限制。
根据单位矩阵得到第二矩阵的一种可选的方式为，将单位矩阵通过搜索算法进行处理，可得到第二矩阵。搜索算法可包括多种，例如模拟退火算法、布谷鸟算法或遗传算法等。将单位矩阵通过搜索算法进行处理以得到第二矩阵，例如一种处理方式可参考图9。
首先确定最大迭代次数，最大迭代次数可能是算法本身规定的，或者是自行设置的。另外需要设置基准矩阵，或者称为初始矩阵，例如一种基准矩阵为单位矩阵，或者也可以采用其他矩阵作为基准矩阵。在设置基准矩阵后，可以以基准矩阵为基础，通过一些处理(例如随机组合和/或变异等处理)，可得到一个或多个待筛选的矩阵。对一个或多个待筛选的矩阵进行测试，可得到这一个或多个待筛选的矩阵的译码性能。根据这一个或多个待筛选的矩阵的译码性能，可以从这一个或多个待筛选的矩阵中选择译码性能较好的Q个矩阵，将这Q个矩阵设置为新的基准矩阵，Q为正整数。到此，本次迭代完毕，可以将迭代 次数加1，或者也可以在开始迭代时将迭代次数加1。如果当前的迭代次数已等于最大迭代次数，则迭代过程结束，输出Q个矩阵，这Q个矩阵中的部分或全部就可作为第二矩阵。或者，如果当前的迭代次数小于最大迭代次数，则继续执行如上的迭代过程。
下面以搜索算法是模拟退火算法为例，介绍将单位矩阵通过模拟退火算法进行处理以得到第二矩阵的过程。
例如，如果信源码长较短，例如信源码长属于表1中所述的短码长，则可以将单位矩阵进行模拟退火算法处理以得到第二矩阵；又例如，如果信源码长较长，例如信源码长属于表1中所述的长码长，同样可以将单位矩阵进行模拟退火算法处理以得到第二矩阵，或者，还可以先将单位矩阵进行模拟退火算法处理，将得到的矩阵暂且称为第三矩阵，再根据第三矩阵可得到第二矩阵，第二矩阵对应的信源码长大于第三矩阵对应的信源码长。也就是说，如果信源码长较长，则可以利用短码长对应的置换矩阵再生成长码长对应的置换矩阵，如果是这种情况，则短码长对应的置换矩阵也可以称为基础置换矩阵，长码长对应的置换矩阵也可以称为派生置换矩阵。根据基础置换矩阵生成派生置换矩阵，而不必根据模拟退火算法等方式直接生成第二矩阵，可以加速第二矩阵的生成，提高第二矩阵的生成效率。
可参考图10，为将单位矩阵进行模拟退火算法处理以得到第二矩阵(或第三矩阵)的流程。根据图10可知，初始时，令变量矩阵P S为单位矩阵(表示为I)。对于单位矩阵I，确定该单位矩阵I对应的译码阈值，即，确定该单位矩阵对应的信噪比(signal-noise ratio，SNR)，将该单位矩阵对应的SNR记为δ 0，且令δ 1＝δ 0，δ 1即为图10中的变量A。设定当前的温度为初始温度，初始温度记为T 0。随机打乱单位矩阵I中的一些行，产生新的矩阵，记为I 1。确定矩阵I 1对应的译码阈值，记为δ 2。确定δ 2是否小于δ 1，如果δ 2小于δ 1，则接受矩阵I 1，令P S为矩阵I 1，以及令δ 1＝δ 2。此时，如果已达到迭代次数，则温度下降，如果下降后的温度T小于或等于温度阈值T th，则输出矩阵P S，此时的矩阵P S就是得到的第二矩阵(或第三矩阵)，另外还可以输出性能增益δ 1-δ 0。或者，在接受矩阵I 1后，如果还未达到迭代次数，则随机打乱矩阵I 1中的一些行，产生新的矩阵，记为I 2，继续执行类似的判断过程。
另外，如果δ 2大于或等于δ 1，则第一设备可以以一定概率接受矩阵I 1，如果接受了矩阵I 1，则令P S为矩阵I 1，以及令δ 1＝δ 2。此时，如果已达到迭代次数，则温度下降，如果下降后的温度T小于或等于温度阈值T th，则输出矩阵P S，此时的矩阵P S就是得到的第二矩阵(或第三矩阵)，另外还可以输出性能增益δ 1-δ 0。或者，在以一定概率接受矩阵I 1后，如果还未达到迭代次数，则随机打乱矩阵I 1中的一些行，产生新的矩阵，记为I 2，继续执行类似的判断过程。
经过图10所输出的矩阵例如为基础置换矩阵，该基础置换矩阵例如为S×S的方阵。
其中，迭代次数是模拟退火算法预先配置的，可以大于或等于1。第一设备以一定概率接收某个矩阵，接受方式可能有多种。例如，如果当前温度较高，则接受概率较大，而如果当前温度较低，表明系统较为稳定，可能不希望接受译码阈值更大的矩阵，因为译码阈值越大则性能可能越差，因此如果当前温度较低，则接受概率较小。或者，如果前后两个矩阵对应的译码阈值之间的差值较小，例如δ 2和δ 1之间的差值小于第一阈值，则接受概率较大，而如果该差值较大，则接受概率较小。具体按照何种概率接受，可由模拟退火算法规定。
在前文介绍了，如果信源码长较长，则还可以根据较短的信源码长对应的基础置换矩阵生成较长的信源码长对应的派生置换矩阵。可参考图11，为根据较短的信源码长对应的基础置换矩阵生成较长的信源码长对应的派生置换矩阵的流程，图11以派生置换矩阵对应的信源码长是基础置换矩阵对应的信源码长的2倍为例。该基础置换矩阵例如为根据图10所示的流程得到的矩阵。
根据图11可知，首先假设一个2S×2S的方阵，表示为P 2S，将基础置换矩阵表示为P S。例如，P S是通过执行图10所示的流程得到的。对于P 2S的第2i行第j列的元素，将其赋值为P S中的第i行第j列的元素的取值，对于P 2S的第2i+1行第j+S列的元素，将其赋值为P S中的第i行第j列的元素的取值。接着将j加1，如果j加1后的取值小于S，则继续执行上述赋值过程；而如果j加1后的取值大于或等于S，则将i加1。如果i加1后的取值小于S，则继续执行上述赋值过程；而如果i加1后的取值大于或等于S，则输出矩阵P 2S，此时输出的矩阵P 2S就是得到的派生置换矩阵。
还有可能，派生置换矩阵对应的信源码长是基础置换矩阵对应的信源码长的k倍，则这种派生置换矩阵可以通过重复执行图11所示的流程来生成。也就是说，如果根据单位矩阵得到了信源码长m对应的基础置换矩阵P S，则可以据此生成信源码长2 km对应的派生置换矩阵，例如将该派生置换矩阵表示为
Figure PCTCN2022127004-appb-000009
该基础置换矩阵例如为根据图10所示的流程得到的矩阵。
例如参考图12，为根据基础置换矩阵生成派生置换矩阵的流程，图12以派生置换矩阵对应的信源码长是基础置换矩阵对应的信源码长的m倍为例。图12中，将i作为重复次数。初始时i＝0，初始时输入的基础置换矩阵表示为P 0，由于是根据基础置换矩阵P S生成派生置换矩阵，因此P 0＝P S。将P i输入到图11所示的流程(即，图12所述的第一子流程)中，例如初始时P i＝P 0。经过图11所示的流程后可输出P i′。如果此时i小于m，则继续将P i′输入图11所示的流程中执行类似处理；而如果此时i等于m，则输出得到的矩阵，例如表示为P m，此时P m就是得到的派生置换矩阵。
本申请实施例中，如果信源码长较长，则可以通过基础置换矩阵生成派生置换矩阵，则对于第一设备或第二设备来说，存储基础置换矩阵即可，无需存储派生置换矩阵，有利于节省存储空间。
本申请实施例中，例如搜索算法为模拟退火算法，那么第二矩阵可以是根据图10所示的流程得到的矩阵，或者是根据图11所示的流程得到的矩阵，或者是根据图12所示的流程得到的矩阵。
可参考表4，为一些可选的置换矩阵及其对应的lifting size和性能增益。本申请实施例中可将表4中的任一个置换矩阵作为第二矩阵，或者本申请实施例也可以使用除了表4所示的矩阵之外的其他矩阵作为第二矩阵。表4涉及的置换矩阵，可以是基础置换矩阵，也可以是派生置换矩阵。
表4
Z c 置换矩阵 性能增益(dB)
20 置换矩阵A 1 0.21
16 置换矩阵A 2 0.17
24 置换矩阵A 3 0.19
18 置换矩阵A 4 0.22
28 置换矩阵A 5 0.23
22 置换矩阵A 6 0.20
26 置换矩阵A 7 0.21
30 置换矩阵A 8 0.23
Z c表示lifting size，表4中每行的Z c表示该行的置换矩阵所对应的lifting size。如下介绍表4涉及的A 1～A 8这8个置换矩阵。
(1)置换矩阵A 1。
[367,384,63,202,270,95,353,352,268,76,75,273,146,250,3,407,237,400,56,113,216,139,267,129,272,18,401,104,165,135,217,371,196,203,45,145,405,150,166,155,147,124,161,383,278,364,324,304,365,137,287,141,183,35,238,162,236,318,44,54,418,107,194,395,347,375,174,218,85,181,198,207,274,112,355,199,86,46,298,115,234,317,439,240,5,266,121,12,133,151,262,26,299,179,37,142,34,331,322,73,192,10,223,7,302,333,177,21,245,378,125,61,100,243,134,91,330,431,36,6,263,14,1,98,118,219,43,182,426,255,346,119,128,258,144,360,231,59,74,427,191,57,66,246,399,291,305,87,206,80,94,380,81,244,349,437,58,157,83,227,33,300,276,416,369,396,153,126,362,143,406,312,419,92,158,106,363,381,354,429,252,173,201,241,108,200,319,386,176,69,103,136,311,433,117,28,297,64,344,24,114,16,233,88,68,372,65,62,282,279,373,9,264,359,392,366,235,101,228,408,48,31,281,89,295,224,361,102,79,261,132,350,397,175,84,432,280,168,420,436,47,313,308,320,122,127,8,152,332,424,214,423,188,345,358,336,376,323,391,409,321,292,303,296,2,294,422,314,148,438,413,99,309,342,210,19,208,247,326,232,357,415,96,77,385,394,164,229,187,204,404,131,154,82,417,341,29,149,435,269,169,289,205,90,189,123,160,197,212,120,71,130,23,78,377,116,382,335,277,271,379,306,434,284,288,356,283,425,222,140,184,249,70,402,257,412,301,370,15,251,190,67,185,156,0,430,286,310,50,256,171,339,220,13,180,213,398,374,275,49,254,368,259,226,172,253,20,242,40,110,403,11,293,17,393,328,215,195,351,290,410,340,343,248,390,348,307,109,38,170,51,53,27,260,325,387,41,163,105,230,239,329,93,42,72,52,338,193,421,111,178,159,428,337,138,60,22,167,39,186,414,209,30,315,25,265,334,211,221,285,327,388,32,55,389,225,316,97,411,4]。
(2)置换矩阵A 2。
[335,248,31,68,154,271,81,202,76,161,241,255,234,132,155,99,134,342,207,63,338,9,206,180,65,286,96,185,158,277,328,178,30,89,23,268,210,315,217,203,104,124,53,347,322,317,235,260,157,171,52,251,302,318,192,177,224,246,327,179,336,122,218,237,259,174,50,289,343,351,195,175,339,186,91,298,253,148,193,59,29,170,27,58,75,245,295,0,100,194,95,222,121,62,1,300,47,182,308,71,143,60,56,118,291,110,263,77,94,313,227,281,280,292,189,106,61,19,151,40,223,18,321,33,54,236,39,169,231,3,270,36,14,98,225,22,307,334,88,187,113,350,305,51,262,21,240,250,256,290,346,288,341,314,243,70,120,140,176,301,166,319,66,197,79,345,5,159,127,25,150,230,238,55,333,220,34,163,125,28,323,320,284,196,266,221,297,215,107,57,11,214,116,26,73,12,97,205,188,167,42,138,325,340,232,108,135,287,41,311,78,331,7,80,276,152,273,184,204,10,219,212,160,90,199,293,8,191,233,326,316,329,296,244,309,126,249,6,168,299,306,239,183,92,228,49,164,72,165,201,156,181,303,209,324,87,330,261,278,101,162,172,149,141,133,2,304,111,86,264,139,35,17,16,147,43,129,274,74,211,216,144,136,38,257,85,247,44,242,82, 123,344,153,145,348,64,105,67,252,32,349,69,190,93,4,310,294,337,272,146,83,332,48,229,112,258,265,173,37,114,269,282,109,200,254,131,312,13,283,103,208,267,130,275,198,285,213,128,115,46,84,279,45,117,24,226,20,137,102,119,142,15]。
(3)置换矩阵A 3。
[356,378,44,281,22,42,333,482,436,414,417,353,228,107,71,234,493,411,220,164,61,270,303,55,30,109,447,487,157,335,227,388,272,400,215,350,313,49,39,25,100,18,521,420,363,300,84,190,523,237,150,497,242,118,483,450,153,250,200,307,261,254,383,191,361,50,293,311,31,7,357,486,246,265,283,475,221,59,266,381,466,198,117,199,69,285,385,401,172,287,465,2,130,166,393,513,525,391,259,516,526,320,322,331,93,23,239,121,376,212,128,503,135,342,379,519,387,243,258,489,474,305,205,186,501,301,110,522,418,87,78,419,294,263,178,140,101,185,5,51,158,517,394,392,28,432,372,284,431,275,297,85,148,136,9,435,362,326,491,184,146,430,230,70,208,288,506,485,327,478,373,165,396,382,520,330,52,86,395,89,105,308,280,336,340,125,351,461,321,399,179,332,289,122,370,113,225,404,17,156,36,442,456,355,29,302,143,13,96,366,476,72,183,410,429,312,68,127,252,147,58,138,106,45,386,123,38,108,33,323,375,47,494,233,299,91,169,83,291,421,64,439,256,484,500,495,24,15,112,257,349,455,65,367,111,295,354,470,82,217,10,344,134,260,120,174,316,315,334,276,490,496,40,433,405,460,92,35,390,236,79,408,241,88,131,459,77,56,98,514,415,203,515,21,314,32,454,488,189,74,229,464,149,180,235,359,398,60,103,341,159,193,80,469,181,151,224,54,214,124,249,139,204,194,46,471,3,279,41,163,248,473,338,137,48,440,510,463,304,232,1,155,269,213,290,397,171,424,206,505,63,365,267,347,329,268,6,73,14,451,154,402,26,102,452,324,371,296,162,358,94,99,12,443,409,479,196,518,377,141,271,222,133,226,444,462,423,317,188,223,216,360,480,152,177,218,384,309,368,507,182,457,255,244,240,37,97,95,319,81,167,168,508,492,472,458,282,129,426,453,441,116,328,161,468,389,76,201,104,132,219,247,337,4,318,210,251,19,422,425,445,512,119,416,57,524,446,264,62,306,286,511,160,192,346,173,145,438,195,238,343,273,170,498,67,403,427,231,253,467,374,292,209,53,509,434,114,277,369,449,339,499,90,413,504,278,298,34,380,412,175,211,477,428,325,202,187,406,75,27,176,262,144,352,142,348,481,502,16,197,245,527,345,0,437,448,364,126,66,11,115,310,274,43,407,207,20,8]。
(4)置换矩阵A 4。
[308,241,267,153,60,291,37,240,372,273,72,356,68,307,243,344,221,386,314,105,179,22,338,92,197,58,315,137,367,20,277,7,44,325,162,268,219,47,142,271,334,285,305,222,353,202,326,73,191,368,261,54,352,76,242,5,165,265,358,331,149,276,196,98,190,108,176,118,87,245,350,48,376,183,9,377,214,2,39,212,200,75,373,195,257,300,101,198,388,185,330,35,6,174,34,132,85,157,40,229,272,57,231,30,27,104,63,110,152,362,247,71,97,192,252,150,303,38,127,355,13,282,393,387,270,77,51,323,337,253,328,133,223,312,42,124,29,15,354,287,11,324,81,359,224,390,280,288,146,332,66,117,56,107,59,340,64,318,385,18,100,52,121,218,299,88,61,292,95,211,301,345,363,217,380,53,322,216,50,25,266,302,210,259,290,206,188,19,244,131,333,103,138,134,366,342,250,189,177,298,193,94,180,83,233,155,304,65,227,163,167,160,208,283,343,28,281,113,260,394,278,33,207,284,129,306,371,199,205,320,8,86,164,226,357,74,14,79,346,289,319,140,275,395,254,381,80,379,102,23,21,112,156,225,335,383,297,41,82,0,115,215,269,114,279,111,327,144,294,173,45,161,17,55,204,348,46,130,181,175,89,78,184,3,213,69,351,336 ,158,16,109,126,321,256,375,258,12,251,361,90,147,370,235,187,1,151,230,128,203,236,239,159,84,122,166,382,4,249,96,341,384,135,194,123,309,148,119,70,329,374,339,369,169,178,136,389,238,201,67,32,220,62,145,10,49,171,228,293,274,234,116,295,182,317,93,316,168,99,349,120,310,170,106,391,378,246,91,31,263,232,209,139,248,36,296,313,262,264,360,186,364,311,26,141,365,143,347,255,43,154,24,125,286,172,392,237]。
(5)置换矩阵A 5。
[252,308,254,546,593,320,402,85,366,577,604,122,102,358,119,193,512,433,290,36,422,586,33,340,230,276,611,610,103,285,100,601,478,405,547,270,569,374,516,93,403,590,84,144,210,241,269,545,440,123,482,411,498,108,393,466,110,179,26,181,303,501,109,372,368,431,525,615,480,481,490,348,95,191,606,237,322,587,453,161,148,326,51,555,450,574,13,166,511,553,441,281,141,401,295,362,238,427,82,505,544,520,369,596,356,375,195,9,572,514,87,477,81,602,315,217,214,55,536,20,54,417,562,136,170,200,265,261,218,3,392,532,341,352,502,77,94,127,126,448,177,359,442,15,242,563,32,260,493,245,378,412,415,215,530,72,38,35,565,296,513,30,552,274,410,486,57,194,271,37,227,515,183,128,205,522,509,384,24,188,169,533,86,121,111,578,219,222,165,139,129,537,527,317,75,240,529,96,223,176,250,570,452,518,299,605,418,23,292,457,132,306,591,60,294,301,206,4,589,432,78,612,199,353,420,343,58,226,339,18,6,377,196,184,159,484,487,99,298,16,282,394,203,582,73,76,594,573,310,559,469,142,328,524,323,329,264,221,528,40,10,613,473,114,331,476,367,346,34,370,189,454,531,451,386,554,147,407,2,444,382,428,523,192,496,436,146,243,332,335,39,59,576,155,118,138,113,256,607,609,510,167,289,48,88,500,307,491,336,0,568,149,135,244,438,312,464,551,150,80,41,286,202,83,11,414,357,342,233,597,174,389,201,160,120,288,255,106,125,506,19,90,28,542,503,535,313,538,566,272,105,29,557,309,581,383,92,449,101,47,273,207,62,98,21,430,380,198,259,351,304,381,133,91,584,413,398,558,263,599,31,423,71,424,429,497,212,460,64,598,539,406,61,363,156,130,277,355,399,253,467,395,408,239,187,266,45,74,67,180,360,232,151,409,247,235,228,447,334,236,302,65,580,338,63,365,321,474,280,66,27,152,462,287,435,446,154,571,468,89,603,1,190,583,284,325,404,216,279,50,297,311,157,371,556,495,534,25,178,461,508,507,116,112,479,549,492,437,421,400,376,131,485,248,69,318,488,472,293,234,185,42,517,211,543,585,567,475,283,397,349,499,564,70,225,68,541,224,345,53,140,463,197,540,519,396,164,443,388,5,419,319,327,153,455,337,46,52,426,361,314,22,251,425,434,134,168,379,347,579,561,14,8,316,143,186,56,333,163,354,592,115,258,162,330,137,456,275,249,229,471,262,44,465,526,416,43,550,145,208,439,220,267,614,521,458,575,12,324,49,209,175,560,104,387,300,350,588,246,278,117,504,79,124,257,231,548,608,7,470,391,494,600,364,173,172,385,158,17,483,305,107,182,373,344,489,291,204,97,213,445,459,171,595,390,268]。
(6)置换矩阵A 6。
[189,372,325,155,5,363,202,256,207,435,427,194,378,146,469,343,208,250,473,374,171,160,180,398,245,294,8,354,16,246,419,278,404,164,73,396,80,40,35,115,36,112,61,228,267,78,277,269,231,52,206,432,444,292,355,476,440,111,241,411,366,126,50,181,65,222,56,416,336,315,299,32,137,403,373,55,314,407,77,334,358,346,2,333,434,229,370,109,10,248,37,364,209,303,481,26,342,205,125,51,106,462,408,413,130,453,169,141,13,59,30,345,468,60,223,319,422,204,335,263,150,290,89,45,4,92,143,477,445,74,298,210,121,233,175,227,379,449,14,442,390, 338,157,382,441,459,470,260,70,98,327,54,133,69,20,139,88,211,147,113,414,436,24,322,156,132,7,203,455,240,465,193,43,275,95,339,437,242,6,258,97,84,324,163,420,271,321,29,340,19,391,381,230,341,217,409,387,238,351,103,456,389,262,215,309,85,454,360,220,282,349,200,138,117,96,323,297,318,108,305,474,195,386,82,287,153,463,291,190,114,218,41,244,380,87,270,311,393,236,400,219,86,450,197,310,471,212,466,425,185,49,124,268,439,83,214,44,352,57,58,401,410,63,328,104,284,158,384,304,302,483,118,395,243,368,23,289,91,165,424,433,42,159,131,135,429,402,152,75,100,136,332,249,331,102,27,162,461,142,261,67,161,475,421,288,252,53,371,3,312,446,259,344,21,362,265,18,350,348,283,239,170,39,72,376,388,431,119,280,66,405,177,357,46,128,472,253,438,406,226,266,144,123,134,367,216,377,225,184,224,306,151,394,383,191,353,281,457,15,430,68,173,154,426,316,9,31,443,235,99,71,145,423,174,361,237,326,279,38,369,28,47,122,320,479,301,167,478,286,183,127,140,182,399,178,365,347,17,418,201,359,25,234,251,317,428,166,264,447,417,274,22,105,285,129,412,0,464,76,300,255,1,232,257,81,482,330,48,176,480,186,296,79,64,375,452,467,273,110,11,198,12,356,120,93,188,168,34,101,192,90,148,448,62,385,213,308,196,247,199,458,451,221,329,307,397,460,187,179,337,272,313,254,94,149,392,33,276,116,415,172,295,107,293]。
(7)置换矩阵A 7。
[527,259,416,280,291,195,333,122,132,509,143,191,271,57,352,538,328,316,314,245,401,48,375,370,18,181,307,234,30,337,513,13,176,182,510,485,326,163,244,368,101,487,517,360,177,42,305,185,117,103,442,525,98,187,24,285,504,556,559,153,240,321,232,450,446,133,469,79,10,406,266,142,17,156,71,76,77,410,138,417,159,27,113,290,318,180,99,570,179,65,424,460,568,82,15,146,457,218,216,478,12,494,571,40,516,128,38,390,7,203,35,43,381,303,188,242,70,521,217,255,278,145,151,14,22,44,320,286,325,443,52,541,287,539,109,292,565,369,465,100,102,351,474,566,282,359,332,172,55,458,366,149,448,239,475,444,88,427,440,134,204,111,299,84,19,47,89,356,233,105,165,28,489,225,274,354,235,373,288,498,155,434,481,532,414,309,558,399,257,317,371,194,342,477,537,221,121,322,365,50,92,361,23,514,451,75,226,31,263,453,438,260,152,540,4,265,231,555,447,224,173,25,198,530,345,413,268,472,241,46,343,398,157,104,85,340,367,488,136,564,435,508,36,377,53,114,269,553,83,569,219,503,542,561,500,54,249,429,543,124,148,445,41,357,430,106,253,171,61,534,493,385,168,415,433,506,60,166,496,486,93,186,8,178,154,68,374,130,339,310,497,419,229,273,137,58,403,297,473,227,364,544,395,464,298,164,392,400,557,402,206,141,33,32,560,212,96,123,423,228,350,162,196,247,108,207,329,490,295,302,80,236,315,59,277,72,495,324,63,296,405,281,6,87,388,135,529,491,237,202,78,174,346,549,425,397,66,283,358,536,452,116,293,69,441,483,5,275,376,436,34,418,323,304,461,306,552,505,74,270,331,341,562,389,412,213,251,301,391,531,126,528,563,144,62,1,355,192,170,39,201,484,81,384,363,454,426,158,26,338,16,512,215,535,524,335,115,205,51,127,0,431,254,456,250,86,548,67,407,408,379,449,526,396,161,311,300,550,480,522,344,211,3,502,523,243,284,308,193,520,387,94,220,112,380,471,482,238,511,262,45,160,353,463,147,20,91,439,362,467,349,470,319,455,468,437,2,118,199,466,330,334,312,519,276,107,222,56,209,90,394,545,294,210,95,421,49,272,462,264,230,313,533,110,252,382,29,167,150,9,139,183,476,479,21,169,378,258,546,404,499,64,200,428,420,551,409,223,208,554,73,518,246,411,129,348,11,327,383,507,120,197,119,97,393,279,37,386,256,347,492,515,248,189,422,289,184, 261,501,547,372,190,459,567,131,140,214,432,336,267,125,175]。
(8)置换矩阵A 8。
[144,587,283,30,513,618,197,417,540,241,191,640,470,485,573,360,421,96,517,561,467,450,49,40,325,239,60,438,659,181,488,288,158,424,136,607,568,187,314,359,77,529,583,308,32,319,425,537,442,579,435,576,207,388,564,128,130,174,256,339,216,415,304,21,199,145,445,548,365,300,558,100,46,11,476,493,479,354,609,473,343,499,427,356,578,203,635,52,373,374,580,577,605,287,306,20,657,250,110,22,23,550,641,14,459,468,243,474,69,66,26,310,449,264,581,526,316,42,309,552,38,536,224,119,623,279,340,637,115,120,105,397,494,566,511,155,653,190,213,357,600,323,369,150,294,85,277,584,117,565,180,315,462,599,539,282,630,220,394,586,567,284,386,10,544,376,400,194,611,92,458,173,177,650,101,569,307,615,482,112,460,317,353,406,480,186,25,198,5,227,428,154,496,37,59,524,218,311,585,521,179,132,402,212,557,423,341,622,93,327,370,252,211,139,43,94,503,471,632,342,563,430,329,518,232,525,371,509,114,551,444,266,478,364,278,204,188,147,210,420,481,326,351,165,395,291,510,2,1,89,534,247,384,582,245,172,338,103,157,246,456,70,48,293,142,453,610,633,67,123,492,412,39,335,634,404,162,624,286,401,303,349,182,627,487,124,299,127,175,248,156,129,409,396,215,410,399,454,466,508,334,313,636,500,486,604,501,195,34,463,461,556,201,535,433,422,27,419,451,87,270,222,106,75,403,235,571,333,217,443,280,361,153,648,137,17,562,72,73,160,387,408,596,6,549,275,140,41,236,324,407,603,71,98,78,164,522,472,29,55,418,88,183,483,54,608,392,141,76,152,375,345,122,649,606,366,0,436,318,91,381,515,36,642,382,12,489,125,328,377,219,547,269,437,352,629,159,520,638,491,533,268,411,193,559,111,15,301,336,434,530,541,272,390,440,254,385,368,595,146,50,133,597,104,512,226,200,378,118,347,464,447,253,617,249,47,545,230,99,290,448,167,265,490,3,274,260,505,379,645,646,355,9,255,251,331,446,126,393,214,330,138,51,531,237,348,267,589,322,131,13,79,18,151,619,528,484,81,273,97,616,223,83,305,414,259,383,44,228,405,64,86,572,497,61,206,295,429,121,8,542,261,416,231,113,102,134,192,68,95,593,532,189,543,431,229,171,281,178,362,289,53,80,538,652,271,621,516,240,302,546,31,477,380,62,519,439,238,601,28,612,276,560,176,242,298,346,523,257,658,363,90,498,504,594,344,148,358,143,244,35,196,209,84,163,19,574,33,495,626,296,45,169,432,554,591,74,170,570,185,234,644,647,639,57,337,184,221,602,258,149,391,65,588,457,654,24,506,413,116,332,350,107,590,135,598,372,202,553,321,292,58,166,168,643,7,263,655,613,398,312,465,592,656,161,620,507,56,631,475,109,208,297,262,575,502,82,320,233,441,285,469,426,452,455,514,367,625,628,389,651,205,108,63,555,527,16,4,614,225]。
其中，如上给出的置换矩阵并不是完整的矩阵，只是给出了置换矩阵中取“1”的元素的位置。例如，如上的数值是用于顺序表示置换矩阵中的行，第一个数值表示第0行，第二个数值表示第1行等。如上的具体数值，就表示该数值对应的行中取“1”的元素所在的位置，该行中除了这个位置之外，其他位置的元素均为0。例如对于置换矩阵A 8，第一个数值为144，表示置换矩阵A 8中第0行的第144个元素的取值为1，第0行的其他元素取值均为0；第二个数值为587，表示置换矩阵A 8中第1行的第587个元素的取值为1，第1行的其他元素取值均为0；第三个数值为283，表示置换矩阵A 8中第2行的第283个元素的取值为1，第2行的其他元素取值均为0；以此类推。对于如上的置换矩阵A 1～A 7的理解也是类似的。
在双LDPC系统中，要求信源码和信道码之间的连接矩阵是一个置换矩阵。而在固定码长下，置换矩阵是数量有限的。因此本申请实施例中，通过搜索算法可搜索出较为合理的置换矩阵，以改善信源码和信道码之间的连接，这样可以有效提升本申请实施例提供的双LDPC系统的性能。另外，因为信源编码基矩阵是根据信道编码基矩阵得到的，这就导致信源编码矩阵与信道校验矩阵之间存在关联性。通过使用合理的搜索算法，搜索并筛选出合理的交织矩阵(例如第二矩阵)，也可以有效解除信源编码矩阵与信道校验矩阵的关联性。
S702、第二设备根据第二矩阵获得联合校验矩阵。可选的，第二设备可根据信源编码矩阵、信道校验矩阵以及第二矩阵获得联合校验矩阵，该联合校验矩阵可参考图8。
第二设备在获得联合校验矩阵后，可以根据联合校验矩阵进行译码。图7所示的实施例与图2所示的实施例可以结合应用，那么第二设备可以根据联合校验矩阵对第二信息进行译码，即，可以用图7所示的实施例中的联合校验矩阵替换图2所示的实施例中的联合校验矩阵。或者，图7所示的实施例与图2所示的实施例也可以单独应用，那么第二设备根据联合校验矩阵所译码的信息，可能是根据图2所示的实施例所提供的方法得到的，或者也可以是根据传统的方法(例如现有的双LDPC编码方法等)得到的，本申请实施例不做限制。
除了得到第二矩阵的过程外，本申请实施例中第二设备的译码过程均可参考图2所示的实施例中对于译码过程的介绍。
本申请实施例中，第二设备可以对单位矩阵进行相应处理后再得到联合校验矩阵，通过该联合校验矩阵进行译码，能够有效降低译码阈值，从而提高了译码性能。
为了更好地说明本申请实施例提供的技术方案所带来的效果，可参考图13，为图2所示的实施例提供的编译码方法与现有的双LDPC系统方案之间的性能比较示意图。图13中，以信源熵率是0.4为例。另外图13中，本申请实施例采用了码长为880的双LDPC，译码方式为联合信源信道译码；现有的双LDPC系统采用了R4JA与AR4JA分别作为信源码和信道码的方案，码长为1024。图13中的实曲线表示本申请实施例的方案(图13中称为基于5G的双LDPC)，虚曲线表示现有的双LDPC系统的方案(图13中称为传统双LDPC)。纵轴表示误比特率，横轴表示
Figure PCTCN2022127004-appb-000010
其中E b表示比特能量，N 0表示信道噪声能量。如果
Figure PCTCN2022127004-appb-000011
的取值越大，则表明性能越好。根据图13可以看到，本申请实施例所提供的编译码方案能够带来约0.5dB的性能增益，同时错误平层等问题也能得到抑制。
另外可再参考图14，为图2所示的实施例提供的编译码方法与现有的分离式编译码系统方案之间的性能比较示意图。分离式编译码系统为单LDPC系统，信道码使用的是LDPC，而信源码未使用LDPC。图14中，以信源熵率是0.4为例，且分别以图2所示的实施例单独应用、以及图2所示的实施例与图7所示的实施例结合应用为例。另外图14中，本申请实施例采用了码长为880的双LDPC，译码方式为联合信源信道译码；现有的分离式编译码系统采用了基于上下文的自适应二进制算术编码(context-based adaptive binary  arithmetic coding，CABAC)与5G NR LDPC分别作为信源码和信道码的方案，其中5G NR LDPC的码长为1024，CABAC的输入比特长度为2×10 7比特。图14中，最上方的曲线表示现有的分离式编译码系统方案(图14中称为分离式编译码)；中间的虚曲线表示图2所示的实施例单独应用的方案(图14中称为双LDPC系统交织前)，即，用于得到联合校验矩阵的是单位矩阵；最下方的虚曲线表示图2所示的实施例与图7所示的实施例结合应用的方案(图14中称为双LDPC系统交织后)，即，用于得到联合校验矩阵的是第二矩阵。纵轴表示误比特率，横轴表示
Figure PCTCN2022127004-appb-000012
根据图14所示，如果根据单位矩阵得到联合校验矩阵，则本申请实施例的技术方案相较于传统的编译码系统来说，系统大约带来了0.8dB的性能增益；如果根据第二矩阵得到联合校验矩阵，则本申请实施例的技术方案相较于传统的编译码系统来说，系统大约带来了约1dB的性能增益。可见，根据单位矩阵生成置换矩阵(基础置换矩阵或派生置换矩阵等)，能够有效降低译码阈值，从而提升性能。
图15给出了本申请实施例提供的一种通信装置的结构示意图。所述通信装置1500也可以称为信息处理装置1500。通信装置1500可以是图2所示的实施例或图7所示的实施例所述的第一设备或该第一设备的电路系统，用于实现上述方法实施例中对应于第一设备的方法。或者，所述通信装置1500可以是图2所示的实施例或图7所示的实施例所述的第二设备或该第二设备的电路系统，用于实现上述方法实施例中对应于第二设备的方法。具体的功能可以参见上述方法实施例中的说明。其中，例如一种电路系统为芯片系统。
该通信装置1500包括至少一个处理器1501。处理器1501可以用于装置的内部处理，实现一定的控制处理功能。可选地，处理器1501包括指令。可选地，处理器1501可以存储数据。可选地，不同的处理器可以是独立的器件，可以位于不同物理位置，可以位于不同的集成电路上。可选地，不同的处理器可以集成在一个或多个处理器中，例如，集成在一个或多个集成电路上。
可选地，通信装置1500包括一个或多个存储器1503，用以存储指令。可选地，所述存储器1503中还可以存储有数据。所述处理器和存储器可以单独设置，也可以集成在一起。
可选地，通信装置1500包括通信线路1502，以及至少一个通信接口1504。其中，因为存储器1503、通信线路1502以及通信接口1504均为可选项，因此在图15中均以虚线表示。
可选地，通信装置1500还可以包括收发器和/或天线。其中，收发器可以用于向其他装置发送信息或从其他装置接收信息。所述收发器可以称为收发机、收发电路、输入输出接口等，用于通过天线实现通信装置1500的收发功能。可选地，收发器包括发射机(transmitter)和接收机(receiver)。示例性地，发射机可以用于将基带信号生成射频(radio frequency)信号，接收机可以用于将射频信号转换为基带信号。
处理器1501可以包括一个通用中央处理器(central processing unit，CPU)，微处理器，特定应用集成电路(application specific integrated circuit，ASIC)，或一个或多个用于控制本申请方案程序执行的集成电路。
通信线路1502可包括一通路，在上述组件之间传送信息。
通信接口1504，使用任何收发器一类的装置，用于与其他设备或通信网络通信，如以太网，无线接入网(radio access network，RAN)，无线局域网(wireless local area networks，WLAN)，有线接入网等。
存储器1503可以是只读存储器(read-only memory，ROM)或可存储静态信息和指令的其他类型的静态存储设备，随机存取存储器(random access memory，RAM)或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(electrically erasable programmable read-only memory，EEPROM)、只读光盘(compact disc read-only memory，CD-ROM)或其他光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。存储器1503可以是独立存在，通过通信线路1502与处理器1501相连接。或者，存储器1503也可以和处理器1501集成在一起。
其中，存储器1503用于存储执行本申请方案的计算机执行指令，并由处理器1501来控制执行。处理器1501用于执行存储器1503中存储的计算机执行指令，从而实现本申请上述实施例提供的信息处理方法。
可选的，本申请实施例中的计算机执行指令也可以称之为应用程序代码，本申请实施例对此不作具体限定。
在具体实现中，作为一种实施例，处理器1501可以包括一个或多个CPU，例如图15中的CPU0和CPU1。
在具体实现中，作为一种实施例，通信装置1500可以包括多个处理器，例如图15中的处理器1501和处理器1508。这些处理器中的每一个可以是一个单核(single-CPU)处理器，也可以是一个多核(multi-CPU)处理器。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(例如计算机程序指令)的处理核。
当图15所示的装置为芯片时，例如是接入网设备的芯片，或UPF的芯片，或SMF的芯片，或终端设备的芯片，则该芯片包括处理器1501(还可以包括处理器1508)、通信线路1502、存储器1503和通信接口1504。具体地，通信接口1504可以是输入接口、管脚或电路等。存储器1503可以是寄存器、缓存等。处理器1501和处理器1508可以是一个通用的CPU，微处理器，ASIC，或一个或多个用于控制上述任一实施例的信息处理方法的程序执行的集成电路。
在第一种实现方式中，该通信装置1500可以用于实现上述申请实施例中对应于终端设备的方法，具体功能参见上述实施例中的说明。
示例性地，通信装置1500包括处理器1501，所述处理器1501用于执行计算机程序或指令，使得上述申请实施例中对应于第一设备的方法被执行。例如，上述申请实施例中对应于第一设备的方法，包括：确定第一信源编码码率；根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵；将信源序列输入所述信源编码矩阵，以对所述信源序列进行信源编码。
在第二种实现方式中，该通信装置1500可以用于实现上述申请实施例中对应于第二设备的方法，具体功能参见上述实施例中的说明。
示例性地，通信装置1500包括处理器1501，所述处理器1501用于执行计算机程序或 指令，使得上述申请实施例中对应于第二设备的方法被执行。例如，上述申请实施例中对应于第二设备的方法，包括：根据第二矩阵获得联合校验矩阵，所述第二矩阵是根据单位矩阵得到的矩阵；根据所述联合校验矩阵对接收的第二信息进行译码。
又例如，上述申请实施例中对应于第二设备的方法，包括：确定第一信源编码码率；根据所述第一信源编码码率，确定信源编码矩阵；根据所述信源编码矩阵对接收的第二信息进行译码。
本申请实施例可以根据上述方法示例对装置进行功能模块的划分，例如，可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。比如，在采用对应各个功能划分各个功能模块的情况下，图16示出了一种装置示意图，该装置1600可以是上述各个方法实施例中所涉及的接入网设备或终端设备，或者为接入网设备中的芯片或终端设备中的芯片。该装置1600包括发送单元1601、处理单元1602和接收单元1603。
应理解，该装置1600可以用于实现本申请实施例的方法中由接入网设备或终端设备执行的步骤，相关特征可以参照上文的各个实施例，此处不再赘述。
可选的，图16中的发送单元1601、接收单元1603以及处理单元1602的功能/实现过程可以通过图15中的处理器1501调用存储器1503中存储的计算机执行指令来实现。或者，图16中的处理单元1602的功能/实现过程可以通过图15中的处理器1501调用存储器1503中存储的计算机执行指令来实现，图16中的发送单元1601和接收单元1603的功能/实现过程可以通过图15中的通信接口1504来实现。
可选的，当该装置1600是芯片或电路时，则发送单元1601和接收单元1603的功能/实现过程还可以通过管脚或电路等来实现。
本申请还提供一种计算机可读存储介质，该计算机可读存储介质存储有计算机程序或指令，当该计算机程序或指令被运行时，实现前述方法实施例中由接入网设备或终端设备所执行的方法。这样，上述实施例中所述功能可以软件功能单元的形式实现并作为独立的产品销售或使用。基于这样的理解，本申请的技术方案本质上或者说对做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。存储介质包括：U盘、移动硬盘、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
本申请还提供一种计算机程序产品，该计算机程序产品包括：计算机程序代码，当该计算机程序代码在计算机上运行时，使得该计算机执行前述任一方法实施例中由终端设备或接入网设备所执行的方法。
本申请实施例还提供了一种处理装置，包括处理器和接口；所述处理器用于执行上述任一方法实施例所涉及的终端设备或接入网设备所执行的方法。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算 机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，DVD)、或者半导体介质(例如固态硬盘(solid state disk，SSD))等。
本申请实施例中所描述的各种说明性的逻辑单元和电路可以通过通用处理器，数字信号处理器(digital signal processor，DSP)，专用集成电路(application specific integrated circuit，ASIC)，现场可编程门阵列(field-programmable gate array，FPGA)，或其它可编程逻辑装置，离散门或晶体管逻辑，离散硬件部件，或上述任何组合的设计来实现或操作所描述的功能。通用处理器可以为微处理器，可选地，该通用处理器也可以为任何传统的处理器、控制器、微控制器或状态机。处理器也可以通过计算装置的组合来实现，例如数字信号处理器和微处理器，多个微处理器，一个或多个微处理器联合一个数字信号处理器核，或任何其它类似的配置来实现。
本申请实施例中所描述的方法或算法的步骤可以直接嵌入硬件、处理器执行的软件单元、或者这两者的结合。软件单元可以存储于RAM、闪存、ROM、可擦除可编程只读存储器(erasable programmable read-only memory，EPROM)、EEPROM、寄存器、硬盘、可移动磁盘、CD-ROM或本领域中其它任意形式的存储媒介中。示例性地，存储媒介可以与处理器连接，以使得处理器可以从存储媒介中读取信息，并可以向存储媒介存写信息。可选地，存储媒介还可以集成到处理器中。处理器和存储媒介可以设置于ASIC中，ASIC可以设置于终端设备中。可选地，处理器和存储媒介也可以设置于终端设备中的不同的部件中。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管结合具体特征及其实施例对本申请实施例进行了描述，显而易见的，在不脱离本申请实施例的范围的情况下，可对其进行各种修改和组合。相应地，本申请实施例和附图仅仅是所附权利要求所界定的本申请实施例的示例性说明，且视为已覆盖本申请实施例范围内的任意和所有修改、变化、组合或等同物。显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实施例的范围。这样，倘若本申请实施例的这些修改和变型属于本申请实施例权利要求及其等同技术的范围之内，则本申请实施例也意图包含这些改动和变型在内。
实施例1.一种信息处理方法，包括：
确定第一信源编码码率；
根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵；
将信源序列输入所述信源编码矩阵，以对所述信源序列进行信源编码。
实施例2.根据实施例1所述的方法，所述方法还包括：
根据所述信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
实施例3.根据实施例1或2所述的方法，根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵，包括：
根据所述第一信源编码码率以及所述信道编码基矩阵，确定信源编码基矩阵；
根据所述信源编码基矩阵，确定所述信源编码矩阵。
实施例4.根据实施例3所述的方法，根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵，包括：
确定所述第一信源编码码率对应的提升系数所属的集合编号；
确定所述集合编号所对应的第一信道编码基矩阵；
将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
实施例5.根据实施例4所述的方法，对所述第二信道编码基矩阵的行和/或列进行裁剪，包括：
保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
实施例6.根据实施例5所述的方法，N 1＝22。
实施例7.根据实施例5或6所述的方法，
如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
实施例8.根据实施例1～7任一项所述的方法，所述方法还包括：
通过第一矩阵，对所述信源编码矩阵输出的比特进行信道编码，其中，所述信源编码矩阵的输出维度与所述第一矩阵的输入维度相等。
实施例9.根据实施例8所述的方法，通过第一矩阵，对所述信源编码矩阵输出的比特进行信道编码，包括：
通过第二矩阵打乱所述信源编码矩阵输出的比特；
通过所述第一矩阵对打乱后的比特进行信道编码。
实施例10.一种信息处理方法，包括：
根据第二矩阵获得联合校验矩阵，所述第二矩阵是根据单位矩阵得到的矩阵；
根据所述联合校验矩阵对接收的第二信息进行译码。
实施例11.根据实施例10所述的方法，所述第二矩阵是将所述单位矩阵通过搜索算法处理后得到的。
实施例12.根据实施例11所述的方法，所述方法还包括：
通过搜索算法处理所述单位矩阵，得到第三矩阵；
根据所述第三矩阵得到所述第二矩阵，其中，所述第二矩阵对应的信源码长大于所述第三矩阵对应的信源码长。
实施例13.根据实施例10～12任一项所述的方法，根据第二矩阵获得联合校验矩阵，包括：
根据信源编码矩阵和所述第二矩阵，获得所述联合校验矩阵。
实施例14.根据实施例13所述的方法，所述方法还包括：
确定第一信源编码码率；
根据所述第一信源编码码率，确定所述信源编码矩阵。
实施例15.根据实施例14所述的方法，所述方法还包括：
根据信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
实施例16.根据实施例14或15所述的方法，根据所述第一信源编码码率，确定所述信源编码矩阵，包括：
根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵；
根据所述信源编码基矩阵，确定所述信源编码矩阵。
实施例17.根据实施例16所述的方法，根据所述第一信源编码码率以及信道编码基矩阵，确定所述信源编码基矩阵，包括：
确定所述第一信源编码码率对应的提升系数所属的集合编号；
确定所述集合编号所对应的第一信道编码基矩阵；
将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
实施例18.根据实施例17所述的方法，对所述第二信道编码基矩阵的行和/或列进行裁剪，包括：
保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
实施例19.根据实施例18所述的方法，N 1＝22。
实施例20.根据实施例18或19所述的方法，
如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
实施例21.一种信息处理方法，包括：
确定第一信源编码码率；
根据所述第一信源编码码率，确定信源编码矩阵；
根据所述信源编码矩阵对接收的第二信息进行译码。
实施例22.根据实施例21所述的方法，所述方法还包括：
根据信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
实施例23.根据实施例21或22所述的方法，根据所述第一信源编码码率，确定信源 编码矩阵，包括：
根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵；
根据所述信源编码基矩阵，确定所述信源编码矩阵。
实施例24.根据实施例23所述的方法，根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵，包括：
确定所述第一信源编码码率对应的提升系数所属的集合编号；
确定所述集合编号所对应的第一信道编码基矩阵；
将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
实施例25.根据实施例24所述的方法，对所述第二信道编码基矩阵的行和/或列进行裁剪，包括：
保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
实施例26.根据实施例25所述的方法，N 1＝22。
实施例27.根据实施例25或26所述的方法，
如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
实施例28.根据实施例21～27任一项所述的方法，根据所述信源编码矩阵对接收的第二信息进行译码，包括：
根据所述信源编码矩阵确定联合校验矩阵；
根据所述联合校验矩阵对所述第二信息进行译码。
实施例29.根据实施例28所述的方法，根据所述信源编码矩阵确定联合校验矩阵，包括：
根据所述信源编码矩阵和第二矩阵，确定所述联合校验矩阵，所述第二矩阵是根据单位矩阵得到的矩阵。
实施例30.根据实施例29所述的方法，所述第二矩阵是将所述单位矩阵通过搜索算法处理后得到的。
实施例31.根据实施例29所述的方法，所述方法还包括：
通过搜索算法处理所述单位矩阵，得到第三矩阵；
根据所述第三矩阵得到所述第二矩阵，其中，所述第二矩阵对应的信源码长大于所述第三矩阵对应的信源码长。
实施例32.一种信息处理装置，包括：
处理单元，用于确定第一信源编码码率；
所述处理单元，还用于根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵；
所述处理单元，还用于将信源序列输入所述信源编码矩阵，以对所述信源序列进行信源编码。
实施例33.根据实施例32所述的装置，所述处理单元，还用于根据所述信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
实施例34.根据实施例33或34所述的装置，所述处理单元用于通过如下方式根据所述第一信源编码码率以及信道编码基矩阵确定信源编码矩阵：
根据所述第一信源编码码率以及所述信道编码基矩阵，确定信源编码基矩阵；
根据所述信源编码基矩阵，确定所述信源编码矩阵。
实施例35.根据实施例34所述的装置，所述处理单元用于通过如下方式根据所述第一信源编码码率以及信道编码基矩阵确定信源编码基矩阵：
确定所述第一信源编码码率对应的提升系数所属的集合编号；
确定所述集合编号所对应的第一信道编码基矩阵；
将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
实施例36.根据实施例35所述的装置，所述处理单元用于通过如下方式对所述第二信道编码基矩阵的行和/或列进行裁剪：
保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
实施例37.根据实施例36所述的装置，N 1＝22。
实施例38.根据实施例36或37所述的装置，
如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
实施例39.根据实施例32～38任一项所述的装置，所述处理单元，还用于通过第一矩阵，对所述信源编码矩阵输出的比特进行信道编码，其中，所述信源编码矩阵的输出维度与所述第一矩阵的输入维度相等。
实施例40.根据实施例39所述的装置，所述处理单元用于通过如下方式通过第一矩阵对所述信源编码矩阵输出的比特进行信道编码：
通过第二矩阵打乱所述信源编码矩阵输出的比特；
通过所述第一矩阵对打乱后的比特进行信道编码。
实施例41.根据实施例32～40任一项所述的装置，所述装置还包括收发单元，用于发送第二信息，所述第二信息是通过信道编码得到的信息。
实施例42.一种信息处理装置，包括：
处理单元，用于根据第二矩阵获得联合校验矩阵，所述第二矩阵是根据单位矩阵得到的矩阵；
所述处理单元，还用于根据所述联合校验矩阵对接收的第二信息进行译码。
实施例43.根据实施例42所述的装置，所述装置还包括收发单元，用于接收所述第二信息。
实施例44.根据实施例42或43所述的装置，所述第二矩阵是将所述单位矩阵通过搜索算法处理后得到的。
实施例45.根据实施例44所述的装置，所述处理单元还用于：
通过搜索算法处理所述单位矩阵，得到第三矩阵；
根据所述第三矩阵得到所述第二矩阵，其中，所述第二矩阵对应的信源码长大于所述第三矩阵对应的信源码长。
实施例46.根据实施例42～45任一项所述的装置，所述处理单元用于通过如下方式根据第二矩阵获得联合校验矩阵：
根据信源编码矩阵和所述第二矩阵，获得所述联合校验矩阵。
实施例47.根据实施例46所述的装置，所述处理单元还用于：
确定第一信源编码码率；
根据所述第一信源编码码率，确定所述信源编码矩阵。
实施例48.根据实施例47所述的装置，所述处理单元，还用于根据信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
实施例49.根据实施例47或48所述的装置，所述处理单元用于通过如下方式根据所述第一信源编码码率，确定所述信源编码矩阵：
根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵；
根据所述信源编码基矩阵，确定所述信源编码矩阵。
实施例50.根据实施例49所述的装置，所述处理单元用于通过如下方式根据所述第一信源编码码率以及信道编码基矩阵，确定所述信源编码基矩阵：
确定所述第一信源编码码率对应的提升系数所属的集合编号；
确定所述集合编号所对应的第一信道编码基矩阵；
将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
实施例51.根据实施例50所述的装置，所述处理单元用于通过如下方式对所述第二信道编码基矩阵的行和/或列进行裁剪：
保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
实施例52.根据实施例51所述的装置，N 1＝22。
实施例53.根据实施例51或52所述的装置，
如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
实施例54.一种信息处理装置，包括：
处理单元，用于确定第一信源编码码率；
所述处理单元，还用于根据所述第一信源编码码率，确定信源编码矩阵；
所述处理单元，还用于根据所述信源编码矩阵对接收的第二信息进行译码。
实施例55.根据实施例54所述的装置，所述装置还包括收发单元，用于接收所述第二信息。
实施例56.根据实施例54或55所述的装置，所述处理单元，还用于根据信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
实施例57.根据实施例54～56任一项所述的方法，所述处理单元用于通过如下方式根据所述第一信源编码码率，确定信源编码矩阵：
根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵；
根据所述信源编码基矩阵，确定所述信源编码矩阵。
实施例58.根据实施例57所述的装置，所述处理单元用于通过如下方式根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵：
确定所述第一信源编码码率对应的提升系数所属的集合编号；
确定所述集合编号所对应的第一信道编码基矩阵；
将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
实施例59.根据实施例58所述的装置，所述处理单元用于通过如下方式对所述第二信道编码基矩阵的行和/或列进行裁剪：
保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
实施例60.根据实施例59所述的装置，N 1＝22。
实施例61.根据实施例59或60所述的装置，
如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
实施例62.根据实施例54～61任一项所述的装置，所述处理单元用于通过如下方式根据所述信源编码矩阵对接收的第二信息进行译码：
根据所述信源编码矩阵确定联合校验矩阵；
根据所述联合校验矩阵对所述第二信息进行译码。
实施例63.根据实施例62所述的装置，所述处理单元用于通过如下方式根据所述信源编码矩阵确定联合校验矩阵：
根据所述信源编码矩阵和第二矩阵，确定所述联合校验矩阵，所述第二矩阵是根据单位矩阵得到的矩阵。
实施例64.根据实施例63所述的装置，所述第二矩阵是将所述单位矩阵通过搜索算法处理后得到的。
实施例65.根据实施例63所述的装置，所述处理单元还用于：
通过搜索算法处理所述单位矩阵，得到第三矩阵；
根据所述第三矩阵得到所述第二矩阵，其中，所述第二矩阵对应的信源码长大于所述 第三矩阵对应的信源码长。
实施例66.一种装置，包含用于执行本申请任一实施例所介绍的方法的单元。
实施例67.一种计算机程序产品，所述计算机程序产品包括计算机程序，当所述计算机程序在计算机上运行时，使得所述计算机执行如实施例1～9中任一项所述的方法，或使得所述计算机执行如实施例10～20中任一项所述的方法，或使得所述计算机执行如实施例21～31任一项所述的方法。

Claims (24)

  1. 一种信息处理方法，其特征在于，包括：
    确定第一信源编码码率；
    根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵；
    将信源序列输入所述信源编码矩阵，以对所述信源序列进行信源编码。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    根据所述信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
  3. 根据权利要求1或2所述的方法，其特征在于，根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码矩阵，包括：
    根据所述第一信源编码码率以及所述信道编码基矩阵，确定信源编码基矩阵；
    根据所述信源编码基矩阵，确定所述信源编码矩阵。
  4. 根据权利要求3所述的方法，其特征在于，根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵，包括：
    确定所述第一信源编码码率对应的提升系数所属的集合编号；
    确定所述集合编号所对应的第一信道编码基矩阵；
    将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
    对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
  5. 根据权利要求4所述的方法，其特征在于，对所述第二信道编码基矩阵的行和/或列进行裁剪，包括：
    保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
    保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
  6. 根据权利要求5所述的方法，其特征在于，N 1＝22。
  7. 根据权利要求5或6所述的方法，其特征在于，
    如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
    如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
  8. 根据权利要求1～7任一项所述的方法，其特征在于，所述方法还包括：
    通过第一矩阵，对所述信源编码矩阵输出的比特进行信道编码，其中，所述信源编码矩阵的输出维度与所述第一矩阵的输入维度相等。
  9. 根据权利要求8所述的方法，其特征在于，通过第一矩阵，对所述信源编码矩阵输出的比特进行信道编码，包括：
    通过第二矩阵打乱所述信源编码矩阵输出的比特；
    通过所述第一矩阵对打乱后的比特进行信道编码。
  10. 一种信息处理方法，其特征在于，包括：
    根据第二矩阵获得联合校验矩阵，所述第二矩阵是根据单位矩阵得到的矩阵；
    根据所述联合校验矩阵对接收的第二信息进行译码。
  11. 根据权利要求10所述的方法，其特征在于，所述第二矩阵是将所述单位矩阵通过搜索算法处理后得到的。
  12. 根据权利要求11所述的方法，其特征在于，所述方法还包括：
    通过搜索算法处理所述单位矩阵，得到第三矩阵；
    根据所述第三矩阵得到所述第二矩阵，其中，所述第二矩阵对应的信源码长大于所述第三矩阵对应的信源码长。
  13. 根据权利要求10～12任一项所述的方法，其特征在于，根据第二矩阵获得联合校验矩阵，包括：
    根据信源编码矩阵和所述第二矩阵，获得所述联合校验矩阵。
  14. 根据权利要求13所述的方法，其特征在于，所述方法还包括：
    确定第一信源编码码率；
    根据所述第一信源编码码率，确定所述信源编码矩阵。
  15. 根据权利要求14所述的方法，其特征在于，所述方法还包括：
    根据信源序列的熵率以及信源码长，从第一信息中确定所述第一信源编码码率，所述第一信息包括信源编码码率与信源码长以及熵率之间的对应关系，且所述第一信息包括的信源编码码率的数量大于6。
  16. 根据权利要求14或15所述的方法，其特征在于，根据所述第一信源编码码率，确定所述信源编码矩阵，包括：
    根据所述第一信源编码码率以及信道编码基矩阵，确定信源编码基矩阵；
    根据所述信源编码基矩阵，确定所述信源编码矩阵。
  17. 根据权利要求16所述的方法，其特征在于，根据所述第一信源编码码率以及信道编码基矩阵，确定所述信源编码基矩阵，包括：
    确定所述第一信源编码码率对应的提升系数所属的集合编号；
    确定所述集合编号所对应的第一信道编码基矩阵；
    将所述第一信道编码基矩阵进行转置，得到第二信道编码基矩阵；
    对所述第二信道编码基矩阵的行和/或列进行裁剪，得到所述信源编码基矩阵。
  18. 根据权利要求17所述的方法，其特征在于，对所述第二信道编码基矩阵的行和/或列进行裁剪，包括：
    保留所述第二信道编码基矩阵的前N 1行，N 1为小于或等于所述第二信道编码基矩阵的总行数的正整数；和/或，
    保留所述第二信道编码基矩阵的N 2列，N 2为小于或等于所述第二信道编码基矩阵的总列数的正整数。
  19. 根据权利要求18所述的方法，其特征在于，N 1＝22。
  20. 根据权利要求18或19所述的方法，其特征在于，
    如果N 2小于或等于第一值，所述N 2列为所述第二信道编码基矩阵的第13列至第N 2+12列；或，
    如果N 2大于第一值，所述N 2列为所述第二信道编码基矩阵的第46-N 2列至第45列。
  21. 一种信息处理设备，其特征在于，包括：
    一个或多个处理器；
    一个或多个存储器；
    以及一个或多个计算机程序，其中所述一个或多个计算机程序被存储在所述一个或多个存储器中，所述一个或多个计算机程序包括指令，当所述指令被所述信息处理设备的一个或多个处理器执行时，使得所述信息处理设备执行如权利要求1～9中任一项所述的方法。
  22. 一种信息处理设备，其特征在于，包括：
    一个或多个处理器；
    一个或多个存储器；
    以及一个或多个计算机程序，其中所述一个或多个计算机程序被存储在所述一个或多个存储器中，所述一个或多个计算机程序包括指令，当所述指令被所述信息处理设备的一个或多个处理器执行时，使得所述信息处理设备执行如权利要求10～20中任一项所述的方法。
  23. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质用于存储计算机程序，当所述计算机程序在计算机上运行时，使得所述计算机执行如权利要求1～9中任一项所述的方法，或使得所述计算机执行如权利要求10～20中任一项所述的方法。
  24. 一种芯片，其特征在于，包括一个或多个处理器和通信接口，所述一个或多个处理器用于读取指令，以执行如权利要求1～9中任一项所述的方法，或执行如权利要求10～20中任一项所述的方法。
PCT/CN2022/127004 2021-11-23 2022-10-24 一种信息处理方法及设备 WO2023093411A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP22897494.5A EP4422079A1 (en) 2021-11-23 2022-10-24 Information processing method, and device
US18/670,138 US20240322939A1 (en) 2021-11-23 2024-05-21 Information processing method and device

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN202111395441 2021-11-23
CN202111395441.2 2021-11-23
CN202210045064.8 2022-01-14
CN202210045064.8A CN116156550A (zh) 2021-11-23 2022-01-14 一种信息处理方法及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/670,138 Continuation US20240322939A1 (en) 2021-11-23 2024-05-21 Information processing method and device

Publications (1)

Publication Number Publication Date
WO2023093411A1 true WO2023093411A1 (zh) 2023-06-01

Family

ID=86354967

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/127004 WO2023093411A1 (zh) 2021-11-23 2022-10-24 一种信息处理方法及设备

Country Status (4)

Country Link
US (1) US20240322939A1 (zh)
EP (1) EP4422079A1 (zh)
CN (1) CN116156550A (zh)
WO (1) WO2023093411A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109478894A (zh) * 2016-08-19 2019-03-15 华为技术有限公司 一种ldpc码的基矩阵生成方法、编译码方法及设备
CN111211790A (zh) * 2020-02-25 2020-05-29 重庆邮电大学 一种面向5g终端的高吞吐率ldpc译码算法及架构
CN113037295A (zh) * 2019-12-09 2021-06-25 中兴通讯股份有限公司 一种ldpc码基础矩阵剪裁方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109478894A (zh) * 2016-08-19 2019-03-15 华为技术有限公司 一种ldpc码的基矩阵生成方法、编译码方法及设备
CN113037295A (zh) * 2019-12-09 2021-06-25 中兴通讯股份有限公司 一种ldpc码基础矩阵剪裁方法及装置
CN111211790A (zh) * 2020-02-25 2020-05-29 重庆邮电大学 一种面向5g终端的高吞吐率ldpc译码算法及架构

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"Master's Thesis", 1 April 2017, XIAMEN UNIVERSITY, CN, article CHEN, CHIANG: "Hardware Implementation and Improvement of Joint Source and Channel Coding Based on Double Protograph LDPC", pages: 1 - 71, XP009545871 *
GOLMOHAMMADI AHMAD, MITCHELL DAVID G. M.: "Concatenated Spatially Coupled LDPC Codes With Sliding Window Decoding for Joint Source-Channel Coding", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ. USA., vol. 70, no. 2, 1 February 2022 (2022-02-01), PISCATAWAY, NJ. USA. , pages 851 - 864, XP093068232, ISSN: 0090-6778, DOI: 10.1109/TCOMM.2021.3126750 *

Also Published As

Publication number Publication date
CN116156550A (zh) 2023-05-23
US20240322939A1 (en) 2024-09-26
EP4422079A1 (en) 2024-08-28

Similar Documents

Publication Publication Date Title
WO2019158031A1 (zh) 编码的方法、译码的方法、编码设备和译码设备
WO2014000514A1 (zh) 设备间通信方法、用户设备和基站
CN111385059B (zh) 极化编码调制的方法和装置
WO2018137663A1 (zh) 一种编码方法、译码方法、编码装置及译码装置
JP2021184638A (ja) 方法及び装置
CN113114410A (zh) 数据处理方法、配置方法及通信设备
US20200059249A1 (en) Method for polar code transmission with partial information and devices using the same
WO2020147526A1 (zh) 一种级联crc码的极化码编码方法及装置
EP3444984B1 (en) Data transmission method, data receiving method, transmission apparatus, and receiving apparatus
WO2022111575A1 (zh) 传输数据的方法以及装置
WO2019021225A1 (en) IMPROVED INFORMATION SEQUENCES FOR POLAR CODES
WO2023093411A1 (zh) 一种信息处理方法及设备
WO2016188406A1 (en) System and method of header compression for online network codes
WO2023273975A1 (zh) 一种数据传输方法和通信装置
WO2022188710A1 (zh) 极化编码调制、解调译码的方法和装置
WO2022268130A1 (zh) 一种网络编码方法及装置
US20200220560A1 (en) Enhanced Information Sequences for Polar Codes
WO2022117061A1 (zh) 一种极化码辅助比特的确定方法和装置
WO2021249080A1 (zh) 编码方法及装置
CN113965208A (zh) 极化码译码方法与装置、译码器和通信设备
CN115549849A (zh) 数据处理方法及装置
WO2024119379A1 (zh) 一种信息比特的确定方法及装置
WO2023051741A1 (zh) 通信方法及装置
WO2023040668A1 (zh) 编码方法、译码方法以及相关装置
WO2024149188A1 (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: 22897494

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2022897494

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2022897494

Country of ref document: EP

Effective date: 20240523

NENP Non-entry into the national phase

Ref country code: DE