Coding method and apparatus, and decoding method and apparatus

Abstract

The present application relates to the technical field of communications, and particularly relates to a coding method and apparatus, and a decoding method and apparatus. The present application can be applied to the IEEE 802.11ax standard, the 802.11be standard, the 802.11bn standard, and other standards of the IEEE 802.11 series, such as the 802.15 standard, the 802.11bf standard, the IMMW standard or the SparkLink standard. The method comprises: a first station acquiring information bits, performing LDPC coding on the information bits on the basis of a parity-check matrix, so as to obtain the coded bits, and outputting a sequence; and after obtaining information to be decoded, a second station performing LDPC decoding in combination with the parity-check matrix, so as to obtain information bits, wherein the code length corresponding to the parity-check matrix is 7776, the code rate corresponding to the parity-check matrix is 5 / 6, and the expansion factor of the parity-check matrix is 162. The parity-check matrix can better match a longer code length, thereby improving the coding and decoding performance.

Description

Encoding method, decoding method and device

[0001] The present application claims priority to the Chinese patent application No. 202411306848.7, filed on September 14, 2024, with the State Intellectual Property Office of China, and entitled "Encoding method, decoding method and device", the whole content of which is incorporated herein by reference. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, in particular to an encoding method, a decoding method and a device. BACKGROUND

[0003] The institute of electrical and electronics engineers (IEEE) 802.11n / ac / ax / be wireless local area network (WLAN) transmission standards mainly study how to improve user experience in a large bandwidth (e.g., 60 gigahertz (GHz)) scenario, including improving user average throughput and energy use efficiency of battery-powered devices. The large bandwidth scenario needs to support high-speed and reliable transmission of data, video and other services on limited frequency and power resources, so a high-reliability and high-efficiency channel coding and decoding scheme is needed.

[0004] In the field of channel coding, concatenated codes (such as turbo codes) and low-density parity-check (LDPC) codes are the two most mature and widely used channel coding methods, both of which have a performance close to the shannon limit. Compared with concatenated codes, LDPC codes can have the following advantages: good error performance can be obtained without a deep interleaver; better frame error rate performance; greatly reduced error floor; decoding is not based on a trellis; supports parallel decoding, small decoding delay, etc. Therefore, LDPC codes have become the standard channel coding scheme for IEEE 802.11n / ac / ax and other low-frequency short-range WLAN communication systems.

[0005] How to further improve the performance of LDPC codes needs to be solved. SUMMARY

[0006] Embodiments of the present application provide an encoding method, a decoding method and a device, which can improve the performance of LDPC codes.

[0007] In a first aspect, an embodiment of the present application provides an encoding method, which is applied to a first station, the first station including a Wi-Fi device, or a chip or a functional module placed in the Wi-Fi device, etc., and the method includes:

[0008] The information bits are LDPC encoded according to the check matrix, the code rate corresponding to the check matrix being 5 / 6, and the code length corresponding to the check matrix being 7776; and the encoded bits are output.

[0009] In the embodiment, the check matrix supports the code length of 7776 and the code rate of 5 / 6, so that the first station supports the LDPC encoding with the code length of 7776 and the code rate of 5 / 6, thereby making the first station obtain stronger error control performance and improving the performance of the LDPC code. Meanwhile, the LDPC encoding manner can also improve the transmission reliability of the wireless transmission system and the data transmission reliability of the Wi-Fi system.

[0010] In a second aspect, the embodiment provides a decoding method, which is applied to a second station, the second station including a Wi-Fi device or a chip or a functional module placed in the Wi-Fi device, and the method includes:

[0011] The information to be decoded is input, and the information to be decoded is LDPC decoded according to a check matrix, the code rate corresponding to the check matrix being 5 / 6, and the code length corresponding to the check matrix being 7776.

[0012] In the embodiment, the check matrix supports the code length of 7776 and the code rate of 5 / 6, so that the second station supports the LDPC decoding with the code length of 7776 and the code rate of 5 / 6, thereby making the second station obtain stronger error control performance and improving the performance of the LDPC code. Meanwhile, the LDPC encoding manner can also improve the transmission reliability of the wireless transmission system and the data transmission reliability of the Wi-Fi system.

[0013] In combination with the first aspect or the second aspect, in a possible implementation manner, the check matrix has an extension factor of 162.

[0014] The check matrix is an 8-row 48-column matrix, and thus the check matrix is matched with the code length through the extension factor of 162.

[0015] The matrix corresponding to the information bits in the check matrix is the first 40 columns of the 48-column matrix, and the matrix corresponding to the check bits in the check matrix is the last 8 columns of the 48-column matrix.

[0016] In combination with the first aspect or the second aspect, in a possible implementation manner, the check matrix includes a sub-matrix, the sub-matrix being a 2-row 2-column matrix, the sub-matrix including two elements greater than or equal to 0, and the two elements greater than or equal to 0 satisfying a modulo operation relationship.

[0017] The modulo operation relationship satisfies: the two elements greater than or equal to 0 are the same, or the difference between the two elements greater than or equal to 0 is 81.

[0018] With reference to the first aspect or the second aspect, in a possible implementation, the check matrix corresponds to the base check matrix, the check matrix has the same number of rows as the base check matrix, and the check matrix has the same number of columns as the base check matrix.

[0019] For example, the base check matrix corresponds to a code length of 3888, the base check matrix corresponds to a code rate of 5 / 6, and the base check matrix has an extension factor of 81.

[0020] With reference to the first aspect or the second aspect, in a possible implementation, the check matrix corresponds to the base check matrix, and includes:

[0021] The first element in the check matrix and the second element in the base check matrix satisfy a modulo operation relationship, the modulo operation relationship satisfies: the first element is the same as the second element, or the first element = the second element + 81 (or the difference between the first element and the second element is 81); wherein the position of the first element in the check matrix is the same as the position of the second element in the base check matrix, the first element is an element in a matrix corresponding to information bits in the check matrix, the second element is an element in a matrix corresponding to information bits in the base check matrix, and the first element and the second element are greater than or equal to 0.

[0022] With reference to the first aspect or the second aspect, in a possible implementation, the check matrix corresponds to the base check matrix, and includes:

[0023] The third element in the check matrix is the same as the fourth element in the base check matrix; wherein the position of the third element in the check matrix is the same as the position of the fourth element in the base check matrix, the third element is an element in a matrix corresponding to information bits in the check matrix, the fourth element is an element in a matrix corresponding to information bits in the base check matrix, and the third element and the fourth element are less than 0.

[0024] In the embodiments of the present application, the check matrix is obtained through the base check matrix, so that the check matrix can reuse the coding and decoding architecture of the base check matrix as much as possible, and the implementation complexity is reduced.

[0025] With reference to the first aspect or the second aspect, in a possible implementation, the check matrix corresponds to the base check matrix, and includes:

[0026] The matrix corresponding to the check bits in the check matrix is the same as the matrix corresponding to the check bits in the base check matrix.

[0027] In the embodiments of the present application, the original WLAN LDPC fast and efficient encoding algorithm can be maintained by maintaining the same check bit matrix.

[0028] The specific matrix of the check matrix involved in the first aspect and the second aspect will be described in detail with reference to the third aspect.

[0029] In the third aspect, the embodiments of the present application provide a check matrix, which is any one of the following matrices:

[0030] Or,

[0031] Or,

[0032] Or,

[0033] Or,

[0034] Or,

[0035] Or,

[0036] Or,

[0037] Or,

[0038] Or,

[0039] Or,

[0040] Or,

[0041] Or,

[0042] Or,

[0043] Or,

[0044] Or,

[0045] Or,

[0046] Or,

[0047] Or,

[0048] or,

[0049] or,

[0050] or,

[0051] or,

[0052] or,

[0053] or,

[0054] or,

[0055] or,

[0056] or,

