WO2016037474A1 - 定帧方法及装置 - Google Patents

定帧方法及装置 Download PDF

Info

Publication number
WO2016037474A1
WO2016037474A1 PCT/CN2015/074333 CN2015074333W WO2016037474A1 WO 2016037474 A1 WO2016037474 A1 WO 2016037474A1 CN 2015074333 W CN2015074333 W CN 2015074333W WO 2016037474 A1 WO2016037474 A1 WO 2016037474A1
Authority
WO
WIPO (PCT)
Prior art keywords
channel
time
data
division data
frame
Prior art date
Application number
PCT/CN2015/074333
Other languages
English (en)
French (fr)
Inventor
路海良
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2016037474A1 publication Critical patent/WO2016037474A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/08—Time-division multiplex systems

Definitions

  • the present invention relates to the field of communications, and in particular to a method and apparatus for framing.
  • GFP Generic Framing Procedure
  • GFP-F framing mapping GFP
  • GFP-T transparent mapping GFP
  • the GFP frame needs to rely on some special characters for frame delimitation and provide control information, and the reserved characters appearing in the payload need to be inserted into the escape character to distinguish, resulting in different non-deterministic bandwidth increases, thus adopting a Delimitation of protocol data units is achieved by a self-delimiting technique based on frame header error detection and error detection.
  • GFP provides a payload length indication unit in the frame header, which can conveniently extract the encapsulated protocol data unit in the data stream. This way of displaying the frame length indication reduces the boundary search processing time, which is very important for data links with higher synchronization requirements.
  • the GFP frame format is shown in Figure 1. Based on the byte structure, it consists of two parts: the frame header and the payload.
  • the idle frame has no payload.
  • the frame header is polynomial with the polynomial 0xB6AB31E0 to ensure the DC balance on the line.
  • the ODU Optical Data Unit service channel of the ODU (optical data unit) is more and more, and multiple ODUs are provided.
  • the number of GFP-F channels generated by the convergence of data is also increased.
  • each channel needs a GFP-F framing module for framing processing, and how many channels are needed. How many framing modules are instantiated, as shown in Figure 2, so that a large amount of logic resources are used in the framing section, and the scale of the logic engineering and the cost of the chip increase.
  • the GFP-F frame in the channel corresponds to a framing module.
  • the framing module only frames the traffic of this channel. After the framing is completed, the corresponding channel number is output. When there is no service transmission on the channel, this The framing module is in an idle state, which causes waste of resources, and the more resources are wasted, the more resources are wasted.
  • the embodiments of the present invention provide a framing method and apparatus to solve at least the problem of resource waste caused by setting a framing module for each channel in the related art.
  • a framing method including: converting a general framing procedure GFP data of each channel of a plurality of channels into one time-division data, and each time-division data carries a channel corresponding to the channel.
  • the identifier is configured to perform frame delimiting on the converted time-division data according to the channel identifier carried in the time-division data.
  • the method further includes: sequentially, according to the channel identifiers carried in the time-division data of each road, Perform cyclic redundancy check on each time-division data after conversion.
  • performing cyclic redundancy check on each converted time-division data in sequence includes: performing cyclic redundancy check on each converted time-division data in sequence by using multiple cycles, and processing one channel corresponding time division in each cycle data.
  • performing cyclic redundancy check on the converted time-division data corresponding to each channel comprises: combining the lower four bytes of the previous time-division data corresponding to the channel and the current time-division data N + 4 bytes of data, wherein the N is the number of bytes of the current time-division data; and the cyclic redundancy check is performed on the N + 4 bytes of data.
  • frame demarcating the converted time-division data in sequence according to the channel identifiers carried in the time-division data including: detecting, for each channel, whether the time-division data corresponding to the channel has a frame header and / or the end of the frame; in the presence of the frame header and / or the end of the frame, determine the byte position of the frame header and / or the end of the frame.
  • converting the general framing procedure GFP data of each channel of the multiple channels into one time division data includes: writing the GFP data of each channel into a first-in first-out buffer fifo, respectively, when one of the After writing a complete frame in the fifo, the time-division data of the corresponding channel is obtained.
  • the method before converting the general framing procedure GFP data of each channel of the multiple channels into one time division data, the method further includes: receiving GFP data in the plurality of independent optical path data units ODU; and using the time limit n
  • the payload of the spatial data of the GFP packet transmitted by the virtual container is channelized according to the configuration information to obtain GFP data of multiple channels.
  • a framing apparatus comprising: an arbitration multiplexing module configured to convert a general framing procedure GFP data of each channel of the plurality of channels into one time division data, each time division The data carries the channel identifier of the corresponding channel; the framing module is configured to perform frame delimiting on the converted time-division data according to the channel identifier carried in the time-division data of each path.
  • the device further includes: a check calculation module, configured to perform cyclic redundancy check on the converted time-division data in sequence according to the channel identifier carried in each time-division data.
  • a check calculation module configured to perform cyclic redundancy check on the converted time-division data in sequence according to the channel identifier carried in each time-division data.
  • the framing module includes: a detecting module, configured to detect, for each channel, a time division data, whether the time division data has a frame header and/or a frame tail; and the delimiting module is set to exist in the presence frame. In the case of the header and/or the end of the frame, the byte position of the frame header and/or the end of the frame of the time division data is determined.
  • the arbitration multiplexing module is configured to write the GFP data of each channel into a FIFO buffer fifo, and when one of the fifos is written into a complete frame, the corresponding channel is obtained. Time division data.
  • data of a plurality of channels is serialized, and then framing is performed, so that a plurality of different channels can be framed by only one framing module, as long as there is any channel of service, framing Modules are not idle and can be fully utilized, saving a lot of resources.
  • FIG. 1 is a schematic diagram of a format of a GFP frame according to the related art
  • FIG. 2 is a schematic structural diagram of a framing apparatus according to the related art
  • FIG. 3 is a schematic structural diagram of a framing apparatus according to an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a framing apparatus according to an alternative embodiment of the present invention.
  • FIG. 5 is a schematic illustration of a CRC check in an alternative embodiment of the present invention.
  • FIG. 6 is a schematic diagram of processing of a framing module according to an alternative embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a state machine jump in an alternative embodiment of the present invention.
  • FIG. 8 is a flow chart of a framing method in accordance with an embodiment of the present invention.
  • an improved framing apparatus is provided.
  • the independent ODU channel data is serialized before the framing module, and the corresponding channel information is given, and only one framing module is used to separately set different independent channels. Frames, each channel is completely independent and does not interfere with each other. This is equivalent to de-frame different channel data in different time periods. As long as there is no channel for any channel, the framing module will not be idle and can be fully utilized. A lot of resources.
  • FIG. 3 is a schematic structural diagram of a framing apparatus according to an embodiment of the present invention.
  • the method mainly includes: an arbitration multiplexing module 30 configured to convert GM data of each channel of each of the multiple channels into one path.
  • Time-division data each time-division data carries a channel identifier of a corresponding channel;
  • the framing module 32 is configured to frame-delimit the converted time-division data according to the channel identifier carried in each time-division data.
  • the apparatus may further include: a verification calculation module 34, configured to sequentially perform time-division data of each channel after conversion according to channel identifiers carried in each time-division data. Cyclic redundancy check.
  • the framing module 32 may include: a detecting module, configured to detect, for each channel, whether a time-division data corresponding to the channel has a frame header and/or a frame tail; The module is set to determine the byte position of the frame header and/or the end of the frame in the presence of a frame header and/or a frame trailer.
  • This module implements the data multiplexing of the N-way ODU service.
  • the state machine reads in turn according to the status of N fifo (First In First Out), and a complete frame in a fifo starts to read. In order to avoid bandwidth loss caused by state transitions, the state machine needs to jump when there is a valid data before the second frame.
  • N fifo First In First Out
  • This module mainly implements the CRC16 check calculation function of the input data.
  • the input data is the multi-channel time-division data after the combination, and the data of one channel is calculated every cycle.
  • the module uses the same channel, the lower four bytes of the previous valid data and the current valid data together form N+4 (N is the number of bytes per beat) Byte data, then slid by byte from the highest byte, each time taking four bytes, you can get N four-byte data window, first two bytes high two bytes, low two words
  • the segments are simultaneously descrambled, and then the CRC16 check results of the N four-byte data windows are simultaneously calculated, and the result is compared with the lower two bytes after the corresponding window descrambling code to obtain each window. Whether it is the result of the frame header, as shown in Figure 5.
  • N 4-byte data windows are compared with idle frames to find out whether each window is the result of an idle frame.
  • the module outputs: N+4 bytes of data, the check result of the N check windows and the comparison result of the idle frame, and the valid signal of the N+4 byte data and the corresponding channel number are attached.
  • This module consists of the following sub-parts, the structure is shown in Figure 6.
  • the main function of this module is to output whether the frame data has the frame header or the end of the frame and the byte position of the frame header or the end of the frame. If it exists, it needs to indicate the location.
  • the module mainly encodes the verification result of the input N check windows, and the priority is sequentially encoded from one bit of the highest bit window to the lowest bit window, respectively, according to the position of the byte, and can represent the byte starting from the payload. Position, because the frame header is extracted and the payload length is extracted, the frame header can be discarded, and a frame header of the period and its position are given. At this time, the state machine should jump from the search frame header to the synchronization state.
  • the length of the payload is extracted by the frame header, and the remaining length of the payload in the next cycle is equal to the extracted payload length minus the position of the frame header in the current period data, if The frame has been fixed, and the remaining length of the payload at the next cycle is equal to the remaining frame length minus N bytes.
  • the start detection position indicates that when a data frame ends quickly, the start detection position of the next data frame generated is valid only at the end of the frame, and the check information and the idle frame before the detection position are not considered, and only for valid Data Frame.
  • the start detection position is equal to the next byte of the position at which the frame header is detected; if the frame has been fixed, the remaining payload length is greater than 0. And less than N-4 bytes, the start detection position is equal to N minus the remaining payload length and then 4 bytes; if the remaining payload length is greater than or equal to N-4 bytes less than or equal to N bytes, the start detection position is equal to N minus The remaining payload length plus N-4 bytes is equal to finding the frame header from the first three bytes of the next frame; if the remaining payload length is greater than N, this information is ignored.
  • the idle comparison result of the check calculation section is grouped by the lower two bits of the position information of the start detection, and each set of four bytes is started from the position where the detection is started, and is divided into N/4 groups, and then according to the position where the detection is started.
  • the remaining high order bits of the information encode the idle frame results of the good group, respectively indicating that the period data is not the start position of the idle frame, and masking the previous idle frame.
  • the position information of the start detection and the verification result of the N check windows of the check calculation part may be encoded, and the payload of the frame header in this state may be found. Start byte position.
  • the number of remaining bytes extracted by the current channel is reduced to greater than 0 and less than or equal to N, indicating that the beat has reached the end of the packet, giving the tail frame signal, and using N minus the length of the remaining bytes is the last byte of the payload.
  • N the number of remaining bytes extracted by the current channel
  • This module has three states of looking for frame header, pre-synchronization and synchronization.
  • the state jump condition is shown in Figure 7. After the history state is extracted according to each beat channel, the next state of the state machine is determined according to the conditions of the beat and registered by the channel. The idle frame between the frame and the frame that has been framed also needs to be detected. If an error occurs, the synchronization is lost, and the search for the frame header needs to be performed again.
  • the framing resource of the GFP-F framing is reduced, and the multiplexing processing of the GFP-F framing module is realized, which greatly reduces the cost.
  • a framing method which can be implemented by the above-described framing apparatus.
  • FIG. 8 is a flowchart of a framing method according to an embodiment of the present invention. As shown in FIG. 8, the method mainly includes the following steps S802 to S804:
  • Step S802 converting general framing procedure (GFP) data of each channel of the multiple channels into one time division data (that is, serializing GFP data of multiple channels), and each channel time division data carries a channel identifier of the corresponding channel.
  • GFP general framing procedure
  • Step S804 frame-delimiting the converted time-division data according to the channel identifier carried in each time-division data.
  • the method before the frame demarcation of the converted time-division data is performed according to the channel identifier carried in each time-division data, the method further includes: according to each path The channel identifier carried in the time-division data is sequentially subjected to cyclic redundancy check on the converted time-division data.
  • the converted time division data may be cyclically checked by a plurality of cycles, and each channel processes one channel corresponding time division data.
  • the lower four bytes of the previous time-division data corresponding to the channel and the current time-division data may be composed of N+4 bytes.
  • the test may be performed in the manner described in the foregoing device embodiment, and details are not described herein.
  • step S804 when performing step S804, for each channel, it may be detected whether the time-division data corresponding to the channel has a frame header and/or a frame tail, and there is a frame header and/or a frame. In the case of the tail, the byte position of the frame header and/or the end of the frame is determined.
  • the GFP data of each channel may be separately written into a first-in first-out buffer fifo, and one of the fifos is written into one After the complete frame, the time-division data of the corresponding channel is obtained.
  • the data of the multiple channels may be the GFP data in the multiple independent optical path data units ODU, or may be the space of transmitting the GFP data packet by using the time-limited n-th order virtual container.
  • the GFP data of multiple channels channelized by the payload of the data according to the configuration information.
  • the framing processing of the GFP-F data packets encapsulated in the multiple independent ODUs mainly includes the following steps:
  • step 1 the GFP-F data packets encapsulated in the multiple independent ODUs are aggregated in the OTN, and the extracted payload data is converted into one-way time-division data after being arbitrated and channel numbered, and the channel number is used for distinguishing.
  • Step 2 registering the lowest four bytes of the input valid data according to the registration, and extracting the history of the current channel four bytes of data and the current period data splicing, starting from the high position every four bytes, forming a group N A window for descrambling.
  • Step 3 Perform CRC16 calculation on the first two bytes of each window at the same time, compare with the last two bytes, the same output 1, no output 0, and one bit per window. At the same time, each window is compared with an idle frame. If it is an idle frame, output 1; otherwise, it outputs 0, and each window uses one bit.
  • Step 4 encoding the N-bit CRC16 calculation result, finding the first CRC16 calculation correct window, and giving the specific position and frame header information of the window according to the coding, and the extracted frame header state is entered into the pre-synchronization.
  • Status and status channel registration The length of the payload of the frame data is extracted and the remaining length of the payload after the period is calculated, and channel registration is performed. If the remaining length is less than the number of bytes transmitted in one cycle, it means that the end of the packet appears in the next beat of this channel, and it is necessary to give the next frame to start detecting whether the position of the frame header is satisfied and perform channel registration.
  • Step 5 The N-bit idle frame comparison result is encoded by using the position of the start detection, and the first idle frame that is not the idle frame is masked. Before the first one is not the idle frame, the detection position needs to be started according to the channel update.
  • the start detection position is calculated by the N-bit CRC16 calculation result calculated in advance together with the N-bit idle frame indication to determine whether the current detection position satisfies the frame header requirement of the next frame, and if so, the status is updated to the synchronization state, if not, then Update to find the frame header status and update the registered value of the status by channel.
  • the operation in the subsequent synchronization state is the same, the history registration data is extracted by the channel, and the channel is stored after the usage is completed.
  • Step 6 the information such as the frame header, the end of the frame, the position of the frame header, the position of the end of the frame, the length of the payload, and whether the data needs to be valid are given.
  • Step 7 the historical registration data (remaining byte, start detection position, current state, etc. intermediate information) is first-level registration according to the channel number. For each new cycle data, firstly, the key information is taken out according to the channel number, and then It is processed on a single channel basis.
  • the space division of the GFP-F packet is transmitted in the E1/SDH (Synchronous Digital Hierarchy) using TS (Time Slot) and VC-n (N-th virtual container).
  • E1/SDH Synchronous Digital Hierarchy
  • TS Time Slot
  • VC-n N-th virtual container
  • step 1 the payload of the space-division data of the GFP-F packet transmitted by the TS and the VC-n in the E1/SDH is channelized according to the configuration information, and becomes the output transmission of the time division.
  • Step 2 then decapsulate GFP-F and extract the payload of its internal package.
  • the GFP-F frame needs to be framed first, and the GFP-F multiplexing frame method provided by the embodiment of the present invention can be used for frame fixation.
  • step 3 the last four bytes of data per beat of the same channel and the N bytes of data of the next beat of the channel form N windows for comparison of CRC16 calculation and idle frame.
  • Step 4 Find the first one of the N-bit CRC16 calculation results to calculate the correct window, perform position coding, give the frame header and length, and calculate the remaining frame length after the beat, and register according to the channel.
  • you want to go to the end of the package you need to give the correct next shot to start detecting whether the CRC16 is correct, and register by channel, jump according to the state machine of Figure 5, and press the channel to register the status.
  • Step 5 Extracting the position information of the current channel start detection at the end of the packet, and determining whether the frame header or the idle frame of the next frame is the CRC16 result and the idle frame indication result here, and the result is performed according to FIG.
  • the state jumps and registers the result by channel. If it is an idle frame, it needs to determine the position of the first one that is not an idle frame. It is used as the start detection location for channel registration for the next beat data of the channel.
  • each beat can give corresponding information, including the frame header, the end of the frame, the position of the end of the frame header, the frame length, the frame valid signal, and thus the frame delimitation is completed for the GFP-F. .
  • GFP-F For any burst of data transmission format, it is necessary to first map to GFP-F, and then adjust the GFP-F rate to match the rate used by the transmission medium. In the opposite direction, GFP needs to be performed.
  • the deframing of -F will inevitably use GFP-F framing, whether it is a multi-channel converged framing or a single-channel framing, this method and device can be used for framing.
  • the present invention achieves the following technical effects: serialize the respective independent ODU channel data before the framing module, and assign corresponding channel information, only using a framing module to each Independent channels are fixed separately, and each channel is completely independent and does not interfere with each other. This is equivalent to de-frame different channel data in different time periods. As long as there is no service for any channel, the positioning module will not be idle. Can be fully utilized and save a lot of resources.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • a framing method and apparatus provided by an embodiment of the present invention have the following beneficial effects: by serializing respective independent ODU channel data before the framing module, and giving corresponding channel information, thereby implementing only A framing module can be used to frame different independent channels, and each channel is completely independent and does not interfere with each other, thereby making full use of the framing module and saving a lot of resources.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

