Communication method, communication equipment, communication device and computer readable storage medium

Abstract

The invention relates to a communication method, communication equipment, a communication device and a computer readable storage medium. The method includes determining a lifting factor from a lifting factor set based on the length of an information bit sequence and a basis matrix. The lifting factor set comprises a prime number and a multiple set associated with the prime number, or the lifting factor set comprises a plurality of lifting factors, and the lifting factor in the plurality of lifting factors is a product of the prime number and multiple in the multiple set associated with the prime number. A multiple in the multiple set is a positive integer, and the multiple set comprises a value not equal to Ax, A is a positive integer equal to or greater than 2, and x is a non-negative integer. And determining a check matrix based on the lifting factor and the basic matrix, the check matrix being used for encoding or decoding the information bit sequence.

Description

Communication method, communication equipment, communication device and computer-readable storage medium Technical Field

[0001] The present disclosure relates to the field of communications, and more particularly to a communication method, a communication device, a communication apparatus, a computer-readable storage medium, and a computer program product for channel coding and decoding. Background Art

[0002] Low-density parity check (LDPC) codes are widely used in channel coding and decoding. Currently, during the encoding and decoding process of LDPC codes, a parity check matrix is ​​generated based on a predetermined base matrix, a set of lifting factors, and a set of shift values. Coding and decoding are then performed based on the parity check matrix. With the advancement of communication technology, future scenarios will require support for longer code lengths. If the current design of lifting factors and shift values ​​is used, stable coding and decoding performance cannot be guaranteed.

[0003] Summary of the Invention

[0004] In view of the above problems, the embodiments of the present disclosure aim to provide a communication solution to optimize the design of a set of lifting factors so as to ensure stable encoding and decoding performance for longer coding lengths in future scenarios.

[0005] According to a first aspect of an embodiment of the present disclosure, a communication method is provided. The method can be performed by a transmitting device or a receiving device. The method comprises: determining a lifting factor from a lifting factor set based on the length of an information bit sequence and a base matrix, wherein the lifting factor set comprises a prime number and a set of multiples associated with the prime number, or the lifting factor set comprises a plurality of lifting factors, wherein a lifting factor in the plurality of lifting factors is a product of the prime number and a multiple in a set of multiples associated with the prime number, wherein the multiples in the set of multiples are positive integers, and the set of multiples comprises a number not equal to A. x , where A is a positive integer equal to or greater than 2, and x is a non-negative integer; and a check matrix is ​​determined based on the lifting factors and the base matrix, the check matrix being used for encoding or decoding the information bit sequence. Thus, a set of lifting factors based on a set of prime numbers and non-exponential multiples can be specified, so that the number of shortened bits does not increase exponentially with increasing code length, thereby achieving more stable encoding and decoding performance.

[0006] In some embodiments, the method further includes: the base matrix is ​​one of a plurality of base matrices; based on at least one of the length, code length, or code rate of the information bit sequence, determining the base matrix from the plurality of base matrices, wherein a base matrix in the plurality of base matrices corresponds to a lifting factor set in a plurality of lifting factor sets; and determining the lifting factor set corresponding to the base matrix based on the base matrix. Thus, an appropriate base matrix and lifting factor set can be selected according to the usage scenario to meet the needs of different scenarios.

[0007] In some embodiments, the maximum value in the set of multiples is determined based on the maximum value of the lifting factor and the prime number; or the maximum value in the set of multiples is determined based on the maximum length of the information bit sequence, the number of information columns of the base matrix corresponding to the maximum length, and the prime number. Thus, the maximum value in the set of multiples in the set of lifting factors can be specified or stored.

[0008] In some embodiments, the maximum value in the set of multiples is associated with at least one of: a communication service type corresponding to the information bit sequence; or a hardware resource limitation. Thus, the maximum value in the set of multiples in the boosting factor set may not be specified or stored.

[0009] In some embodiments, determining the lifting factor includes: the prime number being one of a plurality of prime numbers; determining a minimum multiple corresponding to each of the plurality of prime numbers corresponding to a plurality of lifting factor sets based on at least one of the encoding length of the information bit sequence or the information column length of the base matrix; and determining the lifting factor based on the minimum value of the product of each prime number and the corresponding minimum multiple. Thus, in the case where a maximum value of the lifting factor is not specified or the maximum value of the lifting factor is set to a very large number, an appropriate lifting factor can be determined to achieve rate matching.

[0010] In some embodiments, a minimum value among a plurality of prime numbers corresponding to a plurality of lifting factor sets is associated with at least one of the following: the number of columns in a core portion of the base matrix, the core portion including information columns and core check columns of the base matrix; a connection relationship between the columns in the core portion of the base matrix; the number of rows in the core portion of the base matrix; or a connection relationship between the rows in the core portion of the base matrix. Thus, a minimum value among a plurality of prime numbers corresponding to a plurality of lifting factor sets can be specified.

[0011] In some embodiments, the connection relationship between columns in the core portion of the fundamental matrix includes: two columns grouped in the same group satisfy a quasi-orthogonal condition. In some embodiments, the connection relationship between rows in the core portion of the fundamental matrix includes: two rows grouped in the same group satisfy a quasi-orthogonal condition. Thus, grouping of the core portion of the fundamental matrix can be achieved.

[0012] In some embodiments, the method further includes: determining, based on a communication service type corresponding to the information bit sequence, a boosting factor set corresponding to the communication service type, the communication service type including enhanced mobile broadband (eMBB), massive machine type communication (mMTC), ultra-reliable low latency communication (URLLC), or high throughput. Thus, a boosting factor set can be selected based on the scenario to better meet scenario requirements.

[0013] In some embodiments, determining the boosting factor set includes: if the communication service type is the high throughput type, determining that the prime numbers corresponding to the boosting factor set include 23, 31, or 37; or if the communication service type is the URLLC type, determining that the prime numbers corresponding to the boosting factor set include 11. Thus, prime numbers in the boosting factor sets for the high throughput type and the URLLC type can be specified.

[0014] In some embodiments, the plurality of prime numbers corresponding to the plurality of lifting factor sets include at least one of the following: consecutive prime numbers; or non-consecutive prime numbers with intervals greater than a predetermined value. Thus, the value selection method of the plurality of prime numbers corresponding to the plurality of lifting factor sets can be specified.

[0015] In some embodiments, the consecutive prime numbers include {11, 13, 17, 19, 23}; or the non-consecutive prime numbers with an interval greater than a predetermined value include {11, 17, 23}. Thus, some values ​​of the plurality of prime numbers corresponding to the plurality of lifting factor sets can be specified.

[0016] In some embodiments, the set of multiples includes at least one of the following: consecutive integers separated by a predetermined interval; a set of integers that satisfy a piecewise linear function; a range of multiples; or a number within the range that is not selected as a multiple. Thus, the method for determining the values ​​of the elements in the set of multiples corresponding to the lifting factor set can be specified.

[0017] In some embodiments, the method further comprises: determining two prime numbers corresponding to the lifting factor; and selecting the smallest prime number from the two prime numbers. In this way, better cycle properties can be ensured, achieving more stable encoding and decoding performance.

[0018] In some embodiments, the lifting factor set also includes a non-prime number, wherein the non-prime number includes at least one of the following: 4, 6, 9, 15, 22, or 26. Thus, by combining non-prime numbers with prime numbers, different code lengths can be better supported. For example, for code lengths shorter than or equal to a threshold length, a non-prime number can be used. For code lengths longer than or equal to the threshold length, a prime number can be used.

[0019] In some embodiments, the lifting factor set further includes an index associated with the prime number, so that the translation value set can be searched by the index.

[0020] In some embodiments, the method further includes: determining that the lifting factor corresponds to multiple indices; and selecting the index corresponding to the smallest prime number among the prime numbers corresponding to the multiple indices. Thus, under the condition that the lifting factor is fixed, the smallest prime number can be selected to ensure better cycle properties and achieve more stable encoding and decoding performance.

[0021] In some embodiments, the set of multiples associated with a first index does not include a prime number associated with a second index, the second index being smaller than the first index; or the set of multiples associated with a first prime number does not include a second prime number, the second prime number being smaller than the first prime number. Thus, by deleting some elements from the set of multiples, there can be no duplicate elements between the multiple lifting factor sets.

[0022] According to a second aspect of an embodiment of the present disclosure, a communication device is provided. The device includes: a first processing component configured to determine a lifting factor from a lifting factor set based on the length of an information bit sequence and a base matrix, wherein the lifting factor set includes a prime number and a set of multiples associated with the prime number, or the lifting factor set includes multiple lifting factors, wherein a lifting factor in the multiple lifting factors is a product of the prime number and a multiple in a set of multiples associated with the prime number, wherein the multiples in the set of multiples are positive integers, and the set of multiples includes a number not equal to A. x A value of , wherein A is a positive integer equal to or greater than 2, and x is a non-negative integer; and a second processing component configured to determine a check matrix based on the lifting factor and the basic matrix, wherein the check matrix is ​​used for encoding or decoding the information bit sequence.

[0023] In some embodiments, the apparatus further includes: a third processing component configured to determine the base matrix from a plurality of base matrices based on at least one of the length, coding length, or coding rate of the information bit sequence, wherein the base matrix in the plurality of base matrices corresponds to a lifting factor set in a plurality of lifting factor sets; and a fourth processing component configured to determine the lifting factor set corresponding to the base matrix based on the base matrix.

[0024] In some embodiments, the maximum value in the set of multiples is determined based on the maximum value of the lifting factor and the prime number; or wherein the maximum value in the set of multiples is determined based on the maximum length of the information bit sequence, the number of information columns of the basic matrix corresponding to the maximum length, and the prime number.

[0025] In some embodiments, the maximum value in the set of multiples is associated with at least one of: a communication service type corresponding to the information bit sequence; or a hardware resource limitation.

[0026] In some embodiments, the first processing component includes: a component for determining the minimum multiple corresponding to each of a plurality of prime numbers corresponding to a plurality of lifting factor sets based on at least one of the coding length of the information bit sequence or the information column length of the basic matrix; and a component for determining the lifting factor based on the minimum value of the product of each prime number and the corresponding minimum multiple.

[0027] In some embodiments, the minimum value of multiple prime numbers corresponding to multiple sets of lifting factors is associated with at least one of the following: the number of columns in the core part of the base matrix, the core part including the information column and the core check column of the base matrix; the connection relationship between the columns in the core part of the base matrix; the number of rows in the core part of the base matrix; or the connection relationship between the rows in the core part of the base matrix.

[0028] In some embodiments, the connection relationship between columns in the core portion of the fundamental matrix includes: two columns grouped in the same group satisfy a quasi-orthogonal condition. In some embodiments, the connection relationship between rows in the core portion of the fundamental matrix includes: two rows grouped in the same group satisfy a quasi-orthogonal condition. Thus, grouping of the core portion of the fundamental matrix can be achieved.

[0029] In some embodiments, the device also includes: a fifth processing component, configured to determine the set of boosting factors corresponding to the communication service type based on the communication service type corresponding to the information bit sequence, the communication service type including eMBB type, URLLC type or high throughput type.

[0030] In some embodiments, the fifth processing component includes: a component for determining that the prime numbers corresponding to the lifting factor set include 23, 31 or 37 when the communication service type is the high throughput type; or a component for determining that the prime numbers corresponding to the lifting factor set include 11 when the communication service type is the URLLC type.

[0031] In some embodiments, the plurality of prime numbers corresponding to the plurality of lifting factor sets include at least one of the following: consecutive prime numbers; or non-consecutive prime numbers with an interval greater than a predetermined value.

