CN116915293A - Construction method based on finite field multiple access codebook and network layer multi-user communication method and device - Google Patents

Construction method based on finite field multiple access codebook and network layer multi-user communication method and device Download PDF

Info

Publication number
CN116915293A
CN116915293A CN202310851921.8A CN202310851921A CN116915293A CN 116915293 A CN116915293 A CN 116915293A CN 202310851921 A CN202310851921 A CN 202310851921A CN 116915293 A CN116915293 A CN 116915293A
Authority
CN
China
Prior art keywords
codebook
finite field
multiple access
user
orthogonal
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.)
Pending
Application number
CN202310851921.8A
Other languages
Chinese (zh)
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.)
Harbin Institute of Technology
Original Assignee
Harbin Institute of Technology
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 Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN202310851921.8A priority Critical patent/CN116915293A/en
Publication of CN116915293A publication Critical patent/CN116915293A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/16—Code allocation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a construction method based on a finite field multiple access codebook and a network layer multi-user communication method and device, and belongs to the technical field of multiple access in the communication field. The invention aims to solve the problem of resource shortage when the traditional complex domain multiple access technology distinguishes multi-user signals, and further solves the problem of the contradiction between the rapid increase of the number of communication clients in the scene of the Internet of things and the scarcity of complex domain multiple access physical resources. Firstly, selecting a codebook meeting the number of service users from an orthogonal finite field codebook and a non-orthogonal finite field codebook according to the maximum number of active users in a communication system, dividing an addition reversible element pair according to the codebook design, and carrying out finite field mapping on binary information sent by the users according to the addition reversible element pair allocated to the users; in network layer communication, information transmitted by a delay node is a sum pattern, information is received at a target node, and user information is recovered; and mapping from the finite field to the binary field to obtain binary information sent by the user.

Description

