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

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

The present disclosure relates to the field of communications, and more specifically, 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

In the field of channel coding and decoding, low-density parity check (LDPC) codes are widely used. At present, in the coding and decoding process of LDPC codes, it is necessary to generate a check matrix based on a predetermined basic matrix, a lifting factor set, and a shift value set, and perform coding and decoding based on the check matrix. With the development of communication technology, future scenarios need to support longer code lengths. If the traditional design of lifting factor sets and shift value sets is used, stable coding and decoding performance cannot be guaranteed.

Summary of the invention

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.

According to the first aspect of an embodiment of the present disclosure, a communication method is provided. The method can be performed 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 base 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 base matrix, and the first coefficient is a non-negative integer; and determining a check matrix based on the translation value set and the base matrix for encoding or decoding the information bit sequence. Thus, a translation value set that does not rely on random search can be realized, ensuring good circle properties under different coding lengths and coding rates. In addition, a wider set of lifting factors can be supported to achieve more stable coding and decoding performance.

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

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 performing 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.

In some embodiments, determining the multiple values may include: generating the multiple values based on a first sequence corresponding to the rows of the base matrix and a second sequence corresponding to the columns of the base matrix. Thus, the first coefficient may be generated by calculation, thereby generating the translation value. In some embodiments, determining the multiple values may include: obtaining the multiple values from one or more sets of the first coefficient. Thus, the first coefficient may be determined by table lookup, thereby generating the translation value.

In some embodiments, the translation value may satisfy the following equation: Where Hi _,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 t-th term, _Ri represents the i-th element in the first sequence corresponding to the row of the base matrix, _Cj represents the j-th element in the second sequence corresponding to the column of the base matrix, _ut represents the power of the t-th term for the i-th element in the first sequence, _vt represents the power of the t-th term for the j-th element in the second sequence, _ut and _vt are integers, and t is a positive integer, _Zidt represents the second coefficient in the t-th term, and the second coefficient is a positive integer, _kt represents the third coefficient in the t-th term, and the third coefficient is a non-negative integer, and p represents a prime number. Thus, the translation value can be determined by a formula-based calculation.

In some embodiments, _ut and _vt may satisfy the following formula: _ut + _vt = t + 1. Thus, the power of each term of the formula for the elements in the first sequence and the second sequence may be determined.

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.

In some embodiments, the third coefficient may be based on t and a prime number. In some embodiments, the third coefficient may be a positive integer multiple of 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 may be determined.

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.

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

In some embodiments, the method may further include: determining the index of the segment corresponding to the length based on the length of the information bit sequence; and determining the 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.

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. Thus, different storage sequences may be used for different lifting factors.

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.

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

In some embodiments, the translation value set may satisfy at least one of the following: a first column set associated with the first row of the base matrix and a second column set associated with the second row of the base matrix do not overlap, wherein the elements corresponding to the first row in the first sequence are the same as the elements corresponding to the second row in the first sequence; the first column set and the second column set intersect by 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 values of the same column in the third row and the fourth row of the base matrix are modulo a prime number associated with the lifting factor to obtain different remainders, wherein the elements corresponding to the third row in the first sequence are different from the elements corresponding to the fourth row in the first sequence; 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 corresponding to the first column in the second sequence are the same as the elements corresponding to the second column in the second sequence; the first row set and the second The row sets intersect at most one row; the translation values corresponding to a row that intersects in the first column and the second column are the same; the translation values corresponding to a row that intersects in the first column and the second column differ by a second offset value; the translation values of the same row in the third column and the fourth column of the basic matrix are modulo the prime number associated with the lifting factor to obtain different remainders, where the elements corresponding to the third column in the second sequence are different from the elements corresponding to the fourth column in the second sequence; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same column in the two rows of the first sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same row in the two columns of the second sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same column in the two rows of the first sequence corresponding to the two shift values is different; if the two shift values in the shift value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same row in the two columns of the second sequence corresponding to the two shift values is different; or the shift value set is for a region in the base matrix, and the region corresponds to a coding rate range. Thus, the characteristics of the shift value set are defined.

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

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

According to a second aspect of an embodiment of the present disclosure, a communication device is provided. The device includes: a first processing component configured to determine a lifting factor from a lifting factor set based on the length of an information bit sequence and a base matrix; 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 encoding or decoding the information bit sequence.

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 translation value set for the segment.

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 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.

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.

In some embodiments, the translation value may satisfy the following equation: Where Hi _,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 t-th term, R _i represents the i-th element in the first sequence corresponding to the row of the base matrix, C _j represents the j-th element in the second sequence corresponding to the column of the base matrix, _ut represents the power of the t-th term for the i-th element in the first sequence, v _t represents the power of the t-th term for the j-th element in the second sequence, _ut and v _t are integers and t is a positive integer, _Zidt 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.

In some embodiments, _ut and _vt may satisfy the following equation: _ut + _vt =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 a positive integer multiple of p ^t-1 . In some embodiments, the value of t is 3, 4, 5 or 6.

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

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 segment index. In some embodiments, the segment ranges from [(l-1)×p ² , l×p ² ], where l represents the segment index and p represents the prime number.

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.

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.

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.

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

In some embodiments, the translation value set may satisfy at least one of the following: a first column set associated with the first row of the base matrix and a second column set associated with the second row of the base matrix do not overlap, wherein the elements corresponding to the first row in the first sequence are the same as the elements corresponding to the second row in the first sequence; the first column set and the second column set intersect by 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 values of the same column in the third row and the fourth row of the base matrix are modulo a prime number associated with the lifting factor to obtain different remainders, wherein the elements corresponding to the third row in the first sequence are different from the elements corresponding to the fourth row in the first sequence; 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 corresponding to the first column in the second sequence are the same as the elements corresponding to the second column in the second sequence; the first row set and the second The row sets intersect at most one row; the translation values corresponding to a row that intersects in the first column and the second column are the same; the translation values corresponding to a row that intersects in the first column and the second column differ by a second offset value; the translation values of the same row in the third column and the fourth column of the basic matrix are modulo the prime number associated with the lifting factor to obtain different remainders, where the elements corresponding to the third column in the second sequence are different from the elements corresponding to the fourth column in the second sequence; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same column in the two rows of the first sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same row in the two columns of the second sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same column in the two rows of the first sequence corresponding to the two shift values is different; if the two shift values in the shift value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same row in the two columns of the second sequence corresponding to the two shift values is different; or the shift value set is for a region in the basic matrix, and the region corresponds to a coding rate range.