[0032] In some embodiments, the consecutive prime numbers include {11, 13, 17, 19, 23}; or the non-consecutive prime numbers wherein the interval is greater than a predetermined value include {11, 17, 23}.

[0033] In some embodiments, the set of multiples includes at least one of: consecutive integers separated by a predetermined interval; a set of integers that satisfy a piecewise linear function; a range of multiples; or a number within the range that is not selected as the multiple.

[0034] In some embodiments, the apparatus further comprises: a sixth processing component configured to determine two prime numbers corresponding to the lifting factor; and a seventh processing component configured to select a smallest prime number from the two prime numbers.

[0035] In some embodiments, the set of lifting factors further includes a non-prime number, wherein the non-prime number includes at least one of the following: 4, 6, 9, 15, 22, or 26.

[0036] In some embodiments, the lifting factor set further includes: an index associated with the prime number.

[0037] In some embodiments, the apparatus further comprises: an eighth processing component configured to determine that the lifting factors correspond to a plurality of indexes; and a ninth processing component configured to select an index corresponding to a smallest prime number among a plurality of prime numbers corresponding to the plurality of indexes.

[0038] In some embodiments, the set of multiples associated with a first index does not include a value for a prime number associated with a second index, the second index being smaller than the first index; or the set of multiples associated with a first prime number does not include a value for a second prime number, the second prime number being smaller than the first prime number.

[0039] According to a third aspect of the present disclosure, a communication device is provided, comprising a processor and a memory, wherein the memory comprises computer program code, which, when executed by the processor, enables the method according to the first aspect to be executed.

[0040] According to a fourth aspect of the embodiments of the present disclosure, a computer-readable storage medium is provided, wherein the computer-readable storage medium includes machine-executable instructions, and when the machine-executable instructions are executed by a device, the method according to the first aspect is executed.

[0041] According to a fifth aspect of an embodiment of the present disclosure, a chip is provided, comprising a memory and a processor, wherein the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory so that the method described in the first aspect is executed.

[0042] According to a sixth aspect of the present disclosure, a computer program product is provided, comprising computer program code, which, when executed by a device, enables the method according to the first aspect to be performed.

[0043] According to a seventh aspect of an embodiment of the present disclosure, a communication system is provided. The communication system includes a transmitting device and a receiving device. The transmitting device encodes an information bit sequence to be transmitted by executing the method according to the first aspect. The receiving device decodes the received encoded information bit sequence by executing the method according to the first aspect.

[0044] It will be understood from the following description of example embodiments that, according to the technical solution proposed herein, it is possible to prevent the number of shortened bits from increasing exponentially with increasing code length, thereby achieving more stable encoding and decoding performance.

[0045] It should be understood that the contents described in the Summary of the Invention section are not intended to limit the key or important features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become readily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, wherein:

[0047] FIG1 illustrates a schematic diagram of an example communication system in which embodiments of the present disclosure may be implemented;

[0048] FIG2 is a schematic diagram showing an information transmission process in which an embodiment of the present disclosure may be implemented;

[0049] FIG3 is a schematic diagram showing the structure of a basic matrix in which embodiments of the present disclosure may be implemented;

[0050] FIG4 shows a schematic diagram of a set of boosting factors according to a conventional solution;

[0051] FIG5 is a schematic diagram showing a set of translation values ​​according to a conventional solution;

[0052] FIG6A shows a schematic diagram of an exemplary boosting factor set according to an embodiment of the present disclosure;

[0053] FIG6B shows a schematic diagram of another exemplary boosting factor set according to an embodiment of the present disclosure;

[0054] FIG6C shows a schematic diagram of another exemplary boosting factor set according to an embodiment of the present disclosure;

[0055] FIG7 shows a schematic diagram of a communication process according to an embodiment of the present disclosure;

[0056] FIG8 is a schematic diagram showing an example process of determining a set of boosting factors according to an embodiment of the present disclosure;

[0057] FIG9A is a schematic diagram showing simulation results of the change in the number of shortened bits according to an embodiment of the present disclosure as the length of the information bit sequence changes;

[0058] FIG9B is a schematic diagram showing another simulation result of the variation of the shortened bit number with the length of the information bit sequence according to an embodiment of the present disclosure;

[0059] FIG10 is a schematic diagram showing simulation results of the relationship between the maximum value of the lifting factor supported by hardware and the maximum information bit sequence length actually supported according to an embodiment of the present disclosure;

[0060] FIG11 is a flowchart of a communication method according to an embodiment of the present disclosure;

[0061] FIG12 shows a schematic block diagram of a communication device according to an embodiment of the present disclosure; and

[0062] FIG13 illustrates a simplified block diagram of a communication device suitable for implementing embodiments of the present disclosure. DETAILED DESCRIPTION

[0063] The following describes embodiments of the present disclosure in more detail with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments described herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of protection of the present disclosure.

[0064] In the description of the embodiments of the present disclosure, the term "including" and similar terms should be understood as open inclusion, that is, "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first", "second", etc. can refer to different or the same objects. The term "and / or" means at least one of the two items it is associated with. For example, "A and / or B" means A, B, or A and B. Other explicit and implicit definitions may also be included below.

[0065] It should be understood that the technical solutions provided in the embodiments of the present application may not be repeated in some of the following specific embodiments, but these specific embodiments should be considered as having been referenced to each other and can be combined with each other.

[0066] As used herein, the term "circuitry" refers to one or more of the following:

[0067] (a) hardware circuit implementations only (such as analog and / or digital circuit implementations only); and

[0068] (b) combinations of hardware circuitry and software, such as, as applicable: (i) analog and / or digital hardware circuitry and software / firmware, and (ii) any portion of a hardware processor and software (including a digital signal processor, software, and memory that work together to enable an apparatus such as an optical line terminal (OLT) or other computing device to perform various functions); and

[0069] (c) Hardware circuits and / or processors, such as a microprocessor or portion of a microprocessor, that require software (eg, firmware) for operation but can operate without software when no software is needed for operation.

[0070] The definition of "circuitry" applies to all uses of this term in this application, including in any claims. As another example, the term "circuitry" as used herein also covers an implementation of a hardware circuit or processor (or multiple processors), or a portion of a hardware circuit or processor, or accompanying software or firmware. For example, the term "circuitry" also covers a baseband integrated circuit or processor integrated circuit or a similar integrated circuit in an OLT or other computing device, if applicable to the particular claim element.

[0071] As used herein, the term "end device" refers to any device with wireless or wired communication capabilities. Examples of end devices include, but are not limited to, customer premise equipment (CPE), user equipment (UE), personal computers, desktop computers, mobile phones, cellular phones, smartphones, personal digital assistants (PDAs), portable computers, tablets, wearable devices, IoT devices, machine type communication (MTC) devices, in-vehicle devices for vehicle-to-everything (V2X) communications (where X refers to pedestrians, vehicles, or infrastructure / network), or image capture devices such as digital cameras, gaming devices, music storage and playback devices, or Internet devices capable of wireless or wired Internet access and browsing, etc.

[0072] In addition, the term "access network equipment" may refer to a node in a radio access network (RAN) that is capable of providing or hosting a cell or coverage area in which a terminal device can communicate. Examples of access network equipment include, but are not limited to, a NodeB (NodeB or NB), an evolved NodeB (eNodeB), a next generation NodeB (gNB), a transmission reception point (TRP), a remote radio unit (RRU), a radio head (RH), a remote radio head (RRH), low power nodes such as a femto node, a pico node, etc.

[0073] In addition, the term "core network device" may refer to a node in the core network (CN), which may have control plane functions or user plane functions, or both. Examples of core network devices include, but are not limited to, session management function (SMF), access management function (AMF), policy control function (PCF), user plane function (UPF), network exposure function (NEF), application function (AF), etc.

[0074] In this application, "sending information to...(terminal)" can be understood as the destination of the information being the terminal. This can include sending information directly or indirectly to the terminal. "Receiving information from...(terminal)" can be understood as the source of the information being the terminal, and can include receiving information directly or indirectly from the terminal. For example, directly sending information to the terminal can mean that the information is sent to the terminal via the air interface, and indirectly sending information to the terminal can mean that the information is processed before being sent over the air interface (for example, the information is processed in the processor of the transmitting end and then output). Similarly, directly receiving information from the terminal can mean that the information from the terminal is received by the receiving end via the air interface, and indirectly receiving information from the terminal can mean that the information from the terminal is transmitted over the air interface and processed (for example, the information is received by the antenna, undergoes RF processing, etc.), and then input into the processor of the receiving end, or is received by the processor of the receiving end. "Sending information to...(access network device / network device)" can be understood as the destination of the information being the access network device / network device. This can include sending information directly or indirectly to the access network device / network device. "Receiving information from... (access network device / network device)" can be understood as the source of the information being the access network device / network device, and can include receiving information directly or indirectly from the access network device / network device. For example, directly sending information to the access network device / network device can mean that the information is sent to the access network device / network device via the air interface, and indirectly sending information to the access network device / network device can mean that the information is processed before being sent over the air interface (for example, the information is processed in the processor of the sending end and then output). Similarly, directly receiving information from the access network device / network device can mean that the information from the access network device / network device is received by the receiving end via the air interface, and indirectly receiving information from the access network device / network device can mean that the information from the access network device / network device is transmitted over the air interface and processed (for example, the information is received by the antenna, undergoes radio frequency processing, etc.), and then input into the processor of the receiving end, or is received by the processor of the receiving end. The information may undergo necessary processing between the source and destination of the information, such as format changes, but the destination can understand the valid information from the source. Similar expressions in this application can be understood similarly and will not be repeated here.

[0075] In the context of the present disclosure, the information bit sequence may be an information bit sequence to be encoded (or payload bits), or the information bit sequence may be an information bit sequence after concatenation coding, for example, the information bit sequence may include cyclic redundancy check (CRC) bits. In some embodiments, the length of the information bit sequence may be the length of the information bit sequence to be encoded. In some embodiments, the length of the information bit sequence may be the length of the information bit sequence after concatenation coding. For example, the length of the information bit sequence may be the length of the information bit sequence including CRC bits. In the context of the present disclosure, the terms "information bits" and "information bit sequence" may be used interchangeably.

[0076] In the context of the present disclosure, the term "check matrix" refers to a matrix used for encoding or decoding an information bit sequence. The term "check matrix" can be used interchangeably with "encoding matrix" or "decoding matrix" or "Tanner graph". Of course, the check matrix can also be used by other names. In the context of the present disclosure, the term "communication service type" can be used interchangeably with "communication service scenario", "communication scenario", "scenario", "type", "communication type" or "service type". In the context of the present disclosure, the term "basic matrix" and "base graph (BG)" can be used interchangeably. The term "lifting factor" can be used interchangeably with "extension factor", "lifting value", "extension value", "extension coefficient" or "lifting size".

[0077] In the context of the present disclosure, the term "Tanner graph" refers to the matrix obtained by quasi-cyclic (QC) expansion of the base graph by the lifting factor. The term "cycle" refers to a structure in the Tanner graph that starts from a vertex, follows non-repeated edges, passes through non-repeated vertices, and finally returns to the starting point. The term "short cycle" refers to a cycle of shorter length. The term "girth" refers to the length of the shortest cycle in the Tanner graph. The term "cycle property" refers to the existence of short cycles, the number of short cycles and / or the structural properties between short cycles. Good cycle properties may mean that at least one of the following is met: the girth is large (for example, at least there are no 4 cycles), the number of short cycles is small (for example, 6 cycles or 8 cycles), or the distance between short cycles is large (for example, 6 cycles and 8 cycles overlap by at most one variable node).

