Communication method, communication device, communication apparatus, and computer-readable storage medium

Abstract

The present disclosure relates to a communication method, a communication device, a communication apparatus, and a computer-readable storage medium. The method comprises: on the basis of the length of an information bit sequence and a basic matrix, determining a lifting factor from a lifting factor set; on the basis of the lifting factor, and a prime number and a first coefficient which correspond to the lifting factor, determining a translation value set, wherein a translation value in the translation value set corresponds to a non-zero position in the basic matrix, and the first coefficient is a non-negative integer; and on the basis of the translation value set and the basic matrix, determining a check matrix for encoding or decoding of the information bit sequence. Therefore, the translation value set that does not depend on random search can be realized, and it is ensured that the circle property under different encoding lengths and encoding rates is good. In addition, a wider lifting factor set can be supported, and more stable encoding and decoding performance can be realized.

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 traditional 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 translation value set so as to ensure stable encoding and decoding performance for longer coding lengths in future scenarios.

[0005] According to the first aspect of an embodiment of the present disclosure, a communication method is provided. The method can be executed by a communication device. The method includes: determining a lifting factor from a lifting factor set based on the length of the information bit sequence and a basic matrix; determining a translation value set based on the lifting factor, a prime number corresponding to the lifting factor and a plurality of first coefficients, wherein the translation values ​​in the translation value set correspond to non-zero positions in the basic matrix, and the first coefficients are non-negative integers; and determining a check matrix based on the translation value set and the basic matrix for encoding or decoding the information bit sequence. In this way, a translation value set that does not rely on random search can be realized, ensuring good loop properties under different coding lengths and coding rates. In addition, a wider range of lifting factor sets can be supported to achieve more stable coding and decoding performance.

[0006] In some embodiments, determining the set of shift values ​​may include: determining, based on the lifting factor or the length of the information bit sequence, a segment corresponding to the lifting factor or the length of the information bit sequence; and determining the set of shift values ​​for the segment. Thus, the loop property of each segment may be optimized.

[0007] In some embodiments, determining the set of translation values ​​may include: determining multiple values ​​of the first coefficient based on a non-zero position in the base matrix; performing a modulo operation on the multiple values ​​based on the prime number; and combining the multiple modulo values ​​to determine the translation value for the non-zero position. Thus, the translation value may be generated through multiple stages of modulo operation and combination.

[0008] In some embodiments, determining the plurality of values ​​may include generating the plurality of values ​​based on a first sequence corresponding to rows of the base matrix and a second sequence corresponding to columns of the base matrix. Thus, the first coefficients may be generated computationally, thereby generating the translation values. In some embodiments, determining the plurality of values ​​may include obtaining the plurality of values ​​from one or more sets of first coefficients. Thus, the first coefficients may be determined by table lookup, thereby generating the translation values.

[0009] In some embodiments, the translation value may satisfy the following formula: Among them H i，j represents the translation value of the element in the i-th row and j-th column of the basic matrix, represents the first coefficient in the tth term, R i represents the i-th element in the first sequence corresponding to the row of the base matrix, C j represents the jth element in the second sequence corresponding to the column of the base matrix, u t represents the power of the tth item for the i-th element in the first sequence, v t represents the power of the tth item for the jth element in the second sequence, u t and v t is an integer, and t is a positive integer, Z idt represents the second coefficient in the tth term, and the second coefficient is a positive integer, k t Denotes the third coefficient in the t-th term, and the third coefficient is a non-negative integer, and p denotes a prime number. Thus, the translation value can be determined by calculation based on the formula.

[0010] In some embodiments, u t and v t The following formula can be satisfied: t +v t =t+1. Thus, the power of each term in the formula for the elements in the first sequence and the second sequence can be determined.

[0011] In some embodiments, the second coefficient may be based on t, the lifting factor, and the prime number. Thus, an adjustment factor for the prime number in each term of the formula may be determined.

[0012] In some embodiments, the third coefficient may be based on t and a prime number. In some embodiments, the third coefficient may be p t-1 In some embodiments, the value of t is 3, 4, 5 or 6. Thus, the adjustment factor for the translation value in each term of the formula can be determined.

[0013] In some embodiments, the first coefficient in the t-th term can be determined based on the non-zero position from the set of first coefficients corresponding to the t-th term. Thus, the first coefficient in each term of the formula can be determined by looking up a table.

[0014] In some embodiments, the method may further include: determining an index of a segment corresponding to the lifting factor based on the lifting factor; and determining a value of t based on the index of the segment. Thus, the number of terms in the formula may be determined based on the segment of the lifting factor. In some embodiments, the range of the segment is [(l-1)×p 2 ,l×p 2 ], where l represents the index of the segment and p represents the prime number. In this way, the segment division can be achieved.

[0015] In some embodiments, the method may further include: determining an index of a segment corresponding to the length based on the length of the information bit sequence; and determining a value of t based on the index of the segment. Thus, the number of terms in the formula may be determined based on the length of the information bit sequence.

[0016] In some embodiments, the method may further include: determining a first sequence from a plurality of first sequences and determining a second sequence from a plurality of second sequences based on a lifting factor, thereby using different storage sequences for different lifting factors.

[0017] In some embodiments, the elements in the first sequence and the second sequence may be associated with at least one of the following: the minimum value of the prime numbers in the prime number set corresponding to the lifting factor set; the maximum value among multiple prime numbers; the maximum prime number that is divisible by the maximum lifting factor in multiple lifting factor sets; or the prime number that is divisible by all lifting factors in multiple lifting factor sets. Thus, the value characteristics of the elements in the storage sequence can be specified.

[0018] In some embodiments, the prime number may be the largest prime number that is divisible by the lifting factor.Thereby, the prime number to be used to determine the set of translation values ​​may be determined.

[0019] In some embodiments, the set of translation values may satisfy at least one of the following: the first set of columns associated with the first row of the base matrix and the second set of columns associated with the second row of the base matrix have no overlap, where the elements in the first sequence corresponding to the first row and the elements in the first sequence corresponding to the second row are the same; the first set of columns and the second set of columns intersect at one column; the translation values corresponding to the intersecting column in the first row and the second row are the same; the translation values corresponding to all columns in the first row and the second row differ by a first offset value; the translation value pairs for the same column in the third row and the fourth row of the base matrix modulo a prime number associated with the lifting factor yield different remainders, where the elements in the first sequence corresponding to the third row and the elements in the first sequence corresponding to the fourth row are different; the first set of rows associated with the first column of the base matrix and the second set of rows associated with the second column of the base matrix have no overlap, where the elements in the second sequence corresponding to the first column and the elements in the second sequence corresponding to the second column are the same; the first set of rows and the second set of rows intersect at most one row; the translation values corresponding to the intersecting row in the first column and the second column are the same; the translation values corresponding to the intersecting row in the first column and the second column differ by a second offset value; the translation value pairs for the same row in the third column and the fourth column of the base matrix modulo a prime number associated with the lifting factor yield different remainders, where the elements in the second sequence corresponding to the third column and the elements in the second sequence corresponding to the fourth column are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same column in the two rows in the first sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same row in the two columns in the second sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p and c < p, p is a prime number, and k, t and c are integers associated with the translation value and the prime number, then the t values corresponding to the same column in the two rows in the first sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p and c < p, p is a prime number, and k, t and c are integers associated with the translation value and the prime number, then the t values corresponding to the same row in the two columns in the second sequence for the two translation values are different; or the set of translation values is for a region in the base matrix, and the region corresponds to a coding rate range. Thus, the characteristics of the set of translation values are defined.

[0020] In some embodiments, the method may further include: determining a set of shift values ​​corresponding to a communication service type based on the communication service type corresponding to the information bit sequence, where the communication service type includes enhanced mobile broadband (eMBB), massive machine type communication (mMTC), ultra-reliable low latency communication (URLLC), or high throughput. Thus, different sets of shift values ​​may be used for different scenarios to better meet scenario requirements.

[0021] In some embodiments, determining the shift value set may include: if the communication service type is a high throughput type, determining that the prime number corresponding to the boosting factor includes 23, 31, or 37; or if the communication service type is a URLLC type, determining that the prime number corresponding to the boosting factor includes 11. Thus, by selecting different prime numbers for different scenarios, different shift value sets can be used for different scenarios.