本发明公开了一种定帧方法及装置。其中，该方法包括：将多个通道中各个通道的通用成帧规程数据转换为一路时分数据，每路时分数据中携带有对应通道的通道标识；根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行帧定界。

Description

定帧方法及装置 技术领域
本发明涉及通信领域，具体而言，涉及一种定帧方法及装置。
背景技术
GFP(通用成帧规程，Generic Framing Procedure)提供了一种在传输网上将高层数据信号封装起来的通用机制，它可将变长或定长的数据分组，进行统一的适配处理，实现数据业务在多种高速物理传输通道中的传输。数据帧可以是PDU(包数据单元，packet data unit)格式的，也可以是块编码的恒定比特率流。因此，目前GFP定义了两种数据信号的封装模式：一种是成帧映射GFP(GFP-F)，将一个完整的信号帧封装到一个GFP帧后再传送，另一种是透明映射GFP(GFP-T)，将客户信号字符的一部分封装到一个GFP帧传送。
GFP帧与需要依赖于某些特殊字符进行帧定界和提供控制信息，并且对于净荷内出现的保留字符需要插入转义字符进行区分，从而造成了非确定性的带宽增加不同，因而采用一种基于帧头错误检测检错的自定界技术来实现协议数据单元的定界。为了能够处理不同长度的协议数据单元，GFP在帧头中提供了一个净负荷长度指示单元，可在数据流中方便地提取出封装好的协议数据单元。这种显示帧长度指示的方式可减少边界搜索处理时间，这对于有较高同步需求的数据链路来说非常重要。
GFP帧格式如图1所示，以字节结构为基础，包括帧头和净荷两部分，空闲帧无净荷部分。其中帧头共四个字节，前两个字节为PLI(净荷长度指示，Payload length indiator)域，用于指示净荷长度，后两个字节为cHEC(帧头错误检测，Core header error check)域，用于进行帧头CRC(比特循环冗余校验，Cyclic Redundancy Check)16校验，计算多项式为G(x)＝x16+x12+x5+1，可以纠正单比特错误或检测多比特错误。帧头同多项式0xB6AB31E0求异或扰码来保证线路上的直流平衡。
随着高速物理传送通道，比如OTN(光传送网，Optical Transport Network)速率的不断提高，其承载的各自独立的ODU(光通路数据单元，Optical Data Unit)业务通道越来越多，多个ODU数据汇聚在一起产生的时分的GFP-F通道数也随之增加，按照现有的技术方案，每一个通道都需要一个GFP-F的定帧模块来进行定帧处理，则多少个通道就需要例化多少个定帧模块，如图2所示，如此在定帧部分使用了大量的逻辑资源，逻辑工程的规模、芯片成本随之增加。相关技术中，针对每个独立的ODU 通道中的GFP-F帧都对应一个定帧模块，此定帧模块只对此通道的业务进行定帧，定帧完成后，才会输出对应的通道号，在该通道没有业务传送时，此定帧模块就处于空闲状态，从而造成了资源的浪费，而且通道越多时造成的资源浪费就越大
针对相关技术中存在的资源浪费的问题，目前尚未提出有效的解决方案。
发明内容
本发明实施例提供了一种定帧方法及装置，以至少解决相关技术中针对每个通道设置一个定帧模块而导致的资源浪费的问题。
根据本发明实施例的一个方面，提供了一种定帧方法，包括：将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据，每路时分数据中携带有对应通道的通道标识；根据各路所述时分数据中携带的通道标识，依次对转换后的各路所述时分数据进行帧定界。
可选地，在根据各路时分数据中携带的通道标识，依次对将转换后的各路时分数据进行帧定界之前，所述方法还包括：根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行循环冗余校验。
可选地，依次对转换后的各路时分数据进行循环冗余校验包括：通过多个周期对依次对转换后的各路时分数据进行循环冗余校验，每个周期处理一个通道对应时分数据。
可选地，对每个通道对应的转换后的一路时分数据，对该路时分数据进行循环冗余检验包括：将所述通道对应的前一个时分数据的低四个字节和当前时分数据组成N+4字节数据，其中，所述N为当前时分数据的字节数；对所述N+4字节数据进行循环冗余检验。
可选地，根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行帧定界，包括：对于每个通道，检测该通道对应的所述时分数据是否存在帧头和/或帧尾；在存在帧头和/或帧尾的情况下，确定帧头和/或帧尾所在字节位置。
可选地，将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据，包括：将每个通道的所述GFP数据分别写入一个先进先出缓存器fifo，当其中一个所述fifo中写入一个完整帧后，得到对应通道的时分数据。
可选地，将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据之前，所述方法还包括：接收多个独立的光通路数据单元ODU中的GFP数据；将使用时限n阶虚拟容器传输GFP数据包的空分数据的净荷按照配置信息进行通道化，得到多个通道的GFP数据。
根据本发明实施例的另一个方面，提供了一种定帧装置，包括：仲裁复接模块，设置为将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据，每路时分数据中携带有对应通道的通道标识；定帧模块，设置为根据各路所述时分数据中携带的通道标识，依次对转换后的各路所述时分数据进行帧定界。
可选地，所述装置还包括：校验计算模块，设置为根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行循环冗余校验。
可选地，所述定帧模块包括：检测模块，设置为对于每个通道对应的一路时分数据，检测该路时分数据是否存在帧头和/或帧尾；定界模块，设置为在存在帧头和/或帧尾的情况下，确定该路时分数据的帧头和/或帧尾所在字节位置。
可选地，所述仲裁复接模块设置为将每个通道的所述GFP数据分别写入一个先进先出缓存器fifo，当其中一个所述fifo中写入一个完整帧后，得到对应通道的时分数据。
通过本发明实施例，将多个通道的数据进行串行化，然后进行定帧，从而可以只用一个定帧模块对多个不同通道分别进行定帧，只要存在不论哪个通道的业务，定帧模块就不会空闲，可以得到充分利用，节省了大量资源。
附图说明
此处所说明的附图用来提供对本发明的进一步理解，构成本申请的一部分，本发明的示意性实施例及其说明用于解释本发明，并不构成对本发明的不当限定。在附图中：
图1是根据相关技术的GFP帧的格式示意图；
图2是根据相关技术的定帧装置的结构示意图；
图3是根据本发明实施例的定帧装置的结构示意图；
图4是根据本发明可选实施例的定帧装置的结构示意图；
图5是本发明可选实施例中进行CRC检验的示意图；
图6是根据本发明可选实施例的定帧模块的处理示意图；
图7是根据本发明可选实施例中状态机跳转的示意图；
图8是根据本发明实施例的定帧方法的流程图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
根据本发明实施例，提供了一种改进的定帧装置。
在本发明实施例的定帧装置中，在定帧模块之前将各自独立的ODU通道数据串行化，并赋予其对应的通道信息，只用一个定帧模块对各自独立的不同通道分别进行定帧，各个通道之间完全独立，互不干扰，这样就相当于在不同时段去定帧不同的通道数据，只要存在不论哪个通道的业务，定帧模块就不会空闲，可以得到充分利用，节省了大量资源。
图3为根据本发明实施例的定帧装置的结构示意图，如图3所示，主要包括：仲裁复接模块30，设置为将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据，每路时分数据中携带有对应通道的通道标识；定帧模块32，设置为根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行帧定界。
在本发明可选实施例中，如图4所示，该装置还可以包括：校验计算模块34，设置为根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行循环冗余校验。
在本发明实施例的可选实施方式中，所述定帧模块32可以包括：检测模块，设置为对于每个通道，检测该通道对应的时分数据是否存在帧头和/或帧尾；定界模块，设置为在存在帧头和/或帧尾的情况下，确定帧头和/或帧尾所在字节位置。
下面对本发明可选实施例中，上述各个模块的功能进行描述。
1、仲裁复接模块
本模块实现N路ODU业务的数据复接，状态机根据N个fifo(先进先出缓存器，First In First Out)状态轮流读取,某个fifo中有一个完整的帧才开始读取。为了避免状态转换导致的带宽损失，状态机需要在第二帧之前一个有效数据时跳转。
2、校验计算模块
此模块主要实现输入数据的CRC16校验计算功能，此时输入的数据是合路后的多通道时分数据，每个周期计算一个通道的数据。考虑到核心帧头最终会进行丢弃操作，该模块使用同一个通道中，前一个有效数据的低四个字节和当前有效数据共同组成N+4(N为每一拍数据的字节数)字节数据，然后从最高字节开始按字节滑动，每次取四个字节，可以取到N个四字节数据窗口，先对四字节的高两个字节、低两个字节分别同时进行解扰码，然后同时计算出这N个四字节数据窗口的CRC16校验结果，将此结果与其对应窗口解扰码之后的低两个字节进行比较，得出每个窗口是否可能是帧头的结果，如图5。同时将N个4字节数据窗口和空闲帧进行比较，得出每个窗口是否是空闲帧的结果。
此模块中需要使用相同通道的前一个有效数据的低四个字节，就需要对于每次进来的有效数据按照通道寄存，同时处理前需要提取出当前通道寄存的历史值。
本模块输出：N+4字节数据，N个校验窗口的校验结果和空闲帧比较结果，同时附带有N+4字节数据的有效信号和对应的通道号。
3、定帧模块
此模块由以下几个子部分组成，组成结构如图6。本模块主要作用是输出此帧数据是否存在帧头或帧尾以及帧头或帧尾所在字节位置，如果存在则需要指出所在的位置。
·寻找第一个帧头位置部分
此模块主要对输入的N个校验窗口的校验结果进行编码，优先级由最高位窗口的一比特依次向最低位窗口，分别按照字节所在位置进行编码，可以表示净荷开始的字节位置，因为找到帧头提取出净荷长度后，帧头可以被丢弃，同时给出本周期的一个帧头及其位置，此时状态机应该由寻找帧头跳转到与同步状态。
·剩余字节及开始检测位置计算部分
对于在本周期的数据找到帧头的通道，由帧头提取出净荷的长度，下一周期时净荷剩余的长度等于提取出得净荷长度减去帧头在本周期数据的位置，如果已经定上帧，下一周期时净荷剩余的长度等于剩余帧长减去N个字节。
开始检测位置表示当一个数据帧快结束时，产生的下一个数据帧的开始检测位置，只在帧尾是有效，此检测位置之前的校验信息与空闲帧是不考虑的，只针对有效的数据帧。
如果此周期数据还处在寻找帧头状态，且编码模块输出存在帧头，则开始检测位置等于检测到帧头的位置的下一个字节；如果已经定帧上，剩余的净荷长度大于0而小于N-4字节，开始检测位置等于N减去剩余净荷长度再减4字节；如果剩余净荷长度大于等于N-4字节小于等于N字节，开始检测位置等于N减去剩余净荷长度再加上N-4字节，等于从下一帧的最前面三个字节中找帧头；如果剩余净荷长度大于N，则忽略此信息。
·空闲帧及定上帧后帧头位置的检测
使用开始检测的位置信息低两比特对校验计算部分的空闲比较结果进行分组，由开始检测的位置开始每四个字节一组，共分为N/4组，然后再根据开始检测的位置信息剩余高位比特对分好组的空闲帧结果进行编码，分别表示出此周期数据不是空闲帧的开始位置，屏蔽掉之前的空闲帧。
同理，如果处于已经定上帧状态，则可以对开始检测的位置信息和校验计算部分的N个校验窗口的校验结果进行编码，可以找出此状态下的帧头后面净荷所在开始字节位置。
·帧尾信息产生
当前通道提取出的剩余字节数当减少到大于0小于等于N时，说明本拍已经到包尾，给出尾帧信号，同时使用N减去剩余字节的长度就是净荷最后一个字节所在的位置,同时根据帧尾后的下一字节即为下一帧的开始检测位置，根据其对应的帧头校验信息可以验证此处的帧尾定位是否正确。
·状态机控制部分
此模块有寻找帧头、预同步和同步三个状态，状态跳转条件如图7。根据每一拍通道提取出历史状态后，根据本拍的条件确定状态机的下一个状态并按通道进行寄存。 已经定上帧的帧与帧之间的空闲帧也需要检测，如果出现错误，也算失去同步，需要重新进行寻找帧头。
·中间寄存部分
由于是各通道复用处理，需要把不同通道的关键信息按照通道寄存起来，使用时在使用通道号将其提取出来。主要包括剩余净荷的长度、开始检测的位置、状态机状态等中间信号按照通道号进行寄存。该通道下一拍数据来到后根据有效信号和当前输入数据的通道号，提取出当前通道的关键信息，在此基础上进行以上的处理
通过本发明实施例的上述定帧装置，与现有技术相比，减少了GFP-F定帧的逻辑资源，实现了GFP-F定帧模块的复用处理，大大降低了成本。
根据本发明实施例，还提供了一种定帧方法，该方法可以通过上述定帧装置实现。
图8为根据本发明实施例的定帧方法的流程图，如图8所示，该方法主要包括以下步骤S802-步骤S804：
步骤S802，将多个通道中各个通道的通用成帧规程(GFP)数据转换为一路时分数据(即将多个通道的GFP数据进行串行化)，每路时分数据中携带有对应通道的通道标识；
步骤S804，根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行帧定界。
在本发明实施例的一个可选实施方式中，在根据各路时分数据中携带的通道标识，依次对将转换后的各路时分数据进行帧定界之前，所述方法还包括：根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行循环冗余校验。
本发明实施例的一个可选实施方式中，可以通过多个周期对依次对转换后的各路时分数据进行循环冗余校验，每个周期处理一个通道对应时分数据。
在本发明实施例的一个可选实施方式中，在进行检验时，对每个通道，可以将所述通道对应的前一个时分数据的低四个字节和当前时分数据组成N+4字节数据，其中，所述N为当前时分数据的字节数，然后对所述N+4字节数据进行循环冗余检验。具体可以按照上述装置实施例所描述的方式进行检验，具体不再赘述。
在本发明实施例的一个可选实施方式中，在执行步骤S804时，对于每个通道，可以检测该通道对应的时分数据是否存在帧头和/或帧尾，在存在帧头和/或帧尾的情况下，确定帧头和/或帧尾所在字节位置。
在本发明实施例的一个可选实施方式中，在执行步骤S802时，可以将每个通道的所述GFP数据分别写入一个先进先出缓存器fifo，当其中一个所述fifo中写入一个完整帧后，得到对应通道的时分数据。
在本发明实施例的一个可选实施方式中，多个通道的数据可以是多个独立的光通路数据单元ODU中的GFP数据，或者也可以是使用时限n阶虚拟容器传输GFP数据包的空分数据的净荷按照配置信息进行通道化的多个通道的GFP数据。
下面通过具体实施例对本发明实施例提供的技术方案进行说明。
实施例一
在本实施例中，对多个独立的ODU中封装的GFP-F数据包进行定帧处理，主要包括以下步骤：
步骤1，将OTN中将多个独立的ODU中封装的GFP-F数据包进行汇聚，提取出的净荷数据经过仲裁、通道编号后转化为一路的时分数据，使用通道号进行区分。
步骤2，对输入的有效数据的最低位四个字节按照进行寄存，同时提取出当前通道的历史四个字节数据与当前周期数据拼接，从高位开始每四个字节一组，组成N个窗口，进行解扰码。
步骤3，同时对每个窗口的前两个字节进行CRC16计算，与后两个字节进行比较，相同输出1，不通输出0，每个窗口使用一个比特。同时对每个窗口进行空闲帧的比较，如果是空闲帧，输出1，否则输出0，每个窗口使用一个比特。
步骤4，对N比特的CRC16计算结果进行编码，找出第一个CRC16计算正确的窗口，根据编码给出此窗口的具体位置和帧头信息，此时提取出来的寻找帧头状态进入预同步状态并进行状态的通道寄存。提取出本帧数据净荷的长度并计算出本周期后净荷剩余的长度，进行通道寄存。如果剩余长度小于一个周期传输的字节数，则说明包尾出现在本通道的下一拍，需要给出下一帧开始检测是否满足帧头的的位置并进行通道寄存。
步骤5，对N比特的空闲帧比较结果使用开始检测的位置进行编码，将第一个不是空闲帧之前的空闲帧进行屏蔽，第一个不是空闲帧之前都需要按照通道更新开始检测位置。开始检测位置由之前提前算出的N比特CRC16计算结果和N比特空闲帧指示一起得出当前检测位置是否满足下一帧的帧头要求，如果满足，则状态更新到同步状态，如果不满足，则更新到寻找帧头状态，同时按通道更新状态的寄存值。之后的同步状态下的操作与此相同，按通道提取历史寄存数据，使用完成后更新通道存储数据。
步骤6，根据以上信息给出帧头、帧尾、帧头所在位置、帧尾所在位置、净荷的长度、数据是否需要有效等信息。
步骤7，历史寄存数据(剩余字节、开始检测位置、当前状态按等中间信息)照通道号进行一级寄存，对于新来的每个周期数据，首先根据通道号取出这些关键信息，再此基础上按照单通道进行处理。
实施例二
本实施例中，对E1/SDH(同步数字体系，Synchronous Digital Hierarchy)中使用TS(时隙，Time Slot)、VC-n(n阶虚拟容器，Virtual container)传输GFP-F数据包的空分数据进行定帧，主要包括以下步骤：
步骤1，对E1/SDH中使用TS、VC-n传输GFP-F数据包的空分数据的净荷按照配置信息进行通道化后，变为时分的输出传输。
步骤2，然后再对GFP-F进行解封装，提取其内部封装的净荷时。在提取净荷时首先就需要对GFP-F帧进行定帧，可以使用本发明实施例提供的GFP-F的复用定帧方法进行定帧。
步骤3，同一通道每拍的最后四个字节数据与该通道下一拍的N字节数据组成N个窗口进行CRC16计算和空闲帧的比较。
步骤4，找出N比特的CRC16计算结果中的第一个计算正确的窗口，进行位置编码，给出帧头及长度，同时可以计算出本拍后剩余的帧长度，并按通道进行寄存，快要到包尾时，需要给出正确的下一拍开始检测CRC16是否正确的位置，并按通道进行寄存，根据图5的状态机进行跳转，并按通道寄存状态。
步骤5，包尾时提取出当前通道开始检测的位置信息，对于此处的CRC16结果和空闲帧指示结果判断出此处是否是下一帧的帧头或者空闲帧，对于结果根据图5进行 状态跳转，并按通道寄存结果，如果是空闲帧，则需要判断出第一个不是空闲帧的位置，其作为开始检测位置进行通道寄存，供该通道下一拍数据使用。
步骤6，根据以上的操作，每一拍可以给出相应的信息，包括帧头、帧尾、帧头帧尾所在位置、帧长、帧有效信号，如此则对GFP-F完成了帧定界。
另外，需要说明的是，对于任意突发的数据传输格式需要先映射到GFP-F中，然后调节GFP-F速率使其与传输介质所用速率匹配的应用情况，其相反的方向都需要进行GFP-F的解帧，就不可避免的会使用到GFP-F定帧，不论是多通道汇聚后的定帧还是单通道的定帧，都可以使用此方法和装置进行定帧。
从以上的描述中，可以看出，本发明实现了如下技术效果：在定帧模块之前将各自独立的ODU通道数据串行化，并赋予其对应的通道信息，只是用一个定帧模块对各自独立的不同通道分别进行定帧，各个通道之间完全独立，互不干扰，这样就相当于在不同时段去定帧不同的通道数据，只要存在不论哪个通道的业务，定帧模块就不会空闲，可以得到充分利用，节省了大量资源。
显然，本领域的技术人员应该明白，上述的本发明的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本发明不限制于任何特定的硬件和软件结合。
以上所述仅为本发明的优选实施例而已，并不用于限制本发明，对于本领域的技术人员来说，本发明可以有各种更改和变化。凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。
工业实用性
如上所述，本发明实施例提供的一种定帧方法及装置具有以下有益效果：通过在定帧模块之前将各自独立的ODU通道数据串行化，并赋予其对应的通道信息，进而实现仅采用一个定帧模块便可对各自独立的不同通道分别进行定帧，各个通道之间完全独立，互不干扰，由此可以充分利用定帧模块，节省了大量资源。