[0078] As mentioned above, during both encoding and decoding, a parity check matrix must be generated based on a predetermined base matrix, a set of lifting factors, and a set of shift values. However, the lifting factors in the current lifting factor set increase exponentially with increasing code length. Due to rate matching, the number of shortened bits also increases exponentially. Consequently, the degree distribution is compromised, the integrity of the base matrix is ​​compromised, and performance suffers.

[0079] In view of this, an embodiment of the present disclosure proposes a scheme for designing a lifting factor set based on a prime number and a set of multiples in a non-exponential form. In one aspect, the lifting factor set may include a prime number and a set of multiples associated with the prime number. In another aspect, the lifting factor set may include multiple lifting factors, wherein the lifting factors in the multiple lifting factors are the product of the prime number and the multiples in the set of multiples associated with the prime number. The multiples in the set of multiples are positive integers, and the set of multiples includes multiples not equal to A. x The value of , where A is a positive integer equal to or greater than 2, and x is a non-negative integer.

[0080] Accordingly, embodiments of the present disclosure provide a coding scheme implemented at a transmitting device. In this coding scheme, the transmitting device can determine a lifting factor from the aforementioned set of prime-based lifting factors based on the length of the information bit sequence and a base matrix. Based on the lifting factor and the base matrix, the transmitting device can determine a parity check matrix for use in encoding the information bit sequence.

[0081] Embodiments of the present disclosure also provide a decoding scheme implemented at a receiving device. In this decoding scheme, the receiving device can determine a lifting factor from the aforementioned set of prime-number-based lifting factors based on the length of the information bit sequence and a base matrix. Based on the lifting factor and the base matrix, the receiving device can determine a parity check matrix for use in decoding the information bit sequence.

[0082] According to the solution of the embodiment of the present disclosure, by designing a lifting factor set based on both prime numbers and non-exponential multiples, it is possible to avoid the exponential increase in the number of shortened bits as the code length increases. Therefore, more stable encoding and decoding performance can be achieved.

[0083] For ease of understanding, this solution is described in detail below with reference to the accompanying drawings.

[0084] FIG1 shows a schematic diagram of an example communication system 100 in which embodiments of the present disclosure may be implemented. It should be understood that FIG1 shows a possible, non-limiting system schematic diagram. As shown in FIG1 , the communication system 100 includes a radio access network (RAN) 101, a core network (CN) 102, and optionally, the communication system 100 may also include the Internet 103. The RAN 101 includes at least one RAN node (such as 110a and 110b in FIG1 , collectively referred to as 110) and at least one terminal (such as 120a-120j in FIG1 , collectively referred to as 120). The RAN 101 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment (not shown in FIG1 ). The terminal 120 is connected to the RAN node 110 via a wireless connection. The RAN node 110 is connected to the core network 102 via a wireless or wired connection. The core network equipment in core network 102 and RAN node 110 in RAN 101 can be separate physical devices, or they can be a single physical device that integrates core network logical functions and radio access network logical functions, or they can be a single device that integrates some core network logical functions and some radio access network logical functions. Terminals and RAN nodes can be connected to each other via wired or wireless means. Figure 1 is merely a schematic diagram; the communication system may also include other network devices, such as relay devices and backhaul equipment, which are not shown in Figure 1.

[0085] The RAN 101 may be a cellular system related to the Third Generation Partnership Project (3GPP), such as a 4G or 5G mobile communication system, or a future-oriented evolution system (such as a 6G mobile communication system). The RAN 101 may also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN 101 may also be a communication system that integrates two or more of the above systems.

[0086] RAN node 110, sometimes also referred to as access network equipment, RAN entity, or access node, constitutes part of the communication system and facilitates wireless access for terminals. Multiple RAN nodes 110 in the communication system 100 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative. For example, network element 120i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminal 120j accessing RAN 101 through network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functionality, and network elements 120a-120j can be understood as communication devices with terminal functionality.

[0087] In one possible scenario, a RAN node may be a base station (BS), an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a next generation base station in a sixth generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system. A RAN node may be a macro base station (such as 110a in FIG1 ), a micro base station or an indoor station (such as 110b in FIG1 ), a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, a RAN node may also be a server, a wearable device, a vehicle, or an onboard device. For example, an access network device in vehicle to everything (V2X) technology may be a road side unit (RSU). All or part of the functions of the RAN node in this application may also be implemented by software functions running on hardware, or by virtualized functions instantiated on a platform (such as a cloud platform). The RAN node in this application may also be a logical node, a logical module or software that can implement all or part of the RAN node functions.

[0088] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, and different RAN nodes respectively implement part of the functions of the base station. For example, the RAN node can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU can be set separately, or they can be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0089] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module. The embodiments of this application do not limit the specific technology and specific equipment form adopted by the RAN node.

[0090] A terminal may also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. A terminal may be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, drone, helicopter, airplane, ship, robot, robotic arm, smart home device, etc. The embodiments of the present application do not limit the device form of the terminal.

[0091] The core network 102 may include one or more core network devices (not shown). Examples of core network devices include, but are not limited to, a session management function (SMF), an access management function (AMF), a policy control function (PCF), a user plane function (UPF), a network exposure function (NEF), an application function (AF), and the like.

[0092] The Internet 103 may include one or more servers (not shown) for providing various business services.

[0093] It should be understood that the number of devices in Figure 1 is provided for illustrative purposes and does not imply any limitation on the present application. The communication system 100 may include any suitable number of access network devices and / or core network devices and / or terminal devices suitable for implementing the present application. In addition, the communication system 100 may include more additional components not shown or may omit certain components shown, and the embodiments of the present application are not limited to this. The implementation of the communication system 100 is not limited to the specific examples described above, but may be implemented in any suitable manner.

[0094] The communication devices in the communication system 100 can be compatible with any suitable standard, including but not limited to: global system for mobile communication (GSM), long term evolution (LTE), LTE evolution, LTE-advanced (LTE-A), wideband code division multiple access (WCDMA), code division multiple access (CDMA) system, enhanced data rate for GSM evolution (EDGE) system, etc. In addition, the communication devices in the communication system 100 can perform communication according to any generation of standard communication protocols to be developed in the future, for example, the sixth generation (6G) communication protocol. Examples of communication protocols include but are not limited to first generation (1G), second generation (2G), 2.5G, 2.75G, third generation (3G), fourth generation (4G), 4.5G, fifth generation (5G), and sixth generation communication protocols.

[0095] The embodiments of the present disclosure may be applied to any communication device in the communication system 100, such as the terminal 120, the RAN node 110, a core network device, or a server. In other words, the embodiments of the present disclosure may be applied to a sending device and / or a receiving device during information transmission.

[0096] FIG2 is a schematic diagram of an information transmission process 200 in which embodiments of the present disclosure may be implemented. As shown in FIG2 , information is sent from a source, undergoes source coding, channel coding, modulation, air interface transmission, demodulation, channel decoding, source recovery, and other processing, and arrives at a destination, completing the transmission of information from the source to the destination. The processing shown in the upper layer of FIG2 (including source coding, channel coding, and modulation, etc.) is performed at the transmitting device, and the processing shown in the lower layer (including demodulation, channel decoding, source recovery, etc.) is performed at the receiving device. The embodiments of the present disclosure primarily relate to the encoding or decoding process shown in FIG2 , such as source coding, channel coding, channel decoding, or source recovery.

[0097] Currently, LDPC codes have been selected by the Third Generation Partnership Project (3GPP) as the channel coding scheme for the fifth generation mobile communication technology (5G). LDPC codes are a channel coding scheme that is very close to the Shannon line, offering high performance and low complexity.

[0098] The encoding method of LDPC code is to generate a check matrix. The LDPC code used in mainstream applications has a quasi-cyclic (QC) structure, also known as QC-LDPC code. By setting a translation amount for each block of the basic matrix, a check matrix is ​​generated to avoid bad structures such as short cycles, thereby improving the code distance. The current decoding algorithms for LDPC codes mainly include the minimum sum (MS) decoding algorithm and the belief propagation (BP) decoding algorithm. In terms of decoding performance, the BP decoding algorithm is better, but its information storage volume is large and the calculation method is complex, which is not conducive to hardware implementation. Therefore, the offset MS decoding algorithm and the normalized MS decoding algorithm are actually used in communication systems.

[0099] FIG3 shows a schematic diagram of the structure of a basic matrix 300 in which an embodiment of the present disclosure can be implemented. As shown in FIG3(a), the basic matrix 300 may include a high rate region, an all-zero region, an incremental redundancy region, and a raptor-like region. The high rate region may include part A and part B shown in FIG3(b), where part A corresponds to information bits (or information bits, systematic bits, etc.), and part B is a square matrix corresponding to core parity bits (also called core parity bits). The all-zero region may correspond to part C shown in FIG3(b), which is an all-zero matrix. The incremental redundancy region may correspond to part D in FIG3(b). The raptor-like region may correspond to part E shown in FIG3(b), which may be a unit matrix corresponding to the parity bits of the low rate extension.

[0100] Basic matrix 300 employs a "Laputa-like" structure, allowing for gradual expansion to lower bit rates using a high-bitrate core matrix. In practical applications, as shown in Figure 3(a), the first X rows and Y columns of the basic matrix can be truncated. As the bit rate decreases, X and Y increase, and the area of ​​the matrix used also expands.

[0101] The core rows of the basic matrix 300 refer to the rows corresponding to the core check bits. In other words, the core rows are the rows corresponding to the high code rate area. The core columns of the basic matrix 300 refer to all information columns and all core check columns. In other words, the core columns are the columns corresponding to the high code rate area, or the columns corresponding to part A and part B. The core matrix of the basic matrix 300 refers to the part consisting of all core rows and all core columns of the basic matrix. In other words, the core matrix refers to the high code rate area of ​​the basic matrix 300, or the part consisting of part A and part B. The core part of the basic matrix 300 refers to the part consisting of all rows and all core columns of the basic matrix 300. In other words, the core part refers to the area consisting of the high code rate area and the quasi-Laput area, or the area consisting of part A, part B and part D, or the area corresponding to the non-quasi-Laput node. The extended area of ​​the basic matrix 300 (also called the extended matrix or extended part) refers to the incremental redundancy area or part D.

[0102] It should be noted that the structure of the check matrix is ​​similar to that of the basic matrix, and will not be described in detail here.

[0103] Currently, the QC-LDPC code in actual use is to expand the 1 in the basic matrix into a cyclic shift matrix. The BG model of the QC-LDPC code can be expressed as the following formula (1): BG=(X,Y,F) (1)

[0104] Where X represents the variable, Y represents the verification equation, and F represents the edge relationship between BG.

[0105] After BG is expanded by QC with a lifting factor, the check matrix G can be obtained. The check matrix G can be expressed as the following formula (2): G = (V, C, E) (2)

[0106] Where V represents the variable node, C represents the check node, and E represents the edge relationship of G.

[0107] The number of columns in the check matrix can be expressed as follows (3): N = |V| = Zc|X| (3)

[0108] Where N represents the number of columns of the check matrix, V represents the variable node, Zc represents the lifting factor, and X represents the row of the check matrix.

[0109] The number of rows in the check matrix can be expressed as follows: M = |C| = Zc|Y| (4)

[0110] Where M represents the number of rows in the check matrix, C represents the check nodes, Zc represents the lifting factor, and Y represents the columns in the check matrix.