[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 a length of an information bit sequence and a base matrix; a second processing component configured to determine a translation value set based on the lifting factor, a prime number corresponding to the lifting factor, and a plurality of first coefficients, wherein the translation values ​​in the translation value set correspond to non-zero positions in the base matrix, and the first coefficients are non-negative integers; and a third processing component configured to determine a check matrix based on the translation value set and the base matrix, for use in encoding or decoding the information bit sequence.

[0023] In some embodiments, the second processing component may include: a component for determining a segment corresponding to the lifting factor or the length of the information bit sequence based on the lifting factor or the length of the information bit sequence; and a component for determining the set of translation values ​​for the segment.

[0024] In some embodiments, the second processing component may include: a component for determining multiple values ​​of the first coefficient based on a non-zero position in the basic matrix; a component for performing a modulo operation on the multiple values ​​based on the prime number; and a component for performing a combination operation on the multiple modulo values ​​to determine the translation value for the one non-zero position.

[0025] In some embodiments, the means for determining the plurality of values ​​may include means for generating the plurality of values ​​based on a first sequence corresponding to rows of the base matrix and a second sequence corresponding to columns of the base matrix. In some embodiments, the means for determining the plurality of values ​​may include means for obtaining the plurality of values ​​from one or more sets of first coefficients.

[0026] In some embodiments, the translation value may satisfy the following formula: Among them H i，j represents the translation value of the element in the i-th row and j-th column of the basic matrix, represents the first coefficient in the tth term, R i represents the i-th element in the first sequence corresponding to the row of the base matrix, C j represents the jth element in the second sequence corresponding to the column of the base matrix, u t represents the power of the tth item for the i-th element in the first sequence, v t represents the power of the tth item for the jth element in the second sequence, u t and v t is an integer, and t is a positive integer, Z idt represents the second coefficient in the tth term, and the second coefficient is a positive integer, k t denotes the third coefficient in the t-th term, and the third coefficient is a non-negative integer, and p denotes a prime number.

[0027] In some embodiments, u t and v t The following formula can be satisfied: t +v t =t+1.

[0028] In some embodiments, the second coefficient may be based on t, a lifting factor, and a prime number.

[0029] In some embodiments, the third coefficient may be based on t and a prime number. In some embodiments, the third coefficient may be p t-1 In some embodiments, the value of t is 3, 4, 5 or 6.

[0030] In some embodiments, the first coefficient in the t-th term may be determined based on non-zero positions from a set of first coefficients corresponding to the t-th term.

[0031] In some embodiments, the apparatus may further include: a fourth processing component configured to determine an index of a segment corresponding to the lifting factor based on the lifting factor; and a fifth processing component configured to determine a value of t based on the index of the segment. In some embodiments, the range of the segment is [(l-1)×p 2 ,l×p2 ], where l represents the index of the segment and p represents the prime number.

[0032] In some embodiments, the apparatus may further include: a sixth processing component configured to determine, based on the length of the information bit sequence, an index of a segment corresponding to the length; and a seventh processing component configured to determine a value of t based on the index of the segment.

[0033] In some embodiments, the apparatus may further include: an eighth processing component configured to determine a first sequence from a plurality of first sequences and determine a second sequence from a plurality of second sequences based on a lifting factor.

[0034] In some embodiments, the elements in the first sequence and the second sequence can be associated with at least one of the following: the minimum value of the prime numbers in the prime number set corresponding to the said lifting factor set; the maximum value of multiple prime numbers; the largest prime number that is divisible by the largest lifting factor in multiple lifting factor sets; or the prime number that is divisible by all lifting factors in multiple lifting factor sets.

[0035] In some embodiments, the prime number may be the largest prime number that is divisible by the lifting factor.

[0036] In some embodiments, the set of translation values may satisfy at least one of the following: the first column set associated with the first row of the base matrix and the second column set associated with the second row of the base matrix do not overlap, wherein the elements in the first sequence corresponding to the first row and the elements in the first sequence corresponding to the second row are the same; the first column set and the second column set intersect in one column; the translation values corresponding to the intersecting column in the first row and the second row are the same; the translation values corresponding to all columns in the first row and the second row differ by a first offset value; the translation value pairs of the same column in the third row and the fourth row of the base matrix modulo a prime number associated with the lifting factor result in different remainders, wherein the elements in the first sequence corresponding to the third row and the elements in the first sequence corresponding to the fourth row are different; the first row set associated with the first column of the base matrix and the second row set associated with the second column of the base matrix do not overlap, wherein the elements in the second sequence corresponding to the first column and the elements in the second sequence corresponding to the second column are the same; the first row set and the second row set intersect in at most one row; the translation values corresponding to the intersecting row in the first column and the second column are the same; the translation values corresponding to the intersecting row in the first column and the second column differ by a second offset value; the translation value pairs of the same row in the third column and the fourth column of the base matrix modulo a prime number associated with the lifting factor result in different remainders, wherein the elements in the second sequence corresponding to the third column and the elements in the second sequence corresponding to the fourth column are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same column in the two rows in the first sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same row in the two columns in the second sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p and c < p, p is a prime number, and k, t and c are integers associated with the translation value and the prime number, then the t values corresponding to the same column in the two rows in the first sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p and c < p, p is a prime number, and k, t and c are integers associated with the translation value and the prime number, then the t values corresponding to the same row in the two columns in the second sequence for the two translation values are different; or the set of translation values is for a region in the base matrix, and the region corresponds to a coding rate range.

[0037] In some embodiments, the device may also include: a ninth processing component, configured to determine a set of translation values ​​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, mMTC type, URLLC type or high throughput type.

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

[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, which, when executed by a device, enable the method according to the first aspect to be performed.

[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] As will be understood from the following description of exemplary embodiments, the proposed technical solution can generate a set of translation values ​​without relying on random search, thereby theoretically ensuring good loop properties across various code lengths and code rates. Furthermore, it can support a wider set of lifting factors, 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] FIG6 shows a schematic diagram of a communication process according to an embodiment of the present disclosure;

[0053] FIG7 shows a schematic diagram of an exemplary table according to an embodiment of the present disclosure;

[0054] FIG8A 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;

[0055] FIG8B is a schematic diagram showing simulation results of the signal-to-noise ratio as a function of the length of the information bit sequence according to an embodiment of the present disclosure;

[0056] FIG8C is a schematic diagram showing simulation results of signal-to-noise ratio changes with coding rate according to an embodiment of the present disclosure;

[0057] FIG8D is a schematic diagram showing another simulation result of the variation of the signal-to-noise ratio with the coding rate according to an embodiment of the present disclosure;

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

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

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

[0061] 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.

[0062] 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.

[0063] 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.

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

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

[0066] (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

[0067] (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.

[0068] 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.

[0069] 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.

[0070] 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.

[0071] 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.

[0072] In this application, "sending information to...(terminal)" can be understood as meaning that the destination of the information is the terminal. This can include sending information directly or indirectly to the terminal. "Receiving information from...(terminal)" can be understood as meaning that the source of the information is the terminal, and can include receiving information directly or indirectly from the terminal. For example, directly sending information to a terminal can mean that the information is sent from the transmitting end to the terminal via the air interface, and indirectly sending information to a 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 a 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 meaning that the destination of the information is 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 receiving information from the access network device / network device can mean that the information is received from the access network device / network device via the air interface, and indirectly receiving information from 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 transmission, 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.

[0073] 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.

[0074] 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".

[0075] 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).

[0076] As mentioned above, during the encoding or decoding process, it is necessary to generate a check matrix based on a predetermined basic matrix, a set of lifting factors, and a set of translation values. However, the translation values ​​in the traditional translation value set rely on random search and cannot theoretically guarantee the cycle property. Since the LDPC code working scenario requires fine-grained performance, it is inevitable that there will be a situation with an error floor. Future scenarios support longer coding lengths, so the translation value design will be more complicated. Traditional solutions that rely on random search and a specific numerical form of a translation value set in a table may not be able to support this future scenario.

[0077] In view of this, embodiments of the present disclosure provide a communication solution. In this solution, a communication device can determine a lifting factor from a set of lifting factors based on the length of an information bit sequence and a base matrix. A set of shift values ​​for non-zero positions in the base matrix is ​​determined based on the lifting factor, a prime number corresponding to the lifting factor, and a first coefficient that is a non-negative integer. A parity check matrix is ​​determined based on the set of shift values ​​and the base matrix for use in encoding or decoding the information bit sequence.

[0078] This approach generates a set of shift values ​​based on the lifting factor, the prime number corresponding to the lifting factor, and the first coefficient, which is a non-negative integer, without relying on random search. This theoretically guarantees good cycle properties across various code lengths and coding rates. Furthermore, it supports a wider set of lifting factors, enabling more stable encoding and decoding performance.

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

[0080] 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.

[0081] 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.

[0082] 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.

[0083] 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.

[0084] 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).

[0085] 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.

[0086] 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.

[0087] 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.

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

[0089] 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.

[0090] 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.

[0091] 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.

[0092] 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.

[0093] Currently, LDPC codes have been selected by the Third Generation Partnership Project (3GPP) as the data 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.

[0094] The encoding method of LDPC code is to generate a check matrix. The LDPC code used in mainstream applications has a 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.

[0095] 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.

[0096] 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.

[0097] 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.

[0098] 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.

[0099] 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)

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

[0101] 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)

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

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

[0104] 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.

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

[0106] 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.

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

[0108] 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.

[0109] 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.

[0110] 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.

[0111] 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.

[0112] 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.

