Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A method for time-division multiplexing cache to realize time-slot data packet reassembly

A technology of time-division multiplexing and data packets, applied in the field of communication, can solve the problems of occupying cache resources and wasting cache resources, and achieve the effect of saving cache resources and improving utilization

Active Publication Date: 2022-04-15
TOEC TECH
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] In the time slot multiplexing communication protocol, the data packets are scattered in their respective time slots. When the data packets need to be reassembled, the traditional method is to cache each time slot separately. Although it is easier to implement separate buffering, it will Causes a waste of cache resources, because cache resources will also be occupied when there is no data packet in a certain time slot

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A method for time-division multiplexing cache to realize time-slot data packet reassembly

Examples

Experimental program
Comparison scheme
Effect test

example

[0051] For an 8-bit wide communication input data, each input data is 8 bits (that is, 1 byte). For a communication protocol with multi-slot multiplexing, for example, it may be assumed that there is a data packet in the first time slot, and the processing method of any other time slot is exactly the same as that of the first time slot, so only one first time slot is given as an example. Can. It may be assumed that there is a data packet with the shortest length of 3 bytes in the first time slot, and the processing method for other data packets with any longer length is exactly the same as the processing method for this data packet. Assume that the data packet is "9B6A5D" from the beginning to the end (using hexadecimal, high-order representation, the following data and addresses use this representation by default.).

[0052] The time slot buffer module first receives the beginning segment of the data packet in the input data, ie "9B". The address dynamic cache module alloca...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for recombining time slot data packets by time division multiplexing cache. The method performs time division multiplexing on buffer resources, that is, for the same data buffer, multiple data packets of different time slots are stored at different times. The data packets in different time slots of the input original time slot multiplexing communication protocol data are stored in the same data buffer. When the data packet is reassembled and output, the data cache is read according to the address of the linked list, and the data packet of a certain time slot is continuously output. The address dynamic management of the data cache. After writing an address in the data cache, the address is marked as occupied. After reading an address in the data cache, the address is marked as released and marked as a free address. It needs to be allocated before writing into the data cache. The free address of the data cache. This scheme realizes the recombination of data packets in the time slot multiplexing communication protocol, improves the utilization rate of the cache, and saves cache resources. Reassembly of data packets in more time slots is realized based on limited buffer resources.

Description

technical field [0001] The invention relates to the field of communication, in particular to a method for time-division multiplexing and buffering to realize the recombination of time-slot data packets, and in particular to the reorganization of data packets in the time-slot multiplexing communication protocol. Background technique [0002] In the time slot multiplexing communication protocol, the data packets are scattered in their respective time slots. When the data packets need to be reassembled, the traditional method is to cache each time slot separately. Although it is easier to implement separate buffering, it will It causes a waste of cache resources, because cache resources are also occupied when there is no data packet in a certain time slot. Contents of the invention [0003] The purpose of the present invention is to solve the problems existing in the above-mentioned practical applications, and in particular provide a method for time-division multiplexing and ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F12/06G06F12/0842H04L69/22
CPCG06F12/0842G06F12/0646H04L69/22
Inventor 李斌张晓峰陈伟峰
Owner TOEC TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products