[0111] The number of non-zero elements in the check matrix can be expressed as the following formula (5): |E|=Zc|F| (5)

[0112] Where E represents the number of non-zero elements in the check matrix, Zc represents the lifting factor, and F represents the edge relationship of BG.

[0113] Currently, 5G data channels support information bits ranging from 1 to 8448 and specify two BGs: BG1 and BG2. The same BG requires different boosting factors to adapt to rate matching for different code lengths. Therefore, it is necessary to store a set of boosting factors and a set of shift values, as well as a method for performing rate matching based on these sets of boosting factors and shift values.

[0114] FIG4 shows a schematic diagram 400 of a lifting factor set according to a conventional solution. As can be seen, the jth row of the lifting factor set is where a j ∈{2,3,5,7,9,11,13,15}, max(k j )∈{7,7,6,5,5,5,4,4}, j is a positive integer, and k j A non-negative integer.

[0115] FIG5 shows a schematic diagram 500 of a translation value set according to a conventional solution. As shown in FIG5 , H BG represents the non-zero positions (also called non-zero elements) of the fundamental matrix, V i,j Represents the basic matrix H BG The translation value of the element in row i and column j, i LS Represents the set index of the lifting factor set Z in Figure 4. It can be seen that each row of lifting factors in Figure 4 Share the same set of translation values.

[0116] During rate matching, a boosting factor may be selected from the plurality of boosting factor sets Z shown in FIG4 according to the length of the information bit sequence to be sent or received and the number of information columns in the basic matrix. LS , the translation value sets corresponding to the set index i can be determined from the multiple translation value sets corresponding to the multiple set indexes in FIG5 LS For example, if the lifting factor selected in the lifting factor set of FIG4 is 128, then the set index i is determined to be LS is 0. Then, in the translation value set of FIG5 , the value corresponding to the set index i can be determined. LS A set of translation values ​​corresponding to 0 is used to expand the elements of the corresponding column of row 0 in the basic matrix. In this way, a check matrix can be generated.

[0117] However, as shown in Figure 4, the current lifting factor set uses an exponential design. As the code length increases, the lifting factor also increases exponentially. Due to rate matching, the number of shortened bits also increases exponentially. Consequently, the degree distribution is compromised, the integrity of the underlying matrix is ​​compromised, and performance suffers.

[0118] In view of this, the embodiments of the present disclosure propose a scheme for designing a lifting factor set based on both prime numbers and non-exponential multiple sets. Prime numbers refer to positive integers that have no other factors except 1 and itself. Non-exponential multiple sets refer to multiples in the multiple set that are positive integers and include multiples that are not equal to A. x Where A is a positive integer equal to or greater than 2, and x is a non-negative integer. In some embodiments, except for the value not equal to A x In addition to the value of A, the multiple set can also include x The following will describe this solution in detail with reference to FIG6A to FIG6C.

[0119] In some embodiments, the lifting factor set may include a prime number and a set of multiples associated with the prime number. The multiples in the set of multiples are positive integers, and the set of multiples includes a value not equal to A. x , where A is a positive integer equal to or greater than 2, and x is a non-negative integer. That is, the lifting factors can be stored in the form of prime numbers and multiple sets. In this case, the lifting factor set and the translation value set can be associated by prime numbers. Figure 6A shows a schematic diagram of an exemplary lifting factor set 600A according to an embodiment of the present disclosure. As shown in Figure 6A, the lifting factor set 600A includes multiple lifting factor sets in multiple rows. Each lifting factor set includes a prime number p and a multiple set t associated with the prime number p. The multiple prime numbers p corresponding to the multiple lifting factor sets constitute a prime number set.

[0120] In some embodiments, the lifting factor set may include a prime number, an index associated with the prime number, and a multiple set associated with the prime number. The multiples in the multiple set are positive integers, and the multiple set includes an index not equal to A. x, where A is a positive integer equal to or greater than 2, and x is a non-negative integer. That is, the lifting factor can be stored in the form of a prime number, an index, and a multiple set. In this case, the lifting factor set and the translation value set can be associated by an index or a prime number. Figure 6B shows a schematic diagram of an exemplary lifting factor set 600B according to an embodiment of the present disclosure. As shown in Figure 6B, the lifting factor set 600B includes multiple lifting factor sets in multiple rows. Each lifting factor set includes a prime number p, an index ID associated with the prime number p, and a multiple set t associated with the prime number p. The multiple prime numbers p corresponding to the multiple lifting factor sets constitute a prime number set. In the example of Figure 6B, as the index ID increases, the prime number p gradually increases. It should be understood that the embodiments of the present disclosure are not limited to this. In some embodiments, as the index ID increases, the prime number p can gradually decrease.

[0121] In some embodiments, the lifting factor set may include multiple lifting factors, wherein the lifting factors in the multiple lifting factors are products of prime numbers and multiples in a set of multiples associated with the prime numbers. The multiples in the set of multiples are positive integers, and the set of multiples includes multiples not equal to A x , where A is a positive integer equal to or greater than 2 and x is a non-negative integer. That is, the lifting factors can be stored directly. In some embodiments, a set of all prime numbers associated with the lifting factor set can also be stored. In this case, the lifting factor set and the translation value set can be associated by prime numbers. Figure 6C shows a schematic diagram of an exemplary lifting factor set 600C according to an embodiment of the present disclosure. As shown in Figure 6C, the lifting factor set 600C may include a set Z1 of lifting factor values ​​and an associated prime number set p1. Each value in the set Z1 is the product of a corresponding prime number in the prime number set p1 and a corresponding multiple in the above-mentioned multiple set. It should be understood that although the prime number set p1 is shown in the example of Figure 6C, in some embodiments, the lifting factor set may only include a set Z1 of lifting factor values.

[0122] In this way, the lifting factor can be the product of a prime number and a multiple in the set of multiples. For example, the lifting factor can be expressed as the following formula (6): Zc = p × t (6)

[0123] Where Zc represents the lifting factor, p represents a prime number, and t represents a multiple in the set of multiples.

[0124] Since the multiples in the multiples set do not grow exponentially, the boosting factors corresponding to prime numbers do not grow exponentially either, which can help achieve more stable encoding and decoding performance.

[0125] The following describes an implementation of a multiple set according to an embodiment of the present disclosure. First, the value characteristics of the multiple set are described. In some embodiments, the multiple set may include consecutive integers separated by predetermined intervals. In some embodiments, the predetermined interval may be 1. That is, the multiple set may include consecutive integers with an interval of 1. For example, the multiple set {1, 2, ..., 35} shown in Figures 6A and 6B. In some embodiments, the predetermined interval may be 2. For example, the multiple set may be {1, 3, 5, 7, 9}. It should be understood that the predetermined interval may be any suitable positive integer, and the embodiment of the present disclosure does not limit this. In this way, the multiples are consecutive integers, the intervals between the elements in the lifting factor set are fixed constants, and the number of shortened bits may not expand as the code length increases.

[0126] In some embodiments, the multiple set may include a set of integers that satisfy a piecewise linear function. In some embodiments, the multiple set may include non-continuous integers with gradually increasing intervals. For example, the multiple set may include {1:1:8 10:2:16 19:3:25}. In this example, the multiple set is a concatenation of three linear functions, and the slope of each linear function changes. If the segment number increases with the numerical value, the slope of each segment increases with the segment number, and the endpoints of each adjacent segment are the same, or differ by 1 times the numerical value of the current slope. Designing the multiple set in this way can reduce some of the hardware implementation complexity. In addition, as the coding length increases, the interval of the lifting factor increases appropriately (i.e., increases according to the piecewise linear function) without losing performance. In some embodiments, the multiple set may also include non-continuous integers with gradually decreasing intervals.

[0127] In some embodiments, a multiples set can include a range of multiples. In other words, the maximum and minimum values ​​of the multiples can be directly stored to define the range of multiples. In this case, all integers within the range can be selected as multiples. In this way, the multiples set can be described concisely without sacrificing performance.

[0128] In some embodiments, in addition to the maximum and minimum values ​​of the multiples described above, the multiples set may also include numbers within the above range that are not selected as multiples. In this way, the multiples set can be described more accurately.

[0129] Assume that the lifting factor set is described in the form of an index, a prime number, and a multiple set as shown in Figure 6B. In some embodiments, the multiple set corresponding to each index can be arranged in ascending order. In some embodiments, the multiple set corresponding to each index can be arranged in descending order. In some embodiments, the multiple set can be modulated into a high-order symbol for storage and description.

[0130] Next, the maximum value of the multiple set is described. In some embodiments, the maximum value in the multiple set can be determined based on the maximum value of the lifting factor and the prime number. The maximum value of the lifting factor can refer to the maximum lifting factor in all lifting factor sets. Alternatively, the maximum value of the lifting factor can also be a maximum value specified by the system, such as a system bottleneck. In some embodiments, the maximum value of the multiple set corresponding to each prime number can be expressed by the following formula (7):

[0131] Where p represents a prime number, t max Represents the maximum value of the set of multiples corresponding to the prime number p, Z max In this case, as the prime number increases, the maximum value in the corresponding multiple set tends to decrease.

[0132] In some embodiments, the maximum value in the multiple set can be determined based on the maximum length of the information bit sequence, the number of information columns of the base matrix corresponding to the maximum length, and the prime number. In some embodiments, the maximum length of the information bit sequence and the number of information columns of the base matrix can be used to describe the maximum value of the lifting factor. For example, the maximum value of the lifting factor can be expressed by the following formula (8):

[0133] where Z max Indicates the maximum value of the boost factor, K max represents the maximum length of the information bit sequence, and kb represents the number of information columns of the basic matrix when the maximum length of the information bit sequence is obtained.

[0134] In some embodiments, the maximum value of the lifting factor can be an integer multiple of the maximum value of the lifting factor in each row of the lifting factor set 5G (as shown in FIG4 ), such as twice. For example, the maximum value of the lifting factor can be selected from {768, 512, 640, 448, 576, 704, 416, 480}. After determining the maximum value of the lifting factor, the maximum value t of the multiple set corresponding to each prime number or index can be obtained by formula (7): max .

[0135] The above describes the description of the maximum value of the multiple set under the condition of specifying the maximum value of the lifting factor. In some alternative embodiments, the maximum value of the multiple set can be described without specifying the maximum value of the lifting factor. In some embodiments, the maximum value of the multiple set can be associated with at least one of the communication service type or hardware resource limitation corresponding to the information bit sequence. In other words, the upper bound of the specific lifting factor can be set, and the maximum value of the multiple set (i.e., the appropriate lifting factor) can be selected based on system resources, application scenarios (such as high throughput type or URLLC type), hardware capabilities (such as the maximum lifting factor supported by the hardware device, parallelism, etc.). In some embodiments, the maximum value of the multiple set can be specified as a very large number to indicate the upper limit of the system. In some embodiments, the maximum value of the multiple set corresponding to each prime number or index can be stored instead of storing the maximum value of the multiple set, but only the minimum value of the multiple set and the value characteristics satisfied by the multiples in the multiple set (such as the above-mentioned continuous integers, linear piecewise functions, etc.). In this way, it is possible to adapt to the situation where the maximum coding length of 6G may be further expanded.

[0136] The following describes the implementation of the prime number set according to an embodiment of the present disclosure. First, the minimum and maximum values ​​of the prime number set are described. In some embodiments, the minimum value in the prime number set can be associated with at least one of the following: the number of columns in the core part of the basic matrix, or the connection relationship between the columns. The core part includes the information column and the core check column of the basic matrix. In some embodiments, the columns in the core part of the basic matrix are grouped, and the two columns grouped in the same group meet the quasi-orthogonal condition, that is, the associated nodes of the two columns intersect with at most 1 element. If there are more columns in the same group, the quasi-orthogonal condition is met between any two columns in these columns. In this way, there may be many results for the grouping method of the columns of the core part of the basic matrix. In some embodiments, the minimum value in the prime number set can be selected so that the minimum value is greater than or equal to the minimum number of groupings in the grouping method.

[0137] In certain embodiments, the minimum value in the prime number set can be associated with at least one of the following: the number of the rows in the core of the basic matrix, or the connection relationship between the rows. In certain embodiments, the rows in the core of the basic matrix are grouped, and two rows that are grouped in the same group satisfy the quasi-orthogonal condition, that is, the associated nodes of these two rows intersect and have 1 element at most. If more rows are arranged in the same group, then the quasi-orthogonal condition is satisfied between any two rows in these rows. In this way, the grouping method of the rows in the core of the basic matrix may have a variety of results. In certain embodiments, the minimum value in the prime number set can be chosen so that this minimum value is greater than or equal to the minimum number of groups in the grouping method.

[0138] It should be understood that the minimum value in the set of prime numbers can also be determined based on the grouping of both rows and columns in the core portion of the basic matrix. For example, the minimum value in the set of prime numbers is selected so that the minimum value is greater than or equal to the minimum number of groupings in the grouping of rows and greater than or equal to the minimum number of groupings in the grouping of columns.

[0139] In some embodiments, the minimum value in different prime number sets can be determined based on the different scales of the base matrix. For example, for a smaller base matrix (e.g., the number of rows and / or columns meets the first condition), the minimum value in the prime number set can be greater than or equal to 7. For example, the first condition can include a matrix with 6 to 7 information columns or a core component with fewer than 10 columns. For a medium-sized base matrix (e.g., the number of rows and / or columns meets the second condition), the minimum value in the prime number set can be greater than or equal to 11. For example, the second condition can include a matrix with 10 information columns or a core component with fewer than 15 columns, such as the matrix scale of BG2. For a larger base matrix (e.g., the number of rows and / or columns meets the third condition), the minimum value in the prime number set can be greater than or equal to 23. For example, the third condition can include a matrix with greater than or equal to 20 information columns or a core component with fewer than or equal to 30 columns, such as the matrix scale of BG1.

[0140] In some embodiments, the maximum values ​​in different sets of prime numbers may be determined based on the different sizes of the base matrices. For example, for a smaller base matrix, the maximum value in the set of prime numbers may be less than or equal to 53. For a medium-sized base matrix, the maximum value in the set of prime numbers may be greater than or equal to 57. For a larger base matrix, the maximum value in the set of prime numbers may be greater than or equal to 59.

[0141] Next, the value characteristics of the prime number set are described. In some embodiments, the prime number set may include consecutive prime numbers. For example, consecutive prime numbers starting from the minimum value in the prime number set determined above. Assuming the minimum value is 11, the prime number set may include {11, 13, 17, 19, 23}.

[0142] In some embodiments, the set of prime numbers may include consecutive prime numbers within a certain range. For example, the set of prime numbers may include prime numbers in the range of 10 to 20, i.e., {11, 13, 17, 19}.

[0143] In some embodiments, the set of prime numbers may include non-continuous prime numbers separated by a distance greater than a predetermined value. It should be understood that the predetermined value may be any suitable positive integer. For example, if the predetermined value is 6, the set of prime numbers may include {11, 17, 23}.

[0144] In some embodiments, the prime number set may include non-continuous prime numbers within a certain range and with intervals greater than a predetermined value. For example, the prime number set may include prime numbers ranging from 10 to 50 with intervals greater than 3, i.e., {11, 17, 23, 29, 37, 41, 47}.

[0145] So far, the implementation of the prime number set and multiple set corresponding to the lifting factor set has been described. In some embodiments, the lifting factor set may also include non-prime numbers. In some embodiments, if the length of the information bit sequence is less than or equal to the threshold length, a non-prime number may be used. If the length of the information bit sequence is greater than or equal to the threshold length, a prime number may be used. In other words, short codes may use non-prime numbers, and medium and long codes may use prime numbers. In some embodiments, the non-prime numbers may include at least one of the following: 4, 6, 9, 15, 22, or 26. For example, 4 and 6 may be designed specifically for short codes. 9 and 15 may be lifting factor sets for compatibility with 5G. 22 and 26 are twice the prime numbers 11 and 13, that is, they are essentially designed based on prime numbers to support medium and long codes.

[0146] In the above-described embodiments of the prime number set and the multiple set, the resulting lifting factor set may contain duplicate elements. In other words, different indices or prime numbers may have the same lifting factor. For example, the lifting factor for the case of index 0, prime number 11, and multiple 13 is 143, as is the case of index 1, prime number 13, and multiple 11. Therefore, the disclosed embodiments provide a solution for handling duplicate elements. This is described in detail below.

[0147] In some embodiments, repeated elements may be allowed to exist in the lifting factor set, that is, the same lifting factor may correspond to multiple indices or prime numbers. In some embodiments in which the same lifting factor corresponds to multiple indices, the sending device may determine multiple indices corresponding to the lifting factor, and select the smallest prime number from the multiple prime numbers corresponding to these indices, and then select the index corresponding to the smallest prime number. In some embodiments in which the same lifting factor corresponds to multiple (for example, two) prime numbers, the sending device may determine multiple prime numbers corresponding to the lifting factor, and select the smallest prime number from these multiple prime numbers. Continuing with the above example, the index may be selected as 0, the prime number as 11, and the multiple as 13. In this way, under the condition that the lifting factor is fixed, the smaller the value of the prime number, the better the ring property, which is conducive to more stable encoding and decoding performance.

[0148] In some embodiments, the presence of duplicate elements in the lifting factor set can be eliminated by deleting some elements from the multiples set. In some embodiments, for a lifting factor set comprising a set of prime numbers and a set of multiples (e.g., the lifting factor set shown in FIG6A ), it can be designed so that the set of multiples associated with a first prime number does not include a value of a second prime number that is smaller than the first prime number. In some embodiments, for a lifting factor set comprising an index, a prime number, and a set of multiples (e.g., the lifting factor set shown in FIG6B ), it can be designed so that the set of multiples associated with a first index does not include a value of a prime number associated with a second index that is smaller than the first index. In other words, the set of multiples corresponding to index i does not include prime numbers corresponding to indices that are smaller than i. In some embodiments, for a lifting factor set comprising a set of values ​​of lifting factors and a set of prime numbers (e.g., the lifting factor set shown in FIG6C ), it is clear that duplicate lifting factors may not be included.

[0149] According to an embodiment of the present disclosure, the lifting factor set is designed based on a set of prime numbers and non-exponential multiples, thereby preventing the number of shortened bits from increasing exponentially with increasing code length, thereby achieving more stable encoding and decoding performance.

[0150] Accordingly, an embodiment of the present disclosure proposes a communication scheme based on the above-mentioned lifting factor set. This will be described below in conjunction with Figure 7. Figure 7 shows a schematic diagram of a communication process 700 according to an embodiment of the present disclosure. It will be understood that the communication process shown in Figure 7 is merely exemplary and non-limiting. The embodiment of the present disclosure may include steps not shown in Figure 7, or omit certain steps shown in Figure 7. In addition, the order of the steps in Figure 7 is for illustration only and is not intended to be limiting.

[0151] Unless otherwise specified in this application, communication process 700 may be performed between a transmitting device and a receiving device in communication system 100. "Transmitting device" or "receiving device" may refer to the transmitting device or receiving device itself, or may refer to a device capable of supporting the transmitting device or receiving device to implement the function, such as a system on chip (SoC) or a modem. For convenience, the following description will uniformly use the term transmitting device and receiving device.

[0152] As shown in Figure 7, in step 710, the transmitting device may determine a lifting factor from a lifting factor set based on the length of the information bit sequence and the base matrix. In some embodiments, the length of the information bit sequence may be the length of the information bit sequence to be encoded. In some embodiments, the length of the information bit sequence may be the length of the information bit sequence after concatenation coding. For example, the length of the information bit sequence may be the length of the information bit sequence including cyclic redundancy check (CRC) bits.

[0153] As shown in FIG. 7 , at step 711 , the sending device first determines a boosting factor set.

[0154] In some embodiments, a lifting factor set may be stored separately for each base matrix (e.g., BG1, BG2, etc.). In this case, the transmitting device may determine a base matrix from multiple base matrices based on at least one of the length of the information bit sequence, the code length, or the code rate. Based on the determined base matrix, the transmitting device may determine a lifting factor set corresponding to the base matrix.

[0155] In some embodiments, one base matrix may correspond to one lifting factor set. In some embodiments, one base matrix may correspond to two or more lifting factor sets. In some embodiments, one lifting factor set may correspond to two or more base matrices.

[0156] In some embodiments, different boosting factor sets may be used for different communication service types. In this case, the transmitting device may determine the communication service type corresponding to the information bit sequence. Based on the communication service type, the transmitting device may determine the boosting factor set corresponding to the communication service type. In some embodiments, the communication service type may include an eMBB type, an mMTC type, a URLLC type, or a high throughput type. It should be understood that any other suitable type, whether known or developed in the future, is also feasible.

[0157] In the context of this disclosure, the high-throughput type may also be referred to as the extremely high code rate type. For example, the high-throughput type may include communication service scenarios with a code rate greater than or equal to 0.917. In another example, the high-throughput type includes communication service scenarios with a code rate greater than 0.926. In yet another example, the high-throughput type includes communication service scenarios with very high communication rate requirements, such as communication service scenarios with peak throughput greater than 100 Gbps or 150 Gbps.

[0158] In some embodiments, different base matrices and boosting factor sets can be used for different communication service types. For example, in the eMBB type, BG1 and BG2 can be used, and the 5G boosting factor set shown in Figure 4 can be used. In the high-throughput type, the core region of BG1 (e.g., rows 1 to 4, columns 1 to 26; or rows 1 to 5, columns 1 to 27) can be used as the base matrix, or the base matrix can be generated by adding additional information columns based on BG1. In addition, in this high-throughput type, boosting factor set 1 of this solution can be used. In the URLLC type (also known as the ultra-low code rate type), the low-code rate region of BG2 (e.g., the parity check matrix region corresponding to parity check rows greater than or equal to 12, 22, 32, or 42) can be used as the base matrix, or the base matrix can be generated by adding additional parity check rows based on BG2. In addition, in this URLLC type, boosting factor set 2 of this solution can be used. Boosting factor set 1 and boosting factor set 2 can correspond to different numbers of indices, different sets of prime numbers, and / or different sets of multiples.

[0159] In some alternative embodiments, BG1 and BG2 may be used in the eMBB type, and the boosting factor set 1 and boosting factor set 2 of the above-mentioned present solution may be used corresponding to BG1 and BG2, respectively. In the high-throughput type, the core area of ​​BG1 (e.g., rows 1 to 4, columns 1 to 26; or rows 1 to 5, columns 1 to 27) may be used as the base matrix, or the base matrix may be generated by adding additional information columns based on BG1. In addition, in this high-throughput type, the boosting factor set 1 of the above-mentioned present solution or a subset thereof may be used. In the URLLC type, the low-code rate area of ​​BG2 (e.g., the check matrix area corresponding to check rows greater than or equal to 12, 22, 32, or 42) may be used as the base matrix, or the base matrix may be generated by adding additional check rows based on BG2. In addition, in this URLLC type, the boosting factor set 2 of the above-mentioned present solution or a subset thereof may be used.