[0113] However, the shift values ​​in the shift value set shown in Figure 5 are determined through random search, so the cycle property cannot be theoretically guaranteed. Since LDPC codes require fine-grained performance, they inevitably have an error floor. Future scenarios will support longer code lengths, making shift value design even more complex. In this case, the traditional solution shown in Figure 5 may not be able to support this future scenario.

[0114] In view of this, an embodiment of the present disclosure proposes a communication solution for solving the above and other potential problems. This is described in detail below in conjunction with Figure 6. Figure 6 shows a schematic diagram of a communication process 600 according to an embodiment of the present disclosure. It will be understood that the communication process shown in Figure 6 is only exemplary and not restrictive. The embodiment of the present disclosure may include steps not shown in Figure 6, or omit certain steps shown in Figure 6. In addition, the order of the steps in Figure 6 is for illustration only and not for limitation. The communication process 600 can be performed between a sending device and a receiving device in the communication system 100. "Sending device" or "receiving device" can refer to the sending device or the receiving device itself, or it can refer to a device that can support the sending device or the receiving device to implement this function. For convenience, the sending device and the receiving device are uniformly used for description below.

[0115] As shown in Figure 6, in step 610, 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, that is, the length of the pure information bit sequence / payload. 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.

[0116] In some embodiments, 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 base matrix, and select a value adjacent to the expected value from the lifting factor set 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 value may be selected as the lifting factor.

[0117] It should be understood that any known or future-developed boosting factor set is feasible, and the embodiments of the present disclosure do not limit the boosting factor set. In addition, any known or future-developed method for determining the boosting factor from the boosting factor set is also feasible, and the embodiments of the present disclosure do not limit this aspect.

[0118] 6 , at step 620 , the transmitting device may determine a translation value set based on the lifting factor, the prime number corresponding to the lifting factor, and a plurality of first coefficients that are non-negative integers. The translation values ​​in the translation value set correspond to non-zero positions in the base matrix.

[0119] A prime number refers to a positive integer having no other factors except 1 and itself. In some embodiments, the prime number can be any prime number that is divisible by the lifting factor. In some embodiments, the prime number can be the maximum prime number that is divisible by the lifting factor. In some embodiments, the prime number can be a prime number stored in association with the lifting factor set where the lifting factor is located. For example, one or more prime numbers (also referred to as a prime number set) can be stored in association with the lifting factor set. In this case, a prime number can be selected from the prime number set for determining the translation value set. When the prime number set includes multiple prime numbers, the minimum prime number that is divisible by the lifting factor can be selected for determining the translation value set.

[0120] In some embodiments, multiple values ​​of the first coefficient can be determined based on a non-zero position in the base matrix. A modulo operation is performed on each of the multiple values ​​based on a prime number corresponding to the lifting factor. A combination operation (e.g., addition) of the multiple modulo values ​​is then performed to generate a translation value for the non-zero position. In this way, a set of translation values ​​can be determined for all non-zero positions in the base matrix.

[0121] In some embodiments, the first coefficients can be generated based on a sequence corresponding to the rows of a base matrix (referred to herein as the first sequence for convenience) and a sequence corresponding to the columns of the base matrix (referred to herein as the second sequence for convenience). In this case, the first and second sequences are predetermined for the base matrix. In other words, the first and second sequences are pre-stored. Furthermore, the edges of the base matrix and the rules for generating translation values ​​also need to be pre-stored. In this way, multiple values ​​for the first coefficient can be generated.

[0122] In some embodiments, the first coefficient can be determined from a predetermined set of first coefficients. In other words, the set of first coefficients is pre-stored. In this case, the edges of the base matrix and the rules for generating translation values ​​also need to be pre-stored. In this way, by repeatedly searching multiple sets of first coefficients, multiple values ​​of the first coefficient can be determined.

[0123] For ease of understanding, some exemplary embodiments for determining a translation value set are described below. In some embodiments, the translation values ​​in the translation value set may satisfy the following equation (6):

[0124] Among them H i，j represents the translation value of the element in the i-th row and j-th column of the basic matrix; represents the first coefficient in the tth term, R i represents the i-th element in the first sequence corresponding to the row of the base matrix, C j represents the jth element in the second sequence corresponding to the column of the base matrix, u t represents the power of the tth item for the i-th element in the first sequence, v t represents the power of the tth item for the jth element in the second sequence, u t and v t is an integer, and t is a positive integer; Z idt represents the second coefficient in the t-th term, and the second coefficient is a positive integer; k t represents the third coefficient in the t-th term, and the third coefficient is a non-negative integer; and p represents a prime number.

[0125] Unless otherwise specified in this application, the translation values ​​in the translation value set can be calculated using formulas such as (6) or other forms in this application. Optionally, the receiving end or the transmitting end can directly store the translation values ​​in the translation value set, and the translation values ​​satisfy formulas (6) or other forms in this application.

[0126] Therefore, the translation value in the translation value set can be calculated by the formula: It should be understood that formula (6) is only an example, and any other suitable formula is also feasible.

[0127] In some embodiments, the first coefficient may be generated based on the first sequence and the second sequence. For example, the first coefficient may be the product of the power of the elements in the first sequence and the power of the elements in the second sequence, as in equation (6): It should be noted that this is only an example, and the first coefficient may be generated by other formulas based on the first sequence and the second sequence.

[0128] The implementation of the first sequence and the second sequence is described below. The number of elements in the first sequence corresponds to the number of rows of the basic matrix, and the number of elements in the second sequence corresponds to the number of columns of the basic matrix. In some embodiments, the elements in the first sequence and the rows of the basic matrix can correspond sequentially. That is, the i-th row in the basic matrix can correspond to the i-th element of the first sequence, where i is a positive integer. In some embodiments, the elements in the second sequence and the columns of the basic matrix can correspond sequentially. That is, the j-th row in the basic matrix can correspond to the j-th element of the second sequence, where j is a positive integer. It should be understood that other correspondences between the elements in the first sequence and the rows of the basic matrix and between the elements in the second sequence and the columns of the basic matrix are also feasible, and the embodiments of the present disclosure do not limit this aspect. For convenience, the description herein takes sequential correspondence as an example.

[0129] In some embodiments, for example, when the number of rows and columns of the base matrix is ​​the same, the first sequence and the second sequence may be the same. In this case, only one sequence may be stored, which serves as both the first sequence and the second sequence. In some embodiments, the first sequence and the second sequence may be different. In this case, corresponding sequences are stored for the first sequence and the second sequence, respectively.

[0130] In some embodiments, the elements in the first and second sequences may be associated with the minimum value of the prime numbers in the set of prime numbers corresponding to the lifting factor set. For example, the elements in the first and second sequences may be elements in a q-tuple domain, where q > 2, and q is the minimum value in the set of prime numbers. In some embodiments, the elements in the first and second sequences may be associated with the maximum value in the set of prime numbers. For example, the elements in the first and second sequences may be elements in a q-tuple domain, where q > 2, and q is the maximum value in the set of prime numbers. In some embodiments, the elements in the first and second sequences may be associated with the largest prime number that is divisible by the largest lifting factor in the set of lifting factors. For example, the elements in the first and second sequences may be elements in a q-tuple domain, where q > 2, and q is the largest prime number that is divisible by the largest lifting factor in the set of lifting factors. In some embodiments, the elements in the first and second sequences may be associated with a prime number that is divisible by all lifting factors in the set of lifting factors. For example, the elements in the first and second sequences may be elements in a q-tuple domain, where q > 2, and q is the prime number that is divisible by all lifting factors in the set of lifting factors. It should be understood that other suitable ways of determining the elements in the first sequence and the second sequence are also possible.

[0131] In some embodiments, multiple first sequences and multiple second sequences may be stored. This allows for adapting to different scenarios. In some embodiments, a first sequence may be determined from the multiple first sequences, and a second sequence may be determined from the multiple second sequences based on a lifting factor. In some embodiments, only one first sequence and one second sequence may be stored. In this case, the first and second sequences may be used directly.

[0132] The first sequence and the second sequence can be used to establish the relationship between the base matrix and the translation value. For example, each non-zero position of the base matrix corresponds to a row number i and a column number j. The row number i corresponds to the i-th element R of the first sequence (labeled as R). i , column number j corresponds to the jth element C of the second sequence (labeled C) j Elements corresponding to the rows and columns of the non-zero positions of the basic matrix can be read from the first sequence and the second sequence, respectively, for calculation of the first coefficient.

[0133] In some embodiments, ut and v t The following formula (7) can be satisfied: t +v t =t+1 (7)

[0134] where u t represents the power of the tth term of formula (6) for the i-th element in the first sequence, v t represents the power of the jth element in the second sequence in the tth term of formula (6), u t and v t is an integer, and t is a positive integer. In some embodiments, u t =t,v t = 1. In some embodiments, u t =1,v t =t.

