CN114785451A - Method and device for receiving uplink image segmentation multiple access transmission and storage medium - Google Patents

Method and device for receiving uplink image segmentation multiple access transmission and storage medium Download PDF

Info

Publication number
CN114785451A
CN114785451A CN202110088436.0A CN202110088436A CN114785451A CN 114785451 A CN114785451 A CN 114785451A CN 202110088436 A CN202110088436 A CN 202110088436A CN 114785451 A CN114785451 A CN 114785451A
Authority
CN
China
Prior art keywords
tanner graph
user
multiple access
node
nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110088436.0A
Other languages
Chinese (zh)
Other versions
CN114785451B (en
Inventor
钱彬
张泽方
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Fulian Fugui Precision Industry Co Ltd
Original Assignee
Shenzhen Fugui Precision Industrial Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Fugui Precision Industrial Co Ltd filed Critical Shenzhen Fugui Precision Industrial Co Ltd
Priority to CN202110088436.0A priority Critical patent/CN114785451B/en
Publication of CN114785451A publication Critical patent/CN114785451A/en
Application granted granted Critical
Publication of CN114785451B publication Critical patent/CN114785451B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0047—Decoding adapted to other signal detection operation
    • H04L1/0048—Decoding adapted to other signal detection operation in conjunction with detection of multiuser or interfering signals, e.g. iteration between CDMA or MIMO detector and FEC decoder
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0047—Decoding adapted to other signal detection operation
    • H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Abstract

A receiving method of uplink image segmentation multiple access transmission is characterized in that an uplink image segmentation multiple access transmission coding image matrix is converted into a first tanner graph, a corresponding second tanner graph is respectively constructed for each user node in the first tanner graph according to a low-density parity check code check matrix, each user node in the first tanner graph is linked with a plurality of variable nodes in the corresponding second tanner graph through a symbol and bit mapper to form an extended tanner graph, and a belief propagation iterative detection decoding is used for carrying out multi-user data decoding with preset maximum iteration times by taking a logarithm likelihood ratio as an information metric value. The invention also provides a device and a computer readable storage medium for realizing the method for receiving the uplink image segmentation multiple access transmission. The invention can effectively receive and process multi-user data.

Description

Method and device for receiving uplink image segmentation multiple access transmission and storage medium
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a storage medium for receiving an uplink image segmentation multiple access transmission.
Background
Image Division Multiple Access (Pattern Division Multiple Access) is a non-orthogonal Multiple Access technology, wherein a transmitting end maps signals of a plurality of users to the same time domain, frequency domain and space domain resources through coded images for multiplexing, and a receiving end performs multi-user detection decoding to realize non-orthogonal transmission. In order to meet the massive connection requirement of future mobile communication facing the internet of things, how to improve the performance of a receiving end is an urgent problem to be solved.
Disclosure of Invention
In view of the above, the present invention provides a method, an apparatus and a storage medium for receiving uplink video segmentation multiple access transmission, which can detect and decode multi-user signals and improve the performance of a receiving end.
An embodiment of the present invention provides a method for receiving uplink image segmentation multiple access transmission, where the method includes: constructing a first tanner graph according to an uplink image segmentation multiple access transmission coding image matrix; respectively constructing a corresponding second tanner graph for each user node in the first tanner graph according to the check matrix of the low-density parity check code; linking each user node in the first tanner graph with a plurality of variable nodes in a corresponding second tanner graph via a symbol-to-bit mapper to form an extended tanner graph; and performing multi-user data decoding with preset maximum iteration times on the extended tanner graph by using belief propagation iterative detection decoding, wherein a log-likelihood ratio is used as an information metric value.
An embodiment of the present invention further provides a receiving apparatus, where the receiving apparatus includes a memory and a processor, where the memory is configured to store at least one instruction, and the processor is configured to implement the receiving method of uplink image division multiple access transmission when executing the at least one instruction.
An embodiment of the present invention further provides a storage medium, where the storage medium stores at least one instruction, and the at least one instruction, when executed by a processor, implements the method for receiving uplink image segmentation multiple access transmission.
Compared with the prior art, the receiving method, the receiving device and the storage medium for the uplink image segmentation multiple access transmission can improve the performance of the receiving end on multi-user data detection decoding.
Drawings
Fig. 1 is a flow chart of upstream image segmentation multiple access transmission according to an embodiment of the present invention.
Fig. 2 is an example of an ascending image segmentation multiple access coded image matrix represented by tanner graphs according to an embodiment of the present invention.
Fig. 3 is an example of a low density parity check code check matrix represented by tanner graphs according to an embodiment of the present invention.
Fig. 4 is a flowchart of a method for receiving uplink image segmentation multiple access transmission according to an embodiment of the present invention.
FIG. 5 is an example of an expanded tanner graph according to an embodiment of the invention.
Fig. 6 is a schematic diagram of a complete iteration process of belief propagation iterative detection decoding in a receiving method of uplink image segmentation multiple access transmission according to an embodiment of the present invention.
Fig. 7 is a flowchart of iterative update of belief propagation iterative detection decoding in a method for receiving uplink image segmentation multiple access transmission according to an embodiment of the present invention.
Fig. 8 is a block diagram of a receiving device for upstream graph cut multiple access transmission according to an embodiment of the invention.
Description of the main elements
Figure BDA0002911820740000021
Figure BDA0002911820740000031
The following detailed description will further illustrate the invention in conjunction with the above-described figures.
Detailed Description
The invention will be described in further detail with reference to the following figures and examples in order to facilitate the understanding and practice of the invention for those skilled in the art, it being understood that the invention provides many applicable inventive concepts which can be embodied in a wide variety of specific forms. Those of skill in the art may now appreciate that the invention may be practiced with respect to the specific details described in these and other embodiments, as well as other structural, logical, and electrical changes that may be made without departing from the spirit and scope of the present invention.
The present description provides different examples to illustrate the technical features of different embodiments of the present invention. The arrangement of the components in the embodiments is for illustration and not for limiting the invention. And the reference numbers in the drawings are partially repeated in the embodiments to simplify the description, and do not indicate any relationship between the different embodiments. Where the same component numbers are used in the drawings and the description to refer to the same or like components. The illustrations of the present specification are in simplified form and are not drawn to precise scale.
Further, in describing some embodiments of the invention, the specification may have presented the method and/or process of the invention as a particular sequence of steps. However, the methods and procedures are not necessarily limited to the particular order of steps described, as such may not necessarily be performed according to the particular order of steps described. Other sequences are possible implementations, as will be apparent to those skilled in the art of the present invention. Therefore, the particular order of the steps set forth in the specification should not be construed as limitations on the claimed subject matter. Moreover, the claimed method and/or process is not limited by the order of steps performed, and one skilled in the art can appreciate that the order of steps performed may not be altered without departing from the spirit and scope of the claimed invention.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items. Some embodiments of the invention are described in detail below with reference to the accompanying drawings.
Referring to fig. 1, a flow chart of multiuser uplink image division multiple access transmission according to an embodiment of the invention is shown. As shown in the figure1, there are k users (shown as user 1 to user k in the figure) on the transmitting side, and the uplink data bit stream of each user is first channel coded (111, 121). In this example, a Low Density Parity Check (LDPC) code is used as the channel coding. The channel coding adds redundant information to the user data at the transmitting end, wherein the redundant information is related to the original data, and the receiving end detects and corrects errors according to the correlation, so that the transmission has certain error correction capability and anti-interference capability. The coded bits are transmitted to modulators (112, 122), the data modulation symbols after constellation mapping are transmitted to image Division Multiple access (PDMA) codes (113, 123), the PDMA image vectors are used for coding modulation, the PDMA image vector modulation symbols are mapped to one or more transmission layers (Layer) through PDMA mapping (114, 124), and finally Orthogonal Frequency-Division Multiplexing (OFDM) symbols (115, 125) of each antenna port are generated. In this embodiment, the PDMA image vectors are encoded by binary encoding the image matrix G[N,K]By definition, where N denotes the total number of resource units, and K denotes the total number of users, the relationship between the uplink PDMA receiving end signal and the uplink PDMA transmitting end signal may be denoted as y ═ G[N,K]x + n, where n represents the uplink receive additive noise.
In this embodiment, a Tanner graph (Tanner graph) is used to describe a PDMA encoded image matrix, where und (user node) is used to represent a user node, corresponding to a matrix G[N,K]Cnd (channel node) for representing a channel node, corresponding to the matrix G[N,K]Per row in (1), matrix G[N,K]There is an edge (or called an online) between the UND and CND corresponding to all non-zero elements in the list. As shown in fig. 2, a PDMA coded image matrix 201 is used to represent a coded image in which 6 users multiplex 4 resource units, and the PDMA coded image matrix 201 can be described by a Tanner graph 202.
Whereas LDPC codes are typically represented using a check matrix H or Tanner graph. In this embodiment, a Tanner graph is used to describe a Check matrix H in an LDPC code, where Variable nodes (Variable nodes) correspond to each column of the Check matrix H, Check nodes (Check nodes) correspond to each row of the Check matrix H, and there is an edge (or called an online line) between the Variable nodes and the Check nodes corresponding to all non-zero elements in the Check matrix H. As shown in fig. 3, an LDPC code check matrix 301 having a code length of 6 and having a codeword of 4 check bits can be described by a Tanner graph 302.
Referring to fig. 4, a flowchart of a method for receiving uplink image segmentation multiple access transmission according to an embodiment of the present invention is shown. As shown in fig. 4, the receiving method specifically includes the following steps, and the order of the steps in the flowchart may be changed and some steps may be omitted according to different requirements.
Step S402, constructing a first Tanner graph according to the PDMA coded image matrix.
The first Tanner graph comprises a plurality of user nodes and a plurality of channel nodes, wherein each user node corresponds to each column of the PDMA coded image matrix, each channel node corresponds to each row of the PDMA coded image matrix, and an edge exists between the user nodes and the channel nodes corresponding to all non-zero elements in the PDMA coded image matrix.
Step S404, respectively constructing corresponding second Tanner graphs for each user node in the first Tanner graph according to the LDPC code check matrix.
The second Tanner graph comprises a plurality of variable nodes and a plurality of check nodes, wherein each variable node corresponds to each column of the LDPC code check matrix, each check node corresponds to each row of the LDPC code check matrix, and an edge exists between the variable node and the check node corresponding to all non-zero elements in the LDPC code check matrix.
Step S406, linking each user node in the first Tanner graph with a plurality of variable nodes in the corresponding second Tanner graph through a symbol and bit mapper, so as to form an extended Tanner graph.
Taking PDMA encoded image matrices G [6,4] and (6,4) LDPC codes as an example, as shown in fig. 5, a first Tanner graph 501 is constructed according to the PDMA encoded image matrices G [6,4], a plurality of second Tanner graphs 502 are constructed according to the (6,4) LDPC code check matrix, and each user node in the first Tanner graph 501 and a plurality of variable nodes in the second Tanner graphs 502 are linked with a bit mapper 503 through a symbol to form an extended Tanner graph 500.
Step S408, performing multi-user data Decoding with a preset maximum iteration number on the extended Tanner graph by using Belief Propagation-Iterative Detection and Decoding (BP-IDD), wherein a Log-likelihood Ratio (Log-likelihood Ratio) is used as an information metric.
In a specific embodiment, each iteration process of BP-IDD includes an iterative update of the first Tanner graph and an iterative update of a second Tanner graph corresponding to all user nodes in the first Tanner graph, wherein LLR information output by each iterative update of the first Tanner graph is transmitted to a variable node in the corresponding second Tanner graph through the symbol and bit mapper to serve as a priori information for the iterative update of the corresponding second Tanner graph; and the LLR information output by each iteration update of the second corresponding Tanner graph is transmitted to a corresponding user node in the first Tanner graph through the symbol and bit device mapper to serve as prior information of the next iteration update of the first Tanner graph.
In a specific embodiment, the receiving method further comprises the step of judging whether any user decoding is successful or not when each iteration process is completed. And when judging that the decoding of the user is successful, simplifying the extended Tanner graph and updating the received signals of all channel nodes linked with the successfully decoded user in the first Tanner graph.
In a specific embodiment, the simplifying and expanding Tanner graph comprises deleting a user node, a symbol and bit mapper and a second Tanner graph corresponding to a user with successful decoding, and deleting edges of connection between the deleted nodes.
In a specific embodiment, the updating the received data of all channel nodes linked with the successfully decoded user in the first Tanner graph includes removing the data of the successfully decoded user from the received data of all channel nodes linked with the corresponding user node to remove interference of the successfully decoded user data.
Referring to fig. 6, a process diagram of one complete iteration of the extended Tanner graph according to an embodiment of the present invention is shown. As shown in the figure, the transfer direction of the LLR information in one complete iteration process is from (r) to (r), which is described in detail below.
In fig. 6, x representskRepresenting user nodes (x in FIG. 6)1、x2、x3、x4、x5And x6)、yjRepresenting the channel node (y in FIG. 6)1、y2、y3And y4)、cnRepresenting variable nodes (c in FIG. 6)1、c2、cn3、c4、c5And c6)、rmRepresents check nodes (r in FIG. 6)1、r2、r3And r4)。
In initialization, the maximum iteration number is preset to be lmaxAnd a default user node xkTo the channel node yjIs the initial LLR of (phi in FIG. 6)
Figure BDA0002911820740000061
Where s is a modulation symbol corresponding to an arbitrary bit sequence.
Second in FIG. 6, when the first iteration needs to be calculated, the channel node yjTo user node xkLLR information of (i)
Figure BDA0002911820740000062
The specific calculation formula is as follows:
Figure BDA0002911820740000071
wherein M isc(j) Is a node y of a channeljSet of all user nodes linked, s0Is a modulation symbol corresponding to an all-zero bit sequence
Third in FIG. 6, when the first iteration needs to be calculated, the user node transmits LLR information to the symbol and bit mapper,namely Ll(xkS), the specific calculation formula is as follows:
Figure BDA0002911820740000072
wherein, Mv(k) Is a node x with a userkA set of all channel nodes that are linked.
(iv) in FIG. 6, when the first iteration needs to be calculated, the LLR information, namely L, transmitted to the variable node by the symbol and bit mapperl(cn) The specific calculation formula is as follows:
Figure BDA0002911820740000073
wherein the content of the first and second substances,
Figure BDA0002911820740000074
is cn1-a corresponding set of constellation points,
Figure BDA0002911820740000075
is c n0 corresponds to a set of constellation points.
In FIG. 6, # the LLR information transmitted from the variable node to the check node in the first iteration needs to be calculated, that is
Figure BDA0002911820740000076
Sixthly, in FIG. 6, when the first iteration needs to be calculated, the LLR information transmitted to the variable nodes by the check nodes is calculated, namely
Figure BDA0002911820740000077
The specific calculation formula is as follows:
Figure BDA0002911820740000078
wherein, Mc(m) is a check node rmSet of all variable nodes linked。
In fig. 6, when the first iteration needs to be calculated, the LLR information transmitted to the symbol and bit mapper by the variable node, i.e., Ll(cn) The specific calculation formula is as follows:
Figure BDA0002911820740000079
wherein, Mv(n) is and variable node cnA set of all check nodes that are linked.
R in fig. 6, LLR information L from the symbol and bit mapper to the user node for the L-th iteration is calculatedl(xkS), the specific calculation formula is as follows:
Figure BDA0002911820740000081
wherein the content of the first and second substances,
Figure BDA0002911820740000082
represents xkAn LDPC codeword corresponding when s, an
Figure BDA0002911820740000083
Represents xkAnd when the code is 0, the corresponding LDPC code word is obtained.
The l +1 th iteration updates LLR information transmitted from the user node to the channel node ((r) in FIG. 6) to
Figure BDA0002911820740000084
By means of the symbol in fig. 6, an estimated value of the received codeword for each user can be obtained as follows
Figure BDA0002911820740000085
N is more than or equal to 1 and less than or equal to N, if the code word received by the user passes CRC, the data decoding of the user is judged to be successful, and the user is related toAll nodes are deleted from the extended Tanner graph and the received data (e.g., y) of all channel nodes linked to the user node corresponding to the user is updated1＝y1-x1)。
Referring to fig. 7, a flowchart of the first iteration update of BP-IDD in step S408 of fig. 4 is shown.
It should be noted that the maximum number of iterations is preset to lmax。
It should be noted that, during the initial iterative update, the LLR information transmitted to the linked channel nodes by all the user nodes is set to zero.
Step S702, determine whether the maximum number of iterations has been exceeded, i.e. |<lmax. When the maximum iteration times are judged to be exceeded, the process is ended; when it is determined that the maximum number of iterations is not exceeded, step S704 is performed.
Step S704, calculating LLR information transmitted to the linked one or more channel nodes by each user node, and transmitting the LLR information to the linked one or more channel nodes.
Step S706, calculating LLR information transmitted to the linked one or more user nodes by each channel node, and transmitting to the linked one or more user nodes.
In step S708, the LLR information transmitted to the linked symbol and bit mapper by each user node is calculated and transmitted to the linked symbol and bit mapper.
In step S710, LLR information transmitted to the linked variable nodes by each symbol and bit mapper is calculated and transmitted to the linked variable nodes.
In step S712, LLR information of each variable node to the linked one or more check nodes is calculated and transmitted to the linked one or more check nodes.
In step S714, LLR information transmitted to the linked one or more variable nodes by each check node is calculated and transmitted to the linked one or more variable nodes.
In step S716, the LLR information transmitted to the linked symbol and bit mapper by each variable node is calculated and transmitted to the linked symbol and bit mapper.
In step S718, it is determined whether all the user data are decoded successfully. In one embodiment, the redundancy check can be used to determine whether the user data estimate is correct, thereby determining whether the user has successfully decoded the data. When all the user data are judged to be decoded successfully, the process is ended; when it is determined that all the user data are successfully decoded, step S720 is performed.
Step S720, determining whether at least one user data is decoded successfully. When it is determined that the decoding of the at least one user data is successful, performing step S722; when it is determined that no user data is successfully decoded, step S724 is performed.
Step S722, simplifying the extended Tanner graph. And deleting all associated nodes and edges of the at least one user from the expanded Tanner graph, updating the received data of all channel nodes, and removing the data interference of the user.
In step S724, the LLR information transmitted to the linked user node by each symbol and bit mapper is calculated and transmitted to the linked user node.
In step S726, the number of iterations is increased by one, i.e., l + 1.
Referring to fig. 8, a block diagram of a receiving device 800 for multiuser uplink picture division multiple access transmission according to an embodiment of the invention is shown.
The receiving device 800 includes at least one processor 810 and a memory 820. The receiving device 800 may also include more or less additional hardware or software than shown, or a different arrangement of components.
The receiving method of the multi-user uplink image division multiple access transmission operates in the receiving device 800. In some embodiments, the memory 820 stores at least one functional module comprising program code segments, which are executed by the at least one processor 810 to implement the method for receiving multiple user uplink image segmentation multiple access transmissions (described in detail with reference to fig. 4, 6, and 7).
In some embodiments, the receiving device 800 includes a terminal capable of automatically performing numerical calculation and/or information processing according to preset or stored instructions, and the hardware includes but is not limited to a microprocessor, an application specific integrated circuit, a programmable gate array, a digital processor, an embedded device, and the like.
It should be noted that the receiving device 800 is only an example, and other existing or future products, such as may be suitable for the present application, are also included in the scope of the present application and are incorporated by reference herein.
In some embodiments, the memory 820 is used for storing program codes and various data, and realizes high-speed and automatic access of programs or data during the operation of the receiving device 800. The Memory 820 includes a Read-Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), a One-time Programmable Read-Only Memory (OTPROM), an electronically Erasable rewritable Read-Only Memory (Electrically-Erasable Programmable Read-Only Memory (EEPROM)), an optical Read-Only disk (CD-ROM) or other optical disk Memory, a magnetic disk Memory, a tape Memory, or any other storage medium readable by a computer capable of carrying or storing data.
In some embodiments, the at least one processor 810 may be composed of an integrated circuit, for example, a single packaged integrated circuit, or may be composed of a plurality of integrated circuits packaged with the same or different functions, including one or more Central Processing Units (CPUs), microprocessors, digital Processing chips, graphics processors, and combinations of various control chips. The at least one processor 810 is a Control Unit (Control Unit) of the receiving apparatus 800, connects various components of the entire receiving apparatus 800 by using various interfaces and lines, and performs various functions of the receiving apparatus 800 and processes data, for example, functions of the receiving apparatus 800 for receiving multi-user data, by operating or executing programs or modules stored in the memory 820 and calling data stored in the memory 820.
In some embodiments, the receiving apparatus 800 may be a base station or a terminal.
It is to be understood that the embodiments described are illustrative only and are not to be construed as limiting the scope of the claims.
The memory 820 has program code stored therein, and the at least one processor 810 can call the program code stored in the memory 820 to perform related functions. For example, the program codes of the receiving method flows in fig. 4, fig. 6 and fig. 7 are executed by the at least one processor 810, so as to implement the functions of the modules for the purpose of receiving the uplink image segmentation multiple access transmission.
In one embodiment, the memory 820 stores one or more instructions (i.e., at least one instruction) that are executed by the at least one processor 810 for reception purposes of an upstream image segmentation multiple access transmission, as described with reference to fig. 4, 6, and 7.
In summary, the method, the apparatus and the storage medium for receiving uplink image segmentation multiple access transmission of the present invention form an extended Tanner graph by combining the Tanner graph of the PDMA encoded image matrix and the Tanner graph of the LDPC code check matrix, design a BP-IDD algorithm on the extended Tanner graph, and continuously simplify the extended Tanner graph in an iteration process, so as to reduce the operation complexity of the BP-IDD algorithm and improve the overall receiving performance.
It should be noted that the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims (10)