[0160] In some alternative embodiments, BG1 and BG2 may be used in the eMBB type, and the 5G boosting factor set shown in FIG4 may be used. In the high-throughput type, a newly added base matrix BG3 and the boosting factor set 1 of this solution may be used. This BG3 may be stored as associated with the boosting factor set 1 of this solution. In the URLLC type, a newly added base matrix BG4 and the boosting factor set 2 of this solution may be used. This BG4 may be stored as associated with the boosting factor set 2 of this solution.

[0161] For ease of understanding, the process of determining the boost factor set is described below in conjunction with Figure 8. Figure 8 shows a schematic diagram 800 of an example process for determining the boost factor set according to an embodiment of the present disclosure. In this example, for eMBB or other communication service types, BG1 and BG2 are used, and the boost factor set 1 and boost factor set 2 of this solution are used accordingly. For high throughput types, the core area of ​​BG1 is used as the basic matrix or additional information columns are added based on BG1 to generate the basic matrix, and the boost factor set 1 of this solution or its subset is used. For URLLC types, the low code rate area of ​​BG2 is used as the basic matrix or additional check rows are added based on BG2 to generate the basic matrix, and the boost factor set 2 of this solution or its subset is used.

[0162] As shown in FIG8 , reference numerals 810 and 820 indicate lifting factor set 1 and lifting factor set 2, respectively. It can be seen that in this example, lifting factor set 1 and lifting factor set 2 correspond to different prime number sets and different multiple sets. The lifting factors for BG1 and BG2 are different. For example, BG2 can support medium and low code rates for medium and short codes, and BG1 can support medium and high code rates for medium and long codes. As shown in FIG8 , in some embodiments, the minimum prime number of lifting factor set 1 can be greater than the minimum prime number of lifting factor set 2. In this way, the larger matrix size and relatively lower orthogonality of BG1 can be compatible.

[0163] Although FIG8 shows that the number of indices of lifting factor set 1 is equal to the number of indices of lifting factor set 2, the embodiments of the present disclosure are not limited thereto. In some embodiments, the number of indices of lifting factor set 1 may be greater than the number of indices of lifting factor set 2. Thus, a reasonable fine granularity can be designed based on the number of information columns. A larger matrix scale requires a larger number of indices to support it, so that the fine granularity performance is better. In some embodiments, the number of indices of lifting factor set 1 may be less than the number of indices of lifting factor set 2. This is because BG2 can support very short codes, so some additional indices for the case of very short codes are set.

[0164] In some embodiments, the selection of a boosting factor set based on scenario requirements can be implemented by selecting an index ID. As shown in Figure 8 , for high-throughput services, boosting factor set 1 with IDs 0, 2, 3, or a subset corresponding to a smaller prime number can be selected, as indicated by reference numeral 830. In this way, shift values ​​corresponding to certain IDs can be set to facilitate hardware implementation and highly parallel decoding, and the boosting factor sets corresponding to these IDs can be selected. For eMBB or other communication service types, boosting factor set 1 itself is used, as indicated by reference numeral 835.

[0165] Continuing with Figure 8 , for URLLC, a subset corresponding to ID = 0 or the smallest prime number can be selected from boosting factor set 2, as shown by reference numeral 840. This allows selection of a boosting factor set with a better ring structure, thereby achieving ultra-high reliability and an error-free floor. For eMBB or other communication service types, boosting factor set 2 itself is used, as shown by reference numeral 845.

[0166] In some alternative or additional embodiments, the selection of a boosting factor set based on scenario requirements can be implemented by selecting the maximum or minimum value of the set of multiples corresponding to each index ID. This is because the code lengths used in different scenarios are different. For example, the code lengths in the URLLC type are generally shorter and do not need to support very large boosting factors. The code lengths in the high-throughput type are longer and do not need to be compatible with very small boosting factors. This can better meet scenario requirements.

[0167] In some alternative or additional embodiments, the lifting factor set selected for a scenario may not be selected based on the index ID, but rather only a subset of available lifting factors may be specified. This subset of lifting factors may be a proper subset of all supported lifting factors. In this case, some sets of prime numbers and multiples will not appear in the lifting factor set selected for a specific scenario.

[0168] Referring back to FIG. 7 , in step 712 , the transmitting device may determine a set of all information columns supported by the base matrix in the current scenario (hereinafter also referred to as an information column set for convenience). In some embodiments, the transmitting device may determine the information column set based on at least one of the base matrix, the coding length of the information bit sequence, or the coding rate. In some embodiments, for BG1, if the length of the information bit sequence is less than 2530 or the coding rate of the information bit sequence is higher than 0.917 (i.e., high throughput type), the information column set may be determined as {22, 24, 26}. The transmitting device may then select the number of information columns to be used from the information column set based on the length of the information bit sequence.

[0169] In step 713, the transmitting device may determine an expected value of the lifting factor based on the length of the information bit sequence and the number of information columns of the selected base matrix, and select a value from the lifting factor set that is adjacent to the expected value as the lifting factor. In some embodiments, the value closest to the expected value may be selected as the lifting factor. In some embodiments, any value whose difference from the expected value is less than a threshold may be selected as the lifting factor. It should be understood that the lifting factor may also be determined from the lifting factor set using any other suitable method, and the embodiments of the present disclosure are not limited thereto.

[0170] According to the embodiments of the present disclosure, the number of information columns and the lifting factor can be determined simultaneously based on the determined information column set and lifting factor set. In this way, the number of shortened bits can be further reduced, the integrity of the base image can be maintained, and the needs of different scenarios can be adapted.

[0171] In some embodiments, the maximum value of the boost factor (ie, Z max ) or Z max is specified as a very large number. In these cases, the number of lifting factors supported by the lifting factor set is infinite or very large. Therefore, the embodiment of the present disclosure also proposes a rate matching scheme to improve the rate matching performance in this case. Of course, this scheme can also be used in other cases. In this scheme, the transmitting device can determine the minimum multiple corresponding to each prime number in the prime number set based on at least one of the coding length of the information bit sequence or the information column length of the basic matrix. Based on the minimum value of the product of each prime number and the corresponding minimum multiple, the transmitting device can determine a lifting factor. For example, according to the length K of the information bit sequence to be sent and the length kb of the information column of the check matrix to be used, the minimum multiple t that satisfies kb×p×t≥K can be calculated for each index ID or each prime number. Then, the lifting factor Z can be selected as the minimum p×t corresponding to all index IDs or all prime numbers. In which Z is not set max In some embodiments, a selected boost factor Z is used. max In some embodiments, if the selected Z≤Z max , then use the selected boost factor Z. Otherwise, use Z max .

[0172] In some embodiments, the lifting factor set may include a set of prime numbers and a set of lifting factor values, as shown in Figure 6C. In this case, the value of a lifting factor may correspond to multiple (for example, two) prime numbers. To this end, the embodiment of the present disclosure also proposes a rate matching scheme to improve the rate matching performance in this case. Of course, this scheme can also be used in other cases. In this scheme, the transmitting device can select the smallest lifting factor Zc in the lifting factor set based on the length K of the information bit sequence to be sent and the length kb of the information column of the check matrix to be used, so that kb×Zc≥K. In addition, the smallest prime number in the prime number set that satisfies p|Zc is selected. Thus, the way in which the prime numbers in the prime number set correspond to the lifting factors can be specified, and the smallest prime number can be selected.

[0173] Continuing to refer to Figure 7, in step 714, the transmitting device may determine a check matrix based on the determined lifting factor and the base matrix for encoding the information bit sequence. In some embodiments, the transmitting device may determine a set of translation values ​​for the non-zero positions of the base matrix based on the determined lifting factor. Based on the translation value set and the base matrix, the transmitting device may obtain the check matrix. Then, the transmitting device may encode the information bit sequence based on the check matrix to obtain an encoded information bit sequence. It should be noted here that the operation of determining the translation value set based on the lifting factor can be implemented based on any known or future developed method, and the embodiments of the present disclosure are not limited to this.

[0174] Continuing with Figure 7, in step 720, the transmitting device may transmit the encoded information bit sequence to the receiving device. In some embodiments, the transmitting device may also transmit at least one of the following information to the receiving device: the length of the information bit sequence, the length of the encoded information bit sequence (i.e., the code length), the basis matrix, and the lifting factor set. This facilitates decoding operations on the receiving device. Accordingly, the receiving device may receive the encoded information bit sequence.

[0175] As shown in Figure 7, at step 730, the receiving device may determine a check matrix for use in decoding the information bit sequence. The process of determining the check matrix is ​​similar to the process described in conjunction with step 710 and will not be repeated here.

[0176] This concludes the description of a communication solution according to an embodiment of the present disclosure. By designing a lifting factor set based on both prime numbers and a non-exponential multiple set, this solution prevents the number of shortened bits from increasing exponentially with increasing code length. Consequently, more stable encoding and decoding performance can be achieved. This will be described in detail below with reference to Figures 9A, 9B, and 10.

[0177] Figure 9A shows a schematic diagram of a simulation result 900A showing the change in the number of shortened bits according to an embodiment of the present disclosure as the length of the information bit sequence changes. The simulation result 900A is obtained by simulation for a 5G information bit sequence length range. Reference numeral 901 shows the case of using the lifting factor set in the traditional scheme shown in Figure 4, and reference numeral 902 shows the case of using the lifting factor set according to an embodiment of the present disclosure. It can be seen that for the 5G information bit sequence length range, the number of shortened bits brought about by the lifting factor set of the traditional scheme increases exponentially with the length of the information bit sequence. In contrast, the number of shortened bits brought about by the lifting factor set of the present scheme does not increase with the increase in the length of the information bit sequence, but remains in a very stable range. Therefore, according to the present scheme, for the 5G information bit sequence length range, the integrity of the base graph and more stable encoding and decoding performance can be guaranteed.

[0178] Figure 9B shows a schematic diagram of another simulation result 900B for the change in the number of shortened bits according to an embodiment of the present disclosure as the length of the information bit sequence changes. The simulation result 900B is obtained by simulating the information bit sequence length range that may be larger for 6G. Reference numeral 903 shows the case of using the lifting factor set in the traditional scheme shown in Figure 4, and reference numeral 904 shows the case of using the lifting factor set according to an embodiment of the present disclosure. It can be seen that for this larger range of information bit sequence lengths, the number of shortened bits brought about by the lifting factor set of the traditional scheme also increases exponentially with the length of the information bit sequence. In contrast, the number of shortened bits brought about by the lifting factor set of the present scheme does not increase with the increase in the length of the information bit sequence, but remains in a very stable range. Therefore, according to the present scheme, the integrity of the base graph and more stable encoding and decoding performance can also be guaranteed for this larger range of information bit sequence lengths.

[0179] Figure 10 shows a schematic diagram of simulation results 1000 for the relationship between the maximum lifting factor supported by the hardware and the maximum information bit sequence length actually supported according to an embodiment of the present disclosure. As shown in Figure 10, reference numeral 1001 shows the case where the lifting factor set according to an embodiment of the present disclosure is based on linear multiples. Reference numeral 1002 shows the case where the lifting factor set in the traditional solution is based on integer multiples of powers of 2. It can be seen that when using the lifting factor set in the traditional solution, as the maximum lifting factor supported by the hardware increases (that is, as the parallelism and computing power supported by the hardware increase), the maximum information bit sequence length actually supported increases in a step-like manner. In contrast, when using the lifting factor set according to an embodiment of the present disclosure, as the maximum lifting factor supported by the hardware increases (that is, as the parallelism and computing power supported by the hardware increase), the maximum information bit sequence length actually supported increases in an approximately linear manner. Therefore, according to this solution, higher hardware utilization can be achieved and the computing power of the terminal can be made more fine-grained.