[0135] In some alternative embodiments, the first coefficient can be determined from a predetermined set of first coefficients. In some embodiments, for each of the t terms in formula (6), the first coefficient in the term for each non-zero position of the base matrix can be stored, thereby obtaining t sets of first coefficients. For example, the t sets of first coefficients can be stored in the form of t tables, where t is at least 2. The number of rows in each table is equal to the number of columns. In some embodiments, the storage content of each table can correspond to the first sequence and the second sequence. For example, the position of an element in the table can correspond to a row number g and a column number h, where g≥1 and h≥1. The row number g can correspond to an element in the q-ary field of the first sequence, and the column number h can correspond to an element in the q-ary field of the second sequence.

[0136] In some embodiments, the element in the first sequence corresponding to row number g is g + a, and the element in the second sequence corresponding to column number h is h + b, where a and b are arbitrary constants. In some embodiments, a = b. For example, a = b = 0. This simplifies the description of the stored content. For another example, a = b = -1. Thus, the elements in both the first and second sequences are elements of the q-ary field, making calculations easier and facilitating hardware implementation.

[0137] FIG7 shows a schematic diagram 700 of an exemplary table according to an embodiment of the present disclosure. As shown in FIG7 , the rows correspond to the elements in the q-ary domain (the first column), and the columns correspond to the elements in the q-ary domain (the first row). The correspondence between the table and the first coefficient (or translation value) is achieved by the first sequence and the second sequence. In some embodiments, it is assumed that the elements of the first sequence and the second sequence corresponding to the non-zero position of the base matrix in the i-th row and the j-th column are R i and C j By looking for R i and Cj The corresponding table position, the table element at this position can be read. For example, the element R of the first sequence i and the element C of the second sequence j are all q-domain elements. These elements have a single mapping relationship with the q-domain elements corresponding to the rows or columns of the table. That is, each R i Corresponding to a row of the table, each C j Corresponds to a column of the table.

[0138] Through the above process, each non-zero position in the base matrix can be mapped to a position in each table, but a position in each table may correspond to multiple non-zero positions in the base matrix. Specifically, if the rows and columns of the base matrix correspond to the same elements in the first and second sequences, they will correspond to the same elements in the same positions in each table.

[0139] The above is how to use the table. Next, we will describe the storage content of the table. The table elements are values ​​determined only by the q-ary field elements corresponding to the row and column. In some embodiments, it is assumed that the g-th row of the table corresponds to the element g+a in the first sequence, and the h-th column of the table corresponds to the element h+b in the second sequence. The value stored in the g-th row and h-th column of Table 1 can be (g+a)(h+b)mod p, and the value stored in the g-th row and h-th column of Table 2 can be (g+a) 2 (h+b)mod p or (g+a)(h+b) 2 Mod p, ..., the value stored in the gth row and hth column of table t can be Where t1+t2=t+1. That is, the specific correspondence between the table elements and the finite field elements in each table can be different. The elements in the t tables can correspond to the t items in formula (6) or (7).

[0140] Therefore, by looking up the table multiple times to obtain the first coefficient of each term in the formula, the computational complexity can be reduced.

[0141] In some embodiments, the second coefficient can be based on t, the lifting factor, and the prime number. In some embodiments, the second coefficient can be determined by the following formula (8): idt =mod(mod(Zc,p t+1 ), p t ) (8)

[0142] where Z idt represents the second coefficient in the tth term of formula (6), Zc represents the lifting factor, and p represents the prime number corresponding to the lifting factor. It can be seen that there are multiple stages of modulo in formula (8). The parameters related to the prime number are modulo multiple stages with respect to the lifting factor, and the object of the first stage of modulo is p times the object of the second stage of modulo.

[0143] In some alternative embodiments, the second coefficient Z idt =1 holds for all t, that is, for each term of formula (6). In some alternative embodiments, for some terms of formula (6), the second coefficient can be determined by formula (8), while for other terms of formula (6), the second coefficient is 1.

[0144] In some embodiments, the third coefficient may be based on t and a prime number. In some embodiments, the third coefficient may be determined by the following equation (9): t =N×p t-1 (9)

[0145] where k t represents the third coefficient in the t-th term of formula (6), N represents a non-negative integer, and p represents the prime number corresponding to the lifting factor.

[0146] In some embodiments, assuming v t =1, formula (6) can be written as the following formula (10):

[0147] In this example, a fixed constant is added that does not change with the position i and j. Since the fixed constant is applied to all translation values, the overall circle properties can remain unchanged.

[0148] In some embodiments, different sets of translation values ​​may be obtained for different needs. In other words, a set of translation values ​​may be obtained for a segment. In some embodiments, the set of translation values ​​may be obtained based on a formula calculation. For example, different numbers of terms in the formula may be used for different segments. In some embodiments, the set of translation values ​​may be obtained based on a table lookup. For example, different tables may be searched for different segments. It should be understood that any suitable form of formula or table is feasible, and the embodiments of the present disclosure are not limited thereto.

[0149] In some embodiments, the segments may be divided based on a lifting factor. In some embodiments, the segments may be divided based on information bit sequence length. An example embodiment for segment division is described below.

[0150] In some embodiments, the number of terms t in the formula may depend on the segment to which the lifting factor belongs. In some embodiments, the transmitting device may determine the index of the segment corresponding to the lifting factor based on the lifting factor. Based on the index of the segment, the transmitting device may determine the value of t. In some embodiments, c×p (where c is a constant and p is a prime number corresponding to the lifting factor) may be selected as the node for dividing the segment, and the length of the segment may be a multiple of p. For example, the segment for the lifting factor may be divided into:

[0151] Segment 1: Lift factor less than or equal to p 2

[0152] Segment 2: Lift factor greater than p 2 and less than or equal to 2p 2

[0153] Segment 3: Lift factor greater than 2p 2 and less than or equal to 3p 2

[0154] …

[0155] Segment t: the improvement factor is greater than (t-1)×p 2 and less than or equal to t×p 2 .

[0156] It should be understood that the above segmentation is for illustrative purposes only and is not intended to be limiting. In some embodiments, the segmentation of lifting factors can also be based on the index corresponding to the lifting factor set. In other words, lifting factors corresponding to the same index are in the same segment. In this case, the number of terms t in the formula corresponds to the index corresponding to the lifting factor set.

[0157] In some embodiments, the number of terms t in the formula may depend on the segment to which the length of the information bit sequence belongs. In some embodiments, the transmitting device may determine the index of the segment corresponding to the length based on the length of the information bit sequence. Based on the index of the segment, the transmitting device may determine the value of t. In some embodiments, the segments for the length of the information bit sequence may be divided into:

[0158] Segment 1: (0, K1)

[0159] Segment 2: (K1, K2]

[0160] …

[0161] Segment t: (K t-1 , K t ).

[0162] In some embodiments, the segments can be evenly divided, i.e., each segment has the same length. This optimizes the loop properties of each segment. In some alternative embodiments, the segments can be unevenly divided, i.e., each segment has a different length. In this case, the description complexity is very low, and the optimal loop properties can be maintained.

[0163] In some embodiments where the first coefficient is determined from a set of predetermined first coefficients, a set of first coefficients to be used (e.g., multiple tables) may be determined for each segment. Assume that k segments are divided according to the lifting factors, namely (0, Z1), (Z1, Z2), ..., (Z k-1, Z k ). In some embodiments, the i-th segment may correspond to the i-th table, where i is a positive integer. If the lifting factor is in the i-th segment, the i-th table is searched to obtain the corresponding first coefficient. In some embodiments, the i-th segment needs to use the 1st to i-th tables. In some embodiments, the table to be used in the i-th segment may be stored as a function of i, for example, the i-th segment uses the i-th and i+1-th tables. If the segments are divided according to the length of the information bit sequence, the table to be used may also be determined in a similar manner, which will not be described in detail here.

[0164] In general, the general form of the formula used for each segment is shown in formula (6) or (7), but the formula for each segment is different in that: (1) the number of terms in the calculation formula corresponding to different segments is different; (2) the k value of each term in the calculation formula corresponding to different segments is different. t Different. In the same segment, the coefficients and number of terms of the calculation formula are the same, but they may be different due to the difference in the lifting factor or the length of the information bit sequence in the same segment. idt Note that the k listed in aspect (2) here t In some alternative embodiments, the situation where the first aspect does not include a certain item can also be represented by k t =0 to achieve this.

[0165] Taking the division of segments according to the lifting factor as an example, the above two aspects are described in more detail. Regarding aspect (1), for example, when the maximum value of the lifting factor segment is less than p 3 In the case of , the calculation formula includes the first and second items; the minimum value of the lifting factor segment is greater than or equal to p 3 In the case of , the calculation formula includes the first, second, and third items. It can be seen that the main feature is that the number of items in the calculation formula corresponding to different segments is different. In some embodiments, for each segment, the calculation formula may include consecutive items from the first to the tth item. In some embodiments, for any segment, at least two items of the calculation formula may be included, such as the first and second items. In some embodiments, for some segments, some non-consecutive items of the calculation formula may be included.