1. A receiving method of uplink image segmentation multiple access transmission is characterized in that the receiving method comprises the following steps:
constructing a first tanner graph according to an uplink image segmentation multiple access transmission coding image matrix;
respectively constructing a corresponding second tanner graph for each user node in the first tanner graph according to the check matrix of the low-density parity check code;
linking each user node in the first tanner graph with a plurality of variable nodes in a corresponding second tanner graph via a symbol-to-bit mapper to form an extended tanner graph; and (c) a second step of,
and performing multi-user data decoding with preset maximum iteration times on the extended tanner graph by using belief propagation iterative detection decoding, wherein a log-likelihood ratio is used as an information metric value.
2. The receiving method of claim 1, wherein the step of constructing the first tanner graph from an upstream image partitioning multiple access transport coded image matrix comprises:
the first tanner graph comprises a plurality of user nodes and a plurality of channel nodes;
each user node of the first tanner graph corresponds to each column in the uplink image segmentation multiple access transmission encoded image matrix;
each channel node of the first tanner graph corresponds to each row in the uplink image segmentation multiple access transmission encoded image matrix; and
an edge exists between user nodes and channel nodes corresponding to all non-zero elements in the uplink image segmentation multiple access transmission coding image matrix.
3. The receiving method of claim 1, wherein the step of constructing a corresponding second tanner graph for each user node in the first tanner graph according to a low-density parity-check code check matrix comprises:
the second tanner graph comprises a plurality of variable nodes and a plurality of check nodes;
each variable node of the second tanner graph corresponds to each column in the low-density parity-check code check matrix;
each check node of the second tanner graph corresponds to each row in the low-density parity-check code check matrix;
and an edge exists between the variable node and the check node corresponding to all the non-zero elements in the uplink image segmentation multiple access transmission coding image matrix.
4. The receiving method of claim 1, wherein each iterative process of belief propagation iterative detection decoding comprises an iterative update of the first tanner graph and an iterative update of a second tanner graph corresponding to all user nodes in the first tanner graph.
5. The receiving method of claim 4, wherein each iteration of the belief propagation iterative detection decoding comprises:
the log-likelihood ratio information output by each iteration updating of the first tanner graph is transmitted to a variable node in a corresponding second tanner graph through the symbol and bit mapper to serve as the prior information for the iteration updating of the corresponding second tanner graph; and (c) a second step of,
and the log-likelihood ratio information output by each iteration updating of the corresponding second tanner graph is transmitted to the user node in the first tanner graph through the symbol and bit device mapper to be used as the prior information of the next iteration updating of the first tanner graph.
6. The receiving method of claim 1, wherein the receiving method further comprises:
when each iteration process of the belief propagation iterative detection decoding is finished, judging whether any user decoding is successful; and
and when judging that the decoding of the user is successful, simplifying the extended tanner graph, and updating the received signals of all channel nodes linked with the successfully decoded user in the first tanner graph.
7. The receiving method of claim 6, wherein the reducing the expanded tanner graph comprises:
deleting the user node, the symbol and bit mapper and the second tanner graph corresponding to the user with successful decoding; and the number of the first and second groups,
and deleting the edges of the connections between the deleted nodes.
8. The receiving method as claimed in claim 6, wherein said updating the received signals of all channel nodes linked to the user node corresponding to the decoded successful user in the first tanner graph comprises:
and removing the data of the successfully decoded user from the received data of all channel nodes linked with the corresponding user node.
9. A receiving apparatus, characterized in that the receiving apparatus comprises a processor, a memory and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the method of reception of an upstream image division multiple access transmission according to any of claims 1 to 8.
10. A storage medium, characterized in that it has stored thereon a computer program which, when being executed by a processor, carries out the steps of a method of reception of an upstream image segmentation multiple access transmission according to any one of claims 1 to 8.
CN202110088436.0A 2021-01-22 2021-01-22 Method, device and storage medium for receiving uplink image division multiple access transmission Active CN114785451B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110088436.0A CN114785451B (en) 2021-01-22 2021-01-22 Method, device and storage medium for receiving uplink image division multiple access transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110088436.0A CN114785451B (en) 2021-01-22 2021-01-22 Method, device and storage medium for receiving uplink image division multiple access transmission