[0180] Corresponding to the above-described communication process, an embodiment of the present disclosure further provides a communication method that can be implemented at a communication device (i.e., a transmitting device and / or a receiving device). Figure 11 shows a schematic flow chart of a communication method 1100 according to an embodiment of the present disclosure. For example, the method 1100 can be implemented at the terminal 120, RAN node 110, core network device, or server shown in Figure 1. It should be understood that the method 1100 may include other additional steps not shown, or may omit some of the steps shown. The scope of the present disclosure is not limited thereto.

[0181] In step 1101, the communication device may determine a lifting factor from a lifting factor set based on the length of the information bit sequence and the base matrix. In some embodiments, the lifting factor set may include a prime number and a set of multiples associated with the prime number. In some embodiments, the lifting factor set may also include an index associated with the prime number. In some embodiments, the lifting factor set may include multiple lifting factors, and the lifting factor in the multiple lifting factors is the product of the prime number and the multiple in the set of multiples associated with the prime number. In some embodiments, the multiple in the set of multiples may be a positive integer, and the set of multiples may include an index not equal to A. x , where A is a positive integer equal to or greater than 2, and x is a non-negative integer. Thus, a set of lifting factors based on prime numbers and non-exponential multiples can be specified so that the number of shortened bits does not increase exponentially with increasing code length, thereby achieving more stable encoding and decoding performance.

[0182] In some embodiments, the lifting factor set may also include non-prime numbers. In some embodiments, the non-prime numbers may include at least one of the following: 4, 6, 9, 15, 22, or 26. Thus, by combining non-prime numbers with prime numbers, different code lengths can be better supported.

[0183] In some embodiments, the set of multiples may include at least one of the following: consecutive integers separated by a predetermined interval; a set of integers that satisfy a piecewise linear function; a range of multiples; or numbers within the range that are not selected as multiples. Thus, the method for determining the values ​​of the elements of the set of multiples corresponding to the lifting factor set can be specified.

[0184] In some embodiments, the maximum value in the set of multiples can be determined based on the maximum value of the lifting factor and a prime number. In some embodiments, the maximum value in the set of multiples can be determined based on the maximum length of the information bit sequence, the number of information columns of the base matrix corresponding to the maximum length, and a prime number. In some embodiments, the maximum value in the set of multiples can be associated with at least one of the following: the type of communication service corresponding to the information bit sequence; or hardware resource limitations. Thus, the maximum value in the set of multiples can be specified.

[0185] In some embodiments, the minimum value among the plurality of prime numbers corresponding to the plurality of lifting factor sets can be associated with at least one of the following: the number of columns in the core portion of the base matrix, the core portion including the information columns and the core check columns of the base matrix; the connectivity between the columns in the core portion of the base matrix; the number of rows in the core portion of the base matrix; or the connectivity between the rows in the core portion of the base matrix. In some embodiments, the connectivity between the columns in the core portion of the base matrix can include: two columns grouped in the same group satisfying a quasi-orthogonal condition. In some embodiments, the connectivity between the rows in the core portion of the base matrix can include: two rows grouped in the same group satisfying a quasi-orthogonal condition. Thus, the minimum value among the prime number sets corresponding to the lifting factor sets can be specified.

[0186] In some embodiments, the multiple prime numbers corresponding to the multiple lifting factor sets include at least one of the following: consecutive prime numbers; or non-consecutive prime numbers with intervals greater than a predetermined value. In some embodiments, the consecutive prime numbers include {11, 13, 17, 19, 23}; or the non-consecutive prime numbers with intervals greater than a predetermined value include {11, 17, 23}. This allows for specifying the value assignment of elements in the prime number set.

[0187] In some embodiments, the set of multiples associated with a first index does not include a prime number associated with a second index, and the second index is smaller than the first index; or the set of multiples associated with a first prime number does not include a prime number, and the second prime number is smaller than the first prime number. This ensures that there are no duplicate elements between the multiple lifting factor sets.

[0188] In some embodiments, the communication device can determine two prime numbers corresponding to the lifting factor and select the smallest prime number from the two prime numbers. In some embodiments, the communication device can determine multiple indices corresponding to the lifting factor and select the index corresponding to the smallest prime number from the multiple prime numbers corresponding to the multiple indices. This ensures good cycle properties and achieves more stable encoding and decoding performance.

[0189] In some embodiments, a base matrix from the plurality of base matrices corresponds to a lifting factor set from the plurality of lifting factor sets. The communication device may determine a base matrix from the plurality of base matrices based on at least one of the length of the information bit sequence, the code length, or the code rate, and determine a lifting factor set corresponding to the base matrix based on the base matrix. Thus, an appropriate base matrix and lifting factor set may be selected based on the usage scenario, thereby adapting to the needs of different scenarios.

[0190] In some embodiments, a communications device may determine a boosting factor set corresponding to the communications service type based on the communications service type corresponding to the information bit sequence. In some embodiments, the communications service type may include an eMBB type, a URLLC type, or a high-throughput type. In some embodiments, if the communications service type is a high-throughput type, the communications device may determine that the prime numbers corresponding to the boosting factor set include 23, 31, or 37. In some embodiments, if the communications service type is a URLLC type, the communications device may determine that the prime numbers corresponding to the boosting factor set include 11. Thus, a boosting factor set can be selected based on the scenario to better meet scenario requirements.

[0191] In some embodiments, the communication device may determine the minimum multiple corresponding to each of multiple prime numbers corresponding to multiple lifting factor sets based on at least one of the code length of the information bit sequence or the information column length of the base matrix, and determine the lifting factor based on the minimum value of the product of each prime number and the corresponding minimum multiple. This allows for determining an appropriate lifting factor and achieving rate matching in situations where a maximum lifting factor value is not specified or is set to a very large value.

[0192] In step 1102, the communication device may determine a check matrix based on the lifting factor and the base matrix, where the check matrix is ​​used for encoding or decoding an information bit sequence.

[0193] According to method 1100, encoding or decoding can be performed based on both a set of lifting factors based on prime numbers and a set of non-exponential multiples. This can avoid the exponential increase in the number of shortened bits as the code length increases, and achieve more stable encoding and decoding performance.

[0194] Corresponding to the above-mentioned communication method, the embodiment of the present disclosure also provides a communication device and a communication equipment, which are described below in conjunction with Figures 12 and 13. Figure 12 shows a schematic block diagram of a communication device 1200 according to an embodiment of the present disclosure. The communication device 1200 can be implemented at a communication device (i.e., a transmitting device and / or a receiving device). The communication device 1200 can be a part of a transmitting device or a receiving device, or it can be a transmitting device or a receiving device. It should be understood that the communication device 1200 may include more additional components than the components shown or omit some of the components shown therein, and the embodiment of the present disclosure is not limited to this.

[0195] As shown in FIG12 , a communication device 1200 may include a first processing component 1201 and a second processing component 1202. The first processing component 1201 may be configured to determine a lifting factor from a lifting factor set based on the length of the information bit sequence and a base matrix. The second processing component 1202 may be configured to determine a check matrix based on the lifting factor and the base matrix, where the check matrix is ​​used for encoding or decoding the information bit sequence.

[0196] In some embodiments, the lifting factor set may include a prime number and a set of multiples associated with the prime number. In some embodiments, the lifting factor set may also include an index associated with the prime number. In some embodiments, the lifting factor set may include a plurality of lifting factors, wherein a lifting factor in the plurality of lifting factors is a product of a prime number and a multiple in a set of multiples associated with the prime number. In some embodiments, the multiples in the set of multiples may be positive integers, and the set of multiples may include an index not equal to A. x The value of , where A is a positive integer equal to or greater than 2, and x is a non-negative integer.

[0197] In some embodiments, the lifting factor set may further include non-prime numbers. In some embodiments, the non-prime numbers may include at least one of the following: 4, 6, 9, 15, 22, or 26.

[0198] In some embodiments, the set of multiples may include at least one of the following: consecutive integers separated by a predetermined interval; a set of integers that satisfy a piecewise linear function; a range of multiples; or numbers within the range that are not selected as multiples. Thus, the method for determining the values ​​of the elements of the set of multiples corresponding to the lifting factor set can be specified.

[0199] In some embodiments, the maximum value in the set of multiples can be determined based on the maximum value of the lifting factor and a prime number. In some embodiments, the maximum value in the set of multiples can be determined based on the maximum length of the information bit sequence, the number of information columns of the base matrix corresponding to the maximum length, and a prime number. In some embodiments, the maximum value in the set of multiples can be associated with at least one of the following: the type of communication service corresponding to the information bit sequence; or hardware resource limitations. Thus, the maximum value in the set of multiples can be specified.

[0200] In some embodiments, the minimum value among the plurality of prime numbers corresponding to the plurality of lifting factor sets can be associated with at least one of the following: the number of columns in the core portion of the base matrix, the core portion including the information columns and the core check columns of the base matrix; the connectivity between the columns in the core portion of the base matrix; the number of rows in the core portion of the base matrix; or the connectivity between the rows in the core portion of the base matrix. In some embodiments, the connectivity between the columns in the core portion of the base matrix can include: two columns grouped in the same group satisfying a quasi-orthogonal condition. In some embodiments, the connectivity between the rows in the core portion of the base matrix can include: two rows grouped in the same group satisfying a quasi-orthogonal condition. Thus, the minimum value among the prime number sets corresponding to the lifting factor sets can be specified.

[0201] In some embodiments, the multiple prime numbers corresponding to the multiple lifting factor sets include at least one of the following: consecutive prime numbers; or non-consecutive prime numbers with intervals greater than a predetermined value. In some embodiments, the consecutive prime numbers include {11, 13, 17, 19, 23}; or the non-consecutive prime numbers with intervals greater than a predetermined value include {11, 17, 23}. This allows for specifying the value assignment of elements in the prime number set.

[0202] In some embodiments, the set of multiples associated with a first index does not include a prime number associated with a second index, and the second index is smaller than the first index; or the set of multiples associated with a first prime number does not include a prime number, and the second prime number is smaller than the first prime number. This ensures that there are no duplicate elements between the multiple lifting factor sets.

[0203] In some embodiments, the communication device 1200 may further include a third processing component and a fourth processing component. The third processing component may be configured to: determine a base matrix from a plurality of base matrices based on at least one of a length of an information bit sequence, a code length, or a code rate, wherein a base matrix in the plurality of base matrices corresponds to a lifting factor set in a plurality of lifting factor sets. The fourth processing component may be configured to: determine a lifting factor set corresponding to the base matrix based on the base matrix.

[0204] In some embodiments, the first processing component 1201 may include: a component for determining the minimum multiple corresponding to each prime number of multiple prime numbers corresponding to multiple lifting factor sets based on at least one of the coding length of the information bit sequence or the information column length of the basic matrix; and a component for determining the lifting factor based on the minimum value of the product of each prime number and the corresponding minimum multiple.

[0205] In some embodiments, the communications apparatus 1200 may further include a fifth processing component. The fifth processing component may be configured to determine, based on the communications service type corresponding to the information bit sequence, a set of boosting factors corresponding to the communications service type. In some embodiments, the communications service type may include an eMBB type, a URLLC type, or a high-throughput type. In some embodiments, the fifth processing component may further include a component for determining that the prime numbers corresponding to the boosting factor set include 23, 31, or 37 if the communications service type is a high-throughput type; or a component for determining that the prime numbers corresponding to the boosting factor set include 11 if the communications service type is a URLLC type.