[0166] Regarding aspect (2), the following specific example is given. The calculation formula corresponding to segment 1 can be The calculation formula corresponding to segment 2 can be The calculation formula corresponding to segment 3 is: The other aspects of the calculation formula for each segment are similar to those described in formula (6) or (7) and will not be repeated here. In this example, the main feature is that the constant k corresponding to different segments is tDifferent. Assume that the highest term of the calculation formula corresponding to the current segment is t max , then the features here can be summarized as k tmax The upper bound Z of the boost factor of the segment max In some embodiments, In this case, only the coefficient of the highest term of the calculation formula changes from segment to segment. In some alternative embodiments, all terms of the calculation formula contain k t In some alternative embodiments, all items in the calculation formula include k t = 1. In this case, all terms in the calculation formula contain k t Does not change with the segment.

[0167] Regarding aspects (1) and (2), the correspondence between the lifting factor (or the length of the information bit sequence) and the segment and the correspondence between the segment and the terms of the formula can be stored. Alternatively, the correspondence between the lifting factor (or the length of the information bit sequence) and the segment and the correspondence between the segment and the terms of the formula can be stored. t The storage format can be a table, sequence, text description or other appropriate form.

[0168] Generally, the design of the shift value of an LDPC code must meet the principle of a small number of short cycles and a high probability of connection with the outside. The disclosed embodiment calculates the shift value through a formula, which can theoretically guarantee the characteristics related to the cycle. Different terms in the calculation formula can guarantee different cycle properties. The first-order term can guarantee the properties of four cycles, the second-order term can guarantee the number and position of six cycles and the properties of six cycles when the lifting factor is large enough, and the third-order term can guarantee the number of eight cycles and the properties of eight cycles when the lifting factor is large enough. And so on, other more terms can guarantee a larger number of cycles and properties.

[0169] So far, an implementation method for determining each parameter in the formula has been described. The following describes an implementation method for determining a set of shift values. In some embodiments, different sets of shift values ​​may be used for different communication service types. Continuing with reference to FIG6 , in step 621, a communication service type corresponding to an information bit sequence may be determined. Based on the communication service type, the transmitting device may determine a set of shift values ​​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 known or developed in the future is also feasible.

[0170] In some embodiments, different base matrices and shift value sets may be used for different communication service types. For example, in the eMBB type, BG1 and BG2 may be used, and the 5G shift value set shown in FIG5 may be used. In the high-throughput type (also known as the very high code rate 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 shift value set 1 determined by calculation in this solution may be used. In the URLLC type (also known as the very low code rate 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 shift value set 2 determined by calculation in this solution may be used. The translation value set 1 and the translation value set 2 may correspond to different calculation formulas, for example, different segment division methods, different numbers of formula terms, different constant terms, and so on.

[0171] In some alternative embodiments, BG1 and BG2 may be used in the eMBB type, and the above-mentioned shift value set 1 and shift value set 2 of the 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 the high-throughput type, the above-mentioned shift value set 1 of the present solution 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, 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 the URLLC type, the above-mentioned shift value set 2 of the present solution may be used.

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

[0173] In some embodiments, if the communication service type is a high throughput type, the sending device may determine that the prime number corresponding to the lifting factor includes 23, 31, or 37. In some embodiments, if the communication service type is a URLLC type, the sending device may determine that the prime number corresponding to the lifting factor includes 11.

[0174] Continuing with FIG6 , in step 622 , for each non-zero position of the base matrix, the transmitting device may calculate a corresponding translation value using a corresponding formula (e.g., formula (6) or (7)) using the corresponding elements in the first sequence and the second sequence. For example, the first coefficient of each term in the formula may be obtained according to the determined number of terms in the formula or by searching at least one determined table. A modulo operation may then be performed on the first coefficient of each term based on the prime number corresponding to the lifting factor, and the multiple results after the modulo operation may be combined to obtain the corresponding translation value.

[0175] In some alternative embodiments, the calculated translation value set may be directly stored. For example, the translation value set may be stored in association with the non-zero positions of the base matrix and the indices or prime numbers corresponding to the lifting factor set. During use, the corresponding translation value may be directly searched based on the determined prime numbers or indices corresponding to the lifting factors and the non-zero positions of the base matrix. In these embodiments, the first sequence corresponding to the rows of the base matrix and the second sequence corresponding to the columns of the base matrix are also stored.

[0176] The following describes the static characteristics of the translation value set according to an embodiment of the present disclosure. Assume that the element in the first sequence corresponding to the first row of the base matrix is ​​the same as the element in the first sequence corresponding to the second row of the base matrix. In this case, the first and second rows of the base matrix are considered to be correlated rows. Assume that the element in the first sequence corresponding to the third row of the base matrix is ​​different from the element in the first sequence corresponding to the fourth row of the base matrix. In this case, the third and fourth rows of the base matrix are considered to be uncorrelated.

[0177] In some embodiments, the translation value sets may satisfy the following conditions: a first column set associated with a first row of the base matrix and a second column set associated with a second row of the base matrix do not overlap. In other words, the variable nodes in the corresponding rows of the base matrix intersect to form an empty set (i.e., orthogonal).

[0178] In some embodiments, the translation value set may satisfy: the first column set and the second column set intersect by one column, that is, the variable nodes in the corresponding rows of the base matrix intersect by one element.

[0179] In some embodiments, the set of translation values may satisfy that the translation values corresponding to an intersecting column in the first row and the second row of the base matrix are the same. In some embodiments, the set of translation values may satisfy that the translation values corresponding to all columns in the first row and the second row of the base matrix differ by a first offset value. That is, at the intersecting positions of the relevant rows, the translation values are the same or differ by the first offset value.

[0180] In some embodiments, the set of translation values may satisfy that the pairs of translation values for the same column in the third row and the fourth row of the base matrix have different remainders when modulo the prime number corresponding to the lifting factor.

[0181] Suppose the element in the first sequence corresponding to the first column of the base matrix is the same as the element in the first sequence corresponding to the second column of the base matrix. In this case, the first column and the second column of the base matrix are considered relevant columns. Suppose the element in the first sequence corresponding to the third column of the base matrix is different from the element in the first sequence corresponding to the fourth column of the base matrix. In this case, the third column and the fourth column of the base matrix are considered not to be relevant.

[0182] In some embodiments, the set of translation values may satisfy that the first row set associated with the first column of the base matrix and the second row set associated with the second column of the base matrix do not overlap. That is, the check nodes in the relevant columns of the base matrix intersect to form an empty set (i.e., orthogonal).

[0183] In some embodiments, the set of translation values may satisfy that the first row set and the second row set intersect at one row. That is, the check nodes in the relevant columns of the base matrix intersect at one element.

[0184] In some embodiments, the set of translation values may satisfy that the translation values corresponding to an intersecting row in the first column and the second column of the base matrix are the same. In some embodiments, the set of translation values may satisfy that the translation values corresponding to all rows in the first column and the second column of the base matrix differ by a second offset value. That is, at the intersecting positions of the relevant columns, the translation values are the same or differ by the second offset value.

[0185] In some embodiments, the set of translation values may satisfy that the pairs of translation values for the same row in the third column and the fourth column of the base matrix have different remainders when modulo the prime number corresponding to the lifting factor.

[0186] In some embodiments, if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same column in two rows of the first sequence corresponding to the two translation values are different. For example, suppose the sections are divided according to the lifting factor (Zc), then when p < Zc < p 2When it is, the translation value can be written in the form of kp + c. Except for the case where two rows are correlated, the k values of the same columns in row 1 and row 2 are different.

[0187] In some embodiments, if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same row in two columns in the second sequence corresponding to the two translation values are different. For example, assuming that the section is divided according to the lifting factor (Zc), when p < Zc < p 2 When it is, the translation value can be written in the form of kp + c. Except for the case where two columns are correlated, the k values of the same rows in column 1 and column 2 are different.

[0188] In some embodiments, if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p, and c < p, p is a prime number, and k, t, and c are integers associated with the translation value and the prime number, then the t values corresponding to the same column in two rows in the first sequence corresponding to the two translation values are different. For example, assuming that the section is divided according to the lifting factor (Zc), when p 2 <Zc<p 3 When it is, the translation value can be written as tp 2 + kp + c. Except for the case where two rows are correlated, the t values of the same columns in row 1 and row 2 are different.

[0189] In some embodiments, if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p, and c < p, p is a prime number, and k, t, and c are integers associated with the translation value and the prime number, then the t values corresponding to the same row in two columns in the second sequence corresponding to the two translation values are different. For example, assuming that the section is divided according to the lifting factor (Zc), when p 2 <Zc<p 3 When it is, the translation value can be written as tp 2 + kp + c. Except for the case where two columns are correlated, the t values of the same rows in column 1 and column 2 are different.

[0190] In some embodiments, the shift value set is for a region in the basic matrix, and the region corresponds to a coding rate range. In other words, the basic matrix does not necessarily have the characteristics of the aforementioned shift value set globally, and may have this characteristic only in a certain region. In some embodiments, the region may be the core region of the basic matrix. For example, rows 1 to M and columns 1 to N correspond to the highest code rate region of the basic matrix. M is the row corresponding to the core check, and the size of N is the sum of the number of information columns and the number of core check columns. In another example, it may be M1 to M2 rows and 1 to N columns, corresponding to the medium and low code rate regions of the basic matrix. M1 and M2 are both rows corresponding to the extended check, indicating a certain application code rate range, the size of N is the sum of the number of information columns and the number of core check columns, and M2 may be the last row of the basic matrix.

[0191] It should be understood that any combination of the above-mentioned static features is also possible.

[0192] Continuing with FIG6 , in step 630, the transmitting device may determine a parity check matrix based on the determined set of shift values ​​and the base matrix for use in encoding the information bit sequence. It should be noted that the operation of obtaining the parity check matrix based on the set of shift values ​​may be implemented based on any known or future-developed method, and the embodiments of the present disclosure are not limited thereto.

[0193] Continuing with Figure 6, in step 640, 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), or the basis matrix. This facilitates decoding operations on the receiving device. Accordingly, the receiving device may receive the encoded information bit sequence.

[0194] As shown in Figure 6, the receiving device may determine a check matrix for decoding the information bit sequence at step 650. The process of determining the check matrix is ​​similar to the process of combining steps 610 to 630 and will not be repeated here.

[0195] This concludes the description of a communication scheme according to an embodiment of the present disclosure. This scheme generates a set of translation values ​​without relying on random search, theoretically guaranteeing good cycle properties across various code lengths and code rates. Furthermore, it supports a wider set of lifting factors, achieving more stable encoding and decoding performance. This is explained in detail below with reference to Figures 8A, 8B, 8C, and 8D.

[0196] Figure 8A shows a schematic diagram of a simulation result 800A 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 800A is obtained by simulating the length range of the 5G information bit sequence. Reference numeral 801 shows the case of using the shift value set in the traditional scheme shown in Figure 5, and reference numeral 802 shows the case of using the shift value 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 shift value 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 shift value 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.

[0197] Figure 8B shows a schematic diagram of simulation results 800B for the variation of the signal-to-noise ratio with the length of the information bit sequence according to an embodiment of the present disclosure. Simulation results 800B were performed at the same coding rate. The line segments show the case of using the set of translation values ​​in the conventional solution shown in Figure 5, and the floating points outside the line segments show the case of using the set of translation values ​​according to an embodiment of the present disclosure. As shown in Figure 8B, the fine-grained performance is stable for each coding rate and information bit sequence length. The coding rates are 0.917, 5 / 6, 2 / 3, 1 / 2, 2 / 5, and 1 / 3 from top to bottom. The information bit sequence length ranges from 500 to 8448. It can be seen that the fine-grained performance of this solution is very close to that of the conventional solution. Performance is stable in the eMBB channel scenario.

[0198] FIG8C shows a schematic diagram of a simulation result 800C of the variation of the signal-to-noise ratio with the coding rate according to an embodiment of the present disclosure. The simulation result 800C is obtained by simulating at a lower coding rate. Reference numeral 805 shows the case of using a set of translation values ​​according to an embodiment of the present disclosure. Reference numeral 806 shows the case of using a set of translation values ​​in the conventional scheme shown in FIG5 . It can be seen that in the fine-grained performance simulation of the length of each information bit sequence at a lower coding rate of 2 / 5, the fine-grained performance of this scheme is more stable than that of the conventional scheme. This is due to the fact that this scheme supports finer-grained translation values, which reduces the number of shortened bits and makes the base map more complete.

[0199] Figure 8D shows a schematic diagram of another simulation result 800D for the change of the signal-to-noise ratio with the coding rate according to an embodiment of the present disclosure. The simulation result 800D is obtained by simulation for a higher coding rate. Reference numeral 807 shows the case of using the translation value set according to an embodiment of the present disclosure. Reference numeral 808 shows the case of using the translation value set in the traditional scheme shown in Figure 5. It can be seen that in the fine-grained performance simulation of the length of each information bit sequence at a higher coding rate of 0.926, the fine-grained performance of this scheme is also more stable than that of the traditional scheme. This is due to the fact that this scheme supports finer-grained translation values, which reduces the number of shortened bits and makes the base map more complete.

[0200] 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). FIG9 shows a schematic flow chart of a communication method 900 according to an embodiment of the present disclosure. For example, the method 900 can be implemented at the terminal 120, RAN node 110, core network device, or server shown in FIG1 . It should be understood that the method 900 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.

