Satellite internet random access transmission method based on coding compressed sensing

By adopting encoding compression perception technology and non-rule encoding time slot ALOHA system in the satellite Internet, the problems of large signaling overhead and high access delay in traditional access methods are solved, and efficient access and solution of user data is achieved. In a large number of user scenarios.

CN118972978APending Publication Date: 2024-11-15CHINA ACADEMY OF SPACE TECHNOLOGY

Patent Information

Application Number
CN202411032571.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-30
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

The traditional authorization-based multiple access method has problems such as large-scale users' signaling overhead and high access delay when accessing satellite Internet, which cannot meet the efficient access needs of massive users.

Method used

Using a random access transmission method based on encoding compression perception, user data is processed through tree encoding and compressed sensing encoding, and combined with the non-rule encoding time slot ALOHA system, random access and solution of user data is realized, reducing access Delay and signaling overhead.

Benefits of technology

It realizes efficient access to users, reduces the complexity and resource requirements of the system, improves the service efficiency and capacity of the satellite Internet, and is suitable for massive user scenarios.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118972978A_ABST
    Figure CN118972978A_ABST
Patent Text Reader

Abstract

The invention relates to a satellite internet random access transmission method based on coding compressed sensing. The method comprises the following steps: carrying out tree coding and compressed sensing coding on original information of a kth user; bPSK modulation is carried out on the user data after compressed sensing coding, a channel is accessed through a time slot distribution mode based on an irregular coding time slot ALOHA, and a transmitted superposed signal of each sub-block is obtained; and carrying out compressed sensing decoding on the superposed signal on each sub-block at a receiving end to obtain a sub-block list on a corresponding time slot, connecting the sub-blocks in series through tree decoding, and carrying out multi-user data detection to obtain a final resolving result. The problems that when a large number of users access the satellite internet, but only part of users conduct service transmission at the same time, a traditional authorization-based multiple access mode is large in signaling overhead, high in access delay and not suitable any more are solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of multiple access, and relates to a satellite Internet random access transmission method based on coded compressed sensing. Background Art

[0002] In recent years, satellite Internet technology has developed rapidly, with the advantages of low latency, high bandwidth and wide coverage. With the gradual growth of its constellation scale and the increase in the service needs of access users, it is necessary to design an access method suitable for massive user scenarios to ensure the access and solution efficiency of the system. Traditional access methods are mostly authorization modes, which require a special resource allocation method to coordinate the access of users in the system, and multiple handshakes are required during the access process. First, the user needs to select a sequence in the preamble sequence pool to send. After receiving it, the network control node will authorize the uplink resources and package it in a random access response message for broadcast. After the user parses the resource authorization information, it sends a link request in the given resource. If the request is demodulated correctly, a collision resolution confirmation message will be returned, otherwise the access fails.

[0003] In the authorization-based access mode, the user capacity is limited by the size of the preamble pool and the scale of the allocable access resources. When the business demand in the system surges, the overhead of coordinating access users will overwhelm the system. Therefore, it is necessary to study a new satellite Internet multiple access solution suitable for massive users, sporadic access, and short packet communications, so that users can directly access the system to transmit information without authorization, saving the signaling overhead in the authorization mechanism, while reducing access delay and improving service efficiency. Summary of the invention

[0004] The technical problem solved by the present invention is: to overcome the shortcomings of the prior art and propose a satellite Internet random access transmission method based on coded compressed sensing, so as to solve the problem that when a large number of users access the satellite Internet but only some users transmit services at the same time, the traditional authorization-based multiple access method has large signaling overhead, high access delay and is no longer applicable.

[0005] The technical solution of the present invention is: a satellite Internet random access transmission method based on coded compressed sensing, comprising the following steps:

[0006] Perform tree coding and compressed sensing coding on the original information of the kth user;

[0007] The user data after compressed sensing coding is modulated by BPSK, and accessed to the channel through the time slot allocation method based on irregular coded time slot ALOHA to obtain the superposition signal of each sub-block after transmission;