In some embodiments, the device may also include: a ninth processing component, configured to determine a set of translation values corresponding to a communication service type based on the communication service type corresponding to the information bit sequence, the communication service type including an eMBB type, an mMTC type, a URLLC type or a high throughput type.

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.

According to a third aspect of the embodiments of the present disclosure, a communication device is provided, wherein the device comprises a processor and a memory, wherein the memory comprises a computer program code, and when the computer program code is executed by the processor, the method according to the first aspect is executed.

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

According to a fifth aspect of an embodiment of the present disclosure, a chip is provided, including 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.

According to a sixth aspect of the embodiments of the present disclosure, a computer program product is provided, wherein the computer program product comprises computer program code, and when the computer program code is executed by a device, the method according to the first aspect is executed.

According to a seventh aspect of an embodiment of the present disclosure, a communication system is provided. The communication system includes a sending device and a receiving device. The sending device encodes an information bit sequence to be sent 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.

It will be understood from the following description of the exemplary embodiments that according to the technical solution proposed herein, a set of translation values can be generated without relying on random search, so that good loop properties under different code lengths and code rates can be theoretically guaranteed. In addition, a wider set of lifting factors can be supported to achieve more stable encoding and decoding performance.

It should be understood that the contents described in the summary of the invention 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 easily understood through the following description.

BRIEF DESCRIPTION OF THE DRAWINGS

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:

FIG1 is a schematic diagram of an example communication system in which embodiments of the present disclosure may be implemented;

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

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

FIG4 is a schematic diagram showing a set of boosting factors according to a conventional solution;

FIG5 is a schematic diagram showing a set of translation values according to a conventional solution;

FIG6 shows a schematic diagram of a communication process according to an embodiment of the present disclosure;

FIG7 is a schematic diagram showing an exemplary table according to an embodiment of the present disclosure;

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 with respect to the length of the information bit sequence;

FIG8B is a schematic diagram showing simulation results of signal-to-noise ratio changes with information bit sequence length according to an embodiment of the present disclosure;

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;

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;

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

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

FIG. 11 illustrates a simplified block diagram of a communication device suitable for implementing embodiments of the present disclosure.

DETAILED DESCRIPTION

Embodiments of the present disclosure will be described in more detail below 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 being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

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. may refer to different or the same objects. The term "and/or" means at least one of the two items associated therewith. For example, "A and/or B" means A, B, or A and B. Other explicit and implicit definitions may also be included below.

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

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

(a) hardware circuit implementation only (such as analog and/or digital circuit implementation only); and

(b) a combination of hardware circuitry and software, such as (where applicable): (i) a combination of 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

(c) A hardware circuit and/or processor, such as a microprocessor or portion of a microprocessor, that requires software (eg, firmware) for operation but may operate without software when no software is needed for operation.

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 its accompanying software or firmware. For example, if applicable to a particular claim element, the term "circuitry" also covers a baseband integrated circuit or a processor integrated circuit or a similar integrated circuit in an OLT or other computing device.

As used herein, the term "terminal device" refers to any device with wireless or wired communication capabilities. Examples of terminal devices include but are not limited to customer premises equipment (CPE), user equipment (UE), personal computers, desktop computers, mobile phones, cellular phones, smart phones, personal digital assistants (PDAs), portable computers, tablets, wearable devices, IoT devices, machine type communication (MTC) devices, vehicle-mounted devices for vehicle to everything (V2X) (X refers to pedestrians, vehicles, or infrastructure/network) communications, 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.

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 Node B (NodeB or NB), an evolved Node B (eNodeB), a next generation Node B (gNB), a transmission reception point (TRP), a remote radio unit (RRU), a radio head (RH), a remote radio head (RRH), a low power node such as a femto node, a pico node, etc.

In addition, the term "core network device" may refer to a node in a core network (CN), which may have a control plane function or a user plane function or both. 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.

In the present application, "sending information to ... (terminal)" can be understood as the destination of the information being the terminal. It can include sending information to the terminal directly or indirectly. "Receiving information from ... (terminal)" can be understood as the source of the information being the terminal, which can include receiving information from the terminal directly or indirectly. For example, directly sending information to the terminal can mean that the information is sent from the sending end to the terminal through the air interface, and indirectly sending information to the terminal can mean that the information is processed before being sent through 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 terminal can mean that the information from the terminal is received by the receiving end through the air interface, and indirectly receiving information from the terminal can mean that the information from the terminal is transmitted through 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 received by the processor of the receiving end. "Sending information to ... (access network device/network device)" can be understood as the destination of the information being the access network device/network device. It can include sending information to the access network device/network device directly or indirectly. "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 refer to the information being received from the access network device/network device through the air interface, and indirectly receiving information from the access network device/network device can refer to the information being processed before being sent through 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 refer to the information from the access network device/network device being received by the receiving end through the air interface, and indirectly receiving information from the access network device/network device can refer to the information from the access network device/network device being transmitted through 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 received by the processor of the receiving end. The information may be processed as necessary 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 in a similar way. Elaborate.

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 bit" and "information bit sequence" may be used interchangeably.

In the context of the present disclosure, the term "check matrix" refers to a matrix used for encoding or decoding of an information bit sequence. The term "check matrix" can be used interchangeably with "encoding matrix" or "decoding matrix" or "Tanner graph". Of course, other names can also be used for the check matrix. 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 "base matrix" is used interchangeably with "base graph (BG)". The term "boost factor" can be used interchangeably with "extension factor", "boost value", "extension value", "extension coefficient" or "boost size".

In the context of the present disclosure, the term "Tanner graph" refers to the matrix obtained by expanding the base graph by quasi-cyclic (QC) by a 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 structurality of short cycles with each other. Good cycle properties may refer to satisfying at least one of the following: a large girth (for example, at least no 4 cycles are guaranteed), a small number of short cycles (for example, 6 cycles or 8 cycles), or a large distance between short cycles (for example, 6 cycles and 8 cycles overlap at most one variable node).

As mentioned above, in the process of encoding or decoding, it is necessary to generate a check matrix based on a predetermined basic matrix, a lifting factor set, and a shift value set. However, the shift values in the traditional shift 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 shift value design will be more complicated. Traditional solutions that rely on random search and a specific numerical form of a shift value set in a table may not be able to support this future scenario.