[0201] In step 910, the communication device may determine a lifting factor from a lifting factor set based on the length of the information bit sequence and the basic matrix. It should be understood that the lifting factor may be determined in any suitable manner, and the present disclosure does not limit this.

[0202] At step 920, the communication device may determine a set of translation values ​​based on the lifting factor, the prime number corresponding to the lifting factor, and the first coefficient, wherein the translation values ​​in the set of translation values ​​correspond to non-zero positions in the base matrix, and the first coefficient is a non-negative integer. Thus, the translation values ​​in the set of translation values ​​may be generated without relying on random search.

[0203] In some embodiments, the communication device may determine, based on the lifting factor or the length of the information bit sequence, a segment corresponding to the lifting factor or the length of the information bit sequence, and determine the set of shift values ​​for the segment, thereby optimizing the loop property of each segment.

[0204] In some embodiments, the communication device may determine multiple values ​​of a first coefficient for a non-zero position in a base matrix. In some embodiments, the communication device may generate the multiple values ​​based on a first sequence corresponding to rows of the base matrix and a second sequence corresponding to columns of the base matrix. Thus, the first coefficient may be generated computationally. In some embodiments, the communication device may obtain the multiple values ​​from one or more sets of first coefficients. Thus, the first coefficient may be determined by table lookup.

[0205] Then, the communication device may perform a modulo operation on the multiple values ​​based on the prime number, and perform a combination operation on the multiple values ​​after the modulo operation to determine the translation value for the one non-zero position. Thus, the translation value can be generated by multiple stages of modulo operation and combination.

[0206] In some embodiments, the translation value may satisfy the following formula:

[0207] Among them H i，j represents the translation value of the element in the i-th row and j-th column of the basic matrix; represents the first coefficient in the tth term, R i represents the i-th element in the first sequence corresponding to the row of the base matrix, C j represents the jth element in the second sequence corresponding to the column of the base matrix, u t represents the power of the tth item for the i-th element in the first sequence, v t represents the power of the tth item for the jth element in the second sequence, u t and v t is an integer, and t is a positive integer; Z idt represents the second coefficient in the t-th term, and the second coefficient is a positive integer; k t = represents the third coefficient in the t-th term, and the third coefficient is a non-negative integer; p represents a prime number. Thus, the translation value can be determined by calculation based on the formula.

[0208] In some embodiments, u t and v t The following formula can be satisfied: t +v t =t+1. Thus, the power of each term in the formula for the elements in the first sequence and the second sequence can be determined.

[0209] In some embodiments, the second coefficient can be based on t, the lifting factor, and the prime number. In some embodiments, the third coefficient can be p t-1 In some embodiments, the value of t is 3, 4, 5, or 6. Thus, the adjustment factor for the prime number in each term of the formula can be determined.

[0210] In some embodiments, the third coefficient may be based on t and a prime number. Thus, an adjustment factor for the translation value in each term of the formula may be determined.

[0211] In some embodiments, the first coefficient in the t-th term can be determined based on the non-zero position from the set of first coefficients corresponding to the t-th term. Thus, the first coefficient in each term of the formula can be determined by looking up a table.

[0212] In some embodiments, the communication device may determine the index of the segment corresponding to the lifting factor based on the lifting factor, and determine the value of t based on the segment index. Thus, different formulas may be determined based on the segment division of the lifting factor. In some embodiments, the range of the segment is [(l-1)×p 2 ,l×p 2 ], where l represents the index of the segment and p represents the prime number. In this way, the segment division can be achieved.

[0213] In some embodiments, the communication device may determine the index of the segment corresponding to the length of the information bit sequence based on the length, and determine the value of t based on the segment index. Thus, different formulas may be determined based on the segment division of the information bit sequence length.

[0214] In some embodiments, the elements in the first and second sequences may be associated with at least one of the following: the minimum value of the prime numbers in the prime number set corresponding to the lifting factor set; the maximum value in the prime number set; the maximum prime number that is divisible by the maximum lifting factor in the lifting factor set; or the prime number that is divisible by all lifting factors in the lifting factor set. Thus, the value characteristics of the elements in the storage sequence can be specified.

[0215] In some embodiments, the communication device may determine the first sequence from a plurality of first sequences and determine the second sequence from a plurality of second sequences based on a boosting factor, thereby using different stored sequences for different boosting factors.