[0008] At the receiving end, the superimposed signal on each sub-block is compressed sensing decoded to obtain a list of sub-blocks on the corresponding time slot. The sub-blocks are connected in series through tree decoding to perform multi-user data detection to obtain the final solution result.

[0009] Furthermore, the tree encoding of the original information of the kth user is specifically as follows:

[0010] The user's original data b k Divided into M sub-blocks, each sub-block contains b m The original bits, N B is the original data length of a single user, then the original data of the user is expressed as:

[0011] b k =b k (0)b k (1)…b k (m)…b k (M-1)

[0012] Among them, b k (m) means b k The mth sub-block obtained after segmentation;

[0013] The M sub-blocks obtained after division are tree-coded to complete the parity bit allocation. k (m) will be assigned p m parity bits, and satisfy the relationship:

[0014] p m +b m =J

[0015] Among them, J is the length of the encoded code block, and the data after the parity bit allocation is expressed as:

[0016] u k =u k (0)u k (1)…u k (m)…u k (M-1)

[0017] Among them, u k (m) = b k (m)v k (m), indicating that each sub-block is a concatenation of the original data and the check bits, v k (m) is the parity bit in the m-th sub-block of the k-th user, and |V k (m)|=p m , m′ is a temporary variable, G m′m The dimension is bm′ ×p m A random binary matrix where each element is generated by a Bernoulli distribution with parameter 1 / 2.

[0018] Furthermore, the compressed sensing coding is specifically:

[0019] Each code block u generated by user k after tree coding k (m) is mapped to a column vector s with sparsity 1 k (m):

[0020]

[0021] in,[·] B2D Indicates converting a binary number to a decimal number, s k,u (m) represents the column vector s k The u-th element in (m);

[0022] Define the compressed sensing codebook as C, which has the dimension , where n is the number of resource blocks available in the system, and each column in the codebook C is a BCH codeword; the data packet after compressed sensing encoding can be expressed as:

[0023] W k =W k (O)W k (I)...W k (IJZ)...W k (I\ / rI)

[0024] Among them, w k (m) = C·s k (m) represents w k The mth sub-block in .

[0025] Further, the channel is accessed by means of a time slot allocation method based on irregular coded time slots ALOHA to obtain a superimposed signal of each sub-block after transmission, specifically:

[0026] Define the time slot allocation codebook as F c , is the dimension T c ×N(L,T c ) matrix, where N(L,T c ) represents the codebook F c The number of codewords contained in the packet, the value of the repetition rate L of the transmitted data packet, and the number of time slots T in the contention period c related;

[0027] Codebook F c Each column in corresponds to the allocation of time slot resources, denoted by Fc (n') represents F c The n'th codeword in, 1≤n'≤N(L,T c ); when the element "1" appears in the codeword, it means that the data packet occupies the time slot for transmission, and when "0" appears, it means that the user data does not occupy the time slot;

[0028] After the codebook is generated, users in the system randomly select F c The codewords in are transmitted, using x k represents the transmission vector obtained after codeword selection, |x k |=T c n;

[0029] Each user's information reaches the receiving end after passing through the channel:

[0030]

[0031] Among them, K a is the number of active users at the same time, y is K a The superimposed signal of active users at the receiving end, z represents the additive Gaussian white noise vector, and the superimposed signal of the mth sub-block of signal y after transmission is expressed as z(m) is the noise vector on the m-th sub-block.

[0032] Furthermore, the compressed sensing decoding is performed on the superimposed signal on each sub-block at the receiving end, specifically:

[0033] According to convex optimization theory, the sparse vector on the m-th sub-block is estimated:

[0034]

[0035] Where ||A|| represents the 2-norm of matrix A, ||A|| 1 represents the 1-norm of matrix A, is the sparse vector estimation result on the m-th sub-block, λ is the optimization coefficient, and argmin is the function for finding the minimum value;

[0036] Estimation results To make quantitative adjustments: Select Set the T elements with the largest values ​​in 1, and set 2 of them to 1. J - Set T elements to 0 to get the final estimated result The value of T corresponds to the maximum number of superimposed users that can be resolved by the receiving end;

[0037] mark The positions of non-zero elements in 1 ,…,l t ,…,l T, used to restore the information block superimposed on the sub-block

[0038]

[0039] in,[·] D2B Converts a decimal number to binary.

[0040] Furthermore, the sub-blocks are connected in series through tree decoding to perform multi-user data detection to obtain the final solution result, which is specifically:

[0041] After completing the compressed sensing decoding of the superimposed signal on each sub-block, the superimposed information blocks on all sub-blocks are obtained by solving the decoding;

[0042] Perform tree decoding on the superimposed information blocks on each sub-block obtained by the solution to verify whether the verification relationship between each root node on the 0th sub-block and the data on the subsequent sub-blocks meets the coding requirements. until a sub-block sequence is found that satisfies all the check relations, and the receiver outputs the corresponding solution result.

[0043] A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the satellite Internet random access transmission method based on coded compressed sensing are implemented.

[0044] An electronic device comprises a memory, a processor and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps of the satellite Internet random access transmission method based on coded compressed sensing are implemented.

[0045] A computer program product comprises a computer program, which, when executed by a processor, implements the steps of the satellite Internet random access transmission method based on coded compressed sensing.

[0046] The beneficial effects of the present invention compared with the prior art are:

[0047] The present invention proposes a random access transmission method based on coded compressed sensing for satellite Internet, which combines the coded compressed sensing method with the irregular coded time slot ALOHA system, realizes the concatenation and resolution between different sub-blocks of the same user through cascade coding, and provides a user access and data resolution method within a contention cycle. The present invention realizes multi-user access through a public code book, can realize efficient access of users, and reduces the dimension of the public code book through tree coding, realizes the reduction of complexity, and has high practical application value. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] Figure 1 This is a flow chart of a random access transmission method based on coded compressed sensing according to the present invention;

[0049] Figure 2 is a system block diagram in an embodiment of the present invention;

[0050] Figure 3 It is a schematic diagram of the tree encoding process;

[0051] Figure 4 Schematic diagram of compressed sensing encoding process;

[0052] Figure 5 Schematic diagram of time slot allocation based on irregular coded time slot ALOHA;

[0053] Figure 6 Schematic diagram of the decoding process;

[0054] Figure 7 For simulation results. DETAILED DESCRIPTION

[0055] The present invention proposes a satellite Internet random access transmission method based on coded compressed sensing. By analyzing the characteristics of business data transmission, the compressed sensing codebook is combined with the irregular coded time slot ALOHA protocol, and the division, codebook mapping and data series recovery of business data transmitted by the same user are realized by cascade coding. The solution of business data transmitted by users randomly accessed in the Internet constellation is realized while reducing the solution complexity.

[0056] In the present invention, it is assumed that there are K users in the system who need to access the satellite Internet, but at the same time there are only Ka active users transmitting data through the AWGN channel, and the access probability is p a . In a contention cycle, T c time slots, and it is assumed that the time when the data packet arrives at the receiving end in each time slot is perfectly synchronized. In addition, it is assumed that the user frame structure already contains the irregular time slot selection when the data packet copy is transmitted. The specific steps are explained by taking the transmission of the kth user data packet and the solution of all active user data packets as an example.

[0057] like Figure 1 As shown, the satellite Internet random access transmission method based on coded compressed sensing includes the following steps:

[0058] Step 1: The original information b of the kth user k Perform tree coding and compressed sensing coding.

[0059] The specific operations are as follows:

[0060] 1) The user's original data b k Divided into M sub-blocks, each sub-block contains bm The original bits, N B is the original data length of a single user, so the original data of the user can be expressed as:

[0061] b k =b k (0)b k (1)…b k (m)b k (M-1)

[0062] Among them, b k (m) means b k The mth sub-block obtained after segmentation.

[0063] 2) Perform tree coding on the M sub-blocks obtained after division to complete the parity bit allocation. k (m) will be assigned p m parity bits, and satisfy the relationship:

[0064] p m +b m =J

[0065] Wherein, J is the length of the encoded code block, which is a fixed value. The data after the parity bit allocation is completed can be expressed as:

[0066] u k =u k (0)u k (1)…u k (m)…u k (M-1)

[0067] Among them, u k (m) = b k (m)v k (m), that is, each sub-block is the concatenation of the original data and the check bits, v k (m) is the parity bit in the m-th sub-block of the k-th user, and |v k (m)|=p m , m′ is a temporary variable, with a value of 0 to m-1, G m′m The dimension is b m′ ×p m A random binary matrix where each element is generated by a Bernoulli distribution with parameter 1 / 2.

[0068] 3) Each code block u generated by user k after tree coding k (m) is mapped to a column vector s with sparsity 1 k (m):

[0069]

[0070] in,[·] B2D Indicates converting a binary number to a decimal number (Binary to Decimalism, B2D); k,u (m) represents the column vector s k The u-th element in (m).

[0071] 4) Define the compressed sensing codebook as C, which has the dimension Where n is the number of resource blocks available in the system, and each column in the codebook C is a BCH codeword. The data packet after compressed sensing encoding can be expressed as:

[0072] w k =w k (0)w k (1)…w k (m)…w k (M-1)

[0073] Among them, w k (m) = C·s k (m) represents w k The mth sub-block in .

[0074] Step 2: Perform BPSK modulation on the user data after compressed sensing encoding, access the channel through the time slot allocation method based on irregular coded time slot ALOHA, and obtain the superimposed signal of each sub-block after transmission.

[0075] The specific operations are as follows:

[0076] 1) Each code block w k (m) Perform BPSK modulation, map element 1 to 1, and map element 0 to -1;

[0077] 2) Define the time slot allocation codebook as F c , is the dimension T c ×N(L,T c ) matrix. Among them, N(L,T c ) represents the codebook F c The number of codewords contained in the packet, the value of the repetition rate L of the transmitted data packet, and the number of time slots T in the contention period c related.

[0078] Codebook F c Each column in corresponds to the allocation of time slot resources, denoted by F c (n') represents F c The n'th codeword in, 1≤n'≤N(L,T c). When the element "1" appears in the codeword, it means that the data packet occupies the time slot for transmission, and when "0" appears, it means that the user data does not occupy the time slot.

[0079] 3) After the codebook is generated, the user in the system randomly selects F c The codewords in are transmitted, using x k represents the transmission vector obtained after codeword selection, |x k |=T c ·n.

[0080] 4) Each user's information reaches the receiving end after passing through the channel:

[0081]

[0082] Among them, K a is the number of active users at the same time, y is K a The superimposed signal of active users at the receiving end, z represents the additive Gaussian white noise vector, and the superimposed signal of the mth sub-block of signal y after transmission can be expressed as z(m) is the noise vector on the m-th sub-block.

[0083] Step 3: At the receiving end, the superimposed signal on each sub-block is compressed sensing decoded to obtain a list of sub-blocks on the corresponding time slot, and the sub-blocks are connected in series through tree decoding to perform multi-user data detection to obtain the final solution result.

[0084] The specific operations are as follows:

[0085] 1) According to convex optimization theory, the sparse vector on the m-th sub-block is estimated:

[0086]

[0087] Where ||A|| represents the 2-norm of matrix A, ||A|| 1 represents the 1-norm of matrix A, is the sparse vector estimation result on the mth sub-block, λ is the optimization coefficient, preferably ranging from 0 to 1, and argmin is the function for finding the minimum value;

[0088] 2) Estimation results Make quantitative adjustments. Select Set the T elements with the largest values ​​in 1, and set 2 of them to 1. J -T elements are set to 0, thus obtaining the final estimated result

[0089] The value of T needs to be selected according to the receiver's solving capability, corresponding to the maximum number of superimposed users that can be solved by the receiving end.

[0090] 3) Marking The positions of non-zero elements in 1 ,…,l t ,…,l T , used to restore the information block superimposed on the sub-block

[0091]

[0092] in,[·] D2B Indicates converting a decimal number to a binary number (Decimalism to Binary, D2B).

[0093] 4) For each sub-block, repeat step 1) to step 3) in step 3 until the superimposed information blocks on all sub-blocks are obtained.

[0094] 5) Perform tree decoding on the superimposed information blocks on each sub-block obtained by the solution to verify whether the verification relationship between each root node on the 0th sub-block and the data on the subsequent sub-blocks meets the coding requirements. until a sub-block sequence is found that satisfies all the check relations. At this point, the receiver outputs the corresponding solution result.

[0095] The present invention will be further described below in conjunction with the embodiments.

[0096] Example 1

[0097] The system model of Example 1 is as follows Figure 2 shown.

[0098] Let the total number of users in the system K = 10 7 , user access probability p a ≈2×10 -5 , which is consistent with the satellite Internet access scenario of massive access and sporadic access. In addition, assuming that the number of time slots in the same contention cycle is T c =100, the maximum number of superimposed users that can be solved in each time slot is T=5, the target single-user bit error rate ε=0.05, and the length of the user's original data is N B =50, the number of sub-blocks after division M=5, and the length of the encoded code block J=15.

[0099] Step 1: The original information b of the kth user k Perform tree coding and compressed sensing coding.

[0100] 1) The user's original data b k Divided into 5 sub-blocks, each sub-block contains b m The original bits, Therefore, the original data of the user can be expressed as:

[0101] b h --b k (O)b h (I)b k (2)b k (3)b k (4)

[0102] 2) Perform tree coding on the five sub-blocks obtained after division to complete the parity bit allocation. k (m) will be assigned p m parity bits, and satisfy the relationship:

[0103] p m +b m =15,0≤m·≤4

[0104] The number of original bits and check bits in each code block is optional. For example, [b 0 , b 1 , b 2 , b 3 , b 4 ]=[15,8,9,9,9],[p 0 , p 1 , p 2 , p 3 , p 4 ]=[0,7,6,6,6].

[0105] The data after completing the parity bit allocation can be expressed as

[0106] u k =u k (0)u k (1)u k (2)u k (3)u k (4)

[0107] with u k (1) is used as an example. The Bernoulli matrix G 01 is a 15×7 dimensional binary matrix, with check bits v k (1) = b k (0)×G 01 , is a 1×8 dimensional vector. Therefore, the generated sub-block u k (1) = b k (1)v k (1). The specific process of sub-block generation is as follows Figure 3 shown.

[0108] 3) Each code block u generated by user k after tree coding k(m) is mapped to a column vector s with sparsity 1 k (m):

[0109]

[0110] with u k (1) as an example. Assume that u k (1) = [0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0], then s k,14508 (1) = 1, that is, vector s k The 14508th bit of (1) is 1, which is mapped to the 14508th codeword in the compressed sensing codebook C.

[0111] 4) The data packet after compressed sensing encoding can be expressed as:

[0112] w k =w k (0)w k (1)w k (2)w k (3)w k (4)

[0113] Among them, w k (m) = C·s k (m) represents w k The mth sub-block in is mapped as follows: Figure 4 shown.

[0114] Step 2: Perform BPSK modulation on the user data after compressed sensing encoding, access the channel through the time slot allocation method based on irregular coded time slot ALOHA, and obtain the superimposed signal of each sub-block after transmission.

[0115] 1) Each code block w k (m) performing BPSK modulation;

[0116] 2) Define the time slot allocation codebook as F c , is the dimension T c ×N(L,T c ) matrix. Among them, N(L,T c ) represents the codebook F c The number of codewords contained in the packet, the value of the repetition rate L of the transmitted data packet, and the number of time slots T in the contention period c related.

[0117] T c =4, L = 2 as an example, the corresponding F c as follows:

[0118]

[0119] 3) After the codebook is generated, the user in the system randomly selects F c The codewords in are transmitted, using x k Represents the transmission vector obtained after codeword selection. The schematic diagram of the process is as follows Figure 5 As shown, among them, users 1, 2 and user K a The codeword F is applied respectively c (2) F c (8) and F c (4).

[0120] 4) Each user's information reaches the receiving end after passing through the channel:

[0121]

[0122] Step 3: At the receiving end, the superimposed signal on each sub-block is compressed sensing decoded to obtain a list of sub-blocks on the corresponding time slot, and the sub-blocks are connected in series through tree decoding to perform multi-user data detection to obtain the final solution result.

[0123] 1) According to convex optimization theory, the sparse vector s(m) on the m-th sub-block is estimated to obtain

[0124] 2) Estimation results Make quantitative adjustments. Select The 5 elements with the largest values ​​are set to 1, and 2 of them are 15 -5 elements are set to 0, thus obtaining the final estimated result

[0125] 3) Marking The positions of non-zero elements in 1 , l 2 , l 3 , l 4 , l 5 , used to restore the information block superimposed on the sub-block

[0126]

[0127] 4) For each sub-block, repeat step 1) to step 3) in step 3 until the superimposed information blocks on all sub-blocks are obtained.

[0128] 5) Perform tree decoding on the superimposed information blocks on each sub-block obtained by the solution, and verify whether the check relationship between each root node on the 0th sub-block and the data on the subsequent sub-blocks satisfies the check relationship, until a valid path is found to satisfy all the check relationships. At this point, the receiver outputs the corresponding solution result. The schematic diagram of the decoding process is shown in Figure 6shown.

[0129] The simulation results are given as Figure 7 The method of the present invention is not only applicable to satellite Internet systems, but also applicable to various other systems that meet the requirements of massive access and sporadic access.

[0130] The present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the computer executes Figure 1 The method described.

[0131] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) that contain computer-usable program code.

[0132] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0133] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0134] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1A step that specifies a function in one or more boxes.

[0135] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

[0136] The contents not described in detail in the specification of the present invention belong to the common knowledge of those skilled in the art.

Claims

1. A satellite Internet random access transmission method based on coded compressed sensing, characterized in that: The following steps are involved: Perform tree coding and compressed sensing coding on the original information of the kth user; The user data after compressed sensing coding is modulated by BPSK, and accessed to the channel through the time slot allocation method based on irregular coded time slot ALOHA to obtain the superposition signal of each sub-block after transmission; At the receiving end, the superimposed signal on each sub-block is compressed sensing decoded to obtain a list of sub-blocks on the corresponding time slot. The sub-blocks are connected in series through tree decoding to perform multi-user data detection to obtain the final solution result.

2. The satellite Internet random access transmission method based on coded compressed sensing according to claim 1, characterized in that: The tree encoding of the original information of the kth user is specifically as follows: The user's original data b k Divided into M sub-blocks, each sub-block contains b m The original bits, N B is the original data length of a single user, then the original data of the user is expressed as: b k =b k (0)b k (1)…b k (m)…b k (M-1) Among them, b k (m) means b k The mth sub-block obtained after segmentation; The M sub-blocks obtained after division are tree-coded to complete the parity bit allocation. k (m) will be assigned p m parity bits, and satisfy the relationship: p m +b m =J Among them, J is the length of the encoded code block, and the data after the parity bit allocation is expressed as: u k =u k (0)u k (1)…u k (m)…u k (M-1) Among them, u k (m) = b k (m)v k (m), indicating that each sub-block is a concatenation of the original data and the check bits, v k (m) is the parity bit in the m-th sub-block of the k-th user, and |v k (m)|=p m , m' is a temporary variable, C m′m The dimension is b m′ ×p m A random binary matrix where each element is generated by a Bernoulli distribution with parameter 1 / 2.