Construction method based on finite field multiple access codebook and network layer multi-user communication method and device
Technical Field
The invention belongs to the technical field of multiple access in the communication field, and particularly relates to a construction method based on a finite field multiple access codebook, a network layer multi-user communication method, construction equipment and communication equipment.
Background
Network layer finite field multiple access (Network Finite Field Multiple Access) refers to a technique for resolving packet collisions through network layer topology design. The techniques facilitate multiple devices in a computer network to access and share a communication medium simultaneously. It provides a mechanism to enable multiple devices or users to simultaneously transmit and receive data over a network. Butterfly networks (Butterfly Network) are an emerging form of technology in network layer multiple access. The scheme is structured like a butterfly shape, consisting of multiple levels of switching nodes and links connecting the nodes. Compared to conventional network layer random access techniques such as carrier sense multiple access (Carrier Sense Multiple Access, CSMA), butterfly networks can support larger-scale parallel computing systems and distributed systems, and provide high bandwidth, low latency, and good scalability.
Finite field multiple access (Finite Field Multiple Access) is an algebraic domain codebook construction scheme. The technology aims to solve the problems of scarcity of physical resources and relatively lagging development speed of the existing complex domain multiple access technology. The technology provides higher flexibility and diversity for multi-user transmission by utilizing algebraic virtual resources and a multiple access technology constructed by a finite field.
Compared with the traditional multiple access technology based on frequency domain, time domain, code domain and space domain resources, the finite field multiple access technology supports multi-user use by using algebraic virtual resources, and maps bits output by users to one element of finite field element pairs (Finite Field Element Pair). The output symbols of all users are then mapped together to unique symbols in the same domain for modulation and transmission. In addition, the finite field coding system can be used in combination with classical complex field multiple access termination to provide more multiple access resources.
However, the conventional complex domain multiple access technology has the problem of resource shortage when distinguishing multi-user signals, so that the situation that the number of communication clients in the scene of the Internet of things is increased greatly and the complex domain multiple access physical resources are scarce is caused, and the performance of the Internet of things is limited.
Disclosure of Invention
The invention aims to solve the problem of resource shortage when the traditional complex domain multiple access technology distinguishes multi-user signals, and further solves the problem of the contradiction between the rapid increase of the number of communication clients in the scene of the Internet of things and the scarcity of complex domain multiple access physical resources.
The construction method based on the finite field multiple access codebook is an orthogonal finite field codebook construction method, and the specific construction process comprises the following steps:
setting the number of current active users in a communication system as J, and selecting inequality J.ltoreq.log 2 Prime numbers p in the range of (p-1) to form a finite field GF (p), and dividing unique translatable and additive reversible element pairs in the finite field GF (p) to be randomly distributed to J active users, wherein the unique translatable and additive reversible element pairs are UDAIEP;
in the finite field GF (p) = {0,1, …, p-1} there are obtained J unique pairs of interpretable additive reversible elements, i.e., UDAIEP, denoted as C j = (j, p-j); based on UDAIEP, the sequence of binary domain information bit sequence transmitted by the jth user and mapped onto prime number domain GF (q) is marked as u j I.e. codeword u j The method comprises the steps of carrying out a first treatment on the surface of the Cartesian product operation c=c for UDAIEP of all users 1 ×C 2 ×…×C J An infrastructure constituting a finite field codebook is referred to as a finite field infrastructure codebook, and a codebook corresponding to the infrastructure of the finite field codebook is referred to as a (C) 1 ,C 2 ,...,C J )；
In a finite field codebook (C 1 ,C 2 ,…,C J ) In presence of 2 J A number of codewords, each of which is represented as a sum pattern of the current J active users, recorded asAnd the pattern transmitted by the user (u 1 ,u 2 ,...,u J ) Forming a one-to-one correspondence;
using a finite field infrastructure codebook for multiple access communication;
based on finite field infrastructure codebook, prime number p is expanded into m-order p m Extended finite field p m Is called a finite field spread codebook;
c of UDAIEP codebook allocated to partial users j Replacement by pairs of reversible elements of the reverse order addition, i.e. R-AIEP, denoted C j R The method comprises the steps of carrying out a first treatment on the surface of the The finite field reverse order addition reversible element pair refers to a corresponding element pair obtained by exchanging element mapping relations in UDAIEP; based on the finite field infrastructure codebook or the finite field spread codebook, one or more C's are selected j Replaced by C j R And constructing a finite field reverse order codebook.
The construction method based on the finite field multiple access codebook is a construction method of a non-orthogonal finite field codebook, and the specific construction process comprises the following steps:
setting the number of current active users in a communication system as J, and selecting inequality J.ltoreq.log 2 Prime numbers p in the range of (p-1) to form a finite field GF (p); for each user J in the service range, satisfying 1.ltoreq.j.ltoreq.J, and representing the addition reversible element pair as AIEP;
assuming that the finite field GF (p) serves j= (p-1)/2 users, when p > 3, the AIEP codebook for J users is denoted as { C 1 ＝(1,p-1),C 2 ＝(2,p-2),…,C J = (J, p-J) }; co-existence in codebookCode word, where u q ＝(u 1 ,u 2 ,...,u J ) Marked as C 1 ×C 2 ×...×C J The code word in (a); based on AIEP, multiplexing module G is used M Processing; g M Binary matrix of size t×j:
wherein g 1,1 -g T,J An element that is a binary representation;
according to assumption of 2 +.T < J, the output multiplexing signal v q Expressed as:
v q T ＝G M ·u q T
the generation process of the non-orthogonal finite field codebook is one-to-one mapping, namelyThe mapping coding mode is called a non-orthogonal finite field coding mode, and the obtained codebook is the non-orthogonal finite field codebook.
A network layer multi-user communication method based on a finite field multiple access codebook comprises the following steps:
constructing an orthogonal finite field codebook and/or a non-orthogonal finite field codebook according to the upper limit of the number of active users in a communication system;
constructing an orthogonal finite field codebook by adopting a construction method based on a finite field multiple access codebook for constructing the orthogonal finite field codebook; coding modes of the process of constructing the orthogonal finite field codebook are marked as FFMA, and the corresponding orthogonal finite field codebook is marked as FFMA codebook;
constructing a non-orthogonal finite field codebook by adopting a construction method based on a finite field multiple access codebook for constructing the non-orthogonal finite field codebook; coding modes of a process of constructing the non-orthogonal finite field codebook are marked as NO-FFMA, and the corresponding non-orthogonal finite field codebook is marked as NO-FFMA codebook;
step two, FFMA and/or NO-FFMA are deployed in network layer communication, and a butterfly network structure is adopted as a network structure;
FFMA-based network layer communication, in a network layer butterfly structure, user node A 1 ,A 2 ,...,A j Based on the selected UDAIEP, binary bit data transmitted by the user is encoded into codewords of finite field (u 1 ,u 2 ,...,u J ) The method comprises the steps of carrying out a first treatment on the surface of the With (R) 1 ,R' 1 ) Represents a delay node, wherein R 1 Representing a delay node connected to a user node, R' 1 Representing a delay node connected with a target node, wherein the information transmitted by the delay node is a sum pattern in an FFMA codebook；
NO-FFMA based network layer communication, in which, unlike FFMA, there are multiple delay nodes connected to a user node, { (R) 1 ,R' 1 ),(R 2 ,R' 2 ),...,(R T ,R' T ) And represents a delay node, wherein 2.ltoreq.T < J, R t Representing a delay node connected to a user node, R' t Representing a delay node connected to the target node, t=1, 2, … T; in the communication process, the information is transmitted from R t Transfer to R' t And remain the same; delay node R t And R'. t Is composed of multiplexing modulePrescribing;
step three, at the target node D j Based on D j τ and received user information u of an associated delay node j Recovering (u) 1 ,...,u j ) User information; and mapping from the finite field to the binary field to obtain binary information sent by the user.
A computer storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement a finite field multiple access codebook-based construction method for constructing an orthogonal finite field codebook.
A finite field multiple access codebook-based construction apparatus comprising a processor and a memory having stored therein at least one instruction loaded and executed by the processor to implement a finite field multiple access codebook-based construction method for constructing an orthogonal finite field codebook.
A computer storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement a finite field multiple access codebook-based construction method for constructing a non-orthogonal finite field codebook.
A finite field multiple access codebook-based construction apparatus comprising a processor and a memory having stored therein at least one instruction loaded and executed by the processor to implement a finite field multiple access codebook-based construction method for constructing a non-orthogonal finite field codebook.
A computer storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement the finite field multiple access codebook-based network layer multi-user communication method.
A finite field multiple access codebook-based network layer multi-user communication device, the device comprising a processor and a memory, the memory having stored therein at least one instruction that is loaded and executed by the processor to implement the finite field multiple access codebook-based network layer multi-user communication method.
The beneficial effects are that:
the finite field multiple access codebook designed by the invention can improve the efficiency and quality of the existing wireless communication and increase the capacity of the wireless communication. The use of virtual resources rather than physical resources for processing provides greater flexibility and diversity than Complex-domain multiple access (CFMA) methods, which can be combined with Complex multiple access to cope with diverse communication needs.
Compared with a network layer butterfly multiple access system, the network layer multiple access technology based on the finite field codebook provided by the invention realizes the capability of multiple users to access the network at the same time, thereby improving the multiplexing efficiency of the network. In addition, the technology can also reduce the requirement of channel estimation and the difficulty of multi-user detection, thereby reducing the implementation cost and complexity.
The invention not only can effectively solve the problem of resource shortage when the traditional complex domain multiple access technology distinguishes multi-user signals, but also can solve the problem of contradiction between the rapid increase of the number of communication clients in the scene of the Internet of things and the scarcity of complex domain multiple access physical resources by utilizing the algebraic virtual resource unique decodable cost, thereby realizing higher bandwidth efficiency and accommodating more users.
Drawings
FIG. 1 assigns two sets of uniquely translatable additive invertible element pairs in a codebook for two active users.
FIG. 2 assigns unique pairs of interpretable additive invertible elements, each of which is different for two active users.
Fig. 3 is a diagram of a codebook for allocating two users to a group of element pairs having the same positive codebook and inverse codebook components.
Fig. 4 is C (1) = { C 1 ,C 2 ,C 4 ,C 8 Non-orthogonal finite field codebook construction and allocation schematics.
Fig. 5 is C (2) = { C 3 ,C 5 ,C 6 ,C 7 Non-orthogonal finite field codebook construction and allocation schematics.
Fig. 6 is a schematic diagram of an application of a finite field multiple access codebook based on a conventional butterfly network in network layer communication.
Fig. 7 is a schematic diagram of an application of a finite field multiple access codebook based on a three-dimensional butterfly network in network layer communication.
Fig. 8 is a finite field encoding structure applied in fig. 7.
Detailed Description
The invention provides a network layer multi-user communication method based on a finite field multiple access codebook, which mainly comprises the following steps:
1. the invention provides a new scheme for finite field codebook design, which comprises an inverse sequence codebook of an orthogonal finite field and a non-orthogonal finite field codebook. Compared with the infrastructure of the finite field codebook, the method optimizes the number of service users and can support more communication users.
2. Compared with a butterfly network structure, the method and the device can accommodate more users to communicate simultaneously, and improve the capacity of the system. Secondly, the network layer structure based on the finite field codebook is applied to a distributed system, and all user data can be recovered at a single destination node. In addition, physical layer resources are saved by utilizing the communication of the finite field codebook, and because the user uses different addition reversible elements to map the sent binary information, the user communicating with the destination node cannot collide to cause information loss, thereby improving the concurrency of the network layer.
The following description is made with reference to specific embodiments, and prior to the description, the definitions of symbols used in the invention will be described first: j represents an imaginary unit, upper corner marks T and H represent transpose and conjugate transpose respectively,and->Representing a complex domain and an integer domain, respectively, +.>Representing the mean value operation, by h represents the Hadamard product, and vec represents the vectorization of the matrix, i.e., the matrix is arranged in columns from left to right into a vector.
The first embodiment is as follows:
the embodiment is a network layer multi-user communication method based on a finite field multiple access codebook, comprising the following steps:
constructing a finite field multiple access codebook, wherein the finite field multiple access codebook comprises an orthogonal finite field codebook and a non-orthogonal finite field codebook.
The structure of the orthogonal finite field codebook comprises a basic structure, an extended field structure and an inverse sequence codebook structure, and the specific construction process comprises the following steps:
assuming the number of currently active users J, selecting the inequality J.ltoreq.log 2 Prime numbers p in the range of (p-1) form a finite field GF (p). For each user J in the service range, J is more than or equal to 1 and less than or equal to J, and the addition reversible element pair can be obtained through finite field addition operation and is marked as e j = (j, p-j), the reversible element pair is AIEP (additive inverse element pair). In the multiple access scenario, the user may interact with the communication base station at the same time, in which case, using AIEP as the user of the coding scheme may fail in communication due to collision.
In order for users within the communication capacity to ensure communication with the base station at any time, we need to be inThe unique translatable and invertible element pairs, UDAIEP (unique decodable additive inverse element pair), are divided in the finite field GF (p) and randomly allocated to J active users, the UDAIEP being actually a subset of the AIEP. In the finite field GF (p) = {0,1, …, p-1} J unique pairs of interpretable-additive reversible elements, i.e., UDAIEP, are available, denoted as C j = (j, p-j); based on UDAIEP, the sequence of binary domain information bit sequence transmitted by the jth user and mapped onto prime number domain GF (q) is marked as u j I.e. codeword u j . Cartesian product operation c=c for UDAIEP of all users 1 ×C 2 ×…×C J An infrastructure constituting a finite field codebook is referred to as a finite field infrastructure codebook, and a codebook corresponding to the infrastructure of the finite field codebook is referred to as a (C) 1 ,C 2 ,…,C J )。
In a finite field codebook (C 1 ,C 2 ,…,C J ) In presence of 2 J A number of codewords, each of which may be represented as a sum pattern (sum pattern) of the current J active users, recorded as. Since the communication rules of the user are limited by the finite field codebook, all generated sum patterns satisfy the characteristic +.>，u′ j For different u j Sequences over prime fields GF (q). Ideally, under the condition that the receiving end recovers the pattern tau, all information sent by J users can be recovered in a lossless manner, so that the finite field multiple access communication process is completed. And the pattern and the information sequence (u) 1 ,u 2 ,...,u J ) Constitutes a one-to-one correspondence:
multiple access communication using a finite field infrastructure codebook, a limited number of users can be accommodated by the system, andis subject to inequality condition J.ltoreq.log 2 (p-1). In order to widen the number of service users, an extended finite field codebook GF (p m ) To serve the user. In the extended finite field, based on the finite field infrastructure codebook, prime number p is extended to m-order p m Extended finite field p m The codebook of the (C) is called a finite field expansion codebook, the communication capacity is related to the expansion order m of the finite field, users running on different expansion fields are not interfered with each other, and the upper limit of the number of the users is improved as follows:
although the finite field spread codebook improves the user capacity, the spread codebook occupies more physical resources such as time domain, frequency domain, space domain and the like, and reduces the bandwidth efficiency of the system. To more efficiently utilize algebraic domain resources, we allocate part of the user-allocated UDAIEP codebook C j Replacement by pairs of reversible elements of the reverse order addition, i.e. R-AIEP, denoted C j R . The finite field reverse order addition reversible element pair refers to a corresponding element pair obtained by exchanging element mapping relations in UDAIEP. Since the binary field to finite field mapping contains only two element mappings. So for a particular UDAIEP his reverse order addition reversible element pair is unique. Thereby reconstructing a finite field reverse order codebook c=c 1 ×C 2 ×...×C j R ×...×C J FIG. 1 assigns two sets of unique interpretable additive reversible element pairs in a codebook for two active users, FIG. 2 assigns unique interpretable additive reversible element pairs, different for each element, of a positive codebook and an inverse codebook for two active users, where C 1 、C 2 Is UDAIEP in GF (5), C 2 R Is C 2 Is a reversible element pair. Through verification, even though the information sent by the two users in fig. 1 can generate aliasing, the two users can still be distinguished on a finite field, and the two active users in fig. 2 are allocated with unique translatable and additive reversible element pairs with different elements in the positive codebook and the inverse codebook, so that the purpose of distinguishing different users can be achieved.
In the infrastructure C of the finite field codebook, there are 2 J Individual codewords. In order to maintain the unique interpretability of a finite field codebook, the number of users that the codebook supports at most is relatively limited.
Over the finite field GF (p), a coexistence existsAIEP element pairs, log 2 The (p-1) AIEP element pairs may constitute a unique translatable element pair. For the case of p > 3, there is a total of +.>The pairs of UDAIEP elements, these candidate UDAIEP elements form the set Θ as follows:
wherein the set Θ represents the set of all allocatable UDAIEPs over the current finite field GF (p);indicating the total allocatable UDAIEP over the current finite field GF (p).
There is a one-to-one mapping from binary number domain to finite domain, and a one-to-one correspondence of two elements has two relationships. For example, it willFinite field AIEP assignment, defined as positive order, then corresponds to thisThen the reverse order allocation of the AIEP is performed; wherein the subscript of the number in brackets represents the field to which the data belongs, and the number in brackets represents the data, e.g., (0) 2 Representing a binary number field, the data being 0; (2) 5 The 5-digit field representing the finite field, the data is 2. In the same way, the positive and negative sequence of a UDAIEP can be also usedThe order is distributed to two different users, as shown in fig. 3, but this increases the ambiguity of the system, so that we can recover the information sent by two users, but cannot correspond the information to the identity of the user. However, in some communication scenarios, such as Grant-free multiple access, such ambiguity is allowed. Fig. 3 allocates a set of element pairs with the same positive and negative codebook elements to two users, although collision is induced in the coefficient field. However, given that the codebook is used in an unauthorized random multiple access scenario, the identity of the user is in an agnostic state to the detecting terminal and confusion of the scheme can be accepted.
More generally, in the aggregateHas eta therein p Each effective UDAIEP is allocated, and each UDAIEP has two allocation modes of positive sequence and negative sequence, which can effectively promote the capacity of the communication system.
The coding modes of the codebooks are all finite field multiple access codes (FFMA).
The non-orthogonal finite field codebook is constructed based on the finite field orthogonal finite field codebook set, virtual code field resources are fully utilized, and the capacity of the codebook is further improved on the basis.
In order to further improve the accommodability of the finite field codebook, the invention constructs a non-orthogonal finite field codebook. In an orthogonal finite field codebookThe AIEP elements cannot constitute a UDAIEP element pair and cannot be used because they do not have unique interpretability. To fully exploit these element pairs, the present invention proposes non-orthogonal finite field multiple access coding (non-orthogonal FFMA), i.e. NO-FFMA. NO-FFMA through multiplexing Module (multiplexing Module) G M Is designed to implement non-orthogonal finite field multiple access communications.
Assuming that the finite field GF (p) serves j= (p-1)/2 users, when p > 3, the AIEP codebook for J users is denoted as { C 1 ＝(1,p-1),C 2 ＝(2,p-2),...,C J = (J, p-J) }. Identical to an orthogonal finite field codebook, the codebook is co-existing inCode word, where u q ＝(u 1 ,u 2 ,...,u J ) Marked as C 1 ×C 2 ×...×C J Is a codeword of (b). Based on AIEP, multiplexing module G is used M And (5) processing. G M Binary matrix of size T X J, denoted +.>
Wherein g 1,1 -g T,J As an element in the binary matrix,representing a binary number field; in the network layer connection, each sum pattern value is stored in a relay node, and elements in the multiplexing matrix represent the connection relationship between the nodes, e.g. g in the multiplexing module t,j =1, representing relay node R t With user node a j Is connected with R' t With the target node D j Are connected; the T (1. Ltoreq.t) row of the multiplexing module also represents the users involved in the sum pattern calculation, and the J (1. Ltoreq.j) column of the multiplexing module represents the sum pattern value associated with user J. In the multiplexing module, each sum pattern value processes a fixed amount of user data, the amount being determined by a non-orthogonal finite field codebook.
According to the assumption that T is less than or equal to 2 and less than J, the output multiplexing signal v q Expressed as:
v q T ＝G M ·u q T
the generation process of the non-orthogonal finite field codebook is one-to-one mapping, namelyThis mapping coding scheme is called a non-orthogonal finite field coding scheme, i.e., NO-FFMA, and thus can constitute a block with a capacity J.ltoreq.T.log 2 And in the NO-FFMA system of p, the codebook obtained by utilizing the NO-FFMA is the non-orthogonal finite field codebook.
The bandwidth efficiency of a communication system using a non-orthogonal finite field codebook is:
although the bandwidth efficiency of the non-orthogonal finite field codebook takes the orthogonal finite field codebook as the upper limit, the design scheme successfully improves the number of users of the service to the maximumAnd each.
Multiplexing module G M Is based on the allocation of orthogonal finite field codebooks. As shown in fig. 4-5, there are multiple sets of orthogonal finite field codebooks in GF (17). Fig. 4 and 5 are two codebook designs, denoted as C (1) and C (2), where { C (1) = { C 1 ,C 2 ,C 4 ,C 8 }，C(2)＝{C 3 ,C 5 ,C 6 ,C 7 }}。
Two codebooks are randomly assigned to two different groups of users by multiplexing the module matrices as follows. Because the upper limit of the service of each group of orthogonal finite field codebook is 4 users, the multiplexing module needs to provide a multiplexing mode of 2 groups of users and 4 persons in each group. The matrix is as follows:
similarly, multiplexing module G M Is based on a random allocation of the current number of orthogonal finite field codebooks T and the active user upper limit J for each codebook. According to G M The multiplexing module can obtain the result after the non-orthogonal finite field coding:
fig. 4-5 present non-orthogonal finite field coding schemes based on unique interpretable rules for more user cases than basic finite field coding schemes, which can save bandwidth more effectively. As shown in the figure, the coding scheme is given for at most 8 active users. Active users are divided into two groups of 4 users, and the users are allocated in two groups to form a non-orthogonal relationship with each other.
In summary, in the case of determining the number of active users, we select, in combination with the physical resources of the communication system, the finite field codebook required for generating from different types of non-orthogonal finite field codebooks and orthogonal finite field codebooks.
Deploying finite field multiple access coding (FFMA) and non-orthogonal finite field coding (NO-FFMA) in network layer communication, the network layer application of FFMA and NO-FFMA can also optimize butterfly network structure:
as shown in fig. 6, in the network layer butterfly structure, S represents a signal source, which determines an upper limit of active users in the FFMA codebook, and provides an initial parameter J for the FFMA codebook design. A is a user transmitting node representing the concept of active users in the FFMA codebook. D is a target node, and information sent by a user can be recovered at a receiving end based on FFMA and the pattern. (R) 1 ,R' 1 ) Represents a delay node, wherein R 1 Representing a delay node connected to a user node, R' 1 Representing a delay node connected with a target node, wherein the delay node is a difference between a butterfly network structure and a general network layer structure, and the information transmitted by the node is a sum pattern in an FFMA codebook。R 1 The presence of nodes is network layer multicast and user data forwardError correction provides the possibility.
In FFMA-based network layer communications, user node A 1 ,A 2 ,...,A j Based on the selected UDAIEP, binary bit data transmitted by the user is encoded into a finite field codeword (u 1 ,u 2 ,...,u J ). Next, all finite field codewords (u 1 ,u 2 ,...,u J ) Do sum operationAnd stores the encoded sum pattern τ at delay node R.
Similarly, in the network layer node deployment of NO-FFMA, there are also a signal source S, a user node a, a target node D, and a delay node R (i.e., a relay node), as shown in fig. 7, unlike the FFMA deployment mode, where the NO-FFMA structure has a plurality of delay nodes connected to the user node, { (R) 1 ,R' 1 ),(R 2 ,R' 2 ),...,(R T ,R' T ) And represents a delay node, wherein 2.ltoreq.T < J, R t (t=1, 2, … T) represents a delay node connected to the user node, R' t Representing a delay node connected to the target node. In the communication process, the information is transmitted from R t Transfer to R' t And remain the same. Delay node R t To the user node, R' t The target node is connected with the target node corresponding to the user node; delay node R t And R'. t Connection rule of connection relation is formed by multiplexing moduleAnd (5) prescribing.
Fig. 6-7 illustrate the use of finite field multiple access codebooks in network layer communications. Fig. 6 is a conventional butterfly network coding scheme, which is a two-dimensional structure, and supports communication requirements of different active users through delay nodes. Fig. 7 is a three-dimensional butterfly network employing a non-orthogonal finite field multiple access codebook that accommodates more active users and provides higher bandwidth efficiency than conventional butterfly network schemes.
Step three, at the targetNode D j Based on D j Associated delay node R finite field algebraic sum τ and received user information u j . Can be perfectly recovered from the above information (u 1 ,...,u j ) User information. Through finite field to binary field mapping F q2B And obtaining binary information sent by the user.
At the target node D j FFMA and NO-FFMA are identical. At the target node D j Where τ and u received by the node are combined by querying the FFMA or NO-FFMA codebook j Since the codebook design has unique interpretability, all user information sent by the information source S can be obtained at a single network communication node. At the target node, a hash check sequence is generated according to the received data, and the correctness and the integrity of the received data can be checked based on the principle of the law of large numbers by comparing the check sequences of different target nodes. Therefore, compared with the traditional network layer communication, the method improves reliability and has important application value in a distributed storage system.
NO-FFMA query tables based on GF (17) are shown in FIGS. 4-5. And applying the finite field codebook to a network layer, and performing node deployment to obtain the finite field codebook. With destination node number 1D 1 For example, D 1 Receiving u 1 ＝(1) 7 And τ=0. Fig. 8 represents the finite field encoding structure applied in fig. 7 by means of a sum pattern table as shown in fig. 8. Discovery (u) 1 ,u 2 ,u 3 )＝(1,2,4) 7 Sum (u) 1 ,u 2 ,u 3 )＝(6,5,3) 7 The sum pattern τ=0. Will u j Is regarded as (1) 7 It can be known that (u) 1 ,u 2 ,u 3 )＝(1,2,4) 7 The 3-bit message thus transmitted is (0, 1) 2 . It should be noted that although the algebraic sum of the two finite field codes is the same in fig. 8, since the algebraic sums are distributed in different user groups, the confusing variables can be distinguished and decoded by combining the messages of the user receiving ends.
The network layer multiple access technology based on the finite field code multiple access codebook combines the topological structure of the butterfly network to achieve the performance superior to that of the butterfly network. The traditional two-dimensional butterfly network topology structure is expanded to higher dimensionality (three-dimensional and above) through orthogonal/finite field codebook design on the basis of the butterfly topology structure. The establishment of the high-dimensional butterfly network brings more excellent performance to the system. On one hand, the hierarchical structure in the network layer is enriched, so that the switching nodes in each hierarchy form more link connections, the data of different user nodes realize cross verification, and the error correction capability of the transmitted information is improved. On the other hand, the expandability of the butterfly network is increased, more users can be served by a higher network dimension, and in the face of a complex network routing scene, switching nodes and links can be added in a limited-domain multiple access codebook in a targeted manner, so that the higher expandability is realized.
The invention is suitable for constructing a large-scale parallel computing system and a distributed system. Aiming at the scenes of communication of the Internet of things, distributed big data training and the like, the invention can reduce the retransmission probability and the communication delay. Meanwhile, aiming at the future complex and diversified communication demands, the invention has good expandability, and better system fusion and overall optimization are realized aiming at the communication links and channel states with different attributes through the distinguishing property of algebraic resources.
In summary, the network layer multiple access technology based on the non-orthogonal finite field multiple access codebook realizes more efficient data transmission, collision avoidance, error correction and decoding by selecting a proper finite field, mapping and utilizing a butterfly network structure and a decoding table, thereby improving the performance and reliability of the network. The technology has great significance for constructing a large-scale parallel computing system and a distributed system, can reduce retransmission probability and communication delay, has good expandability, adapts to complex and diverse communication requirements in the future, and realizes system fusion and overall optimization.
The second embodiment is as follows:
the present embodiment is a computer storage medium having at least one instruction stored therein, the at least one instruction being loaded and executed by a processor to implement the finite field multiple access codebook-based construction method.
The instruction for implementing the construction method based on the finite field multiple access codebook can be an instruction for separately implementing the construction method of the orthogonal finite field codebook, can be an instruction for separately implementing the construction method of the non-orthogonal finite field codebook, and can be an instruction for implementing both the construction method of the orthogonal finite field codebook and the construction method of the non-orthogonal finite field codebook.
It should be understood that the instructions comprise a computer program product, software, or computerized method corresponding to any of the methods described herein; the instructions may be used to program a computer system, or other electronic device. Computer storage media may include readable media having instructions stored thereon and may include, but is not limited to, magnetic storage media, optical storage media; magneto-optical storage media include read-only memory ROM, random-access memory RAM, erasable programmable memory (e.g., EPROM and EEPROM), and flash memory layers, or other types of media suitable for storing electronic instructions.
And a third specific embodiment:
the present embodiment is a finite field multiple access codebook-based construction device, which includes a processor and a memory, and it should be understood that any device including a processor and a memory described in the present invention may include other units, modules for performing display, interaction, processing, control, etc. and other functions through signals or instructions;
at least one instruction is stored in the memory, and the at least one instruction is loaded and executed by the processor to implement the finite field multiple access codebook-based construction method.
The instruction for implementing the construction method based on the finite field multiple access codebook can be an instruction for separately implementing the construction method of the orthogonal finite field codebook, can be an instruction for separately implementing the construction method of the non-orthogonal finite field codebook, and can be an instruction for implementing both the construction method of the orthogonal finite field codebook and the construction method of the non-orthogonal finite field codebook.
The specific embodiment IV is as follows:
the embodiment is a computer storage medium having at least one instruction stored therein, the at least one instruction being loaded and executed by a processor to implement the network layer multi-user communication method based on a finite field multiple access codebook.
It should be understood that the instructions comprise a computer program product, software, or computerized method corresponding to any of the methods described herein; the instructions may be used to program a computer system, or other electronic device. Computer storage media may include readable media having instructions stored thereon and may include, but is not limited to, magnetic storage media, optical storage media; magneto-optical storage media include read-only memory ROM, random-access memory RAM, erasable programmable memory (e.g., EPROM and EEPROM), and flash memory layers, or other types of media suitable for storing electronic instructions.
Fifth embodiment:
the present embodiment is a network layer multi-user communication device based on a finite field multiple access codebook, where the device includes a processor and a memory, and it should be understood that any device including a processor and a memory described in the present invention may include other units, modules that perform display, interaction, processing, control, and other functions through signals or instructions;
the memory stores at least one instruction that is loaded and executed by the processor to implement the network layer multi-user communication method based on the finite field multiple access codebook.
The above examples of the present invention are only for describing the calculation model and calculation flow of the present invention in detail, and are not limiting of the embodiments of the present invention. Other variations and modifications of the above description will be apparent to those of ordinary skill in the art, and it is not intended to be exhaustive of all embodiments, all of which are within the scope of the invention.