Claims (11)

  1. 一种定帧方法，包括：
    将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据，每路时分数据中携带有对应通道的通道标识；
    根据各路所述时分数据中携带的通道标识，依次对转换后的各路所述时分数据进行帧定界。
  2. 根据权利要求1所述的方法，其中，在根据各路时分数据中携带的通道标识，依次对将转换后的各路时分数据进行帧定界之前，所述方法还包括：
    根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行循环冗余校验。
  3. 根据权利要求2所述的方法，其中，依次对转换后的各路时分数据进行循环冗余校验包括：
    通过多个周期对依次对转换后的各路时分数据进行循环冗余校验，每个周期处理一个通道对应时分数据。
  4. 根据权利要求2所述的方法，其中，对每个通道对应的转换后的一路时分数据，对该路时分数据进行循环冗余检验包括：
    将所述通道对应的前一个时分数据的低四个字节和当前时分数据组成N+4字节数据，其中，所述N为当前时分数据的字节数；
    对所述N+4字节数据进行循环冗余检验。
  5. 根据权利要求1所述的方法，其中，根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行帧定界，包括：
    对于每个通道，检测该通道对应的所述时分数据是否存在帧头和/或帧尾，
    在存在帧头和/或帧尾的情况下，确定帧头和/或帧尾所在字节位置。
  6. 根据权利要求1至5中任一项所述的方法，其中，将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据，包括：
    将每个通道的所述GFP数据分别写入一个先进先出缓存器fifo，当其中一个所述fifo中写入一个完整帧后，得到对应通道的时分数据。
  7. 根据权利要求1至5中任一项所述的方法，其中，将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据之前，所述方法还包括：
    接收多个独立的光通路数据单元ODU中的GFP数据；
    将使用时限n阶虚拟容器传输GFP数据包的空分数据的净荷按照配置信息进行通道化，得到多个通道的GFP数据。
  8. 一种定帧装置，包括：
    仲裁复接模块，设置为将多个通道中各个通道的通用成帧规程GFP数据转换为一路时分数据，每路时分数据中携带有对应通道的通道标识；
    定帧模块，设置为根据各路所述时分数据中携带的通道标识，依次对转换后的各路所述时分数据进行帧定界。
  9. 根据权利要求8所述的装置，其中，所述装置还包括：
    校验计算模块，设置为根据各路时分数据中携带的通道标识，依次对转换后的各路时分数据进行循环冗余校验。
  10. 根据权利要求8所述的装置，其中，所述定帧模块包括：
    检测模块，设置为对于每个通道对应的一路时分数据，检测该路时分数据是否存在帧头和/或帧尾；
    定界模块，设置为在存在帧头和/或帧尾的情况下，确定该路时分数据的帧头和/或帧尾所在字节位置。
  11. 根据权利要求8至10中任一项所述的装置，其中，所述仲裁复接模块设置为将每个通道的所述GFP数据分别写入一个先进先出缓存器fifo，当其中一个所述fifo中写入一个完整帧后，得到对应通道的时分数据。
PCT/CN2015/074333 2014-09-12 2015-03-16 定帧方法及装置 WO2016037474A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410466304.7A CN105406937B (zh) 2014-09-12 2014-09-12 定帧方法及装置
CN201410466304.7 2014-09-12

Publications (1)

Publication Number Publication Date
WO2016037474A1 true WO2016037474A1 (zh) 2016-03-17

Family

ID=55458313

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/074333 WO2016037474A1 (zh) 2014-09-12 2015-03-16 定帧方法及装置

Country Status (2)

Country Link
CN (1) CN105406937B (zh)
WO (1) WO2016037474A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109510686A (zh) * 2018-09-13 2019-03-22 红色江山(湖北)导航技术有限公司 一种通用的二进制流数据转换处理方法
CN110990044A (zh) * 2019-11-12 2020-04-10 中国航发南方工业有限公司 在应用编程方法、计算机可读取的存储介质
CN112702624A (zh) * 2020-12-22 2021-04-23 山东鲁能软件技术有限公司 一种短视频播放效率的优化方法、系统、介质及设备
CN113824649A (zh) * 2021-09-17 2021-12-21 上海航天计算机技术研究所 面向固定帧长的数据流量控制装置

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105680991B (zh) * 2016-01-14 2019-03-12 烽火通信科技股份有限公司 Otn系统中基于odu帧的多通道串行化定帧方法及装置
CN105897631A (zh) * 2016-06-23 2016-08-24 醴陵恒茂电子科技有限公司 客房夜起引导系统
CN108063986A (zh) * 2016-11-09 2018-05-22 中兴通讯股份有限公司 多通道无源光网络的帧序号承载方法、装置及系统
CN108173623B (zh) * 2018-01-16 2020-08-14 四川安迪科技实业有限公司 一种基于滑动crc的自定义基带帧封装方法
CN111200482B (zh) * 2019-12-31 2023-03-24 曙光网络科技有限公司 Gfp帧定位处理方法、装置、电子设备及存储介质
CN111555844B (zh) * 2020-05-14 2023-07-28 北京中科网维科技有限公司 自动识别vc3/vc4虚级联gfp协议方法及装置
CN112187397B (zh) * 2020-09-11 2022-04-29 烽火通信科技股份有限公司 一种通用的多通道数据同步方法和装置
CN114257334A (zh) * 2020-09-24 2022-03-29 华为技术有限公司 一种数据编码方法、数据解码方法及通信装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1812315A (zh) * 2005-01-25 2006-08-02 华为技术有限公司 一种多路数据信号处理方法和装置
US20060233194A1 (en) * 2005-04-19 2006-10-19 Cisco Technology, Inc. Ethernet encapsulation over optical transport network
CN101499997A (zh) * 2008-01-29 2009-08-05 中兴通讯股份有限公司 一种多路低速业务复用及解复用装置及其方法
CN101674145A (zh) * 2009-10-21 2010-03-17 中兴通讯股份有限公司 一种传输数据的方法及装置

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100464517C (zh) * 2003-08-08 2009-02-25 华为技术有限公司 通用帧处理封装模式中帧校验序列的识别装置及方法
CN101299649B (zh) * 2008-06-19 2011-08-24 中兴通讯股份有限公司 基于通用成帧规程的多业务混合汇聚方法和装置
CN101729940B (zh) * 2008-10-22 2013-06-05 华为技术有限公司 向多路通信通道发送数据的方法及接收数据的方法
EP2461623B1 (en) * 2009-08-27 2020-02-26 Huawei Technologies Co., Ltd. Method and system for improving signal quality

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1812315A (zh) * 2005-01-25 2006-08-02 华为技术有限公司 一种多路数据信号处理方法和装置
US20060233194A1 (en) * 2005-04-19 2006-10-19 Cisco Technology, Inc. Ethernet encapsulation over optical transport network
CN101499997A (zh) * 2008-01-29 2009-08-05 中兴通讯股份有限公司 一种多路低速业务复用及解复用装置及其方法
CN101674145A (zh) * 2009-10-21 2010-03-17 中兴通讯股份有限公司 一种传输数据的方法及装置

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109510686A (zh) * 2018-09-13 2019-03-22 红色江山(湖北)导航技术有限公司 一种通用的二进制流数据转换处理方法
CN109510686B (zh) * 2018-09-13 2022-05-31 红色江山(湖北)导航技术有限公司 一种通用的二进制流数据转换处理方法
CN110990044A (zh) * 2019-11-12 2020-04-10 中国航发南方工业有限公司 在应用编程方法、计算机可读取的存储介质
CN110990044B (zh) * 2019-11-12 2023-06-30 中国航发南方工业有限公司 在应用编程方法、计算机可读取的存储介质
CN112702624A (zh) * 2020-12-22 2021-04-23 山东鲁能软件技术有限公司 一种短视频播放效率的优化方法、系统、介质及设备
CN112702624B (zh) * 2020-12-22 2023-04-07 山东鲁软数字科技有限公司 一种短视频播放效率的优化方法、系统、介质及设备
CN113824649A (zh) * 2021-09-17 2021-12-21 上海航天计算机技术研究所 面向固定帧长的数据流量控制装置
CN113824649B (zh) * 2021-09-17 2023-10-27 上海航天计算机技术研究所 面向固定帧长的数据流量控制装置