3. The satellite Internet random access transmission method based on coded compressed sensing according to claim 2, characterized in that: The compressed sensing coding is specifically: Each code block u generated by user k after tree coding k (m) is mapped to a column vector s with sparsity 1 k (m): in,[·] B2D Indicates converting a binary number to a decimal number, s k,u (m) represents the column vector s k The u-th element in (m); Define the compressed sensing codebook as C, which has the dimension , where n is the number of resource blocks available in the system, and each column in the codebook C is a BCH codeword; the data packet after compressed sensing encoding can be expressed as: w k =w k (0)w k (1)…w k (m)…w k (M-1) Among them, w k (m) = C·s k (m) represents w k The mth sub-block in .

4. The satellite Internet random access transmission method based on coded compressed sensing according to claim 3 is characterized in that: The channel is accessed by a time slot allocation method based on irregular coded time slot ALOHA to obtain a superimposed signal of each sub-block after transmission, specifically: Define the time slot allocation codebook as F c , is the dimension T c ×N(L,T c ) matrix, where N(L,T c ) represents the codebook F c The number of codewords contained in the packet, the value of the repetition rate L of the transmitted data packet, and the number of time slots T in the contention period c related; Codebook F c Each column in corresponds to the allocation of time slot resources, denoted by F c (n') represents F c The n'th codeword in, 1≤n'≤N(L,T c ); when the element "1" appears in the codeword, it means that the data packet occupies the time slot for transmission, and when "0" appears, it means that the user data does not occupy the time slot; After the codebook is generated, users in the system randomly select F c The codewords in are transmitted, using x k represents the transmission vector obtained after codeword selection, |x k |=T c n; Each user's information reaches the receiving end after passing through the channel: Among them, K a is the number of active users at the same time, y is K a The superimposed signal of active users at the receiving end, z represents the additive Gaussian white noise vector, and the superimposed signal of the mth sub-block of signal y after transmission is expressed as y(m)=Cs(m)+z(m), z(m) is the noise vector on the m-th sub-block.

5. The satellite Internet random access transmission method based on coded compressed sensing according to claim 4, characterized in that: The compressed sensing decoding of the superimposed signal on each sub-block is performed at the receiving end, specifically: According to convex optimization theory, the sparse vector on the m-th sub-block is estimated: Among them, ||A|| represents the 2-norm of matrix A, ||A||1 represents the 1-norm of matrix A, is the sparse vector estimation result on the m-th sub-block, λ is the optimization coefficient, and argmin is the function for finding the minimum value; Estimation results To make quantitative adjustments: Select Set the T elements with the largest values ​​in 1, and set 2 of them to 1. J - Set T elements to 0 to get the final estimated result The value of T corresponds to the maximum number of superimposed users that can be resolved by the receiving end; mark The positions of the non-zero elements in l1,…,l t ,…,l T , used to restore the information block superimposed on the sub-block in,[·] D2B Converts a decimal number to binary.

6. The satellite Internet random access transmission method based on coded compressed sensing according to claim 5, characterized in that: The tree decoding is used to connect the sub-blocks in series, perform multi-user data detection, and obtain the final solution result, which is specifically: After completing the compressed sensing decoding of the superimposed signal on each sub-block, the superimposed information blocks on all sub-blocks are obtained by solving the decoding; Perform tree decoding on the superimposed information blocks on each sub-block obtained by the solution to verify whether the verification relationship between each root node on the 0th sub-block and the data on the subsequent sub-blocks meets the coding requirements. until a sub-block sequence is found that satisfies all the check relations, and the receiver outputs the corresponding solution result.

7. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method described in any one of claims 1 to 6 are implemented.

Citation Information

Patent Citations

  • Large-scale MIMO passive random access method under spatial correlation channel

    CN111343730A

  • Wireless random access and transmission method based on time slot Aloha and network coding

    CN114124298A

  • Random multiple access method based on compressed sensing and CRDSA for satellite Internet of Things

    CN115623606A

Cited By

  • SCMA transmission method and device based on compressed sensing measurement matrix

    CN120165999A