RRC Message Compression for PDCP Transmission Reliability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In 5G mobile communication systems, super-large Radio Resource Control (RRC) messages often exceed the maximum byte length that can be carried by the Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU), leading to incorrect transmission.
Innovation Solution
The method involves compressing original RRC messages when their length exceeds a preset threshold, packaging the compressed messages into PDCP PDUs, and including header information to indicate compression, allowing the receiving end to distinguish and decompress the messages using appropriate algorithms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the original RRC message is transmitted directly without compression, then the data transmission is simple and reliable, but the message size exceeds the PDCP PDU maximum byte length limit
Solution Approach 1:
The patent applies compression algorithms to change the parameter of RRC message length, transforming super-large messages into compressed versions that fit within the PDCP PDU maximum byte length limit, thereby resolving the contradiction between message size and transmission reliability
Solution Approach 2:
The patent segments the RRC message transmission process into two parts: compression processing (when message length exceeds the threshold) and normal transmission. This segmentation allows the system to handle both small and super-large messages appropriately, maintaining reliability while accommodating varying message sizes
2Length of moving object
If compression is applied to RRC messages, then the message size fits within PDCP PDU limits, but the system complexity increases due to compression and decompression operations
Solution Approach 1:
The patent introduces parameter changes in the form of compression algorithms that transform RRC message length. By changing the message from uncompressed to compressed format, the system achieves fit-within-PDCP-PDU-length while managing the added complexity through standardized compression techniques
Solution Approach 2:
The patent uses compression algorithms as intermediary components between the RRC layer and PDCP layer. These intermediaries handle the complexity of size transformation, allowing the main transmission system to remain relatively simple while accommodating variable message sizes through the compression intermediary
3Length of moving object
If compression is applied to RRC messages, then the message can be transmitted within PDCP PDU limits, but the receiving end requires additional decompression processing
Solution Approach 1:
The patent applies parameter changes through compression at the sending end, which automatically results in the receiving end receiving compressed messages that need decompression. This resolves the length constraint issue while the decompression operation is a straightforward reverse process
4Reliability
If header information fields are added to indicate compression, then the receiving end can correctly identify and process compressed messages, but the header information size increases
Solution Approach 1:
The patent applies local quality changes by adding specific indicator fields (first preset field and second preset field) to the PDCP PDU header. These localized additions provide the necessary compression indication information without significantly impacting the overall header structure, maintaining reliability while minimizing length increase
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
Provided by the present application are a data transmission method and device, which are used to solve the technical problem of being unable to accurately transmit an RRC message which is too large. The method comprises: when determining that the length of an original RRC message exceeds a preset threshold, compressing the original RRC message; packaging the compressed RRC message into a PDCP PDU; and sending the packaged PDCP PDU to a receiving end.