Also Published As

Publication number Publication date
CN105406937B (zh) 2020-03-03
CN105406937A (zh) 2016-03-16

Similar Documents

Publication Publication Date Title
WO2016037474A1 (zh) 定帧方法及装置
US11444798B2 (en) Methods and apparatus for configuring a flex ethernet node
US7519080B2 (en) Fibre channel frame-mode GFP with distributed delimiter
US20220416895A1 (en) Data transmission method and apparatus, terminal device and storage medium
US20190319730A1 (en) Techniques to operate a time division mulitplexing(tdm) media access control (mac)
JP2021534618A (ja) トラフィック伝送方法、装置及びコンピュータ記憶媒体
US9276874B1 (en) High bandwidth GFP demapper
CN110719143A (zh) 用于数据传输的方法、发送机和接收机
CN105791777B (zh) 基于fpga的千兆以太网视频多路采集传输系统
WO2017063457A1 (zh) 一种速率适配方法和装置、计算机存储介质
CN113612564A (zh) 一种报文处理的方法和网络设备
US9276851B1 (en) Parser and modifier for processing network packets
US8644347B2 (en) Transporting optical data units in an optical transport network
WO2019100982A1 (zh) 数据传输方法和设备
KR102309444B1 (ko) 데이터 캡슐화, 전송 방법, 장치 및 컴퓨터 저장 매체
JP2009164833A (ja) データ処理装置およびデータ処理方法並びにプログラム
US20130016738A1 (en) Method and apparatus for implementing frame header alignment and multi-frame zeroing
CN110012367B (zh) 用于gpon olt的omci组帧装置及组帧方法
JP5430477B2 (ja) 多重化装置及び多重化方法、分離装置及び分離方法、並びにプログラム
CN105630825B (zh) 一种数据转换方法及装置
WO2005015821A1 (fr) Appareil de reconnaissance d'une sequence de controle de trame dans une configuration d'integration d'une procedure de mise en trame generique, et procede s'y rapportant
CN110311746A (zh) 低阶虚级联对齐方法及装置
EP1986363A1 (en) Method, device and network element for decoding an information word from a coded word
WO2024007804A1 (zh) 固定速率信号的速率恢复方法及装置
CN113454935B (zh) 一种线路编码方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15839343

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15839343

Country of ref document: EP

Kind code of ref document: A1