Claims (10)

1. The construction method based on the finite field multiple access codebook is characterized in that the construction method is an orthogonal finite field codebook construction method, and the specific construction process comprises the following steps:
setting the number of current active users in a communication system as J, and selecting inequality J.ltoreq.log 2 Prime numbers p in the range of (p-1) to form a finite field GF (p), and dividing unique translatable and additive reversible element pairs in the finite field GF (p) to be randomly distributed to J active users, wherein the unique translatable and additive reversible element pairs are UDAIEP;
in the finite field GF (p) = {0,1, …, p-1} there are obtained J unique pairs of interpretable additive reversible elements, i.e., UDAIEP, denoted as C j = (j, p-j); based on UDAIEP, the sequence of binary domain information bit sequence transmitted by the jth user and mapped onto prime number domain GF (q) is marked as u j I.e. codeword u j The method comprises the steps of carrying out a first treatment on the surface of the Cartesian product operation c=c for UDAIEP of all users 1 ×C 2 ×…×C J An infrastructure constituting a finite field codebook is referred to as a finite field infrastructure codebook, and a codebook corresponding to the infrastructure of the finite field codebook is referred to as a (C) 1 ,C 2 ,...,C J )；
In a finite field codebook (C 1 ,C 2 ,...,C J ) In presence of 2 J A number of codewords, each of which is represented as a sum pattern of the current J active users, recorded asAnd the pattern transmitted by the user (u 1 ,u 2 ,...,u J ) Forming a one-to-one correspondence;
using a finite field infrastructure codebook for multiple access communication;
based on finite field infrastructure codebook, prime number p is expanded into m-order p m Extended finite field p m Is called a finite field spread codebook;
c of UDAIEP codebook allocated to partial users j Replacement by pairs of reversible elements of the reverse order addition, i.e. R-AIEP, denoted C j R The method comprises the steps of carrying out a first treatment on the surface of the The finite field reverse order addition reversible element pair refers to a corresponding element pair obtained by exchanging element mapping relations in UDAIEP; based on the finite field infrastructure codebook or finite field spreading codebook,one or more C j Replaced by C j R And constructing a finite field reverse order codebook.
2. The construction method based on the finite field multiple access codebook is characterized in that the construction method is a construction method of a non-orthogonal finite field codebook, and the specific construction process comprises the following steps:
setting the number of current active users in a communication system as J, and selecting inequality J.ltoreq.log 2 Prime numbers p in the range of (p-1) to form a finite field GF (p); for each user J in the service range, satisfying 1.ltoreq.j.ltoreq.J, and representing the addition reversible element pair as AIEP;
assuming that the finite field GF (p) serves j= (p-1)/2 users, when p > 3, the AIEP codebook for J users is denoted as { C 1 ＝(1,p-1),C 2 ＝(2,p-2),…,C J = (J, p-J) }; co-existence in codebookCode word, where u q ＝(u 1 ,u 2 ,...,u J ) Marked as C 1 ×C 2 ×…×C J The code word in (a); based on AIEP, multiplexing module G is used M Processing; g M Binary matrix of size t×j:
wherein g 1,1 -g T,J An element that is a binary representation;
according to the assumption that T is less than or equal to 2 and less than J, the output multiplexing signal v q Expressed as:
v q T ＝G M ·u q T
the generation process of the non-orthogonal finite field codebook is one-to-one mapping, namelyThis is then put into effectThe mapping coding mode is called a non-orthogonal finite field coding mode, and the obtained codebook is the non-orthogonal finite field codebook.
3. The method for constructing a finite field multiple access codebook based on claim 2, wherein the communication system bandwidth efficiency using the non-orthogonal finite field codebook is
4. The network layer multi-user communication method based on the finite field multiple access codebook is characterized by comprising the following steps:
constructing an orthogonal finite field codebook and/or a non-orthogonal finite field codebook according to the upper limit of the number of active users in a communication system;
constructing an orthogonal finite field codebook by adopting the finite field multiple access codebook-based construction method as claimed in claim 1; coding modes of the process of constructing the orthogonal finite field codebook are marked as FFMA, and the corresponding orthogonal finite field codebook is marked as FFMA codebook;
constructing a non-orthogonal finite field codebook by adopting the finite field multiple access codebook-based construction method as set forth in claim 2 or 3; coding modes of a process of constructing the non-orthogonal finite field codebook are marked as NO-FFMA, and the corresponding non-orthogonal finite field codebook is marked as NO-FFMA codebook;
step two, FFMA and/or NO-FFMA are deployed in network layer communication, and a butterfly network structure is adopted as a network structure;
FFMA-based network layer communication, in a network layer butterfly structure, user node A 1 ,A 2 ,...,A j Based on the selected UDAIEP, binary bit data transmitted by the user is encoded into codewords of finite field (u 1 ,u 2 ,...,u J ) The method comprises the steps of carrying out a first treatment on the surface of the With (R) 1 ,R' 1 ) Represents a delay node, wherein R 1 Representing a delay node connected to a user node, R' 1 Representing a delay node connected with a target node, wherein the information transmitted by the delay node is in an FFMA codebookAnd a pattern of (2);
NO-FFMA based network layer communication, in which, unlike FFMA, there are multiple delay nodes connected to a user node, { (R) 1 ,R' 1 ),(R 2 ,R' 2 ),...,(R T ,R' T ) And represents a delay node, wherein 2.ltoreq.T < J, R t Representing a delay node connected to a user node, R' t Representing a delay node connected to the target node, t=1, 2, … T; in the communication process, the information is transmitted from R t Transfer to R' t And remain the same; delay node R t And R'. t Is composed of multiplexing modulePrescribing;
step three, at the target node D j Based on D j τ and received user information u of an associated delay node j Recovering (u) 1 ,...,u j ) User information; and mapping from the finite field to the binary field to obtain binary information sent by the user.
5. A computer storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement the finite field multiple access codebook-based construction method of claim 1.
6. A finite field multiple access codebook-based construction apparatus, characterized in that it comprises a processor and a memory, in which at least one instruction is stored, which is loaded and executed by the processor to implement the finite field multiple access codebook-based construction method according to claim 1.
7. A computer storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement the finite field multiple access codebook-based construction method of claim 2 or 3.
8. A finite field multiple access codebook-based construction device, characterized in that it comprises a processor and a memory, in which at least one instruction is stored, which is loaded and executed by the processor to implement the finite field multiple access codebook-based construction method according to claim 2 or 3.
9. A computer storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement the finite field multiple access codebook-based network layer multi-user communication method of claim 4.
10. A finite field multiple access codebook-based network layer multi-user communication device, characterized in that it comprises a processor and a memory, in which at least one instruction is stored, which is loaded and executed by the processor to implement the finite field multiple access codebook-based network layer multi-user communication method according to any one of claims 4.
CN202310851921.8A 2023-07-12 2023-07-12 Construction method based on finite field multiple access codebook and network layer multi-user communication method and device Pending CN116915293A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310851921.8A CN116915293A (en) 2023-07-12 2023-07-12 Construction method based on finite field multiple access codebook and network layer multi-user communication method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310851921.8A CN116915293A (en) 2023-07-12 2023-07-12 Construction method based on finite field multiple access codebook and network layer multi-user communication method and device