[0216] In some embodiments, the prime number may be the largest prime number that is divisible by the lifting factor.Thereby, the prime number to be used to determine the set of translation values ​​may be determined.

[0217] In some embodiments, the set of translation values may satisfy at least one of the following: the first column set associated with the first row of the base matrix and the second column set associated with the second row of the base matrix have no overlap, wherein the elements in the first sequence corresponding to the first row and the elements in the first sequence corresponding to the second row are the same; the first column set and the second column set intersect at one column; the translation values corresponding to the intersecting column in the first row and the second row are the same; the translation values corresponding to all columns in the first row and the second row differ by a first offset value; the translation value pairs of the same column in the third row and the fourth row of the base matrix modulo a prime number associated with the lifting factor yield different remainders, wherein the elements in the first sequence corresponding to the third row and the elements in the first sequence corresponding to the fourth row are different; the first row set associated with the first column of the base matrix and the second row set associated with the second column of the base matrix have no overlap, wherein the elements in the second sequence corresponding to the first column and the elements in the second sequence corresponding to the second column are the same; the first row set and the second row set intersect at most one row; the translation values corresponding to the intersecting row in the first column and the second column are the same; the translation values corresponding to the intersecting row in the first column and the second column differ by a second offset value; the translation value pairs of the same row in the third column and the fourth column of the base matrix modulo a prime number associated with the lifting factor yield different remainders, wherein the elements in the second sequence corresponding to the third column and the elements in the second sequence corresponding to the fourth column are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same column in the two rows in the first sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same row in the two columns in the second sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p, and c < p, p is a prime number, and k, t, and c are integers associated with the translation value and the prime number, then the t values corresponding to the same column in the two rows in the first sequence for the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p, and c < p, p is a prime number, and k, t, and c are integers associated with the translation value and the prime number, then the t values corresponding to the same row in the two columns in the second sequence for the two translation values are different; or the set of translation values is for a region in the base matrix, and the region corresponds to a coding rate range. In this way, the characteristics of the set of translation values are defined.

[0218] In some embodiments, the communication device may determine a set of shift values ​​corresponding to the communication service type based on the communication service type corresponding to the information bit sequence, where the communication service type includes an eMBB type, an mMTC type, an URLLC type, or a high throughput type. Thus, different sets of shift values ​​may be used for different scenarios to better meet scenario requirements. In some embodiments, if the communication service type is a high throughput type, the prime number corresponding to the boost factor may include 23, 31, or 37. In some embodiments, if the communication service type is a URLLC type, the prime number corresponding to the boost factor may include 11. Thus, by selecting different prime numbers for different scenarios, different sets of shift values ​​may be used for different scenarios.

[0219] In step 930, the communication device may determine a check matrix based on the shift value set and the basic matrix, where the check matrix is ​​used for encoding or decoding the information bit sequence.

[0220] According to method 900, a set of translation values ​​can be generated based on a lifting factor, a prime number corresponding to the lifting factor, and a first coefficient that is a non-negative integer, without relying on random search. Therefore, good cycle properties can be theoretically guaranteed for different code lengths and code rates. Furthermore, a wider set of lifting factors can be supported, thereby achieving more stable encoding and decoding performance.

[0221] Corresponding to the above-mentioned communication method, the embodiments of the present disclosure also provide a communication device and a communication equipment, which are described below in conjunction with Figures 10 and 11. Figure 10 shows a schematic block diagram of a communication device 1000 according to an embodiment of the present disclosure. The communication device 1000 can be implemented at a communication device (i.e., a transmitting device and / or a receiving device). The communication device 1000 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 1000 may include more additional components than the components shown or omit some of the components shown therein, and the embodiments of the present disclosure are not limited to this.

[0222] As shown in FIG10 , the communication device 1000 may include a first processing component 1010, a second processing component 1020, and a third processing component 1030. The first processing component 1010 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 1020 may be configured to determine a translation value set based on the lifting factor, a prime number corresponding to the lifting factor, and a first coefficient, wherein the translation values ​​in the translation value set correspond to non-zero positions in the base matrix, and the first coefficient is a non-negative integer. The third processing component 1030 may be configured to determine a parity check matrix based on the translation value set and the base matrix for encoding or decoding the information bit sequence.

[0223] In some embodiments, the second processing component 1020 may include: a component for determining a segment corresponding to the lifting factor or the length of the information bit sequence based on the lifting factor or the length of the information bit sequence; and a component for determining the translation value set for the segment.

[0224] In some embodiments, the second processing component 1020 may include: a component for determining multiple values ​​of the first coefficient for a non-zero position in the base matrix; a component for performing a modulo operation on the multiple values ​​based on the prime number; and a component for performing a combination operation on the multiple values ​​after modulo operation to determine the translation value for the one non-zero position.

[0225] In some embodiments, the means for determining the plurality of values ​​may include means for generating the plurality of values ​​based on a first sequence corresponding to rows of the base matrix and a second sequence corresponding to columns of the base matrix. In some embodiments, the means for determining the plurality of values ​​may include means for obtaining the plurality of values ​​from one or more sets of first coefficients.

[0226] In some embodiments, the translation value may satisfy the following formula: Among them H i，j represents the translation value of the element in the i-th row and j-th column of the basic matrix, represents the first coefficient in the tth term, R i represents the i-th element in the first sequence corresponding to the row of the base matrix, C j represents the jth element in the second sequence corresponding to the column of the base matrix, u t represents the power of the tth item for the i-th element in the first sequence, v t represents the power of the tth item for the jth element in the second sequence, u t and v t is an integer, and t is a positive integer, Z idt represents the second coefficient in the tth term, and the second coefficient is a positive integer, k t denotes the third coefficient in the t-th term, and the third coefficient is a non-negative integer, and p denotes a prime number.

[0227] In some embodiments, u t and v t The following formula can be satisfied: t +v t =t+1. In some embodiments, the second coefficient may be based on t, a lifting factor, and a prime number. In some embodiments, the third coefficient may be based on t and a prime number. In some embodiments, the third coefficient may be p t-1In some embodiments, the value of t is 3, 4, 5, or 6. In some embodiments, the prime number may be the largest prime number that is divisible by the lifting factor.

[0228] In some embodiments, the first coefficient in the t-th term may be determined based on non-zero positions from a set of first coefficients corresponding to the t-th term.

[0229] In some embodiments, the apparatus may further include: a fourth processing component configured to determine an index of a segment corresponding to the lifting factor based on the lifting factor; and a fifth processing component configured to determine a value of t based on the index of the segment. In some embodiments, the range of the segment is [(l-1)×p 2 ,l×p 2 ], where l represents the index of the segment and p represents the prime number.

[0230] In some embodiments, the apparatus may further include: a sixth processing component configured to determine, based on the length of the information bit sequence, an index of a segment corresponding to the length; and a seventh processing component configured to determine a value of t based on the index of the segment.

[0231] In some embodiments, the apparatus may further include: an eighth processing component configured to determine a first sequence from a plurality of first sequences and determine a second sequence from a plurality of second sequences based on a lifting factor.

[0232] In some embodiments, the elements in the first sequence and the second sequence can be associated with at least one of the following: the minimum value of the prime numbers in the prime number set corresponding to the said lifting factor set; the maximum value of multiple prime numbers; the largest prime number that is divisible by the largest lifting factor in multiple lifting factor sets; or the prime number that is divisible by all lifting factors in multiple lifting factor sets.

[0233] In some embodiments, the set of translation values may satisfy at least one of the following: the first column set associated with the first row of the base matrix and the second column set associated with the second row of the base matrix have no overlap, where the elements in the first sequence corresponding to the first row and the elements in the first sequence corresponding to the second row are the same; the first column set and the second column set intersect at one column; the translation values corresponding to the intersecting column in the first row and the second row are the same; the translation values corresponding to all columns in the first row and the second row differ by a first offset value; the translation value pairs of the same column in the third row and the fourth row of the base matrix modulo a prime number associated with the lifting factor result in different remainders, where the elements in the first sequence corresponding to the third row and the elements in the first sequence corresponding to the fourth row are different; the first row set associated with the first column of the base matrix and the second row set associated with the second column of the base matrix have no overlap, where the elements in the second sequence corresponding to the first column and the elements in the second sequence corresponding to the second column are the same; the first row set and the second row set intersect at most one row; the translation values corresponding to the intersecting row in the first column and the second column are the same; the translation values corresponding to the intersecting row in the first column and the second column differ by a second offset value; the translation value pairs of the same row in the third column and the fourth column of the base matrix modulo a prime number associated with the lifting factor result in different remainders, where the elements in the second sequence corresponding to the third column and the elements in the second sequence corresponding to the fourth column are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same column in the two rows in the first sequence corresponding to the two translation values are different; if two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is a prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same row in the two columns in the second sequence corresponding to the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p and c < p, p is a prime number, and k, t and c are integers associated with the translation value and the prime number, then the t values corresponding to the same column in the two rows in the first sequence corresponding to the two translation values are different; if two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p and c < p, p is a prime number, and k, t and c are integers associated with the translation value and the prime number, then the t values corresponding to the same row in the two columns in the second sequence corresponding to the two translation values are different; or the set of translation values is for a region in the base matrix, and the region corresponds to a coding rate range.