Publications (2)

Publication Number Publication Date
CN114785451A true CN114785451A (en) 2022-07-22
CN114785451B CN114785451B (en) 2023-10-31

Family

ID=82407651

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110088436.0A Active CN114785451B (en) 2021-01-22 2021-01-22 Method, device and storage medium for receiving uplink image division multiple access transmission

Country Status (1)

Country Link
CN (1) CN114785451B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789798A (en) * 2016-11-22 2017-05-31 北京邮电大学 Data is activation, method of reseptance and device based on Space Coupling data transmission technology
WO2018174686A1 (en) * 2017-03-24 2018-09-27 Samsung Electronics Co., Ltd. Apparatus and method for in multiple access in wireless communication
CN110337789A (en) * 2017-02-17 2019-10-15 索尼公司 Electronic equipment and communication means for the multiple access access based on non orthogonal resources
CN110430009A (en) * 2019-06-29 2019-11-08 西南电子技术研究所（中国电子科技集团公司第十研究所） Multi-user association code modulation system
CN110730008A (en) * 2019-09-12 2020-01-24 天津大学 RS code belief propagation decoding method based on deep learning
US20200220557A1 (en) * 2017-07-31 2020-07-09 Codelucida, Inc. Vertical Layered Finite Alphabet Iterative Decoding

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789798A (en) * 2016-11-22 2017-05-31 北京邮电大学 Data is activation, method of reseptance and device based on Space Coupling data transmission technology
CN110337789A (en) * 2017-02-17 2019-10-15 索尼公司 Electronic equipment and communication means for the multiple access access based on non orthogonal resources
WO2018174686A1 (en) * 2017-03-24 2018-09-27 Samsung Electronics Co., Ltd. Apparatus and method for in multiple access in wireless communication
US20200220557A1 (en) * 2017-07-31 2020-07-09 Codelucida, Inc. Vertical Layered Finite Alphabet Iterative Decoding
CN110430009A (en) * 2019-06-29 2019-11-08 西南电子技术研究所（中国电子科技集团公司第十研究所） Multi-user association code modulation system
CN110730008A (en) * 2019-09-12 2020-01-24 天津大学 RS code belief propagation decoding method based on deep learning

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
任斌: ""面向5G的图样分割非正交多址接入（PDMA）关键技术研究"", 《中国博士学位论文全文数据库（电子期刊）信息科技辑》 *