[0206] In some embodiments, the communication device 1200 may further include a sixth processing component and a seventh processing component. The sixth processing component may be configured to determine two prime numbers corresponding to the lifting factors. The seventh processing component may be configured to select a smallest prime number from the two prime numbers.

[0207] In some embodiments, the communication device 1200 may further include an eighth processing component and a ninth processing component. The eighth processing component may be configured to determine that the lifting factors correspond to the plurality of indices. The ninth processing component may be configured to select the index corresponding to the smallest prime number among the plurality of prime numbers corresponding to the plurality of indices.

[0208] This allows for a communication device that encodes or decodes based on both a prime number and a non-exponential multiple set of lifting factors, thereby preventing the number of shortened bits from increasing exponentially with increasing code length and achieving more stable encoding and decoding performance.

[0209] FIG13 is a simplified block diagram of a communication device 1300 suitable for implementing embodiments of the present disclosure. Device 1300 can be provided to implement a transmitting device or a receiving device, or a communication device including both transmitting and receiving functions. As shown, device 1300 includes one or more processors 1310 and one or more memories 1320 coupled to processors 1310. Optionally, one or more memories 1320 may also be integrated with one or more processors 1310.

[0210] Processor 1310 can be of any type suitable for the local technology network and, by way of limiting example, can include one or more of the following: a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor, and a processor based on a multi-core processor architecture. Device 1300 can have multiple processors, such as application-specific integrated circuit chips, which are time-slave to a clock synchronized with a main processor.

[0211] The memory 1320 may include one or more non-volatile memories and one or more volatile memories. Examples of non-volatile memories include, but are not limited to, read-only memory (ROM) 1324, electrically programmable read-only memory (EPROM), flash memory, hard disks, compact discs (CDs), digital video discs (DVDs), and other magnetic and / or optical storage devices. Examples of volatile memories include, but are not limited to, random access memory (RAM) 1322 and other volatile memories that do not persist during a power outage.

[0212] Computer program 1330 includes computer-executable instructions executed by associated processor 1310. Program 1330 may be stored in ROM 1320. Processor 1310 may perform any suitable actions and processes by loading program 1330 into RAM 1320.

[0213] The embodiments of the present disclosure can be implemented with the aid of program 1330, so that device 1300 performs the processes of the present disclosure as discussed with reference to Figures 6 to 11. Device 1300 may correspond to the aforementioned communication apparatus 1200, and the functional modules in communication apparatus 1200 are implemented using the software of device 1300. In other words, the functional modules included in communication apparatus 1200 are generated by the processor 1310 of device 1300 after reading the program code stored in memory 1320. The embodiments of the present disclosure may also be implemented through hardware or a combination of software and hardware.

[0214] In some embodiments, program 1330 may be tangibly embodied in a computer-readable medium that may be included in device 1300 (such as in memory 1320) or other storage device accessible by device 1300. Program 1330 may be loaded from the computer-readable medium into RAM 1322 for execution. The computer-readable medium may include any type of tangible, non-volatile memory, such as ROM, EPROM, flash memory, hard disk, CD, DVD, etc.

[0215] In some embodiments, device 1300 may further include one or more communication modules (not shown). The one or more communication modules may be coupled to processor 1310. The one or more communication modules may be configured for bidirectional communication. The one or more communication modules may have a communication interface to facilitate communication. A communication interface may represent any interface required for communication with other network elements.

[0216] In general, the various example embodiments of the present disclosure can be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. Certain aspects can be implemented in hardware, while other aspects can be implemented in firmware or software that can be executed by a controller, microprocessor or other computing device. When various aspects of the embodiments of the present disclosure are illustrated or described as block diagrams, flow charts or using some other graphical representations, it will be understood that the boxes, devices, systems, techniques or methods described herein can be implemented as non-limiting examples in hardware, software, firmware, dedicated circuits or logic, general hardware or controller or other computing device, or some combination thereof. Examples of hardware devices that can be used to implement the embodiments of the present disclosure include, but are not limited to, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard parts (ASSPs), systems on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

[0217] As an example, the embodiments of the present disclosure can be described in the context of machine executable instructions, such as in a program module executed in a device on a real or virtual processor included in a target. Generally speaking, a program module includes a routine, a program, a library, an object, a class, a component, a data structure, etc., which performs a specific task or implements a specific abstract data structure. In various embodiments, the functions of the program modules can be merged or split between the described program modules. The machine executable instructions for the program modules can be executed in a local or distributed device. In a distributed device, the program modules can be located in both a local and a remote storage medium.

[0218] The computer program code for implementing the disclosed method can be written in one or more programming languages. These computer program codes can be provided to the processor of a general-purpose computer, a special-purpose computer or other programmable data processing device so that the program code, when executed by the computer or other programmable data processing device, causes the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code can be executed entirely on a computer, partially on a computer, as an independent software package, partially on a computer and partially on a remote computer or entirely on a remote computer or server.

[0219] In the context of the present disclosure, computer program code or related data can be carried by any suitable carrier to enable a device, apparatus, or processor to perform the various processes and operations described above. Examples of carriers include signals, computer-readable media, and the like. Examples of signals can include electrical, optical, radio, acoustic, or other forms of propagated signals, such as carrier waves, infrared signals, and the like. A machine-readable medium can be any tangible medium that contains or stores a program for or related to an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination thereof. More detailed examples of machine-readable storage media include an electrical connection with one or more wires, a portable computer disk, a hard disk, RAM, ROM, EPROM, or flash memory, an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0220] In addition, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in a sequential order, or that all illustrated operations be performed to obtain the desired result. In some cases, multitasking or parallel processing can be beneficial. Similarly, although the above discussion contains certain specific implementation details, this should not be interpreted as limiting the scope of any invention or claim, but rather as a description of a specific embodiment that can be directed to a specific invention. Certain features described in this specification in the context of separate embodiments may also be integrated and implemented in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented separately in multiple embodiments or in any suitable subcombination.

[0221] Although the subject matter has been described in language specific to structural features and / or methodological acts, it should be understood that the subject matter defined in the appended claims is not limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

Claims

1. A communication method, comprising: Based on the length of the information bit sequence and the basic matrix, a lifting factor is determined from a lifting factor set, wherein the lifting factor set includes a prime number and a multiple set associated with the prime number, or the lifting factor set includes multiple lifting factors, a lifting factor in the multiple lifting factors is a product of the prime number and a multiple in a multiple set associated with the prime number, the multiples in the multiple set are positive integers, and the multiple set includes a prime number not equal to A. x , where A is a positive integer equal to or greater than 2, and x is a non-negative integer; as well as Based on the lifting factor and the basic matrix, a check matrix is ​​determined, and the check matrix is ​​used for encoding or decoding the information bit sequence.

2. The method according to claim 1, further comprising: The basic matrix is ​​one of a plurality of basic matrices; Determine the base matrix from the plurality of base matrices based on at least one of the length, the coding length or the coding rate of the information bit sequence, wherein a base matrix in the plurality of base matrices corresponds to a lifting factor set in a plurality of lifting factor sets; as well as Based on the basic matrix, the lifting factor set corresponding to the basic matrix is ​​determined.

3. The method according to any one of claims 1 to 2, wherein determining the boost factor comprises: The prime number is one of a plurality of prime numbers; Determine, based on at least one of the coding length of the information bit sequence or the information column length of the basic matrix, a minimum multiple corresponding to each of the plurality of prime numbers corresponding to the plurality of lifting factor sets; as well as The lifting factor is determined based on the minimum value of the product of each prime number and the corresponding minimum multiple.

4. The method of claim 3, wherein the minimum value among the plurality of prime numbers corresponding to the plurality of lifting factor sets is associated with at least one of the following: the number of columns in a core portion of the base matrix, the core portion comprising information columns and core check columns of the base matrix; The connection relationship between the columns in the core part of the basic matrix; the number of rows in the core portion of the base matrix; or The connection relationship between the rows in the core part of the basic matrix.

5. The method according to any one of claims 1 to 4, wherein the plurality of prime numbers corresponding to the plurality of lifting factor sets include at least one of the following: consecutive prime numbers; or Non-consecutive prime numbers with intervals greater than a predetermined value.

6. The method according to claim 5, wherein the consecutive prime numbers include {11, 13, 17, 19, 23}; or The non-continuous prime numbers whose intervals are greater than a predetermined value include {11, 17, 23}.

7. The method according to any one of claims 1 to 6, wherein the maximum value in the set of multiples is determined based on the maximum value of the lifting factor and the prime number; or The maximum value in the set of multiples is determined based on the maximum length of the information bit sequence, the number of information columns of the basic matrix corresponding to the maximum length, and the prime number.

8. The method according to any one of claims 1 to 7, wherein the maximum value in the set of multiples is associated with at least one of the following: the type of communication service corresponding to the information bit sequence; or a hardware resource limitation.

9. The method according to any one of claims 1 to 8, wherein the set of multiples comprises at least one of the following: consecutive integers separated by predetermined intervals, The set of integers that satisfies the piecewise linear function; a range of multiples; or Numbers within the range are not selected as the multiples.

10. The method according to any one of claims 1 to 9, further comprising: Determine two prime numbers corresponding to the lifting factors; as well as The smallest prime number is selected from the two prime numbers. 11 . The method according to claim 1 , wherein the set of lifting factors further comprises a non-prime number, wherein the non-prime number comprises at least one of the following: 4, 6, 9, 15, 22 or 26.

12. The method according to any one of claims 1 to 11, wherein the boosting factor set further comprises: The index associated with the prime number.

13. The method according to claim 12, further comprising: Determining that the boost factor corresponds to a plurality of indexes; as well as Select an index corresponding to the smallest prime number among the multiple prime numbers corresponding to the multiple indices.

14. A method according to claim 12 or 13, wherein the set of multiples associated with a first index does not include a value that is a prime number associated with a second index, the second index being smaller than the first index; or Wherein the set of multiples associated with the first prime number does not include the value of a second prime number, and the second prime number is smaller than the first prime number.

15. The method according to any one of claims 1 to 14, further comprising: Based on the communication service type corresponding to the information bit sequence, the boosting factor set corresponding to the communication service type is determined, and the communication service type includes an enhanced mobile broadband (eMBB) type, an ultra-reliable low-latency communication (URLLC) type, or a high-throughput type.

16. The method of claim 15, wherein determining the set of boosting factors comprises: The communication service type is the high throughput type, and the prime numbers corresponding to the boosting factor set are determined to include 23, 31 or 37; or The communication service type is the URLLC type, and it is determined that the prime numbers corresponding to the lifting factor set include 11.

17. A communication device comprising: processor; as well as memory, including computer program code, The computer program code, when executed by the processor, causes the method according to any one of claims 1 to 16 to be performed.

18. A communication device comprising means for performing the method according to any one of claims 1 to 16.

19. A computer-readable storage medium comprising machine-executable instructions which, when executed by a device, cause the method according to any one of claims 1 to 16 to be performed.

20. A computer program product comprising a computer program which, when run on a device, causes the method according to any one of claims 1 to 16 to be performed.

21. A communication system comprising: A sending device, wherein the sending device encodes an information bit sequence to be sent by executing the method according to claims 1 to 16; as well as A receiving device, wherein the receiving device decodes the received encoded information bit sequence by executing the method according to claims 1-16.

Images