[0234] Through this communication device, a set of translation values can be generated without relying on random search, so the cycle properties under different coding lengths and coding rates can be theoretically guaranteed to be good. In addition, a wider set of lifting factors can be supported, achieving more stable coding and decoding performance.

[0235] It should be understood that other operations of the above-mentioned communication method 900 and communication device 1000 are similar to the operations in the communication process 600 described above in conjunction with Figure 6, and will not be repeated here.

[0236] Figure 11 is a simplified block diagram of a communication device 1100 suitable for implementing embodiments of the present disclosure. Device 1100 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 1100 includes one or more processors 1110 and one or more memories 1120 coupled to processors 1110. Optionally, one or more memories 1120 may also be integrated with one or more processors 1110.

[0237] Processor 1110 may be of any type suitable for the local technology network and, by way of limiting example, may 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 1100 may have multiple processors, such as application-specific integrated circuit chips, which are time-slave to a clock synchronized with a main processor.

[0238] The memory 1120 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) 1124, 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) 1122 and other volatile memories that do not persist during a power outage.

[0239] Computer program 1130 includes computer-executable instructions executed by associated processor 1110. Program 1130 may be stored in ROM 1120. Processor 1110 may perform any suitable actions and processes by loading program 1130 into RAM 1120.

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

[0241] In some embodiments, the program 1130 may be tangibly embodied in a computer-readable medium that may be included in the device 1100 (such as in the memory 1120) or other storage device accessible by the device 1100. The program 1130 may be loaded from the computer-readable medium into the RAM 1122 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.

[0242] In some embodiments, the device 1100 may further include one or more communication modules (not shown). The one or more communication modules may be coupled to the processor 1110. 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. The communication interface may represent any interface required for communication with other network elements.

[0243] 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.

[0244] 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.

[0245] 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.

[0246] 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.

[0247] 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.

[0248] 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: Determining a lifting factor from a lifting factor set based on a length of the information bit sequence and a base matrix; Determine a translation value set based on the lifting factor, a prime number corresponding to the lifting factor, and a plurality of first coefficients, wherein the translation values ​​in the translation value set correspond to non-zero positions in the base matrix, and the first coefficients are non-negative integers; as well as A check matrix is ​​determined based on the shift value set and the basic matrix, and the check matrix is ​​used for encoding or decoding the information bit sequence.

2. The method of claim 1 , wherein determining the set of translation values ​​comprises: Based on the lifting factor or the length of the information bit sequence, determining a segment corresponding to the lifting factor or the length of the information bit sequence; as well as The set of translation values ​​is determined for the segment.

3. The method according to claim 1 or 2, wherein determining the set of translation values ​​comprises: determining a plurality of values ​​of a first coefficient based on a non-zero position in the base matrix; Based on the prime number, performing a modulo operation on the multiple values; as well as A combination operation is performed on the multiple values ​​after modulo taking to determine the translation value for the one non-zero position.

4. The method of claim 3, wherein determining the plurality of values ​​comprises: generating the plurality of values ​​based on a first sequence corresponding to rows of the base matrix and a second sequence corresponding to columns of the base matrix; or By obtaining the plurality of values ​​from one or more sets of first coefficients.

5. The method according to any one of claims 1 to 4, wherein the translation value satisfies the following formula: in H i，j represents the translation value for the element in the i-th row and j-th column of the basic matrix, represents the first coefficient in the tth term, R i represents the i-th element in the first sequence corresponding to the row of the base matrix, C j represents the jth element in the second sequence corresponding to the column of the base matrix, u t represents the power of the tth item for the i-th element in the first sequence, v t represents the power of the tth term for the jth element in the second sequence, u t and v t is an integer, and t is a positive integer, Z idt represents the second coefficient in the t-th term, and the second coefficient is a positive integer, k t represents the third coefficient in the t-th term, and the third coefficient is a non-negative integer, and p represents the prime number.

6. The method according to claim 5, wherein said u t and the v t Satisfies the following formula: t +v t =t+1.

7. The method of claim 5 or 6, wherein the second coefficient is based on the t, the lifting factor and the prime number.

8. The method according to any one of claims 5 to 7, wherein the third coefficient is based on the t and the prime number.

9. The method according to claim 8, wherein the third coefficient is p t-1 A positive integer multiple of .

10. The method according to claim 9, wherein the value of t is 3, 4, 5 or 6.

11. The method according to any one of claims 5 to 10, wherein the first coefficient in the t-th term is determined from a set of first coefficients corresponding to the t-th term based on the non-zero position.

12. The method according to any one of claims 5 to 11, further comprising: Based on the boosting factor, determining an index of a segment corresponding to the boosting factor; as well as Based on the index of the segment, the value of t is determined.

13. The method according to claim 12, wherein the range of the segment is [(l-1)×p 2 ,l×p 2 ], where l represents the index of the segment and p represents the prime number.

14. The method according to any one of claims 5 to 11, further comprising: Based on the length of the information bit sequence, determining an index of a segment corresponding to the length; as well as Based on the index of the segment, the value of t is determined.

15. The method according to any one of claims 4 to 14, further comprising: Based on the boosting factor, the first sequence is determined from a plurality of first sequences, and the second sequence is determined from a plurality of second sequences.

16. The method according to any one of claims 4 to 15, wherein the elements in the first sequence and the second sequence are associated with at least one of: The minimum prime number in the set of prime numbers corresponding to the set of lifting factors; The maximum value in the set of prime numbers; The largest prime number divisible by the largest lifting factor in the set of lifting factors; Or A prime number divisible by all lifting factors in the set of lifting factors.

17. The method according to any one of claims 1-16, wherein the prime number is the largest prime number divisible by the lifting factor.

18. The method according to any one of claims 1-17, wherein the set of translation values satisfies at least one of the following: The first column set associated with the first row of the base matrix and the second column set associated with the second row of the base matrix do not overlap, wherein the elements in the first sequence corresponding to the first row and the elements in the first sequence corresponding to the second row are the same; The first column set and the second column set intersect at one column; The translation values corresponding to the intersecting column in the first row and the second row are the same; The translation values corresponding to all columns in the first row and the second row differ by a first offset value; The translation value pairs of the same column in the third row and the fourth row of the base matrix modulo the prime number corresponding to the lifting factor result in different remainders, wherein the elements in the first sequence corresponding to the third row and the elements in the first sequence corresponding to the fourth row are different; The first row set associated with the first column of the base matrix and the second row set associated with the second column of the base matrix do not overlap, wherein the elements in the second sequence corresponding to the first column and the elements in the second sequence corresponding to the second column are the same; The first row set and the second row set intersect at most one row; The translation values corresponding to the intersecting row in the first column and the second column are the same; The translation values corresponding to the intersecting row in the first column and the second column differ by a second offset value; The translation value pairs of the same row in the third column and the fourth column of the base matrix modulo the prime number corresponding to the lifting factor result in different remainders, wherein the elements in the second sequence corresponding to the third column and the elements in the second sequence corresponding to the fourth column are different; If two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is the prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same column in the two rows in the first sequence corresponding to the two translation values are different; If two translation values in the set of translation values both satisfy the equation kp + c, where k < p and c < p, p is the prime number, and k and c are integers associated with the translation value and the prime number, then the k values corresponding to the same row in the two columns in the second sequence corresponding to the two translation values are different; If two translation values in the set of translation values both satisfy the equation tp 2 + kp + c, where k < p, t < p, and c < p, p is the prime number, and k, t, and c are integers associated with the translation values and the prime number, then the t values corresponding to the same column in two rows in the first sequence corresponding to the two translation values are different; If two translation values in the set of translation values both satisfy the equation tp 2 +kp + c, where k < p, t < p, and c < p, p is the prime number, and k, t, and c are integers associated with the translation value and the prime number, then the t values corresponding to the same row in two columns in the second sequence corresponding to the two translation values are different; or The set of translation values is for a region in the base matrix, and the region corresponds to a coding rate range.

19. The method according to any one of claims 1-18, further comprising: Based on the communication service type corresponding to the information bit sequence, the shift value 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.

20. The method of claim 19, wherein determining the set of translation values ​​comprises: The communication service type is the high throughput type, and the prime number corresponding to the boost factor is determined to include 23, 31 or 37; or The communication service type is the URLLC type, and the prime number corresponding to the lifting factor is determined to include 11.

21. 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 20 to be performed.

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

23. 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 20 to be performed.

24. 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 20 to be performed.

25. 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 20; as well as A receiving device, wherein the receiving device decodes the encoded information bit sequence by executing the method according to claims 1-20.

Images