Publications (1)

Publication Number Publication Date
CN116915293A true CN116915293A (en) 2023-10-20

Family

ID=88359639

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310851921.8A Pending CN116915293A (en) 2023-07-12 2023-07-12 Construction method based on finite field multiple access codebook and network layer multi-user communication method and device

Country Status (1)

Country Link
CN (1) CN116915293A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117272354A (en) * 2023-11-22 2023-12-22 四川互慧软件有限公司 Information docking and traceable system applied to emergency treatment first-aid process

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117272354A (en) * 2023-11-22 2023-12-22 四川互慧软件有限公司 Information docking and traceable system applied to emergency treatment first-aid process
CN117272354B (en) * 2023-11-22 2024-02-06 四川互慧软件有限公司 Information docking and traceable system applied to emergency treatment first-aid process

Similar Documents

Publication Publication Date Title
CN107425947B (en) Method and device for mapping reference signals and multiple access resources
US10790926B2 (en) Data processing method, network device, and terminal
CN105978655B (en) A kind of parcel data transmission method in wireless network and system
CN116915293A (en) Construction method based on finite field multiple access codebook and network layer multi-user communication method and device
CN113114410A (en) Data processing method, configuration method and communication equipment
CN108770054B (en) SCMA resource dynamic optimization allocation method
CN106998308B (en) Code hopping transmission method in sparse code multiple access based on time-varying codebook
CN106209302B (en) Data transmission processing method and device
Cai et al. Topology-transparent time division multiple access broadcast scheduling in multihop packet radio networks
CN108848482A (en) Resource allocation methods based on mMTC layer-specific access frame
Su et al. Survivable virtual network link protection method based on network coding and protection circuit
CN102196574B (en) The indicating means of Resources allocation and base station
Wang et al. Optimal design of linear network coding for information theoretically secure unicast
Elsaraf et al. Performance analysis of code-domain NOMA in 5G communication systems
CN101741512B (en) Coding method and device
Chuang et al. Efficient multicast delivery for data redundancy minimization over wireless data centers
CN109257145B (en) RLNC (recursive least squares) -assisted D2D cooperative transmission process optimization method and device
CN114844754A (en) Large-scale terminal multiple access method based on grouping sequence codebook set
Shukla et al. Wireless network-coded four-way relaying using Latin Hyper-Cubes
Xu et al. Cache-aided interference management in partially connected linear networks
Guo et al. A cross-layer optimization framework for index-coded NOMA in cache-aided F-RANs
Pan et al. Spatial modulation aided cooperative NOMA: Implementation and achievable rate analysis
CN118118410B (en) Multipath transmission method, related device and medium
CN115361682B (en) Underwater wireless sensor network key pre-allocation method
Umar et al. Multiple relay‐based Reed–Muller network‐coded cooperation for wireless 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