In view of this, an embodiment of the present disclosure proposes a communication scheme. In this scheme, a communication device can determine a lifting factor from a lifting factor set based on the length of an information bit sequence and a base matrix. A translation value set for a non-zero position in a 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 check matrix is determined based on the translation value set and the base matrix for encoding or decoding the information bit sequence.

According to the scheme, the translation value set can be generated based on the lifting factor, the prime number corresponding to the lifting factor, and the first coefficient as a non-negative integer, without relying on random search, so the good cycle property under different code lengths and code rates can be theoretically guaranteed. In addition, a wider set of lifting factors can be supported, so that more stable encoding and decoding performance can be achieved.

For ease of understanding, the present solution is described in detail below with reference to the accompanying drawings.

FIG. 1 shows a schematic diagram of an example communication system 100 in which the embodiments of the present disclosure may be implemented. It should be understood that FIG. 1 shows a possible, non-limiting system schematic diagram. As shown in FIG. 1 , 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 FIG. 1 , collectively referred to as 110) and at least one terminal (such as 120a-120j in FIG. 1 , 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 FIG. 1 ). The terminal 120 is connected to the RAN node 110 in a wireless manner. The RAN node 110 is connected to the core network 102 in a wireless or wired manner. The core network device in the core network 102 and the RAN node 110 in the RAN 101 can be different physical devices, or the same physical device that integrates the core network logic function and the radio access network logic function, or a device that integrates part of the core network logic function and part of the radio access network logic function. Terminals and RAN nodes can be connected to each other by wire or wireless. Figure 1 is only a schematic diagram, and the communication system can also include other network devices, such as relay devices and backhaul devices, which are not drawn in Figure 1.

RAN 101 may be a cellular system related to the 3rd 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). RAN 101 may also be an open access network (open RAN, O-RAN or ORAN), a cloud radio access network (cloud radio access network, CRAN), or a wireless fidelity (wireless fidelity, WiFi) system. RAN 101 may also be a communication system that integrates two or more of the above systems.

RAN node 110, sometimes also referred to as access network equipment, RAN entity or access node, etc., constitutes a part of the communication system. To help the terminal achieve wireless access. The multiple RAN nodes 110 in the communication system 100 can be nodes of the same type or different types. In some scenarios, the roles of the RAN node 110 and the terminal 120 are relative. For example, the network element 120i in Figure 1 can be a helicopter or a drone, which can be configured as a mobile base station. For the terminal 120j that accesses the RAN 101 through the network element 120i, the network element 120i is a base station; but for the base station 110a, the network element 120i is a terminal. The RAN node 110 and the terminal 120 are sometimes referred to as communication devices. For example, the network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functions, and the network elements 120a-120j can be understood as communication devices with terminal functions.

In a possible scenario, the 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. The RAN node may be a macro base station (such as 110a in FIG. 1 ), a micro base station or an indoor station (such as 110b in FIG. 1 ), a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, the RAN node may also be a server, a wearable device, a vehicle or an onboard device. For example, the access network device in the vehicle to everything (V2X) technology may be a road side unit (RSU). All or part of the functions of the RAN node in the present application may also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (such as a cloud platform). The RAN node in the present application may also be a logical node, a logical module or software that can implement all or part of the RAN node functions.

In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, and different RAN nodes implement part of the functions of the base station respectively. For example, the RAN node can be a central 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 can also be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU) or a remote radio head (RRH).

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 takes 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.

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

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, session management function (SMF), access management function (AMF), policy control function (PCF), user plane function (UPF), network exposure function (NEF), application function (AF), and the like.

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

It should be understood that the number of devices in FIG. 1 is provided for illustrative purposes and does not imply any limitation to 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, which is not limited by the embodiments of the present application. The implementation of the communication system 100 is also not limited to the above specific examples, but may be implemented in any suitable manner.

The communication devices in the communication system 100 may 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 may perform communication according to the communication protocol of any generation standard to be developed in the future, for example, the sixth generation (6G) communication protocol. Examples of communication protocols include but are not limited to the first generation (1G), the second generation (2G), the third generation (4G), the fourth generation (5G), the fifth generation (6G), the sixth ... second generation (2G), 2.5G, 2.75G, third generation (3G), fourth generation (4G), 4.5G, fifth generation (5G), and sixth generation communication protocols.

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, the core network device or the server. In other words, the embodiments of the present disclosure may be applied to a sending device and/or a receiving device in the process of information transmission.

FIG2 shows a schematic diagram of an information transmission process 200 in which an embodiment of the present disclosure can be implemented. As shown in FIG2, information is sent by a source, and after source coding, channel coding, modulation, air interface transmission, demodulation, channel decoding, source recovery and other processing, it reaches the 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 sending 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 mainly relate to the encoding or decoding process shown in FIG2, such as source coding, channel coding, channel decoding or source recovery.

At present, LDPC code has been identified by the third generation partnership project (3GPP) as the data channel coding scheme for the fifth generation mobile communication technology (5G). LDPC code is a channel coding scheme very close to the Shannon line, with the characteristics of good performance and low complexity.

The encoding method of LDPC code is to generate a check matrix. The mainstream LDPC code has a QC structure, also known as QC-LDPC code. By setting the 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. At present, the decoding algorithms of 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.

FIG3 shows a schematic diagram of the structure of a basic matrix 300 in which the 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), part A corresponds to information bits (or information bits, system bits, etc.), and part B is a square matrix and corresponds to core check bits (also called core check 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 check bits of the low rate extension.

The basic matrix 300 adopts a "quasi-Laputa" structure, which can be gradually extended to a low bit rate through a core matrix with a high bit rate. In actual use, as shown in (a) of FIG3 , the first X rows and the first Y columns of the basic matrix can be intercepted. As the bit rate decreases from high to low, X and Y gradually increase, and the area in which the matrix is used also gradually expands.

The core row of the basic matrix 300 refers to the row corresponding to the core check bit. In other words, the core row is the row corresponding to the high code rate area. The core column of the basic matrix 300 refers to all information columns and all core check columns. In other words, the core column is the column corresponding to the high code rate area, or the column 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 class-Laput area, or the area consisting of part A, part B and part D, or the area corresponding to the non-class-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.

It should be noted that the structure of the check matrix is similar to that of the basic matrix, which will not be described in detail here.

At present, the QC-LDPC code actually used 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)

Where X represents the variable, Y represents the verification equation, and F represents the edge relationship of BG.

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

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

The number of columns of the check matrix can be expressed as the following formula (3):
N＝|V|＝Zc|X| (3)

Wherein 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.

The number of rows of the check matrix can be expressed as the following formula (4):
M＝|C|＝Zc|Y| (4)

Wherein, M represents the number of rows of the check matrix, C represents the check node, Zc represents the lifting factor, and Y represents the column of the check matrix.

The number of non-zero elements in the check matrix can be expressed as follows (5):
|E|＝Zc|F| (5)

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.

At present, the range of information bits supported by the data channel of 5G is 1-8448, and two BGs are specified: BG ₁ and BG _2. The same BG needs to use different boosting factors to adapt to the rate matching of different coding lengths. Therefore, it is necessary to store the boosting factor set and the shift value set, as well as the method of rate matching based on the boosting factor set and the shift value set.

FIG4 shows a schematic diagram 400 of a lifting factor set according to a conventional solution. It can be seen that the jth row of the lifting factor set is Wherein 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 is a non-negative integer.

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 position (also referred to as the non-zero element) of the base matrix, V _i,j represents the translation value for the element in the i-th row and j-th column of the base matrix H _BG , and i _LS represents the set index of the lifting factor set Z in FIG4. It can be seen that each row of the lifting factor in FIG4 Share the same set of translation values.

During rate matching, a lifting factor can be selected from a plurality of lifting 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. Based on the set index i _LS of the lifting factor set Z to which the lifting factor belongs, a set of shift values corresponding to the set index i _LS can be determined from a plurality of shift value sets corresponding to the plurality of set indices in FIG5 . For example, if the lifting factor selected in the lifting factor set of FIG4 is 128, the set index i _LS is determined to be 0. Then, in the shift value set of FIG5 , a set of shift values corresponding to the set index i _LS of 0 can be determined for the expansion of the elements of the corresponding column of the 0th row in the basic matrix. In this way, a check matrix can be generated.

However, the shift values in the shift value set shown in FIG5 are determined by random search, so the cycle property cannot be guaranteed in theory. Since the working scenario of LDPC code requires good fine-grained performance, it is inevitable that there will be a situation with an error platform. Future scenarios support longer coding lengths, so the shift value design will be more complicated. In this case, the traditional solution shown in FIG5 may not be able to support this future scenario.

In view of this, an embodiment of the present disclosure proposes a communication scheme 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 can 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 some steps shown in Figure 6. In addition, the order of the steps in Figure 6 is only for illustration 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" may refer to the sending device or the receiving device itself, or may refer to a device that can support the sending device or the receiving device to implement the function. For convenience, the sending device and the receiving device are uniformly used for description below.

As shown in FIG6 , in step 610, the transmitting device may determine the lifting factor from the lifting factor set according to the length of the information bit sequence and the basic 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 the CRC bit.

In some embodiments, the transmitting device may determine the expected value of the lifting factor according to the length of the information bit sequence and the number of information columns of the basic 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 with the expected value is less than a threshold value may be selected as the lifting factor.

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

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.

A prime number refers to a positive integer having no other factors except 1 and itself. In some embodiments, the prime number may be any prime number that is divisible by the lifting factor. In some embodiments, the prime number may be the maximum prime number that is divisible by the lifting factor. In some embodiments, the prime number may 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 prime number sets) may be stored in association with the lifting factor set. In this case, a prime number may be selected from the prime number set for determining the translation value set. In the case where the prime number set includes a plurality of prime numbers, the minimum prime number that is divisible by the lifting factor may be selected for determining the translation value set.

In some embodiments, multiple values of the first coefficient may 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. Then, a combination operation (e.g., addition) is performed on the multiple values after the modulo operation. To generate the translation value for the non-zero position. In this way, a set of translation values for all non-zero positions of the base matrix can be determined.

In some embodiments, the first coefficient can be generated based on a sequence corresponding to the rows of the base matrix (for convenience, referred to herein as the first sequence) and a sequence corresponding to the columns of the base matrix (for convenience, referred to herein as the second sequence). In this case, the first sequence and the second sequence are predetermined for the base matrix. In other words, the first sequence and the second sequence are pre-stored. In addition, it is also necessary to pre-store the edges of the base matrix and the rules for generating translation values. In this way, multiple values of the first coefficient can be generated.

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 searching multiple sets of first coefficients multiple times, multiple values of the first coefficient can be determined.

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 formula (6):

Where 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 t-th item, R _i represents the i-th element in the first sequence corresponding to the row of the base matrix, C _j represents the j-th element in the second sequence corresponding to the column of the base matrix, _ut represents the power of the t-th item for the i-th element in the first sequence, v _t represents the power of the t-th item for the j-th element in the second sequence, _ut and v _t are integers, and t is a positive integer; _Zidt represents the second coefficient in the t-th item, and the second coefficient is a positive integer; _kt represents the third coefficient in the t-th item, and the third coefficient is a non-negative integer; and p represents a prime number.

Unless otherwise specified in this application, the translation values in the translation value set can be calculated by 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 such as (6) or other forms in this application.

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 form of formula is also feasible.

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 also be generated by other formulas based on the first sequence and the second sequence.

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 can correspond to the rows of the basic matrix in sequence. 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 can correspond to the columns of the basic matrix in sequence. 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 corresponding modes 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.

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 is used 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.

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

In some embodiments, multiple first sequences and multiple second sequences may be stored. This can be adapted to different scenario requirements. In some embodiments, the first sequence may be determined from the multiple first sequences based on the lifting factor, and the second sequence may be determined from the multiple second sequences. In some embodiments, only one first sequence and one second sequence may be stored. In this case, the first sequence and Second sequence.

The first sequence and the second sequence can be used to establish a 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 _Ri of the first sequence (labeled as R), and the column number j corresponds to the j-th element _Cj of the second sequence (labeled as C). The elements corresponding to the rows and columns of the non-zero positions of the base matrix can be read from the first sequence and the second sequence for calculation of the first coefficient.

In some embodiments, _ut and _vt may satisfy the following equation (7):
u _t + v _t = t + 1 (7)

Wherein _ut represents the power of the t-th term of formula (6) for the i-th element in the first sequence, _vt represents the power of the t-th term of formula (6) for the j-th element in the second sequence, _ut and _vt are integers, and t is a positive integer. In some embodiments, _ut = t, _vt = 1. In some embodiments, _ut = 1, _vt = t.

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 items in formula (6), the first coefficient in the item 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, h≥1. The row number g can correspond to an element in the q-ary domain of the first sequence, and the column number h can correspond to an element in the q-ary domain of the second sequence.

In some embodiments, the element in the first sequence corresponding to the row number g is g+a, and the element in the second sequence corresponding to the column number h is h+b, where a and b are arbitrary constants. In some embodiments, a=b. For example, a=b=0. Thus, the description of the storage content can be simplified. For another example, a=b=-1. Thus, the elements in the first sequence and the second sequence are both elements of the q-ary domain, which is easy to calculate and convenient for hardware implementation.

FIG. 7 shows a schematic diagram 700 of an exemplary table according to an embodiment of the present disclosure. As shown in FIG. 7 , rows correspond to elements in the q-ary domain (first column), and columns correspond to elements in the q-ary domain (first row). The correspondence between the table and the first coefficient (or translation value) is achieved through a first sequence and a second sequence. In some embodiments, it is assumed that the elements of the first sequence and the second sequence corresponding to the i-th row and the j-th column of the non-zero position of the basic matrix are _Ri and _Cj , respectively. By finding the table position corresponding to _Ri and _Cj , the table elements at this position can be read. For example, the element _Ri of the first sequence and the element _Cj of the second sequence are both q-ary domain elements. These elements have a single mapping relationship with the q-ary domain elements corresponding to the rows or columns of the table. That is, each _Ri corresponds to a row of the table, and each _Cj corresponds to a column of the table.

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

The above is how to use the table. Next, the storage content of the table is described. The table elements are values determined only by the q-ary domain elements corresponding to the rows and columns. 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, the value stored in the g-th row and h-th column of Table 2 can be (g+a) ² (h+b) mod p or (g+a)(h+b) ² mod p, ..., the value stored in the g-th row and h-th column of Table t can be Wherein t ₁ +t ₂ =t+1. That is, the specific correspondence between the table elements of each table and the finite field elements may be different. The elements in the t tables may correspond to the t items in formula (6) or (7) respectively.

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.

In some embodiments, the second coefficient may be based on t, the lifting factor and the prime number. In some embodiments, the second coefficient may be determined by the following formula (8):
Z _idt =mod (mod (Zc, p ^t+1 ), p ^t ) (8)

Wherein 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 according to the lifting factor, and the object of the first stage of modulo is p times the object of the second stage of modulo.

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.

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 formula (9):
k _t =N× ^pt-1 (9)

Wherein _kt represents the third coefficient in the tth term of formula (6), N represents a non-negative integer, and p represents the prime number corresponding to the lifting factor.

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

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

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 acquisition of the set of translation values may be based on the calculation of a formula. For example, for different segments, the number of terms in the formula used is different. In some embodiments, the acquisition of the set of translation values may be based on a table lookup. For example, different tables are 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.

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. Example embodiments for segment division are described below.

In some embodiments, the number of terms t of 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 a 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:

Segment 1: Lift factor less than or equal to p ²

Segment 2: The lifting factor is greater than p ² and less than or equal to 2p ²

Segment 3: The lifting factor is greater than 2p ² and less than or equal to 3p ²

…

Segment t: The lifting factor is greater than (t-1)×p ² and less than or equal to t×p ² .

It should be understood that the above-mentioned segment division is only for illustration and is not intended to be limiting. In some embodiments, the segment division for the lifting factor can also be based on the index corresponding to the lifting factor set. In other words, the 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.

In some embodiments, the number of terms t of 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:

Segment 1: (0, K ₁ )

Segment 2: (K ₁ , K ₂ ]

…

Segment t: (K _t-1 , K _t ).

In some embodiments, the segments may be evenly divided, i.e., each segment has the same length. This can optimize the loop properties of each segment. In some alternative embodiments, the segments may not be evenly divided, i.e., each segment has a different length. In this case, the description complexity is very low and the better loop properties can be maintained.

In some embodiments of determining the first coefficient from a predetermined set of 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 factor, namely (0, Z ₁ ), (Z ₁ , Z ₂ ], ..., (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 that the i-th segment needs to use 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.

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 _t of each term in the calculation formula corresponding to different segments is different. In the same segment, the coefficients and number of terms in the calculation formula are the same, but _Zidt may change due to different lifting factors or information bit sequence lengths in the same segment. Note that the k _t listed in aspect (2) here are all greater than 0. In some alternative embodiments, aspect (1) does not include a certain term, which can also be achieved by k _t = 0.

Taking the division of the 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 ³ , the calculation formula includes the first and second items; when the minimum value of the lifting factor segment is greater than or equal to p ³ , 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 continuous items from the first to the tth item. In some embodiments, for For any segment, at least two items of the calculation formula may be included, such as item 1 and item 2. In some embodiments, for some segments, some non-continuous items of the calculation formula may be included.

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 _t corresponding to different segments is different. Assuming that the highest term of the calculation formula corresponding to the current segment is t _max , the feature here can be summarized as k _tmax changes with the change of the upper limit Z _max of the segment's lifting factor. In some embodiments, In this case, only the coefficient of the highest term of the calculation formula changes with the segment. In some alternative embodiments, all terms of the calculation formula contain k _t that changes with the segment. In some alternative embodiments, all terms of the calculation formula contain k _t = 1. In this case, all terms of the calculation formula contain k _t that does not change with the segment.

Regarding aspects (1) and (2), the correspondence between the lifting factor (or the information bit sequence length) and the segment and the correspondence between the segment and the term of the formula may be stored. Alternatively, the correspondence between the lifting factor (or the information bit sequence length) and the segment and the correspondence between the segment and k _t may be stored. The storage may be in the form of a table, a sequence, a text description or other suitable manner.

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

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 to refer to Figure 6, in step 621, the communication service type corresponding to the 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.

In some embodiments, different basic matrices and shift value sets may be used for different communication service types. For example, BG1 and BG2 may be used in the eMBB type, and the shift value set of 5G as shown in FIG5 may be used. In the high throughput type (also referred to as the extremely 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 basic matrix, or the basic matrix may be generated by adding additional information columns based on BG1. In addition, in the high throughput type, the shift value set 1 determined by calculation in this scheme may be used. In the URLLC type (also referred to as the extremely 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, 42) may be used as the basic matrix, or the basic matrix may be generated by adding additional check rows based on BG2. In addition, in the URLLC type, the shift value set 2 determined by calculation in this scheme 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.

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 scheme 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 scheme 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 scheme may be used.

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

In some embodiments, if the communication service type is a high throughput type, the transmitting 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 transmitting device may determine that the prime number corresponding to the lifting factor includes 11.

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

In some alternative embodiments, the above-mentioned translation value set obtained by calculation may also be directly stored. For example, the translation value set may be stored in association with the non-zero position of the base matrix, the index or prime number corresponding to the lifting factor set. When in use, the corresponding translation value may be directly searched based on the determined prime number or index corresponding to the lifting factor and the non-zero position 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 as above are also stored.

The static characteristics of the translation value set according to an embodiment of the present disclosure are described below. It is assumed that the element corresponding to the first row of the base matrix in the first sequence is the same as the element corresponding to the second row of the base matrix in the first sequence. In this case, the first row and the second row of the base matrix are considered to be correlated rows. It is assumed that the element corresponding to the third row of the base matrix in the first sequence is different from the element corresponding to the fourth row of the base matrix in the first sequence. In this case, the third row and the fourth row of the base matrix are considered to have no correlation.

In some embodiments, the translation value set may satisfy: 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. That is, the variable nodes in the relevant rows in the base matrix intersect to an empty set (i.e., orthogonal).

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 relevant rows in the basic matrix intersect by one element.

In some embodiments, the translation value set may satisfy: the translation value corresponding to the intersecting column in the first row and the second row of the base matrix is the same. In some embodiments, the translation value set may satisfy: 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 intersection position of the related rows, the translation values are the same or differ by the first offset value.

In some embodiments, the set of translation values may satisfy: the translation values of the same column in the third row and the fourth row of the base matrix are modulo the prime number corresponding to the lifting factor to obtain different remainders.

Assume that 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 and second columns of the base matrix are considered to be correlated columns. Assume that 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 and fourth columns of the base matrix are considered to be uncorrelated.

In some embodiments, the translation value set may satisfy: a first row set associated with a first column of the base matrix and a second row set associated with a 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).

In some embodiments, the translation value set may satisfy: the first row set and the second row set intersect by one row, that is, the check nodes in the relevant columns in the basic matrix intersect by one element.

In some embodiments, the translation value set may satisfy: the translation value corresponding to a row intersecting in the first column and the second column of the base matrix is the same. In some embodiments, the translation value set may satisfy: 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 intersection position of the relevant columns, the translation values are the same or differ by a second offset value.

In some embodiments, the set of translation values may satisfy that the translation value pairs in the same row in the third column and the fourth column of the base matrix are modulo the prime number corresponding to the lifting factor to obtain different remainders.

In some embodiments, if two translation values in the translation value set 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 in the first sequence corresponding to the two translation values are different. For example, assuming that the segments are divided according to the lifting factor (Zc), when p＜Zc＜p ² , the translation value can be written in the form of kp+c. Except when the two rows are correlated, the k values of the same column in row 1 and row 2 are different.

In some embodiments, if two translation values in the translation value set 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. For example, assuming that the segments are divided according to the lifting factor (Zc), when p＜Zc＜p ² , the translation value can be written in the form of kp+c. Except when the two columns are correlated, the k values of the same row in column 1 and column 2 are different.

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

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

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 feature 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 can 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 can be the last row of the basic matrix.

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

Continuing to refer to Figure 6, in step 630, the transmitting device may determine a check matrix based on the determined shift value set and the basic matrix for encoding the information bit sequence. It should be noted here that the operation of obtaining the check matrix based on the shift value set may be implemented based on any known or future developed method, and the embodiments of the present disclosure are not limited to this.

Continuing to refer to FIG6, in step 640, the transmitting device may send the encoded information bit sequence to the receiving device. In some embodiments, the transmitting device may also send 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 coding length), or the basic matrix. Thus, the decoding operation of the receiving device may be facilitated. Accordingly, the receiving device may receive the encoded information bit sequence.

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

So far, the communication scheme according to the embodiment of the present disclosure has been described. According to this scheme, a set of translation values can be generated without relying on random search, so that good circle properties under different code lengths and code rates can be theoretically guaranteed. In addition, a wider set of lifting factors can be supported to achieve more stable encoding and decoding performance. The following is a detailed description in conjunction with Figures 8A, 8B, 8C and 8D.

FIG8A shows a schematic diagram of a simulation result 800A for the change in the number of shortened bits according to an embodiment of the present disclosure with the length of the information bit sequence. 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 FIG5, 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 map and more stable encoding and decoding performance can be guaranteed.

8B shows a schematic diagram of a simulation result 800B for the change of the signal-to-noise ratio with the length of the information bit sequence according to an embodiment of the present disclosure. The simulation result 800B is performed at the same coding rate. The line segment shows the case of using the translation value set in the traditional scheme shown in FIG5, and the floating point outside the line segment shows the case of using the translation value set according to the embodiment of the present disclosure. As shown in FIG8B, the fine-grained performance of each coding rate and information bit sequence length is stable. The coding rate is 0.917, 5/6, 2/3, 1/2, 2/5, 1/3 from top to bottom. The information bit sequence length is 500-8448. It can be seen that the fine-grained performance of this scheme is very close to that of the traditional scheme. The performance is stable in the eMBB channel scenario.

FIG8C shows a schematic diagram of simulation result 800C for the change of signal-to-noise ratio with coding rate according to an embodiment of the present disclosure. Simulation result 800C is obtained by simulation for 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 for 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, resulting in fewer shortened bits and stronger basemap integrity.

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 FIG5. 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.

Corresponding to the above communication process, an embodiment of the present disclosure also provides a communication method that can be implemented at a communication device (i.e., a sending device and/or a receiving device). FIG. 9 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, the RAN node 110, the core network device, or the server shown in FIG. 1. It should be understood that the method 900 may include other additional steps not shown, or some of the steps shown may be omitted. The scope of the present disclosure is not limited thereto.

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 embodiments of the present disclosure are not limited thereto.

In step 920, the communication device may determine a translation value set based on the lifting factor, the prime number corresponding to the lifting factor, and the 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. Thus, the translation values in the translation value set may be generated without relying on random search.

In some embodiments, the communication device may determine 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 determine the set of translation values for the segment, thereby optimizing the loop property of each segment.

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

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 may be generated by multiple stages of modulo operation and combination.

In some embodiments, the translation value may satisfy the following equation:

Where 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 t-th term, _Ri represents the i-th element in the first sequence corresponding to the row of the base matrix, _Cj represents the j-th element in the second sequence corresponding to the column of the base matrix, _ut represents the power of the t-th term for the i-th element in the first sequence, _vt represents the power of the t-th term for the j-th element in the second sequence, _ut and _vt are integers, and t is a positive integer; _Zidt represents the second coefficient in the t-th term, and the second coefficient is a positive integer; _kt 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 a formula-based calculation method.

In some embodiments, _ut and _vt may satisfy the following formula: _ut + _vt = t + 1. Thus, the power of each term of the formula for the elements in the first sequence and the second sequence may be determined.

In some embodiments, the second coefficient may be based on t, the lifting factor, and the prime number. In some embodiments, the third coefficient may be a positive integer multiple of 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 may be determined.

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.

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.

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 ² ,l×p ² ], where l represents the index of the segment and p represents the prime number. Thus, the segment division may be achieved.

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

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 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.

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 the boosting factor, thereby using different stored sequences for different boosting factors.

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

In some embodiments, the translation value set 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 corresponding to the first row in the first sequence are the same as the elements corresponding to the second row in the first sequence; the first column set and the second column set intersect by 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 values of the same column in the third row and the fourth row of the base matrix are modulo a prime number associated with the lifting factor to obtain different remainders, wherein the elements corresponding to the third row in the first sequence are different from the elements corresponding to the fourth row in the first sequence; 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 corresponding to the first column in the second sequence are the same as the elements corresponding to the second column in the second sequence; the first row set and the second row set intersect by 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 a row of the intersection differ by a second offset value; the translation values of the same row in the third column and the fourth column of the basic matrix are modulo the prime number associated with the lifting factor to obtain different remainders, where the elements corresponding to the third column in the second sequence are different from the elements corresponding to the fourth column in the second sequence; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same column in the two rows of the first sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same row in the two columns of the second sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same column in the two rows of the first sequence corresponding to the two shift values is different; if the two shift values in the shift value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same row in the two columns of the second sequence corresponding to the two shift values is different; or the shift value set is for a region in the basic matrix, and the region corresponds to a coding rate range. In this way, the characteristics of the shift value set are defined.

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, and the communication service type includes an eMBB type, an mMTC type, a 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.

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.

According to method 900, a translation value set can be generated based on a lifting factor, a prime number corresponding to the lifting factor, and a first coefficient as a non-negative integer, without relying on random search, so that good cycle properties under different code lengths and code rates can be theoretically guaranteed. In addition, a wider set of lifting factors can be supported, thereby achieving more stable encoding and decoding performance.

Corresponding to the above-mentioned communication method, the embodiment of the present disclosure also provides a communication device and a communication equipment, which are described below in conjunction with Figures 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 sending device and/or a receiving device). The communication device 1000 can be a part of a sending device or a receiving device, or it can be a sending 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 embodiment of the present disclosure does not limit this.

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 the base matrix. The second processing component 1020 may be configured to determine a translation value set based on the lifting factor, the prime number corresponding to the lifting factor, and the 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 check matrix based on the translation value set and the base matrix for encoding or decoding the information bit sequence.

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.

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.

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.

In some embodiments, the translation value may satisfy the following equation: Where Hi _,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 t-th term, R _i represents the i-th element in the first sequence corresponding to the row of the base matrix, C _j represents the j-th element in the second sequence corresponding to the column of the base matrix, _ut represents the power of the t-th term for the i-th element in the first sequence, v _t represents the power of the t-th term for the j-th element in the second sequence, _ut and v _t are integers and t is a positive integer, _Zidt 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.

In some embodiments, _ut and _vt may satisfy the following formula: _ut + _vt =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 a positive integer multiple of pt ^-1 . In 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.

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

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 segment index. In some embodiments, the segment ranges from [(l-1)×p ² , l×p ² ], where l represents the segment index and p represents the prime number.

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.

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.

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.

In some embodiments, the translation value set may satisfy at least one of the following: a first column set associated with the first row of the base matrix and a second column set associated with the second row of the base matrix do not overlap, wherein the elements corresponding to the first row in the first sequence are the same as the elements corresponding to the second row in the first sequence; the first column set and the second column set intersect by 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 values of the same column in the third row and the fourth row of the base matrix are modulo a prime number associated with the lifting factor to obtain different remainders, wherein the elements corresponding to the third row in the first sequence are different from the elements corresponding to the fourth row in the first sequence; 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 corresponding to the first column in the second sequence are the same as the elements corresponding to the second column in the second sequence; the first row set and the second The row sets intersect at most one row; the translation values corresponding to a row that intersects in the first column and the second column are the same; the translation values corresponding to a row that intersects in the first column and the second column differ by a second offset value; the translation values of the same row in the third column and the fourth column of the basic matrix are modulo the prime number associated with the lifting factor to obtain different remainders, where the elements corresponding to the third column in the second sequence are different from the elements corresponding to the fourth column in the second sequence; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same column in the two rows of the first sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation kp+c, where k<p and c<p, p is a prime number, k and c are integers associated with the translation value and the prime number, then the k corresponding to the same row in the two columns of the second sequence corresponding to the two translation values is different; if two translation values in the translation value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same column in the two rows of the first sequence corresponding to the two shift values is different; if the two shift values in the shift value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is a prime number, k, t and c are integers associated with the shift value and the prime number, then the t corresponding to the same row in the two columns of the second sequence corresponding to the two shift values is different; or the shift value set is for a region in the basic matrix, and the region corresponds to a coding rate range.

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

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.

FIG11 is a simplified block diagram of a communication device 1100 suitable for implementing an embodiment of the present disclosure. The device 1100 may be provided to implement a transmitting device or a receiving device or a communication device including a transmitting function and a receiving function. As shown, the device 1100 includes one or more processors 1110 and one or more memories 1120 coupled to the processors 1110. Optionally, the one or more memories 1120 may also be integrated with the one or more processors 1110.

Processor 1110 may be of any type suitable for the local technology network, and may include, by way of limiting example, one or more of: 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-slaved to a clock synchronized with a main processor.

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, electrical programmable read-only memory (EPROM), flash memory, hard disk, compact disc (CD), digital video disc (DVD), and the like. Examples of volatile memory include, but are not limited to, random access memory (RAM) 1122 and other volatile memory that does not persist across a power outage duration.

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.

The embodiments of the present disclosure may be implemented with the aid of the program 1130, so that the device 1100 performs the processes of the present disclosure as discussed with reference to FIGS. 6 to 9. The device 1100 may correspond to the above-mentioned communication apparatus 1000, and the functional modules in the communication apparatus 1000 are implemented by the software of the device 1100. In other words, the functional modules included in the communication apparatus 1000 are generated after the processor 1110 of the device 1100 reads the program code stored in the memory 1120. The embodiments of the present disclosure may also be implemented by hardware or by a combination of software and hardware.

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 to 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.

In some embodiments, the device 1100 may also 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 used for two-way communication. The one or more communication modules may have a communication interface to facilitate communication. The communication interface may represent any interface required to communicate with other network elements.

In general, various example embodiments of the present disclosure may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. Certain aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that may 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 certain other graphical representations, it will be understood that the blocks, devices, systems, techniques, or methods described herein may be implemented as non-limiting examples in hardware, software, firmware, dedicated circuits or logic, general hardware or controllers or other computing devices, or some combination thereof. Examples of hardware devices that may be used to implement 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), system on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

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 realizes a specific abstract data structure. In various embodiments, the functions of the program module can be merged or split between the described program modules. The machine executable instructions for the program module can be executed in a local or distributed device. In a distributed device, the program module can be located in both a local and a remote storage medium.

The computer program code for realizing the method of the present disclosure 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 function/operation specified in the flow chart and/or block diagram to be implemented. The program code can be executed completely on a computer, partially on a computer, as an independent software package, partially on a computer and partially on a remote computer or completely on a remote computer or server.

In the context of the present disclosure, computer program code or related data can be carried by any appropriate 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 may include electrical, optical, radio, acoustic or other forms of propagation signals, such as carrier waves, infrared signals, and the like. Machine-readable media may be any tangible medium containing or storing a program for or related to an instruction execution system, apparatus or device. Machine-readable media may be machine-readable signal media or machine-readable storage media. Machine-readable media may include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared or semiconductor systems, apparatuses or devices, or any suitable combination thereof. More detailed examples of machine-readable storage media include electrical connections with one or more wires, portable computer disks, hard disks, RAM, ROM, EPROM or flash memory, optical storage devices, magnetic storage devices, or any suitable combination thereof.

In addition, although the operations are depicted in a particular order, this should not be understood as requiring such operations to be completed in the particular order shown or in a sequential order, or to perform all illustrated operations to obtain the desired results. 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 should be interpreted as a description of a specific embodiment that can be directed to a specific invention. Certain features described in the context of separate embodiments in this specification may also be integrated and implemented in a single embodiment. Conversely, the various features described in the context of a single embodiment may also be implemented separately in multiple embodiments or in any suitable sub-combination.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is The subject matter 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 (25)

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; and Based on the shift value set and the basic matrix, a check matrix is determined, and the check matrix is used for encoding or decoding the information bit sequence. 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; and The set of translation values is determined for the segment. 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 plurality of values; and A combination operation is performed on the multiple values after modulo taking to determine the translation value for the one non-zero position. 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. The method according to any one of claims 1 to 4, wherein the translation value satisfies the following formula: in Hi _,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 t-th term, R _i represents the i-th element in the first sequence corresponding to the row of the base matrix, C _j represents the j-th element in the second sequence corresponding to the column of the base matrix, _ut represents the power of the t-th term for the i-th element in the first sequence, v _t represents the power of the t-th term for the j-th element in the second sequence, _ut and v _t are integers, 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. The method according to claim 5, wherein said _ut and said _vt satisfy the following formula: _ut + _vt =t+1. The method of claim 5 or 6, wherein the second coefficient is based on the t, the lifting factor and the prime number. A method according to any one of claims 5 to 7, wherein the third coefficient is based on the t and the prime number. The method according to claim 8, wherein the third coefficient is a positive integer multiple of pt ^-1 . The method according to claim 9, wherein the value of t is 3, 4, 5 or 6. 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. 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; and Based on the index of the segment, the value of t is determined. The method according to claim 12, wherein the range of the segment is [(l-1)×p ² , l×p ² ], wherein l represents the index of the segment, and p represents the prime number. 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; and Based on the index of the segment, the value of t is determined. 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. The method according to any one of claims 4 to 15, wherein the elements in the first sequence and the second sequence are the same as the following At least one of the following is associated with: the minimum value of the prime numbers in the prime number set corresponding to the lifting factor set; The maximum value in the set of prime numbers; the largest prime number that is divisible by the largest lifting factor in the set of lifting factors; or A prime number that is divisible by all the lifting factors in the set of lifting factors. The method according to any one of claims 1-16, wherein the prime number is the largest prime number that is divisible by the lifting factor. The method according to any one of claims 1 to 17, wherein the translation value set satisfies at least one of the following: a first set of columns associated with a first row of the base matrix and a second set of columns associated with a second row of the base matrix do not overlap, wherein an element of the first sequence corresponding to the first row is the same as an element of the first sequence corresponding to the second row; The first column set and the second column set intersect by one column; The translation values corresponding to the intersecting columns 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 values of the same column in the third row and the fourth row of the basic matrix are modulo the prime number corresponding to the lifting factor to obtain different remainders, wherein the element corresponding to the third row in the first sequence is different from the element corresponding to the fourth row in the first sequence; a first set of rows associated with a first column of the base matrix and a second set of rows associated with a second column of the base matrix do not overlap, wherein an element of the second sequence corresponding to the first column is the same as an element of the second sequence corresponding to the second column; 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 values of the same row in the third column and the fourth column of the basic matrix are modulo the prime number corresponding to the lifting factor to obtain different remainders, wherein the element corresponding to the third column in the second sequence is different from the element corresponding to the fourth column in the second sequence; If two translation values in the translation value set 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 corresponding to the same column in two rows of the first sequence corresponding to the two translation values is different; If two translation values in the translation value set 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 corresponding to the same row in two columns of the second sequence corresponding to the two translation values is different; If two translation values in the translation value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is the prime number, k, t and c are integers associated with the translation value and the prime number, then t corresponding to the same column in two rows of the first sequence corresponding to the two translation values is different; If two translation values in the translation value set both satisfy the equation tp ² +kp+c, where k<p, t<p and c<p, p is the prime number, k, t and c are integers associated with the translation value and the prime number, then t corresponding to the same row in two columns of the second sequence corresponding to the two translation values is different; or The set of translation values is for a region in the base matrix, and the region corresponds to a coding rate range. The method according to any one of claims 1 to 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. 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 boosting 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. A communication device, comprising: Processor; and 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. A communication device comprising means for executing the method according to any one of claims 1 to 20. 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. A computer program product comprising a computer program which, when executed on a device, causes the The method described in any one of to 20 is performed. 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; and A receiving device, wherein the receiving device decodes the encoded information bit sequence by executing the method according to claims 1-20.