Also Published As

Publication number Publication date
CN114785451B (en) 2023-10-31

Similar Documents

Publication Publication Date Title
US11831329B2 (en) LDPC code matrices
CN110226289B (en) Receiver and method for decoding
US9385753B2 (en) Systems and methods for bit flipping decoding with reliability inputs
KR102349209B1 (en) Systems and methods for multi-stage soft input decoding
WO2019026981A2 (en) Encoder, decoder and transmitter
US9369152B2 (en) Systems and methods for decoding with late reliability information
RU2369008C2 (en) Device and method for coding/decoding block code for low density parity check with variable block length
KR101700235B1 (en) Low complexity receiver and method for low density signature modulation
US20090222711A1 (en) Generalized Multi-Threshold Decoder for Low-Density Parity Check Codes
KR20110031322A (en) Reduced complexity ldpc decoder
KR20060032464A (en) Efficient decoding method and apparatus of low density parity code
CN116964945A (en) Quasi-cyclic polarization code for master pattern and related low-density generation matrix family
CN111130563B (en) Method and device for processing information
CN112953569B (en) Decoding method and device, storage medium, electronic equipment and decoder
CN108234066B (en) Communication method and communication device based on LDPC
CN111034055A (en) Simplified check node processing in non-binary LDPC decoders
WO2020074404A1 (en) Offset value determination in a check node processing unit for message-passing decoding of non-binary codes
JP2018520544A (en) Method and device for iterative MIMO detection and channel decoding
CN114785451A (en) Method and device for receiving uplink image segmentation multiple access transmission and storage medium
US10903855B2 (en) Convolutional LDPC decoding method and apparatus, decoder, and system
JP4863519B2 (en) Decoding device, decoding method, decoding program, receiving device, and communication system
CN112994704B (en) Decoding early termination method, storage medium and electronic equipment
KR20080078596A (en) Apparatus and method for encoding and decoding
CN114337913A (en) Decoding method, device and decoder
CN116436471A (en) Encoding and decoding method, communication device, and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant