CN114785451B - Method, device and storage medium for receiving uplink image division multiple access transmission - Google Patents
Method, device and storage medium for receiving uplink image division multiple access transmission Download PDFInfo
- Publication number
- CN114785451B CN114785451B CN202110088436.0A CN202110088436A CN114785451B CN 114785451 B CN114785451 B CN 114785451B CN 202110088436 A CN202110088436 A CN 202110088436A CN 114785451 B CN114785451 B CN 114785451B
- Authority
- CN
- China
- Prior art keywords
- tanner graph
- user
- nodes
- multiple access
- access transmission
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000005540 biological transmission Effects 0.000 title claims abstract description 37
- 239000011159 matrix material Substances 0.000 claims abstract description 42
- 238000001514 detection method Methods 0.000 claims abstract description 12
- 238000003709 image segmentation Methods 0.000 claims description 17
- 238000012804 iterative process Methods 0.000 claims description 2
- 238000004590 computer program Methods 0.000 claims 2
- 238000005259 measurement Methods 0.000 abstract 1
- 229920002939 poly(N,N-dimethylacrylamides) Polymers 0.000 description 16
- 238000004364 calculation method Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 239000004973 liquid crystal related substance Substances 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 239000013598 vector Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 239000000654 additive Substances 0.000 description 1
- 230000000996 additive effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Artificial Intelligence (AREA)
- Error Detection And Correction (AREA)
Abstract
A receiving method of uplink image division multiple access transmission converts an uplink image division multiple access transmission coding image matrix into a first tanner graph, respectively constructs a corresponding second tanner graph for each user node in the first tanner graph according to a low-density parity check code check matrix, links 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 to form an extended tanner graph, and uses belief propagation iterative detection decoding to carry out multi-user data decoding with a preset maximum iteration number by taking a log likelihood ratio as an information measurement value. The application also provides a device for realizing the receiving method of the uplink image division multiple access transmission and a computer readable storage medium. The application can effectively receive and process multi-user data.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and apparatus for receiving uplink image division multiple access transmission, and a storage medium.
Background
The image division multiple access (Pattern Division Multiple Access) is a non-orthogonal multiple access technology, 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 mass connection requirement of the mobile communication for the internet of things in the future, how to improve the performance of the receiving end is a problem to be solved.
Disclosure of Invention
Accordingly, an object of the present application is to provide a method, apparatus and storage medium for receiving uplink image division multiple access transmission, which can detect and decode multi-user signals and improve the performance of a receiving end.
An embodiment of the present application provides a method for receiving uplink image division multiple access transmission, where the method includes: constructing a first tanner graph according to the 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 a low-density parity check code check matrix; linking each user node in the first tanner graph with a plurality of variable nodes in a corresponding second tanner graph through a symbol and 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.
The embodiment of the application also provides a receiving device, which comprises a memory and a processor, wherein the memory is used for storing at least one instruction, and the processor is used for realizing the receiving method of the uplink image division multiple access transmission when executing the at least one instruction.
An embodiment of the present application further provides a storage medium storing at least one instruction, where the at least one instruction, when executed by a processor, implements a method for receiving the uplink image segmentation multiple access transmission.
Compared with the prior art, the method, the device and the storage medium for receiving the uplink image division multiple access transmission can improve the performance of the receiving end on multi-user data detection and decoding.
Drawings
Fig. 1 is a flow chart of uplink image segmentation multiple access transmission according to an embodiment of the present application.
Fig. 2 is an example of an uplink image division multiple access coded image matrix represented by tanner graph according to an embodiment of the present application.
Fig. 3 is an example of a low density parity check code check matrix represented by a tanner graph according to an embodiment of the present application.
Fig. 4 is a flowchart of a method for receiving an uplink image division multiple access transmission according to an embodiment of the present application.
Fig. 5 is an example of an extended tanner graph according to an embodiment of the present application.
Fig. 6 is a schematic diagram of a complete iteration process of belief propagation iterative detection decoding in a receiver method of uplink image segmentation multiple access transmission according to an embodiment of the present application.
Fig. 7 is a flowchart of iterative updating of belief propagation iterative detection decoding in a receiver method of uplink image segmentation multiple access transmission according to an embodiment of the present application.
Fig. 8 is a block diagram of a receiving device for uplink image segmentation multiple access transmission according to an embodiment of the present application.
Description of the main reference signs
The application will be further described in the following detailed description in conjunction with the above-described figures.
Detailed Description
In order to facilitate an understanding and practice of the application by those skilled in the art, it should be understood that the application, as described in further detail below, is capable of numerous specific forms of application and embodiments in conjunction with the drawings. Those skilled in the art may utilize the details of these and other embodiments and other available structures, logical and electrical changes, and may be made without departing from the spirit and scope of the application.
The present description provides various examples to illustrate the features of various embodiments of the present application. The arrangement of the components in the embodiments is for illustration, and is not intended to limit the application. And repetition of the reference numerals in the embodiments is for simplicity of illustration and does not in itself dictate a relationship between the various embodiments. Wherein like reference numerals are used to refer to like or similar components throughout the several views. The illustrations in this specification are in simplified form and are not drawn to precise scale.
Furthermore, in describing some embodiments of the present application, the specification may have presented the method and/or process of the present application as a particular sequence of steps. However, the methods and processes are not necessarily limited to the specific order of steps described, as they may not be performed in accordance with the specific order of steps described. Other sequences are possible embodiments as will be apparent to those skilled in the art. Accordingly, the particular sequence of steps described in the specification is not intended to limit the scope of the claims. Furthermore, the scope of the claimed method and/or program is not limited by the order of the steps performed, and those skilled in the art will appreciate that adjusting the order of the steps performed does not depart from the spirit and scope of the application.
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 application belongs. The terminology used herein in the description of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The term "and/or" as used herein includes any and all combinations of one or more of the associated listed items. Some embodiments of the present application are described in detail below with reference to the accompanying drawings.
Referring to fig. 1, a flow chart of a multi-user uplink image segmentation multiple access transmission according to an embodiment of the application is shown. As shown in fig. 1, there are k users (shown as user 1 to user k in the drawing) at the transmitting end, and the uplink transmission data bit stream of each user is first subjected to channel coding (111, 121). In this example, a low density parity check (Low Density Parity Check, LDPC) code is used as the channel code. 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 passed to modulators (112, 122), and constellation mapped data modulation symbols are passed to image division multiple access (Pattern Division Multipl)e Access, PDMA) codes (113, 123), coded modulation using PDMA image vectors, mapping the PDMA image vector modulation symbols to one or more transport layers (layers) via PDMA mapping (114, 124), and finally generating orthogonal frequency division multiplexing (Orthogonal Frequency-division Multiplexing, OFDM) symbols (115, 125) for each antenna port. In this embodiment, the PDMA image vector passes through the binary coded image matrix G [N,K] Definition, where N represents the total number of resource units and K represents the total number of users, then the relationship between the uplink PDMA receiver signal and the sender signal may be expressed as y=g [N,K] x+n, where n represents the uplink received additive noise.
In the present embodiment, a Tanner graph (Tanner graph) is used to describe a PDMA encoded image matrix, where UND (User Node) is used to represent user nodes, corresponding to matrix G [N,K] CND (Channel Node) are used to represent channel nodes, corresponding to matrix G [N,K] Each row of matrix G [N,K] There is an edge (or "online") between the UND and the CND corresponding to all non-zero elements in (a) the list. As shown in fig. 2, the 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 may be described by a Tanner graph 202.
While 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 a Variable Node (Variable Node) corresponds to each column of the Check matrix H, a Check Node (Check Node) corresponds to each row of the Check matrix H, and an edge (or called an online) exists 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 codewords of 4 check bits can be described by a Tanner graph 302.
Referring to fig. 4, a flowchart of a method for receiving an uplink image segmentation multiple access transmission according to an embodiment of the application is shown. As shown in fig. 4, the receiving method specifically includes the following steps, the order of the steps in the flowchart may be changed according to different requirements, and some steps may be omitted.
Step S402, constructing a first Tanner graph according to the PDMA coding 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 coding image matrix, each channel node corresponds to each row of the PDMA coding image matrix, and an edge exists between the user nodes and the channel nodes corresponding to all non-zero elements in the PDMA coding image matrix.
Step S404, respectively constructing a corresponding second Tanner graph 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 nodes and the check nodes 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 via a symbol and bit mapper, so as to form an extended Tanner graph.
Taking the PDMA encoded image matrix G [6,4] and the (6, 4) LDPC code as an example, as shown in FIG. 5, a first Tanner graph 501 is constructed according to the PDMA encoded image matrix G [6,4], a plurality of second Tanner graphs 502 are constructed according to the (6, 4) LDPC code check matrix, each user node in the first Tanner graph 501 and a plurality of variable nodes in the second Tanner graph 502 are linked through symbols and a bit mapper 503, and an extended Tanner graph 500 is formed.
In step S408, performing multi-user data decoding with a preset maximum iteration number on the extended Tanner graph by using belief propagation iterative detection decoding (Belief Propagation-Iterative Detection and Decoding, BP-IDD), wherein a Log-likelihood Ratio (Log-likelihood Ratio) is used as an information metric value.
In a specific embodiment, each iteration process of the BP-IDD includes an iteration update of the first Tanner graph and an iteration update of a second Tanner graph corresponding to all user nodes in the first Tanner graph, where LLR information output by each iteration update of the first Tanner graph is transmitted to a variable node in the corresponding second Tanner graph through the symbol and bit mapper, and is used as prior information for performing iteration update of the corresponding second Tanner graph; and transmitting LLR information output by each iteration update of the first corresponding two Tanner graphs to a corresponding user node in the first Tanner graph through the symbol and bit mapper, and taking the LLR information as prior information for the next iteration update of the first Tanner graph.
In a specific embodiment, the receiving method further comprises judging whether any user decoding is successful 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 decoded successful user in the first Tanner graph.
In a specific embodiment, the simplifying and expanding Tanner graph includes deleting user nodes, symbol and bit mappers and a second Tanner graph corresponding to decoded successful users, and deleting edges connected between the deleted nodes.
In a specific embodiment, the updating the received data of all the channel nodes linked with the decoded successful user in the first Tanner graph includes removing the data of the decoded successful user from the received data of all the channel nodes linked with the corresponding user node to remove the interference of the decoded successful user data.
Referring to fig. 6, a schematic diagram of a process for expanding a Tanner graph to perform a complete iteration according to an embodiment of the present application is shown. As shown, the LLR information transfer direction in a complete iteration is from (1) to (8), as described in detail below.
In fig. 6, x k Representing user nodes (x in fig. 6 1 、x 2 、x 3 、x 4 、x 5 X is a group 6 )、y j Represents a channel node (y in fig. 6 1 、y 2 、y 3 Y 4 )、c n Representing variable nodes (c in FIG. 6) 1 、c 2 、c n3 、c 4 、c 5 C 6 )、r m Represents a check node (r in FIG. 6 1 、r 2 、r 3 R 4 )。
In the initialization, the preset maximum iteration number is l max And default user node x k To channel node y j The initial LLR (1) in FIG. 6) isWhere s is a modulation symbol corresponding to an arbitrary bit sequence.
In fig. 6 (2), when the first iteration needs to be calculated, the channel node y j To the user node x k LLR information of (2), i.eThe specific calculation formula is as follows:
wherein M is c (j) For and channel node y j Set of all user nodes linked s 0 Is the modulation symbol corresponding to the all-zero bit sequence
In fig. 6 (3), the LLR information transmitted by the user node to the symbol and bit mapper at the first iteration, i.e., L l (x k =s), the specific calculation formula is as follows:
wherein M is v (k) For and user node x k And a set of all channel nodes linked.
In FIG. 6 (4), the LLR information transmitted by the symbol-to-bit mapper to the variable nodes, L, is calculated for the first iteration l (c n ) The specific calculation formula is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,c is n Constellation point set corresponding to =1, +.>C is n Set of constellation points corresponding to =0.
In FIG. 6 (5), the LLR information transmitted by the variable node to the check node at the first iteration is calculated, i.e.
In FIG. 6 (6), the LLR information transmitted by the check node to the variable node at the first iteration is calculated, i.e.The specific calculation formula is as follows:
wherein M is c (m) is the check node r m A collection of all variable nodes linked.
In FIG. 6 (7), the LLR information, L, that the variable node sends to the symbol and bit mapper for the first iteration l (c n ) The specific calculation formula is as follows:
wherein M is v (n) is the node c of the AND variable n And a set of all check nodes linked.
In FIG. 6 (8), the first iteration is calculated from the symbols and bitsLLR information of mapper to user node, i.e. L l (x k =s), the specific calculation formula is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,represents x k LDPC codeword corresponding to =s +.>Represents x k Corresponding LDPC codeword when=0.
The (1) th iteration updates LLR information transmitted from the user node to the channel node (fig. 6 (1)) to be
By (7) in fig. 6, an estimated value of each user received codeword can be obtained as follows
Wherein 1N is less than or equal to N, if the received codeword of the user passes the CRC check, determining that the data decoding of the user is successful, deleting all nodes related to the user from the extended Tanner graph, and updating the received data of all channel nodes linked with the user node corresponding to the user (e.g., y 1 ＝y 1 -x 1 )。
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 iteration number is preset to be l max 。
It should be noted that, when the initial iteration is updated, the LLR information transmitted to the linked channel nodes by all the user nodes is set to zero.
Step S702, determining whether the maximum number of iterations has been exceeded, i.e., l<l max . Ending the flow when judging that the maximum iteration times are exceeded; when it is judged that the maximum number of iterations is not exceeded, step S704 is performed.
Step S704 calculates LLR information transmitted from each user node to the linked one or more channel nodes and transmits the LLR information to the linked one or more channel nodes.
Step S706 calculates LLR information for each channel node to transmit to the linked one or more user nodes and transmits to the linked one or more user nodes.
Step S708 calculates LLR information for each user node to transmit to the concatenated symbol and bit mapper.
In step S710, LLR information transmitted from each symbol-to-bit mapper to the linked plurality of variable nodes is calculated and transmitted to the linked plurality of variable nodes.
Step S712 calculates LLR information for each variable node to the linked one or more check nodes and transmits to the linked one or more check nodes.
In step S714, LLR information transmitted from each check node to the linked variable node or nodes is calculated and transmitted to the linked variable node or nodes.
In step S716, LLR information transmitted from each variable node to the concatenated symbol and bit mapper is calculated and transmitted to the concatenated symbol and bit mapper.
In step S718, it is determined whether all user data are successfully decoded. In one embodiment, whether the user is successfully decoded can be determined by determining whether the user data estimate is correct through redundancy check. Ending the flow when judging that all user data are successfully decoded; when it is determined that decoding of all the user data is successful, step S720 is performed.
Step S720, judging whether at least one user data decoding is successful. When it is determined that the decoding of at least one user data is successful, step S722 is executed; when it is determined that no user data decoding is successful, step S724 is performed.
Step S722, the extended Tanner graph is simplified. Deleting all the associated nodes and edges of the at least one user from the extended Tanner graph, updating the received data of all the channel nodes, and removing the data interference of the user.
In step S724, LLR information transmitted from each symbol-to-bit mapper to the linked user node is calculated and transmitted to the linked user node.
In step S726, the iteration number is increased by one, i.e., l=l+1.
Referring to fig. 8, a block diagram of a receiving device 800 for multi-user uplink image segmentation multiple access transmission according to an embodiment of the application is shown.
The receiving device 800 includes at least one processor 810 and memory 820. The receiving device 800 may also include more or less other hardware or software than shown, or a different arrangement of components.
The receiving method of the multiuser uplink image division multiple access transmission is operated in the receiving device 800. In some embodiments, the memory 820 stores at least one functional module composed of program code segments and executed by the at least one processor 810 to implement a receiving method of multi-user uplink image segmentation multiple access transmission (see fig. 4, 6 and 7 for details).
In some embodiments, the receiving device 800 includes a terminal capable of automatically performing numerical calculation and/or information processing according to a preset or stored instruction, and its 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 used as an example, and other products that may be present in the present application or may be present in the future are also included in the scope of the present application by way of reference.
In some embodiments, the memory 820 is used to store program codes and various data and to enable high-speed, automatic access to programs or data during operation of the receiving device 800. The Memory 820 includes Read-Only Memory (ROM), programmable Read-Only Memory (PROM), erasable programmable Read-Only Memory (EPROM), one-time programmable Read-Only Memory (One-time Programmable Read-Only Memory, OTPROM), electrically erasable rewritable Read-Only Memory (EEPROM), compact disc Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM) or other optical disc Memory, magnetic disk Memory, magnetic tape Memory, or any other storage medium capable of being used for carrying or storing data.
In some embodiments, the at least one processor 810 may be comprised of an integrated circuit, for example, a single packaged integrated circuit, or may be comprised of multiple integrated circuits packaged with the same or different functions, including one or more central processing units (Central Processing unit, CPU), microprocessors, digital processing chips, graphics processors, combinations of various control chips, and the like. The at least one processor 810 is a Control Unit (Control Unit) of the receiving apparatus 800, connects respective components of the entire receiving apparatus 800 using various interfaces and lines, and performs various functions of the receiving apparatus 800 and processes data, for example, performs a function of the receiving apparatus 800 for receiving multi-user data, by running 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 should be understood that the embodiments described are for illustrative purposes only and are not limited to this configuration in the scope of the patent application.
The memory 820 has stored therein program code, and the at least one processor 810 can invoke the program code stored in the memory 820 to perform related functions. For example, the program code of the receiving method flows in fig. 4, 6 and 7 is executed by the at least one processor 810, so as to implement the functions of the respective modules for the purpose of receiving the uplink image division 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 the purpose of receiving uplink image segmentation multiple access transmissions, as shown in fig. 4, 6 and 7.
In summary, the method, the device and the storage medium for receiving the uplink image segmentation multiple access transmission form an extended Tanner graph by combining the Tanner graph of the PDMA coding 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 the iterative 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 solution of the present application and not for limiting the same, and although the present application has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that the technical solution of the present application may be modified or substituted without departing from the spirit and scope of the technical solution of the present application.
Claims (10)
1. A method for receiving uplink image division multiple access transmission, the method comprising:
constructing a first tanner graph according to the 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 a low-density parity check code check matrix;
linking each user node in the first tanner graph with a plurality of variable nodes in a corresponding second tanner graph through a symbol and bit mapper to form an extended tanner graph; the method comprises the steps 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 method of receiving of claim 1, wherein the constructing a first tanner graph from the uplink image segmentation multiple access transmission 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 coded image matrix;
each channel node of the first tanner graph corresponds to each row in the uplink image segmentation multiple access transmission coded image matrix; and
and an edge exists between the user nodes and the channel nodes corresponding to all non-zero elements in the uplink image division 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 the 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 variable nodes and check nodes corresponding to all non-zero elements in the uplink image division multiple access transmission coding image matrix.
4. The method of claim 1, wherein each iteration of the belief propagation iterative detection decoding 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.
5. The receiving method of claim 4, wherein each iterative process of belief propagation iterative detection decoding comprises further comprising:
the log-likelihood ratio information output by each iteration update of the first tanner graph is transmitted to a variable node in a corresponding second tanner graph through the symbol and bit mapper and is used as prior information for carrying out the iteration update of the corresponding second tanner graph; the method comprises the steps of,
and the log-likelihood ratio information output by each iteration update of the corresponding second tanner graph is transmitted to a user node in the first tanner graph through the symbol and bit mapper and is used as prior information for the next iteration update 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 iteration detection decoding is completed, 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 decoded successful user in the first tanner graph.
7. The method of receiving of claim 6, wherein said simplifying said extended tanner graph comprises:
deleting user nodes, symbol and bit mappers and second tanner graphs corresponding to decoded successful users; the method comprises the steps of,
and deleting the edges connected between the deleted nodes.
8. The method of claim 6, wherein updating the received signals of all channel nodes in the first tanner graph linked to the user node corresponding to the decoded successful user comprises:
and removing the data of the decoded successful user from the received data of all channel nodes linked with the corresponding user node.
9. A receiving device comprising a processor, a memory and a computer program stored on the memory and executable on the processor, which when executed by the processor performs the steps of the method of reception of an uplink image segmentation multiple access transmission according to any one of claims 1 to 8.
10. A storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of reception of an uplink image division multiple access transmission according to any one of claims 1 to 8.
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 CN114785451A (en) | 2022-07-22 |
| CN114785451B true 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 (5)
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10530392B2 (en) * | 2017-07-31 | 2020-01-07 | Codelucida, Inc. | Vertical layered finite alphabet iterative decoding |
-
2021
- 2021-01-22 CN CN202110088436.0A patent/CN114785451B/en active Active
Patent Citations (5)
| 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 |
| 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)
| Title |
|---|
| "面向5G的图样分割非正交多址接入（PDMA）关键技术研究";任斌;《中国博士学位论文全文数据库（电子期刊）信息科技辑》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114785451A (en) | 2022-07-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110226289B (en) | Receiver and method for decoding | |
| KR102349209B1 (en) | Systems and methods for multi-stage soft input decoding | |
| US9385753B2 (en) | Systems and methods for bit flipping decoding with reliability inputs | |
| US9831895B2 (en) | System and method for a message passing algorithm | |
| US8209579B2 (en) | Generalized multi-threshold decoder for low-density parity check codes | |
| CN112425103B (en) | Method and system for retransmitting data using systematic polarization encoding | |
| CN109257148B (en) | Polarization code BP decoding method based on Gaussian approximate threshold judgment | |
| US9369152B2 (en) | Systems and methods for decoding with late reliability information | |
| WO2016119105A1 (en) | Polar code generation method and device | |
| KR20110031322A (en) | Reduced complexity ldpc decoder | |
| CN112953569B (en) | Decoding method and device, storage medium, electronic equipment and decoder | |
| US20080005643A1 (en) | Apparatus and method for receiving signal in a communication system | |
| CN112889221B (en) | Offset value determination in a check node processing unit for message passing decoding of non-binary codes | |
| CN114785451B (en) | Method, device and storage medium for receiving uplink image division multiple access transmission | |
| US10341056B2 (en) | Decoding apparatus and method in mobile communication system using non-binary low-density parity-check code | |
| WO2014169041A2 (en) | Systems and methods of channel quality indicator (cqi) selection for non-deterministic receivers | |
| WO2009102012A1 (en) | Decoding device, decoding method, decoding program, reception device, and communication system | |
| US11245421B2 (en) | Check node processing methods and devices with insertion sort | |
| Guo et al. | Design of Physical Layer Coding for Intermittent-Resistant Backscatter Communications Using Polar Codes | |
| KR101496978B1 (en) | Method and apparatus to receive signal in a communication system |
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 |