[0057] or,

[0058] or,

[0059] or,

[0060] or,

[0061] or,

[0062] or,

[0063] or,

[0064] or,

[0065] or,

[0066] or,

[0067] or,

[0068] or,

[0069] In a fourth aspect, an embodiment of the present application provides a first station for performing the method in the first aspect or any possible implementation manner. The first station comprises a module for performing the method in the first aspect or any possible implementation manner.

[0070] In a fifth aspect, an embodiment of the present application provides a second station for performing the method in the second aspect or any possible implementation manner. The second station comprises a module for performing the method in the second aspect or any possible implementation manner.

[0071] In a sixth aspect, an embodiment of the present application provides a communication apparatus, comprising a processor and a transceiver, wherein the processor is configured to perform the processing steps in the method in the first aspect to the second aspect or any possible implementation manner, and the transceiver is configured to perform the transceiving steps or input / output steps in the method in the first aspect to the second aspect or any possible implementation manner.

[0072] In a seventh aspect, an embodiment of the present application provides a communication apparatus, comprising a logic circuit and an interface, wherein the logic circuit and the interface are coupled to enable the communication apparatus to implement the method in the first aspect to the second aspect or any possible implementation manner.

[0073] In an eighth aspect, an embodiment of the present application provides a computer readable storage medium for storing a computer program, which when executed on a computer, causes the method in the first aspect to the second aspect or any possible implementation manner to be performed.

[0074] In a ninth aspect, an embodiment of the present application provides a computer program product, which when executed on a computer, causes the method in the first aspect to the second aspect or any possible implementation manner to be performed.

[0075] In a tenth aspect, an embodiment of the present application provides a communication system, comprising a first station for performing the method in the first aspect or any possible implementation manner, and a second station for performing the method in the second aspect or any possible implementation manner. BRIEF DESCRIPTION OF DRAWINGS

[0076] FIG. 1a to FIG. 1c are schematic diagrams of architectures of a communication system according to an embodiment of the present application;

[0077] FIG. 2a is a schematic diagram of a check matrix H of an LDPC code;

[0078] FIG. 2b is a Tanner graph corresponding to FIG. 2a;

[0079] FIG. 3a is a check matrix corresponding to a code length of 1944 bits;

[0080] FIG. 3b is a circulant permutation matrix (CPM) when i=0, i=1, i=2, i=3, taking Z=4 as an example;

[0081] FIG. 4 is a flow diagram of a communication method according to an embodiment of the present application;

[0082] FIG. 5 is a schematic diagram of LDPC encoding according to an embodiment of the present application;

[0083] FIG. 6 is a schematic diagram of a check matrix according to an embodiment of the present application;

[0084] FIG. 7a and FIG. 7b are base check matrices corresponding to code length of 3888 bits and R=5 / 6 according to an embodiment of the present application;

[0085] FIG. 8 is a schematic diagram of two options when a modulo operation relationship is satisfied according to an embodiment of the present application;

[0086] FIG. 9 is a schematic diagram of tree expansion according to an embodiment of the present application;

[0087] FIG. 10 is a schematic diagram of a structure of a communication apparatus according to an embodiment of the present application;

[0088] FIG. 11 is a schematic diagram of another structure of a communication apparatus according to an embodiment of the present application;

[0089] FIG. 12 is a schematic diagram of yet another structure of a communication apparatus according to an embodiment of the present application. DETAILED DESCRIPTION

[0090] To facilitate understanding of the technical solutions of the present application, the present application will be further described below with reference to the accompanying drawings.

[0091] The terms "first" and "second" and the like in the specification of the present application, claims, and accompanying drawings are only used to distinguish different objects, and are not used to describe a specific order. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus, and the like that includes a series of steps or units is not limited to the listed steps or units, but can optionally include other steps or units not listed, or can optionally include other steps or units inherent to the process, method, product, or apparatus.

[0092] Reference herein to an "example" means that a particular feature, structure, or characteristic described in connection with the example can be included in at least one example of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same example, nor are they necessarily mutually exclusive of one another. As will be apparent to those of ordinary skill in the art, embodiments described herein can be combined with other embodiments.

[0093] In this application, "at least one", "one or more", "multiple", "two or more", "at least two", "and / or", are used to describe a conjunctive relationship that can include three possible relationships, for example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist. "Or" means that there can be two possible relationships, for example, only A exists, or only B exists. The character " / " generally means that the associated objects before and after are in an "or" relationship. "At least one of" or similar expressions means any combination of these items. For example, at least one of a, b or c, can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c".

[0094] The following introduces a communication system related to the embodiments of the application.

[0095] The technical solutions provided in the embodiments of the present application can be applied to a wireless local area network (WLAN) system, such as Wi-Fi and the like. The method provided in the embodiments of the present application can be applicable to the institute of electrical and electronics engineers (IEEE) 802.11 series standards, for example, the 802.11be standard, the 802.11bn standard (or also referred to as Wi-Fi 8, and also referred to as ultra high reliability (UHR) or ultra high reliability and throughput (UHRT), etc.), or a next-generation standard of the 802.11bn standard or a standard supporting ambient power (AMP), and the like. The technical solutions provided in the embodiments of the present application can also be applied to a wireless personal area network (WPAN) based on integrated millimeter wave (IMMW), ultra wideband (UWB) technology, and the like. The method provided in the embodiments of the present application can be applicable to the IEEE 802.15 series standards, for example, the 802.15.4a standard, the 802.15.4z standard or the 802.15.4ab standard, or a future generation UWB WPAN standard, and the like. The technical solutions provided in the embodiments of the present application can also be applied to a spark link or nearlink standard. The technical solutions provided in the embodiments of the present application can also be applied to a communication system, for example, can be an internet of things (IoT) system, a vehicle-to-everything (V2X, X can represent any thing) system, a device-to-device (D2D) system, a narrow band IoT (NB-IoT) system, a long term evolution (LTE) system, a 5th-generation (5G) communication system, and a new communication system to be appeared in future communication development, and the like.For example, the V2X can include vehicle to vehicle (V2V), vehicle to infrastructure (V2I), vehicle to pedestrian (V2P) or vehicle to network (V2N) communication, etc.

[0096] The WLAN system can provide high-rate and low-latency transmission. With the continuous evolution of WLAN application scenarios, the WLAN system will be applied to more scenarios or industries, such as the Internet of Things industry, the Internet of Vehicles industry, or the banking industry, enterprise offices, stadiums and exhibition halls, concert halls, hotel rooms, dormitories, hospital rooms, classrooms, supermarkets, squares, streets, manufacturing workshops, and warehouses, etc. Of course, the devices (such as access points or stations) supporting WLAN communication or sensing can be sensor nodes in smart cities (such as smart water meters, smart electricity meters, and smart air detection nodes), smart devices in smart homes (such as smart cameras, projectors, display screens, televisions, sound systems, refrigerators, washing machines, etc.), nodes in the Internet of Things, entertainment terminals (such as augmented reality (AR), virtual reality (VR), etc. wearable devices), smart devices in smart offices (such as printers, projectors, amplifiers, sound systems, etc.), Internet of Vehicles devices in the Internet of Vehicles, infrastructure in daily life scenarios (such as vending machines, self-service navigation stations in supermarkets, self-service checkout devices, self-service ordering machines, etc.), and devices in large sports and music venues, etc.

[0097] Although the embodiments of the present application mainly take WLAN as an example, especially the network applied to the IEEE 802.11 series standard, but the various aspects involved in the embodiments of the present application can be extended to other networks using various standards. For example, Bluetooth, high performance radio LAN (HIPERLAN) (a wireless standard similar to the IEEE 802.11 standard) and wide area network (WAN) or other now known or later developed networks.

[0098] In a possible implementation, the method provided by the embodiments of the present application can be implemented by a communication device in a communication system. For example, the communication device can be an access point (AP) or a station (STA).

[0099] The AP is a device with wireless communication function, which supports communication or sensing or energy transmission by using WLAN standards, and has the function of communication or sensing or energy transmission with other devices (such as non-access point stations (non-AP STAs) or other access points) in the WLAN network. Alternatively, the access point is equivalent to a bridge connecting wired and wireless networks, and mainly functions to connect various wireless network clients together and then access the wireless network to the Ethernet. In the WLAN system, the access point can be referred to as an access point station (AP STA). The device with wireless communication function can be a whole device, or a chip, processing system or functional module installed in the whole device, and the device installed with the chip or processing system or functional module can realize the method and function of the embodiments of the application under the control of the chip or processing system or functional module. The AP in the embodiments of the application is a device providing services for non-AP STAs, and can support 802.11 series standards or subsequent standards. For example, the access point can be an access point for terminals (such as mobile phones) to enter wired (or wireless) networks, and is mainly deployed in homes, buildings and parks, with a typical coverage radius of tens of meters to hundreds of meters, and can also be deployed outdoors. For another example, the AP can be a communication server, a router, a switch, a network bridge and the like; the AP can include various forms of macro base stations, micro base stations, relay stations and the like.

[0100] The STA is a device with wireless communication function, which supports communication or sensing or energy transmission by using WLAN standards, and has the ability of communication or sensing or energy transmission with other non-AP STAs or access points in the WLAN network. In the WLAN system, the station can be referred to as a non-access point station (non-AP STA). For example, the STA is any user communication device allowing a user to communicate or sense or transmit energy with the AP and then communicate with the WLAN, and the device with wireless communication function can be a whole device, or a chip, processing system or functional module installed in the whole device, and the device installed with the chip or processing system or functional module can realize the method and function of the embodiments of the application under the control of the chip or processing system or functional module. For example, the STA can be a wireless communication chip, a wireless sensor or a wireless communication terminal, and can also be referred to as a user. For another example, the STA can be a mobile phone supporting Wi-Fi communication function, a tablet computer supporting Wi-Fi communication function, a set-top box supporting Wi-Fi communication function, a smart television supporting Wi-Fi communication function, a smart wearable device supporting Wi-Fi communication function, a vehicle-mounted communication device supporting Wi-Fi communication function and a computer supporting Wi-Fi communication function.

[0101] For example, the embodiments of the present application can be applied to the communication or sensing between an AP and a STA, between an AP and an AP, or between a STA and a STA in a WLAN, and the embodiments of the present application are not limited in this respect. Optionally, the AP can communicate or sense with a single STA, or the AP can simultaneously communicate or sense with multiple STAs. Specifically, the AP communicating or sensing with multiple STAs can be divided into downlink transmission in which the AP simultaneously sends signals to multiple STAs, and uplink transmission in which multiple STAs send signals to the AP. The communication between the AP and the STA, between the AP and the AP, or between the STA and the STA can support a WLAN communication standard, which can include the IEEE 802.11 series of standards, such as the 802.11bn standard, and of course also applies to standards after the 802.11bn standard.

[0102] FIGS. 1a-1c are schematic diagrams of architectures of communication systems provided by the embodiments of the present application. The communication system can include one or more APs and one or more STAs. Two APs, such as AP1 and AP2, and three STAs, such as STA1, STA2, and STA3, are shown in FIG. 1a. As an example, the method provided by the embodiments of the present application can be applied to data communication or sensing between one AP and one or more STAs, such as the communication between AP1 and STA1 shown in FIG. 1a, the communication between the AP and the STA shown in FIG. 1b, or the communication or sensing or energy transfer between the AP and the STAs 1, 2, and 3 shown in FIG. 1c. As another example, the method provided by the embodiments of the present application can be applied to communication between APs, such as the communication or sensing between AP1 and AP2 shown in FIG. 1a. As yet another example, the method provided by the embodiments of the present application can be applied to communication or sensing between STAs, such as the communication or sensing between STA2 and STA3 shown in FIG. 1a.

[0103] In FIGS. 1a-1c, the STA is a mobile phone and the AP is a router as an example, and this does not limit the types of the AP and the STA in the embodiments of the present application. Meanwhile, the number of APs and the number of STAs shown in FIGS. 1a-1c are only examples, and the number of APs or STAs can be more or less in a specific implementation, and the embodiments of the present application are not limited in this respect.

[0104] From different perspectives of transmitting signals and receiving signals, the first station shown below can be understood as a communication device for transmitting signals, and the second station can be understood as a communication device for receiving signals. Alternatively, the first station can also be referred to as a transmitting end or an encoding end, and the second station can also be referred to as a receiving end or a decoding end. The above-mentioned signals can be encoded bits, or signals obtained by processing the encoded bits, etc.

[0105] From the perspective of different devices, as an example, the first station can be an AP, and the second station can be a non-AP STA. As another example, the first station and the second station can both be non-AP STAs or both be APs. As yet another example, the first station can be a non-AP STA, and the second station can be an AP. Specific forms of the first station and the second station are not listed one by one here.

[0106] Embodiments of the present application are described from the perspective of the first station and the second station, but the first station and the second station can also forward the signal through other devices in the process of transmitting the signal, such as forwarding the signal between the first station and the second station through a forwarding device, and the embodiments of the present application do not limit other devices other than the first station and the second station.

[0107] Before introducing the method involved in the embodiments of the present application, the following introduces the related concepts of the LDPC code involved in the embodiments of the present application.

[0108] The LDPC code is a kind of linear block code, and its check matrix is a kind of sparse matrix. The number of zero elements in the check matrix of the LDPC code is much larger than the number of non-zero elements, or in other words, the row weight and the column weight of the check matrix are very small numbers compared with the code length of the LDPC code.

[0109] Tanner represented the code word of the LDPC code in the form of a graph in 1981, and called this graph a Tanner graph (or factor graph or number graph). The Tanner graph and the check matrix correspond to each other. The Tanner graph is composed of two types of nodes, the first type of node represents a code symbol and is called a variable node, and the second type of node is a check node and represents a check constraint relationship. Each node represents a check constraint relationship.

[0110] FIG. 2a is a schematic diagram of the check matrix H of the LDPC code. In FIG. 2a, {Vi} represents a set of variable nodes, and {Ci} represents a set of check nodes. Each row of the check matrix H represents a check equation, and each column represents a code symbol. In FIG. 2a, there are 8 variable nodes and 4 check nodes. If a code symbol is included in the corresponding check equation, a line can be used to connect the bit node and the check node involved, and a Tanner graph is obtained.

[0111] FIG. 2b is a Tanner graph corresponding to FIG. 2a. The Tanner graph represents a check matrix of the LDPC code. Taking FIG. 2a as an example, for a check matrix H of size 4 rows by 8 columns, the Tanner graph contains two types of nodes, 8 variable nodes and 4 check nodes. The 8 variable nodes correspond to the 8 columns of the check matrix H respectively, and the 4 check nodes correspond to the 4 rows of the check matrix H respectively. A cycle in the Tanner graph is composed of nodes connected to each other, and the cycle takes one node in the group of nodes as both the starting point and the ending point, and passes through each node only once.

[0112] The LDPC code includes a quasi cyclic (QC) LDPC (QC-LDPC) code. The QC-LDPC code is a kind of structured LDPC code that is widely used, and due to the unique structure of the check matrix, a simple feedback shift register can be used for encoding, which better solves the problem of encoding complexity of the LDPC code.

[0113] For a code length of 648 bits, or for a code length of 1296 bits, or for a code length of 1944 bits, each code length supports 4 different code rates: 1 / 2, 2 / 3, 3 / 4, 5 / 6. The check matrix under each code length and code rate is different, and the check bit part (i.e., the matrix corresponding to the check bit, or the check matrix) in the check matrix of different code lengths or code rates has the same structure.

[0114] FIG. 3a is a check matrix corresponding to a code length of 1944 bits. FIG. 3a exemplarily shows check matrices corresponding to the following 4 different code rates: 1 / 2, 2 / 3, 3 / 4, 5 / 6. Different code rates correspond to a check matrix respectively. The code length of 1944 bits can also be referred to as 1944 code length or code length 1944 or code length of 1944.

[0115] In FIG. 3a, “-” represents a zero matrix of Z*Z, and elements greater than or equal to 0 in FIG. 3a represent a circulant permutation matrix (CPM) of the identity matrix of Z*Z. The CPM can be represented as Pi, i represents the above-mentioned element greater than or equal to 0. 0≤i≤Z-1. i can be referred to as a cyclic shift value or a cyclic shift bit number (such as the number of bits of the right cyclic shift of the identity matrix) or a CPM coefficient, and the specific name of i is not limited in the embodiments of the present application. The above-mentioned Z represents an extension factor. It can be understood that “-” in FIG. 3a can also be represented as “-1”, etc., that is, “-” and “-1” in the present application can be replaced with each other.

[0116] The relationship between the extension factor Z and the code length N is as follows: N = Z * (the number of columns of the check matrix). Taking FIG. 3a as an example, the number of columns of the check matrix is 24, that is, N = 24 * Z. For N = 648, N = 1296, or N = 1944, the number of columns of the check matrix is 24. The relationship between Z and N shown herein is only an example. For example, for a check matrix of 48 columns, N = Z * 48.

[0117] For example, N = 1944 and Z = 81. When i = 1, P1 represents the CPM of the 81 * 81 unit matrix after being right-circulated by 1 bit. The CPM is as follows:

[0118] FIG. 3b is a CPM when i = 0, a CPM when i = 1, a CPM when i = 2, and a CPM when i = 3, taking Z = 4 as an example. The CPM shown in FIG. 3b is only an example. The CPM of other Z * Z unit matrices in the embodiments of the present application can be obtained according to the principle shown in FIG. 3a or FIG. 3b to obtain the final Pi. Details are not described herein again.

[0119] Optionally, the selection of the code rate can be determined by the modulation and coding scheme (MCS) selected by the link adaptation of the transmission system. Optionally, the code length can be determined by the length of the data bits (also referred to as the length of the information bits) of the transmission, the total number of coded bits of the transmission, and the PPDU encoding parameters. The PPDU encoding parameters include the relationship among the length of the data bits, the total number of coded bits, and the code length. Therefore, the station can select a check matrix from the 12 check matrices according to the given code length and code rate.

[0120] The method related to the embodiments of the present application is described below.

[0121] Since the LDPC code can improve the transmission reliability of the wireless transmission system, the LDPC code has been widely applied in WLAN standards. In order to further improve the data transmission reliability of the Wi-Fi system, the current standard or the next generation standard may consider a longer code length of the LDPC code, so that the coding module has stronger error control performance.

[0122] Therefore, the embodiments of the present application provide a new check matrix, which can be applied to a longer code length. The check matrix can be applied to a code length of 7776 bits, so that the check matrix can have stronger error control performance. The code length of 7776 bits can also be referred to as a 4x-LDPC code length or a 4x LDPC. That is, the LDPC code length of 7776 bits is 4 times the LDPC code length of 1944 bits.

[0123] The embodiment of the present application designs the check matrix on the basis of the basic check matrix, which can be applied to longer code length and obtain excellent performance, and can reuse the original WLAN LDPC code coding and decoding architecture as much as possible, for example, the change to the existing LDPC encoding module and LDPC decoding module is small, and the implementation complexity of the LDPC coding and decoding is reduced.

[0124] In the embodiment of the present application, each matrix shown below can represent a check matrix, or be referred to as a prototype of the check matrix, or a matrix prototype of the parity-matrix, or a matrix prototype of the parity-check matrix, or a matrix prototype for a codeword block length N, or a mother matrix, and the specific name of the matrix involved in the embodiment of the present application is not limited. For ease of description, the check matrix is taken as an example in the following description.

[0125] In the embodiment of the present application, the code length can also be referred to as a codeword block length or a codeword length, and the specific name of the code length is not limited in the embodiment of the present application. For ease of description, the code length is taken as an example in the following description.

[0126] In the embodiment of the present application, Z can be referred to as a subblock size or an expansion factor or a lift factor, and the specific name of Z is not limited in the embodiment of the present application. For ease of description, Z is taken as an expansion factor in the following description.

[0127] Optionally, since the number of columns of each matrix shown below is 48, N=Z*48. For ease of understanding, therefore, different letters are used to represent different meanings in the embodiment of the present application, for example, N represents the code length, Z represents the expansion factor, and R represents the code rate. However, the letter parameters corresponding to each meaning are only examples and are not limited to the embodiment of the present application.

[0128] FIG. 4 is a flow diagram of a communication method provided by the embodiment of the present application. The communication method involves an encoding process and a decoding process. The process related to encoding in FIG. 4 can be referred to as an encoding method, and the process related to decoding can be referred to as a decoding method. The description of the first station and the second station can be referred to the above description, and will not be described in detail here. As shown in FIG. 4, the method comprises:

[0129] 401. The first station encodes the information bits according to the check matrix to obtain the coded bits, the code rate corresponding to the check matrix is 5 / 6, and the code length corresponding to the check matrix is 7776.

[0130] The coded bits include check bits. For R=5 / 6, N=7776, the number of information bits in the code length of 7776 bits can be 7776*5 / 6=6480. Or, 40*162=6480. 40 is the number of columns of the matrix corresponding to the information bits of the check matrix, and 162 is the spreading factor.

[0131] As an example, the number of information bits can be equal to 6480.

[0132] As another example, the number of information bits can be less than 6480. The first station can fill a certain number of 0s in the information bits, and then delete these 0s after completing the LDPC encoding. The operation of the first station filling a certain number of 0s in the information bits and then deleting these 0s after encoding can be referred to as a shortening operation.

[0133] As yet another example, the number of information bits is greater than 6480. The first station can split the information bits into multiple code words, and the number of information bits carried by each code word can be less than or equal to 6480. Optionally, the shortening operation and the operation of splitting into multiple code words can be combined with each other, and embodiments of the present application do not limit this.

[0134] In the case of using orthogonal frequency division multiplexing (OFDM) technology, the coded information bits need to be placed into an integer number of OFDM symbols, and the coded bits also need to be placed into an integer number of LDPC code words. Before the first station performs LDPC encoding, the minimum number of OFDM symbols NSYM required for this transmission is determined, and the total number of coded bits NTCB that can be stored in all OFDM symbols is calculated according to NSYM and the current coding and modulation scheme (such as the modulation order and code rate indicated by MCS). For example, NTCB=NCBPS*NSYM, NCBPS represents the number of coded bits that can be stored in each OFDM symbol, and NSYM represents the number of OFDM symbols. For example, the first station selects the code length and the number of code words NCW required for the current transmission according to NTCB and the number of information bits. This example is illustrated by the first station determining the code length according to the PPDU encoding parameters. The code length in the PPDU encoding parameters can include a code length greater than 1944, such as a code length of 7776 bits in the PPDU encoding parameters. For another example, the first station can directly determine the code length it adopts, which can be 7776. The specific way in which the first station determines the code length is not limited by embodiments of the present application.

[0135] When there are not enough information bits to fill the information bit part of the LDPC code word, the first station can perform a shortening operation before LDPC encoding.

[0136] FIG. 5 is a schematic diagram of LDPC encoding provided by an embodiment of the present application. FIG. 5 exemplarily shows three LDPC code words. The length of each LDPC code word is equal to the code length. As shown in FIG. 5, 501 represents that the first station acquires payload bits (e.g., information bits) to be encoded. 502 represents that the first station calculates the LDPC code length and the number of code words. 503 represents that the first station can perform a shortening operation on the payload bits. 504 represents that the first station generates parity bits by using the payload bits and shortening 0 bits. 505 represents that the first station discards the shortening bits. The above-mentioned related description about the shortening operation and the like is only an example, and the related description about the shortening operation and the like can also be referred to the related standards and the like, which are not limited in the embodiments of the present application.

[0137] Optionally, the first station can puncture the parity bits obtained by encoding to obtain a higher code rate or a shorter code length.

[0138] The code rate can be determined according to the MCS selected by the link adaptation. For example, the code rate R is determined according to the channel information between the first station and the second station. For the specific determination method of the code rate R, the embodiments of the present application are not limited. As an example, the MCS can be issued by the AP. As another example, the MCS can be determined by the first station. For example, the first station sends the MCS to the second station, and the second station receives the MCS and knows the code rate R based on the MCS. As yet another example, the MCS is determined by the second station. For example, the second station sends the MCS to the first station, and the first station receives the MCS and knows the code rate R based on the MCS. For the specific interaction process of the MCS, the embodiments of the present application are not limited.

[0139] In the embodiments of the present application, the check matrix is a matrix of 8 rows and 48 columns. The extension factor of the check matrix is 162.

[0140] The check matrix includes a sub-matrix, which is a matrix of 2 rows and 2 columns, and the sub-matrix includes two elements greater than or equal to 0, which satisfy the modulo operation relationship. In other words, the two elements on the positive diagonal of the sub-matrix satisfy the modulo operation relationship, or the two elements on the negative diagonal of the sub-matrix satisfy the modulo operation relationship.

[0141] For example, two elements in the sub-matrix are element a and element b, and element a = element b % (Z / 2). That is, element a = element b, or element a = element b + 81. Here, element a and element b are elements in the check matrix other than "-1" (or "-"), that is, element a and element b are greater than or equal to 0. Alternatively, elements in the sub-matrix other than element a and element b are -1 (or "-").

[0142] Other descriptions of the check matrix can be referred to below, which are not described in detail here.

[0143] 402. The first station outputs the encoded bits.

[0144] The encoded bits are output from the LDPC encoding module of the first station. Alternatively, the encoded bits can also be subjected to other processing, and the first station transmits the signal after the other processing through the channel. The signal can be referred to as a signal corresponding to the encoded bits. As shown in FIG. 4, the first station can transmit the signal corresponding to the encoded bits through the channel.

[0145] Correspondingly, the second station receives the signal transmitted through the channel from the first station.

[0146] 403. The second station obtains the information to be decoded.

[0147] Alternatively, the second station obtains the information to be decoded from the signal received from the first station.

[0148] 404. The second station performs LDPC decoding on the information to be decoded according to the check matrix.

[0149] The decoding method used by the second station includes but is not limited to a hard decision decoding method, a soft decision decoding method, or a hybrid decoding method. Through the LDPC decoding, the second station can obtain the information bits.

[0150] As an example, the second station can determine the code length according to the PPDU encoding parameter, and the code length is 7776. As another example, the second station can receive the indication information from the first station, and the indication information is used to indicate the code length used by the first station, such as the code length being 7776. The specific manner of determining the code length by the second station is not limited in the embodiments of the present application.

[0151] The manner in which the second station determines the code rate is described with reference to step 401, which is not described here.

[0152] In the embodiments of the present application, the steps 401-402 can be implemented by an LDPC encoding module, and the first station comprises the LDPC encoding module. The steps 403 and 404 can be implemented by an LDPC decoding module, and the second station comprises the LDPC decoding module.

[0153] The check matrix provided by the embodiments of the present application can be applied to code length of 7776, thereby improving the transmission reliability of the system and improving the performance.

[0154] The check matrix related to FIG. 4 is introduced below.

[0155] As a possible implementation manner, the embodiments of the present application provide a check matrix, which is any one of the following Matrix 1-Matrix 40:

[0156] Matrix 1:

[0157] Matrix 2:

[0158] Matrix 3:

[0159] Matrix 4:

[0160] Matrix 5:

[0161] Matrix 6:

[0162] Matrix 7:

[0163] Matrix 8:

[0164] Matrix 9:

[0165] Matrix 10:

[0166] Matrix 11:

[0167] Matrix 12:

[0168] Matrix 13:

[0169] Matrix 14:

[0170] Matrix 15:

[0171] Matrix 16:

[0172] Matrix 17:

[0173] Matrix 18:

[0174] Matrix 19:

[0175] Matrix 20:

[0176] Matrix 21:

[0177] Matrix 22:

[0178] Matrix 23:

[0179] Matrix 24:

[0180] Matrix 25:

[0181] Matrix 26:

[0182] Matrix 27:

[0183] Matrix 28:

[0184] Matrix 29:

[0185] Matrix 30:

[0186] Matrix 31:

[0187] Matrix 32:

[0188] Matrix 33:

[0189] Matrix 34:

[0190] Matrix 35:

[0191] Matrix 36:

[0192] Matrix 37:

[0193] Matrix 38:

[0194] Matrix 39:

[0195] Matrix 40:

[0196] As another possible implementation, the embodiment of the present application further provides a design method of the check matrix. In the specific implementation, the communication parties can not perform the design method shown below, but save the check matrix designed by the design method, or save the extension indication information, or save the cyclic shift value, etc. The design method shown below can obtain the matrix 1~matrix 40 shown above. Although the 40 check matrices are shown above as examples, other check matrices determined according to the design method shown in the embodiment of the present application also belong to the protection scope of the embodiment of the present application. The design method is shown as follows:

[0197] The check matrix corresponds to the base check matrix. Or, the check matrix is determined according to the base check matrix. The code length corresponding to the base check matrix is 3888, the code rate corresponding to the base check matrix is 5 / 6, and the extension factor of the base check matrix is 81. That is, the number of rows of the base check matrix is the same as the number of rows of the check matrix, and the number of columns of the base check matrix is the same as the number of columns of the check matrix. For example, the check matrix is an 8*48 matrix, and the base check matrix is an 8*48 matrix. It can be understood that the 848 matrix shown here is only an example, and in the specific implementation, the 8*48 matrix can be extended according to the cyclic shift value and the extension factor, so as to obtain a matrix with a size of 8Z*48Z.

[0198] The check matrix corresponding to the base check matrix satisfies at least one of the following:

[0199] (1) The first element Z1(i, j) in the check matrix and the second element Z(i, j) in the base check matrix satisfy the modulo operation relationship. That is, Z(i, j) and Z1(i, j) can satisfy: Z(i, j) = Z1(i, j)%(Z / 2). That is, Z1(i, j) = Z(i, j), or Z1(i, j) = Z(i, j)+(Z / 2). Z is the extension factor of the check matrix, such as Z = 162.

[0200] Or, Z1(i, j) and Z(i, j) can satisfy: Z(i, j) = Z1(i, j)%(Z0), and Z0 is the extension factor 81 of the base check matrix.

[0201] Wherein, the first element is an element in the matrix corresponding to the information bits in the check matrix, and the second element is an element in the matrix corresponding to the information bits in the base check matrix. The position of the first element in the check matrix (such as the i-th row and the j-th column in the check matrix) is the same as the position of the second element in the base check matrix (such as the i-th row and the j-th column in the base check matrix). Both the first element and the second element are greater than or equal to 0, that is, the first element is a cyclic shift value in the check matrix, and the second element is a cyclic shift value in the base check matrix.

[0202] For example, Z(i, j) = 13, then Z1(i, j) = 13, or Z1(i, j) = 13 + (162 / 2) = 94.

[0203] In the embodiments of the present application, Z(i, j) and Z1(i, j) satisfy the nesting relationship, that is, Z(i, j) and Z1(i, j) satisfy the modular operation relationship, so that the check matrix with a code length of 7776 proposed in the embodiments of the present application can reduce the modification of the existing LDPC encoding module and LDPC decoding module in the Wi-Fi system as much as possible, and reduce the complexity of the encoding and decoding implementation. Further, based on the base check matrix to determine the check matrix, when the first station performs LDPC encoding, the existing LDPC encoding module can still be reused, and when the second station performs LDPC decoding, the existing LDPC decoding module can still be reused. The embodiments of the present application reduce the modification of the LDPC encoding module and the LDPC decoding module, and also ensure the encoding and decoding performance.

[0204] (2) The third element in the check matrix is the same as the fourth element in the base check matrix. Wherein, the position of the third element in the check matrix is the same as the position of the fourth element in the base check matrix, the third element is an element in the matrix corresponding to the information bits in the check matrix, the fourth element is an element in the matrix corresponding to the information bits in the base check matrix, and the third element and the fourth element are both less than 0.

[0205] For example, the i-th row and the j-th column in the matrix corresponding to the information bits in the base check matrix is an element less than 0, that is, "-1" or "-". Then the i-th row and the j-th column in the matrix corresponding to the information bits in the check matrix is also an element less than 0.

[0206] (3) The matrix corresponding to the check bits in the check matrix is the same as the matrix corresponding to the check bits in the base check matrix.

[0207] Since the extension factor of the check matrix is 162 and the extension factor of the base check matrix is 81, when (3) is satisfied, the size of the CPM represented by the elements in the matrix corresponding to the check bits in the check matrix changes from Z0*Z0 (the extension factor Z0 of the base check matrix) to Z*Z, i.e., from 81*81 to 162*162.

[0208] FIG. 6 is a schematic diagram of a check matrix according to an embodiment of the present application. Taking R=5 / 6 shown in FIG. 3a as an example, the matrix corresponding to the check bits in the check matrix is the square matrix in the box part in FIG. 6, and the matrix other than the matrix in the box is the matrix corresponding to the information bits in the check matrix.

[0209] In the embodiment of the present application, the matrix corresponding to the check bits in the check matrix is the same as the matrix corresponding to the check bits in the base check matrix, and the fast and efficient encoding algorithm of WLAN LDPC can be maintained.

[0210] FIGS. 7a and 7b are base check matrices corresponding to R=5 / 6 when the code length is 3888 bits according to an embodiment of the present application. The check matrix shown in matrix 1 to matrix 20 can be determined according to the base check matrix shown in FIG. 7a. The check matrix shown in matrix 21 to matrix 40 can be determined according to the base check matrix shown in FIG. 7b.

[0211] The elements in the matrix corresponding to the information bits in the base check matrix shown in FIG. 7a satisfy (1) and (2) of the elements in the matrix corresponding to the information bits in the check matrix shown in matrix 1 to matrix 20, and the matrix corresponding to the check bits in the base check matrix satisfies (3) of the matrix corresponding to the check bits in the check matrix shown in matrix 1 to matrix 20. FIG. 7b is similar, and thus is not described herein.

[0212] Alternatively, the base check matrix can be determined according to the check matrix corresponding to the code length of 1944 bits and the code rate of 5 / 6. That is, the base check matrix can be determined according to the check matrix corresponding to R=5 / 6 shown in FIG. 3a. The extension factor of each check matrix shown in FIG. 3a is 81.

[0213] In a possible implementation, on the basis of (1) to (3) of the check matrix and the base check matrix, the embodiment of the present application further provides a design method, and the design method shown below can effectively eliminate the check matrix with better performance and enhance the performance of the check matrix.

[0214] In order to ensure the above modulo operation relationship, each cyclic shift value in the check matrix has two options. If Z(i, j) = s, then Z1(i, j) = s (remains unchanged) or Z1(i, j) = s + (Z / 2). The small squares in FIG. 8 represent the values of Z(i, j), Opt A represents Z1(i, j) = s (remains unchanged), and Opt B represents Z1(i, j) = s + (Z / 2).

[0215] The specific selection of Opt A or Opt B for Z1(i, j) can expand the tree according to the number. The deeper the selection depth, the fewer short loops the corresponding matrix contains, and the short loops have a negative impact on performance. The deeper the depth of the expanded tree, the fewer short loops the corresponding matrix contains, and the short loops have a negative impact on performance. According to the tree expansion of each variable node, the depth of Opt A or Opt B corresponding to each item in the corresponding matrix may be different, and the ring structure caused by the corresponding Tanner graph of the overall check matrix is also different. Therefore, the embodiment of the present application comprehensively considers the ring structure of the matrix locally and as a whole, designs all non-zero elements according to the tree expansion, so as to ensure that the corresponding Tanner graph of the first check matrix has a good ring structure.

[0216] In a possible implementation, the communication parties store the cyclic shift values. For example, the communication parties can store each cyclic shift value in the check matrix. Alternatively, when the code length is 7776, the communication parties obtain the check matrix based on the cyclic shift values stored by themselves, and perform encoding and decoding according to the check matrix. Alternatively, when the code length is 3888, the communication parties can obtain the base check matrix based on the above modulo operation relationship. For another example, the communication parties store each cyclic shift value in the base check matrix. Alternatively, when the code length is 7776, the communication parties obtain the check matrix based on the above modulo operation relationship. By storing the cyclic shift values, the communication parties can obtain the check matrices of two code lengths, thereby saving storage space.

[0217] In a possible implementation, the communication parties store the expansion indication information, which is used to indicate whether the modulo operation relationship between Z(i, j) and Z1(i, j) is Z1(i, j) = Z(i, j) or Z1(i, j) = Z(i, j) + (Z / 2).

[0218] As an example, the extension indication information can be a bitmap, and a bit in the bitmap is used to indicate whether the modulo operation relationship between Z(i, j) and Z1(i, j) at the corresponding position of the bit is Z1(i, j) = Z(i, j) or Z1(i, j) = Z(i, j) + (Z / 2). For example, if the value of the bit is 0, the modulo operation relationship corresponding to the bit is Z1(i, j) = Z(i, j). For another example, if the value of the bit is 1, it indicates that the modulo operation relationship corresponding to the bit is Z1(i, j) = Z(i, j) + (Z / 2). The specific relationship between the bit in the bitmap and the corresponding position is not limited in the embodiments of the present application.

[0219] As another example, the extension indication information can be in the form of a binary matrix, and the size of the binary matrix can be the same as the size of the matrix corresponding to the information bits in the check matrix. For example, the binary matrix includes element 0 and element 1. For example, element 0 is located in the i-th row and the j-th column of the binary matrix, and element 0 can indicate that the modulo operation relationship between Z1(i, j) and Z(i, j) at the position corresponding to element 0 is Z1(i, j) = Z(i, j). For another example, element 1 is located in the i-th row and the j-th column of the binary matrix, and element 1 can indicate that the modulo operation relationship between Z1(i, j) and Z(i, j) at the position corresponding to element 1 is Z1(i, j) = Z(i, j) + (Z / 2).

[0220] The various check matrices provided by the embodiments of the present application can obtain significant performance improvement, and a good trade-off between performance and complexity.

[0221] The above various implementation manners can be separate embodiments, or the various implementation manners can be combined with each other.

[0222] The communication device provided by the embodiments of the present application will be introduced below.

[0223] The communication device provided by the embodiments of the present application will be introduced below.

[0224] Figure 10 is a structural schematic diagram of a communication apparatus provided in an embodiment of the present application. As shown in Figure 10, the communication apparatus includes a processing module 1001 and a transceiver module 1002. The transceiver module 1002 can implement corresponding communication functions, and the processing module 1001 is configured to implement corresponding processing functions. The transceiver module 1002 can also be referred to as an interface, a communication interface, or a communication module, etc.

[0225] In some embodiments of the present application, the communication apparatus can be configured to perform actions performed by the first station in the above method embodiments. In this case, the first station can be the Wi-Fi device itself or a chip or a functional module configured in the device, etc. The transceiver module 1002 is configured to perform transceiver-related operations of the first station in the above method embodiments, and the processing module 1001 is configured to perform processing-related operations of the first station in the above method embodiments.

[0226] For example, the processing module 1001 is configured to obtain information bits, and perform LDPC encoding on the information bits based on a check matrix to obtain encoded bits. The transceiver module 1002 is configured to output the encoded bits.

[0227] Optionally, the processing module 1001 can also be configured to perform other processing on the encoded bits. The transceiver module 1002 can also be configured to transmit or output the signals after the other processing.

[0228] In another embodiment of the present application, the communication apparatus can be configured to perform actions performed by the second station in the above method embodiments. In this case, the communication apparatus can be the Wi-Fi device itself or a chip or a functional module configured in the device, etc. The transceiver module 1002 is configured to perform transceiver-related operations of the second station in the above method embodiments, and the processing module 1001 is configured to perform processing-related operations of the second station in the above method embodiments.

[0229] Optionally, the transceiver module 1002 is configured to receive or input signals transmitted through a channel. The processing module 1001 can be configured to process the signals to obtain to-be-decoded information.

[0230] For example, the transceiver module 1002 can be configured to input to-be-decoded information. The processing module 1001 can perform LDPC decoding on the to-be-decoded information based on a check matrix.

[0231] For example, the transceiver module 1002 can be an antenna module. For another example, the transceiver module 1002 can be an input / output module. Optionally, in each of the above embodiments, the communication apparatus can further include a storage module, which can be configured to store instructions and / or data, and the processing module 1001 can read the instructions and / or data in the storage module to enable the communication apparatus to implement the above method embodiments. For example, the storage module can store the check matrix shown above, or the storage module can be configured to store the CPM coefficients or the extension indication information in the check matrix shown above.

[0232] In each of the above embodiments, the specific description of the terms or steps can refer to the description in the above method embodiments, which will not be repeated here.

[0233] It can be understood that the division of the modules in the above apparatus is only a logical functional division, one function module can correspond to each function, or two or more functions can be integrated into one function module. In actual implementation, all or part of the modules can be integrated into one physical entity, or can be distributed in different physical entities. In addition, the function modules can be implemented in the form of hardware, software, or a combination of hardware and software.

[0234] In one example, the functional units in any of the above apparatuses can be one or more integrated circuits configured to implement the above methods, such as one or more application specific integrated circuits (ASICs), or one or more central processing units (CPUs), one or more microcontroller units (MCUs), one or more digital signal processors (DSPs), or one or more field programmable gate arrays (FPGAs), or a combination of at least two of the integrated circuit forms.

[0235] The above introduces the communication apparatus of the embodiments of the present application, and the following introduces possible product forms of the communication apparatus. Any form of product that has the functions of the communication apparatus described in FIG. 10 falls within the protection scope of the embodiments of the present application. The following introduction is only for example, and does not limit the product form of the communication apparatus of the embodiments of the present application to only this.

[0236] In a possible implementation, in the communication apparatus shown in FIG. 10, the processing module 1001 can be one or more processors, and the transceiver module 1002 can be a transceiver, or the transceiver module 1002 can also be a sending module and a receiving module, the sending module can be a transmitter, and the receiving module can be a receiver, and the sending module and the receiving module are integrated in one device, for example, a transceiver. In the embodiment of the present application, the processor and the transceiver can be coupled, and the connection manner between the processor and the transceiver is not limited in the embodiment of the present application. In the process of executing the above method, the process about sending information in the above method can be the process that the processor outputs the above information. When the above information is output, the processor outputs the above information to the transceiver, so as to be transmitted by the transceiver. After the above information is output by the processor, the above information can also need to be processed further, and then reaches the transceiver. Similarly, the process about receiving information in the above method can be the process that the processor receives the input above information. When the processor receives the input information, the transceiver receives the above information and inputs the processor. Further, after the transceiver receives the above information, the above information can need to be processed further, and then inputs the processor.

[0237] FIG. 11 is another structural schematic diagram of the communication apparatus provided by the embodiment of the present application. As shown in FIG. 11, the communication apparatus 110 includes one or more processors 1120 and a transceiver 1110.

[0238] In some embodiments of the present application, the communication apparatus can be used to execute the steps or methods or functions executed by the first station, for example, the processor 1120 can be used to execute the functions or steps implemented by the processing module 1001 shown in FIG. 10, and the transceiver 1110 can be used to execute the functions or steps implemented by the transceiver module 1002 shown in FIG. 10. The specific description of the processor 1120 and the transceiver 1110 can refer to the method embodiments shown in FIG. 10 or the above description, and will not be described in detail here.

[0239] In some embodiments of the present application, the communication apparatus can be used to execute the steps or methods or functions executed by the first station, for example, the processor 1120 can be used to execute the functions or steps implemented by the processing module 1001 shown in FIG. 10, and the transceiver 1110 can be used to execute the functions or steps implemented by the transceiver module 1002 shown in FIG. 10. The specific description of the processor 1120 and the transceiver 1110 can refer to the method embodiments shown in FIG. 10 or the above description, and will not be described in detail here.

[0240] In the various implementations of the communication apparatus shown in FIG. 11, the transceiver can include a receiver for performing the functions (or operations) of receiving and a transmitter for performing the functions (or operations) of transmitting. The transceiver is configured to communicate with other devices / apparatuses via a transmission medium.

[0241] Optionally, the communication apparatus 110 can further include one or more memories 1130 for storing program instructions and / or data. The memory 1130 is coupled to the processor 1120. The coupling between the communication apparatus, units or modules in the embodiments of the present application can be indirect coupling or communication connection between the communication apparatus, units or modules, which can be electrical, mechanical or other forms, for information interaction between the communication apparatus, units or modules. The processor 1120 can operate in cooperation with the memory 1130. The processor 1120 can execute the program instructions stored in the memory 1130. Optionally, at least one of the one or more memories can be included in the processor.

[0242] The specific connection medium between the transceiver 1110, the processor 1120 and the memory 1130 in the embodiments of the present application is not limited. In FIG. 11, the memory 1130, the processor 1120 and the transceiver 1110 are connected through a bus 1140, which is represented by a thick line in FIG. 11, and the connection mode between other components is only schematically illustrated and is not limited. The bus can be divided into an address bus, a data bus, a control bus, etc. For convenience of representation, only one thick line is used in FIG. 11, but it does not mean that there is only one bus or only one type of bus.

[0243] In the embodiments of the present application, the processor can be a general processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., which can implement or execute the disclosed methods, steps and logic block diagrams in the embodiments of the present application. The general processor can be a microprocessor or any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as execution completed by a hardware processor, or executed by a combination of hardware and software modules in the processor, etc.

[0244] The memory in the embodiments of the present application can include, but is not limited to, a non-volatile memory such as a hard disk drive (HDD) or a solid-state drive (SSD), a random access memory (RAM), an erasable programmable ROM (EPROM), a read-only memory (ROM), a compact disc read-only memory (CD-ROM), and the like. The memory is any storage medium that can be used to carry or store program codes in the form of instructions or data structures and can be read and / or written by a computer (such as the communication device shown in the present application and the like). The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing a storage function, used for storing program instructions and / or data.

[0245] The processor 1120 is mainly used for processing communication protocols and communication data, controlling the whole communication device, executing software programs, and processing data of the software programs. The memory 1130 is mainly used for storing software programs and data. The transceiver 1110 can include a control circuit and an antenna, and the control circuit is mainly used for converting baseband signals and radio frequency signals and processing the radio frequency signals. The antenna is mainly used for receiving and transmitting radio frequency signals in the form of electromagnetic waves. The input and output devices, such as touch screens, display screens, keyboards, and the like, are mainly used for receiving user input data and outputting data to users.

[0246] When the communication device is powered on, the processor 1120 can read the software program in the memory 1130, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 1120 performs baseband processing on the data to be transmitted, and outputs the baseband signal to the radio frequency circuit. The radio frequency circuit converts the baseband signal into a radio frequency signal, and transmits the radio frequency signal through the antenna in the form of electromagnetic waves. When data is transmitted to the communication device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 1120. The processor 1120 converts the baseband signal into data and processes the data.

[0247] In another implementation, the radio frequency circuit and the antenna can be arranged independently of the processor performing baseband processing, for example, in a distributed scenario, the radio frequency circuit and the antenna can be arranged remotely from the communication device.

[0248] The communication apparatus shown in the embodiments of the present application can also have more components than those shown in FIG. 11, and the embodiments of the present application do not limit this. The method performed by the processor and the transceiver shown above is only an example, and the steps actually performed by the processor and the transceiver can refer to the method described above.

[0249] In another possible implementation, in the communication apparatus shown in FIG. 10, the processing module 1001 can be one or more logic circuits, and the transceiving module 1002 can be an input / output interface, also referred to as a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiving module 1002 can also be a sending module and a receiving module, the sending module can be an output interface, and the receiving module can be an input interface, and the sending module and the receiving module are integrated in one module, for example, an input / output interface.

[0250] FIG. 12 is another structure of a communication apparatus provided by the embodiments of the present application. As shown in FIG. 12, the communication apparatus shown in FIG. 12 includes a logic circuit 1201 and an interface 1202. That is, the processing module 1001 can be implemented by the logic circuit 1201, and the transceiving module 1002 can be implemented by the interface 1202. The logic circuit 1201 can be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface 1202 can be a communication interface, an input / output interface, a pin, etc. For example, FIG. 12 is a chip with the above communication apparatus as an example, which includes the logic circuit 1201 and the interface 1202.

[0251] In the embodiments of the present application, the logic circuit and the interface can also be coupled to each other. The embodiments of the present application do not limit the specific connection mode of the logic circuit and the interface. For example, the logic circuit 1201 can be used to perform the functions or steps implemented by the processing module 1001 shown in FIG. 10, and the interface 1202 can be used to perform the functions or steps implemented by the transceiving module 1002 shown in FIG. 10. For specific description of the logic circuit 1201 and the interface 1202, refer to the method embodiments shown in FIG. 10 or the above description, which will not be described in detail here.

[0252] The communication apparatus shown in the embodiments of the present application can implement the method provided by the embodiments of the present application in the form of hardware, or implement the method provided by the embodiments of the present application in the form of software, etc., and the embodiments of the present application do not limit this.

[0253] The embodiments of the present application also provide a communication system, which includes a first station and a second station, and the first station and the second station can be used to perform the method in any of the preceding embodiments.

[0254] In addition, the present application also provides a computer program for implementing the operations and / or processes performed by each communication device in the method provided by the present application.

[0255] The present application also provides a computer readable storage medium having computer code stored therein, which, when executed on a computer (such as each communication device shown above and the like), causes the computer to perform the operations and / or processes performed by each communication device in the method provided by the present application.

[0256] The present application also provides a computer program product comprising computer code or a computer program, which, when executed on a computer (such as each communication device shown above and the like), causes the operations and / or processes performed by each communication device in the method provided by the present application to be performed.

[0257] In several embodiments provided by the present application, it should be understood that the disclosed system, communication device and method can be implemented in other manners. For example, the above described communication device embodiments are merely illustrative, and for example, the division of the modules is merely a logical function division, and there can be another division manner in actual implementation, for example, multiple modules or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections between different modules can be indirect couplings or communication connections through some interfaces, communication devices or modules, and can be electric, mechanical or other forms of connections.

[0258] The modules illustrated as separated components can or can not be physically separated, and the components illustrated as modules can or can not be physical modules, i.e., can be located in one place, or can be distributed on multiple network modules. Part or all of the modules can be selected according to actual needs to achieve the technical effects of the scheme provided by the embodiments of the present application.

[0259] In addition, each functional module in each embodiment of the present application can be integrated into a processing module, or each module can exist physically, or two or more modules can be integrated into one module. The above integrated module can be realized in the form of hardware or in the form of a software functional module.

[0260] The integrated module, if implemented in the form of a software function module and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or say the part that contributes to the prior art, or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a readable storage medium, includes a plurality of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in various embodiments of the present application. The aforementioned readable storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

Claims

1. An encoding method characterized by comprising: The method comprises: performing low-density parity-check (LDPC) encoding on information bits according to a check matrix, to obtain encoded bits, the check matrix corresponding to a code rate of 5 / 6, the check matrix corresponding to a code length of 7776, and the check matrix having an extension factor of 162; outputting the encoded bits.

2. A decoding method, comprising: The method comprises: inputting to-be-decoded information; performing low-density parity-check (LDPC) decoding on the to-be-decoded information according to a check matrix, the check matrix corresponding to a code rate of 5 / 6, the check matrix corresponding to a code length of 7776, and the check matrix having an extension factor of 162.

3. The method according to claim 1 or 2, characterized in that, The check matrix comprises a sub-matrix, the sub-matrix being a 2-row and 2-column matrix, the sub-matrix comprising two elements greater than or equal to 0, and the two elements satisfying a modulo operation relationship.

4. The method according to any one of claims 1 to 3, characterized in that, The check matrix is any one of the following matrices: or 5. The method according to any one of claims 1 to 4, characterized in that, The check matrix corresponds to a base check matrix, the base check matrix corresponding to a code length of 3888, the base check matrix corresponding to a code rate of 5 / 6, and the base check matrix having an extension factor of 81.

6. The method of claim 5, wherein, The check matrix corresponds to a base check matrix, and comprises: a first element in the check matrix and a second element in the base check matrix satisfy a modulo operation relationship, the modulo operation relationship satisfying: the first element being the same as the second element, or the first element being equal to a sum of the second element and 81; wherein a position of the first element in the check matrix is the same as a position of the second element in the base check matrix, the first element being an element in a matrix corresponding to information bits in the check matrix, the second element being an element in a matrix corresponding to information bits in the base check matrix, and the first element and the second element both being greater than or equal to 0.

7. The method according to claim 5 or 6, characterized in that, The check matrix corresponds to a base check matrix, and comprises: a third element in the check matrix being the same as a fourth element in the base check matrix; wherein a position of the third element in the check matrix is the same as a position of the fourth element in the base check matrix, the third element being an element in a matrix corresponding to information bits in the check matrix, the fourth element being an element in a matrix corresponding to information bits in the base check matrix, and the third element and the fourth element both being less than 0.

8. The method of claim 5, wherein, The check matrix corresponds to a base check matrix, and comprises: a matrix corresponding to check bits in the check matrix being the same as a matrix corresponding to check bits in the base check matrix.

9. A communications device, characterized by The apparatus comprises a module for performing the method of any one of claims 1-8.

10. A communications device, characterized by The apparatus comprises a processor and a transceiver coupled to cause the communication apparatus to implement the method of any one of claims 1-8.

11. A communications device, characterized by The apparatus comprises a logic circuit and an interface coupled to cause the communication apparatus to implement the method of any one of claims 1-8.

12. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program, which, when executed by a communication apparatus, causes the method of any one of claims 1-8 to be implemented.

13. A computer program product, characterised in that, The computer program product, when executed by a computer, causes the method of any of claims 1-8 to be performed.

14. A communication system, characterized by comprising a first station for performing the method of any of claims 1, 3-8 and a second station for performing the method of any of claims 2-8.

Images