WO2024045869A1

WO2024045869A1 - Data transmission method and data transmission apparatus

Info

Publication number: WO2024045869A1
Application number: PCT/CN2023/104489
Authority: WO
Inventors: 黄科超; 孙亮; 刘翔; 马会肖
Original assignee: 华为技术有限公司
Priority date: 2022-09-02
Filing date: 2023-06-30
Publication date: 2024-03-07
Also published as: CN117692821A

Abstract

Disclosed in embodiments of the present application are a data transmission method and a data transmission apparatus, capable of reducing the delay in transmitting small-bandwidth services, and having the characteristics of low overhead and high reliability. First, data is mapped to a data frame, and then the data frame is sent. Specifically, the data frame comprises a plurality of time slot block sets, each time slot block set comprises P time slot blocks, each time slot block comprises V indication bits and B bytes, V is an integer greater than or equal to 1, and B is an integer greater than or equal to 1. An object carried by the B bytes comprises at least one of data and padding. Each slot block set comprises an indication bit set, and the indication bit set comprises V×P indication bits in total covering V indication bits of each slot block in the slot block set. W indication bits in each indication bit set refer to one of N1 preset bit sequences, P is an integer greater than or equal to 2, N1 is an integer greater than or equal to 1, and 1<W≤V×P. The Hamming distance between any two bit sequences in the N1 preset bit sequences is greater than or equal to 2.

Description

A data transmission method and data transmission device

This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on September 2, 2022, with application number 202211072579.3 and application title "A data transmission method and data transmission device", the entire content of which is incorporated by reference. in this application.

Technical field

The present application relates to the field of communications, and in particular, to a data transmission method and a data transmission device.

Background technique

Driven by the continuous promotion of 5G, cloud computing, big data, artificial intelligence, etc., optical transport network (OTN) is developing in the direction of high bandwidth, large capacity, high reliability, low latency, and intelligence, and has become Mainstream technologies used in transport networks. OTN can provide large-bandwidth transmission capabilities such as n×1.25G bits per second and n×5G bits per second. It is widely deployed in backbone, metro core and aggregation networks, and is further expanded to access networks.

As the Synchronous Digital Hierarchy (SDH) gradually withdraws from the market, OTN is facing more and more low-speed service carrying requirements, especially the growing demand for high-quality services such as dedicated lines and video. These high-quality connection services are large in number and have small bandwidth, requiring flexible bandwidth adjustment. In the future, OTN networks need to add small-granular pipes with flexible bandwidth adjustment to have transmission capabilities as low as several megabits per second and carry high-quality connections. Existing technical solutions have the problem of large transmission delays for small-bandwidth client signals.

Contents of the invention

Embodiments of the present application provide a data transmission method and a data transmission device, which can reduce the delay in transmitting small-bandwidth services and have the characteristics of low overhead and high reliability.

In a first aspect, embodiments of the present application provide a data transmission method, which includes the following steps. First, the data is mapped to a data frame, and then the data frame is sent. Specifically, the data frame includes multiple time slot block sets, each time slot block set includes P time slot blocks, each time slot block includes V indication bits and B bytes, integer V≥1, integer B≥ 1. The object carried by B bytes includes at least one of data and padding. Each time slot block set includes a byte set, and the byte set includes B bytes of each time slot block in the time slot block set, totaling B×P bytes. Each time slot block set includes a set of indicator bits, and the indicator bit set includes V indicator bits for each time slot block in the time slot block set, totaling V×P indicator bits. The W indicator bits in the indicator bit set are one of N ₁ preset bit sequences, the integer P ≥ 2, the integer N ₁ ≥ 1, 1<W≤V×P. The Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 2.

In some possible implementations, W≥3. When N ₁ =3 or 4, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to When N ₁ =5 or 6 or 7 or 8, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to in, Indicates rounding down the real number a.

In some possible implementations, V=1, indicating that the bit is in the first bit position of the slot block.

In some possible implementations, V>1, and the number of bits spaced between two of the V indication bits in each slot block is greater than or equal to 8.

In some possible implementations, the number of bits separated between any two indication bits of the V indication bits in each slot block is greater than or equal to 8.

In some possible implementations, V=2, and the two indicator bits in each slot block are respectively at the first bit position and the last bit position of the slot block. Or, one of the two indication bits in each time slot block is at the first bit position of the time slot block, and there is an interval between the two indication bits. or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.

In some possible implementations, N ₁ =2, and the N ₁ preset bit sequences include a first bit sequence and a second bit sequence, and the lengths of the first bit sequence and the second bit sequence are both W. The first bit sequence is all 0s, and the second bit sequence is all 1s. Or, the first bit of the first bit sequence is 1, and the values of two adjacent bits in the first bit sequence are different; the first bit of the second bit sequence is 0, and the values of the second bits are different. The values of two adjacent bits in the special sequence are different.

In some possible implementations, every two adjacent time slot blocks in the P time slot blocks have the same interval in the data frame.

In some possible implementations, the value of B is 8, 16, 24, 32, 48 or 64.

In some possible implementations, the plurality of time slot block sets include a first time slot block set, and the first time slot block set includes a first indication bit set and a first byte set. The W indication bits in the first indication bit set are used to indicate the amount of data and/or the amount of padding and/or the position of the data and/or the position of the padding carried by the first byte set.

In some possible implementations, the plurality of time slot block sets include a first time slot block set and a second time slot block set, and the first time slot block set includes a first indication bit set and a first byte set. The second slot block set includes a second indication bit set and a second byte set. The W indication bits in the first indication bit set are used to indicate the amount of data and/or the amount of padding and/or the position of the data and/or the position of the padding carried by the second byte set.

In some possible implementations, the plurality of time slot block sets include a first time slot block set, a second time slot block set, and a third time slot block set. The first time slot block set includes a first indicator bit set and a first byte set, the second time slot block set includes a second indicator bit set and a second byte set, and the third time slot block set includes a third indicator bit set. and the third byte set. The N ₁ preset bit sequences include a first type bit sequence and a second type bit sequence. When the W indicator bits in the first indicator bit set are the first type of bit sequences, the W indicator bits in the first indicator bit set are used to indicate the quantity and/or padding of the data carried by the second byte set. Quantity and/or location of data and/or location of fill. When the W indicator bits in the first indicator bit set are second type bit sequences, the W indicator bits in the first indicator bit set are used to indicate the quantity and/or padding of the data carried by the third byte set. Quantity and/or location of data and/or location of fill.

In a second aspect, embodiments of the present application provide a data transmission method, which includes the following steps. First, the data is mapped to a data frame, and then the data frame is sent. Specifically, the data frame includes multiple time slot blocks, each time slot block includes V indication bits and B bytes, the integer V≥2, and the integer B≥1. The object carried by B bytes includes at least one of data and padding. The number of bits spaced between two of the V indication bits is greater than or equal to 8. The V indicator bits are one of N preset bit sequences. The Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2, and the integer N≥2. Each preset bit sequence is used to indicate the type of object carried by B bytes. The type of object carried by B bytes is one of the object type sets. The object type set includes all objects carried by B bytes. It is data, the object carried by B bytes is all padding, and the object carried by B bytes includes data and padding.

In some possible implementations, V=2, N=2; the two preset bit sequences are 00 and 11 respectively, or the two preset bit sequences are 01 and 10 respectively.

In some possible implementations, the two indication bits are respectively at the first bit position and the last bit position of the time slot block. Or, one of the two indication bits is at the first bit position of the time slot block, and there is an interval between the two indication bits. or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.

In some possible implementations, V=3, N=2. The 2 preset bit sequences are 000 and 111 respectively, or the 2 preset bit sequences are 110 and 001 respectively, or the 2 preset bit sequences are 110 and 001 respectively. The bit sequences are 101 and 010 respectively, or the 2 preset bit sequences are 011 and 100 respectively.

In some possible implementations, the first indication bit among the three indication bits is at the first bit position of the time slot block, and there is an interval between the second indication bit and the first indication bit among the three indication bits. or Bytes, the third indication bit among the 3 indication bits is at the last bit position of the time slot block. Alternatively, the first indication bit among the 3 indication bits is at the first bit position of the slot block, the second indication bit among the 3 indication bits is at the second bit position of the slot block, and the third indication bit among the 3 indication bits is bit in the last bit position of the slot block. Alternatively, the first indication bit among the 3 indication bits is at the first bit position of the slot block, the second indication bit among the 3 indication bits is at the second bit position of the slot block, and the third indication bit among the 3 indication bits is The interval between the bit and the second indication bit or bytes. Or, the first indication bit among the three indication bits is at the first bit position of the time slot block, the second indication bit among the three indication bits is separated from the first indication bit by B bytes, and the third indication bit among the three indication bits is The three indicator bits are in the last bit position of the slot block. in, means rounding down the real number a, Indicates rounding up the real number a.

In some possible implementations, the number of bits separated between any two indication bits among the V indication bits is greater than or equal to 8.

In some possible implementations, the value of B is 8, 16, 24, 32, 48 or 64.

In some possible implementations, the set of object types includes B bytes carrying objects that are all data and B bytes carrying objects that are all padding.

In some possible implementations, the set of object types includes B bytes carrying objects that are all data and B bytes carrying objects that include a fixed amount of data and padding.

In some possible implementations, V indication bits are used to indicate the amount of data and/or the amount of padding and/or the location of data and/or the location of padding carried by B bytes.

In some possible implementations, the object carried by B bytes includes data and padding, and among the B bytes, the bytes used to carry data are located before the bytes used to carry padding.

In some possible implementations, the object carried by the B bytes includes padding, and some of the bits used to carry the padding in the B bytes are one of the preset indication sequences, and the indication sequence includes multiple bits. The indication sequence is used to indicate the amount of data carried by B bytes and/or the amount of padding and/or the position of data and/or the position of padding.

In a third aspect, embodiments of the present application provide a data transmission device. The data transmission device includes: a mapping unit and a sending unit. The mapping unit is used to map data to data frames, and the sending unit is used to send data frames. Specifically, the data frame includes multiple time slot block sets, each time slot block set includes P time slot blocks, each time slot block includes V indication bits and B bytes, integer V≥1, integer B≥ 1. The object carried by B bytes includes at least one of data and padding. Each time slot block set includes a byte set, and the byte set includes B bytes of each time slot block in the time slot block set, totaling B×P bytes. Each time slot block set includes a set of indicator bits, and the indicator bit set includes V indicator bits for each time slot block in the time slot block set, totaling V×P indicator bits. The W indicator bits in the indicator bit set are one of N ₁ preset bit sequences, the integer P ≥ 2, the integer N ₁ ≥ 1, 1<W≤V×P. The Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 2.

In some possible embodiments, W≥3. When N ₁ =3 or 4, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to When N ₁ =5 or 6 or 7 or 8, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to in, Indicates rounding down the real number a.

In some possible implementations, N ₁ =2, and the N ₁ preset bit sequences include a first bit sequence and a second bit sequence, and the lengths of the first bit sequence and the second bit sequence are both W. The first bit sequence is all 0s, and the second bit sequence is all 1s. Or, the first bit of the first bit sequence is 1, and the values of two adjacent bits in the first bit sequence are different; the first bit of the second bit sequence is 0, and the values of adjacent bits in the second bit sequence are different. The values of the two bits are different.

In some possible implementations, the value of B is 8, 16, 24, 32, 48 or 64.

In some possible implementations, the plurality of time slot block sets include a first time slot block set, a second time slot block set, and a third time slot block set. The first time slot block set includes a first indicator bit set and a first byte set, the second time slot block set includes a second indicator bit set and a second byte set, and the third time slot block set includes a third indicator bit set. and the third byte set. N ₁ preset bit sequences include the first type of bit sequence columns and type 2 bit sequences. When the W indicator bits in the first indicator bit set are the first type of bit sequences, the W indicator bits in the first indicator bit set are used to indicate the quantity and/or padding of the data carried by the second byte set. Quantity and/or location of data and/or location of fill. When the W indicator bits in the first indicator bit set are second type bit sequences, the W indicator bits in the first indicator bit set are used to indicate the quantity and/or padding of the data carried by the third byte set. Quantity and/or location of data and/or location of fill.

In a fourth aspect, embodiments of the present application provide a data transmission device. The data transmission device includes: a mapping unit and a sending unit. The mapping unit is used to map data to data frames, and the sending unit is used to send data frames. Specifically, the data frame includes multiple time slot blocks, each time slot block includes V indication bits and B bytes, the integer V≥2, and the integer B≥1. The object carried by B bytes includes at least one of data and padding. The number of bits spaced between two of the V indication bits is greater than or equal to 8. The V indicator bits are one of N preset bit sequences. The Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2, and the integer N≥2. Each preset bit sequence is used to indicate the type of object carried by B bytes. The type of object carried by B bytes is one of the object type sets. The object type set includes all objects carried by B bytes. It is data, the object carried by B bytes is all padding, and the object carried by B bytes includes data and padding.

In some possible implementations, the value of B is 8, 16, 24, 32, 48 or 64.

In some possible implementations, the object carried by the B bytes includes padding, and some of the bits used to carry the padding in the B bytes are one of the preset indication sequences, and the indication sequence includes multiple bits. The indication sequence is used to indicate the amount of data in the object carried by B bytes, and/or the indication sequence is used to indicate the amount of data carried by B bytes and/or the amount of padding and/or the position of the data and/or Filled position.

In a fifth aspect, embodiments of the present application provide a data transmission method, which includes the following steps. First, the data frame is received, and then the data frame is demapped to obtain the data. Specifically, the data frame includes multiple time slot block sets, each time slot block set includes P time slot blocks, each time slot block includes V indication bits and B bytes, integer V≥1, integer B≥ 1. The object carried by B bytes includes data and padding in at least one. Each time slot block set includes a byte set, and the byte set includes B bytes of each time slot block in the time slot block set, totaling B×P bytes. Each time slot block set includes a set of indicator bits, and the indicator bit set includes V indicator bits for each time slot block in the time slot block set, totaling V×P indicator bits. The W indicator bits in the indicator bit set are one of N ₁ preset bit sequences, the integer P ≥ 2, the integer N ₁ ≥ 1, 1<W≤V×P. The Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 2.

In a sixth aspect, embodiments of the present application provide a data transmission method, which includes the following steps. First, the data frame is received, and then the data frame is demapped to obtain the data. Specifically, the data frame includes multiple time slot blocks, each time slot block includes V indication bits and B bytes, the integer V≥2, and the integer B≥1. The object carried by B bytes includes at least one of data and padding. The number of bits spaced between two of the V indication bits is greater than or equal to 8. The V indicator bits are one of N preset bit sequences. The Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2, and the integer N≥2. Each preset bit sequence is used to indicate the type of object carried by B bytes. The type of object carried by B bytes is one of the object type sets. The object type set includes all objects carried by B bytes. It is data, the object carried by B bytes is all padding, and the object carried by B bytes includes data and padding.

In a seventh aspect, embodiments of the present application provide a data transmission device. The data transmission device includes: a receiving unit and a demapping unit. The receiving unit is used to receive data frames, and the demapping unit is used to demap the data frames to obtain data. Specifically, the data frame includes multiple time slot block sets, each time slot block set includes P time slot blocks, each time slot block includes V indication bits and B bytes, integer V≥1, integer B≥ 1. The object carried by B bytes includes at least one of data and padding. Each time slot block set includes a byte set, and the byte set includes B bytes of each time slot block in the time slot block set, totaling B×P bytes. Each time slot block set includes a set of indicator bits, and the indicator bit set includes V indicator bits for each time slot block in the time slot block set, totaling V×P indicator bits. The W indicator bits in the indicator bit set are one of N ₁ preset bit sequences, the integer P ≥ 2, the integer N ₁ ≥ 1, 1<W≤V×P. The Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 2.

In an eighth aspect, embodiments of the present application provide a data transmission device. The data transmission device includes: a receiving unit and a demapping unit. The receiving unit is used to receive data frames, and the demapping unit is used to demap the data frames to obtain data. Specifically, the data frame includes multiple time slot blocks, each time slot block includes V indication bits and B bytes, the integer V≥2, and the integer B≥1. The object carried by B bytes includes at least one of data and padding. The number of bits spaced between two of the V indication bits is greater than or equal to 8. The V indicator bits are one of N preset bit sequences. The Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2, and the integer N≥2. Each preset bit sequence is used to indicate the type of object carried by B bytes. The type of object carried by B bytes is one of the object type sets. The object type set includes all objects carried by B bytes. It is data, the object carried by B bytes is all padding, and the object carried by B bytes includes data and padding.

Description of drawings

Figure 1 is a schematic diagram of a possible application scenario of the embodiment of the present application;

Figure 2 is a schematic diagram of a possible network device hardware structure;

Figure 3 is a schematic diagram of the frame structure of an OTN frame;

Figure 4 is a schematic flow chart of a data transmission method in an embodiment of the present application;

Figure 5 is a schematic structural diagram of an OTN frame provided by this application;

Figure 6 is a schematic structural diagram of another OTN frame provided by this application;

Figure 7 is a schematic structural diagram of the first time slot block in this application;

Figure 8 is a schematic diagram of the second structure of the time slot block in this application;

Figure 9 is a schematic diagram of the third structure of the time slot block in this application;

Figure 10 is a schematic diagram of the fourth structure of the time slot block in this application;

Figure 11 is a schematic diagram of the fifth structure of the time slot block in this application;

Figure 12 is a schematic diagram of the sixth structure of the time slot block in this application;

Figure 13 is a schematic diagram of the seventh structure of the time slot block in this application;

Figure 14 is a schematic diagram of the eighth structure of the time slot block in this application;

Figure 15 is a schematic diagram of the ninth structure of the time slot block in this application;

Figure 16 is a schematic diagram of the tenth structure of the time slot block in this application;

Figure 17 is a schematic diagram of the eleventh structure of the time slot block in this application;

Figure 18 is a schematic diagram of the twelfth structure of the time slot block in this application;

Figure 19 is a schematic diagram of the thirteenth structure of the time slot block in this application;

Figure 20 is a schematic structural diagram of the fourteenth time slot block in this application;

Figure 21 is a schematic diagram of multiple time slot block sets in this application;

Figure 22 is a schematic structural diagram of the first type of data judgment processing in this application;

Figure 23 is a schematic diagram of the second structure of data judgment processing in this application;

Figure 24 is a schematic diagram of the third structure of data judgment processing in this application;

Figure 25 is a schematic diagram of the fourth structure of data judgment processing in this application;

Figure 26 is a schematic diagram of the fifth structure of data judgment processing in this application;

Figure 27 is a schematic structural diagram of a data control and instruction process in this application;

Figure 28 is a schematic structural diagram of a data transmission device in an embodiment of the present application;

Figure 29 is another structural schematic diagram of a data transmission device in an embodiment of the present application;

Figure 30 is another schematic structural diagram of a data transmission device in an embodiment of the present application.

Detailed ways

In order to facilitate understanding of the embodiments of the present application, the following description is provided.

First, the terms "first", "second", etc. and various numerical numbers in the description of the embodiments of the present application or in the drawings shown below are only for convenience of description and are not necessarily used for distinction. Describing a specific sequence or sequence is not intended to limit the scope of the embodiments of the present application. For example, distinguish between different data frames, etc.

Second, the terms "including" and "having" and any variations thereof in the embodiments of the present application shown below are intended to cover non-exclusive inclusions, for example, processes, methods, and systems that include a series of steps or units. , products, or devices need not be limited to those steps or units that are expressly listed, but may include other steps or units that are not expressly listed or that are inherent to the processes, methods, products, or devices.

Third, in the embodiments of this application, words such as "exemplary" or "for example" are used to express examples, illustrations or illustrations, and embodiments or designs described as "exemplary" or "for example" should not are to be construed as preferred or advantageous over other embodiments or designs. The use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete manner that is easier to understand.

Fourth, in the embodiment of this application, service data refers to services carried by the optical transmission network or the metropolitan area transmission network. For example, it can be Ethernet services, packet services, wireless backhaul services, etc. Business data can also be called business signals, customer data or customer business data. It should be understood that the type of service data is not limited in the embodiment of this application.

Fifth, in the embodiment of this application, "for instructions" may include direct instructions and indirect instructions. When describing certain information to indicate A, it may include that the information directly indicates A or indirectly indicates A, but it does not mean that the information must contain A.

Sixth, in the embodiment of this application, only the OTN frame is used as an example to illustrate the embodiment. It should be understood that in future technology development, this application is also applicable to other bearer OTN frames and MTN frames.

Seventh, in the embodiment of this application, "preset" may include predefined definitions, for example, protocol definitions. Among them, "pre-definition" can be realized by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in the device. This application does not limit its specific implementation method.

Figure 1 is a schematic diagram of a possible application scenario according to the embodiment of the present application. As shown in Figure 1, embodiments of the present application are applicable to optical networks, such as optical transport networks (optical transport network, OTN). An OTN is usually composed of multiple devices connected through optical fibers, and can be formed into different topology types such as linear, ring, and mesh according to specific needs. The OTN 100 shown in Figure 1 consists of 8 OTN devices 101, namely device AH. Among them, 102 indicates the optical fiber, used to connect two devices; 103 indicates the customer service interface, used to receive or send customer service data. As shown in Figure 1, OTN100 is used to transmit service data for client devices 1-3. Customer equipment communicates with OTN equipment through customer service interfaces connected. For example, in Figure 1, client devices 1-3 are connected to OTN devices A, H and F respectively.

Depending on actual needs, an OTN device may have different functions. Generally speaking, OTN equipment is divided into optical layer equipment, electrical layer equipment and optical and electrical hybrid equipment. Optical layer equipment refers to equipment that can process optical layer signals, such as: optical amplifier (optical amplifier, OA), optical add-drop multiplexer (optical add-drop multiplexer, OADM). OA, also known as optical line amplifier (OLA), is mainly used to amplify optical signals to support transmission over longer distances while ensuring specific performance of optical signals. OADM is used to spatially transform optical signals so that they can be output from different output ports (sometimes called directions). Electrical layer equipment refers to equipment that can process electrical layer signals, such as equipment that can process OTN signals. Optoelectronic hybrid equipment refers to equipment that has the ability to process optical layer signals and electrical layer signals. It should be noted that, depending on specific integration needs, an OTN device can integrate a variety of different functions. The technical solution provided in this application is suitable for OTN equipment containing electrical layer functions of different forms and integration levels.

It should be noted that the data frame structure used by the OTN device in the embodiment of this application is an OTN frame, which is used to carry various business data and provide rich management and monitoring functions.

It should be noted that the OTN frame can be an optical data unit frame (Optical Data Unit k, ODUk), ODUCn, ODUflex, or an optical channel transmission unit k (optical transport unit k, OTUk), OTUCn, or a flexible OTN (FlexO) frame wait. Among them, the OTU frame includes the ODU frame and OTU overhead. k represents different rate levels, for example, k=1 represents 2.5Gbps, k=4 represents 100Gbps; Cn represents a variable rate, specifically a rate that is a positive integer multiple of 100Gbps.

It should be noted that the ODU frame refers to any one of ODUk, ODUCn or ODUflex, and the OTU frame refers to any one of OTUk, OTUCn or FlexO. It should also be noted that with the development of OTN technology, new types of OTN frames may be defined, which are also applicable to this application.

Figure 2 is a schematic diagram of a possible network device hardware structure. For example, the network device may be device A in Figure 1. As shown in Figure 2, the OTN device 200 includes a tributary board 201, a cross-connect board 202, a circuit board 203, an optical layer processing board (not shown in the figure), and a system control and communication board 204. Depending on specific needs, network equipment may contain different types and numbers of boards. For example, a network device serving as a core node does not have a tributary board 201 . For another example, a network device serving as an edge node has multiple tributary boards 201 or no optical cross-connect board 202 . For another example, network equipment that only supports electrical layer functions may not have optical layer processing boards.

The branch board 201, the cross-connect board 202 and the circuit board 203 are used to process the electrical layer signals of the OTN. Among them, the tributary board 201 is used to realize the reception and transmission of various customer services, such as SDH services, packet services, Ethernet services and fronthaul services. Furthermore, the tributary board 201 can be divided into a client-side optical transceiver module and a signal processor. Among them, the client-side optical transceiver module can also be called an optical transceiver and is used to receive and/or send service data. The signal processor is used to implement mapping and demapping of business data to data frames. The cross-connect board 202 is used to realize the exchange of data frames and complete the exchange of one or more types of data frames. The circuit board 203 mainly implements the processing of line-side data frames. Specifically, the circuit board 203 can be divided into a line-side optical module and a signal processor. Among them, the line side optical module can be called an optical transceiver and is used to receive and/or send data frames. The signal processor is used to implement multiplexing and demultiplexing, or mapping and demapping processing of data frames on the line side. The system control and communication single board 204 is used to implement system control. Specifically, information can be collected from different boards, or control instructions can be sent to the corresponding boards.

It should be noted that, unless otherwise specified, a specific component (such as a signal processor) may be one or more, and is not limited in this application.

It should be noted that this application does not impose any restrictions on the types of boards included in the equipment, as well as the functional design and quantity of the boards.

It should be noted that in specific implementation, the above two single boards may also be designed as one single board. In addition, network equipment may also include power supplies for backup, fans for cooling, etc.

It should be noted that the above content is an exemplary description of the application scenarios of the data transmission method provided by the embodiment of the present application, and does not constitute a limitation on the application scenarios of the data transmission method. Persons of ordinary skill in the art will know that as business needs evolve, Changes and application scenarios can be adjusted according to application requirements, and the embodiments of this application do not list them one by one.

Figure 3 is a schematic diagram of the frame structure of an OTN frame. As shown in Figure 3, the OTN frame is a frame structure with four rows and multiple columns, including an overhead area and a payload area. It should be noted that some OTN frame structures also include Forward Error Correction (FEC) areas. Specifically, the OTN frame structure can refer to the relevant descriptions in the current ITU-T, which will not be described again here. It should be understood that the above description of the OTN frame structure is only an example. Other deformed OTN frames are also applicable to this application. For example, OTN frames that do not contain the FEC area. Another example is a frame structure with a different number of rows and columns than an OTN frame. Divide the payload area of the OTN frame to include multiple payload blocks (Payload Block, PB). Each PB occupies a fixed-length (also called size) position in the payload area, such as 128 bytes. It should be understood that PB can also be called time slot, time slot Blocks or time slices, etc., this application does not impose restrictions on their names. For ease of introduction, time slot blocks are used to represent PB in the following text.

For example, the overhead that an OTN frame may include is shown in Table 1 below.

Table 1

Figure 4 is a schematic flowchart of a data transmission method in an embodiment of the present application.

401. Map data to data frame.

In this embodiment, the data frame includes multiple time slot blocks, and each time slot block includes indication bits and bytes. The indication bit is used to indicate the type of object carried by the bytes in the specified slot block. The object carried by bytes includes at least one of data and stuff. It should be understood that filling refers to other types of information besides data, which is not specifically limited in this application. For example, the padding can be random information. For another example, the filling can also be information of a fixed pattern. For another example, padding can also be information with fixed constraints, such as a sequence with error correction and error detection capabilities. For another example, the filling may be partly random information and partly fixed pattern information.

The data frame may specifically be an OTN frame. The structure of several OTN frames provided by this application will be introduced below.

Considering the OPU0 frame, the frequency offset is ±20ppm, the nominal rate is 238/239×1244.160Mbits/s≈1238.95431Mbits/s, and the minimum rate is 1238.95431Mbits/s×(1-20×10 ^-6 )≈1238.929531 Mbits/s. Consider a packet service with a nominal signal rate of 10Mbits/s, a frequency offset of ±100ppm, and 64B/66B encoding. The maximum rate is 10Mbits/s×(1+100×10 ^-6 )×(66/64)≈10.31353125Mbits/s. Since (1238.929531Mbits/s)/(10.31353125Mbits/s)≈120.1. At this time, considering transmission efficiency, it is a better choice to use 119 or 120 timeslots.

Figure 5 is a schematic structural diagram of an OTN frame provided by this application. As shown in Figure 5, its OPU frame includes 119 time slots, each time slot carries 10M services, such as TS#1, TS#2,..., TS#119 in Figure 5. In this application, time slot #i carries a time slot block of length V+8B bits, including V indicator bits and B bytes, and the next time slot is time slot #i+1. The slot after slot #119 is slot #1. A slot cycle is defined to consist of 119 consecutive blocks of slots. As shown in Figure 5, the first time slot #1 carries a V+8B bit of a certain service flow, and the second time slot #1 carries the next V+8B bit of a certain service flow. The same time slot carries data or padding from the same service flow.

Figure 6 is a schematic structural diagram of an OTN frame provided by this application. As shown in Figure 6, its OPU frame includes 120 time slots, each time slot carries 10M services, such as TS#1, TS#2,..., TS#120 in Figure 6. In this application, time slot #i carries a time slot block of length V+8B bits, including V indicator bits and B bytes, and the next time slot is time slot #i+1. The slot after slot #120 is slot #1. A slot cycle is defined to consist of a continuous block of 120 slots. As shown in Figure 6, the first time slot #1 carries a V+8B bit of a certain service flow, and the second time slot #1 carries the next V+8B bit of a certain service flow. The same time slot carries data or padding from the same service flow. The OTN frame shown in Figure 6 carries a higher service rate than that in Figure 5.

It should be noted that if we consider a packet service with a nominal signal rate of 10Mbits/s and a frequency offset of ±100ppm, a more efficient line coding (transcode) operation is performed after 64B/66B encoding, such as 256B/257B encoding, the minimum rate at this time is 10Mbits/s×(1+100×10 ^-6 )×(257/256)≈10.04006641Mbits/s. Since (1238.929531Mbits/s)/(10.04006641Mbits/s)≈123.4. At this time, the number of time slot blocks that the OPU0 frame can carry does not exceed 123. At this time, the data frame structure can be referred to the above-mentioned Figure 5 and Figure 6, and will not be described again here. Based on the above constraints of the actual service rate and OPU frame rate, the number of time slots considered in the OTN frame in the embodiment of this application can be one of 119, 120, 121, 122 and 123. The specific implementation method can be simply extended according to this embodiment, which is the best method in this field. It is known to ordinary skilled persons and will not be described in detail here.

402. Send data frame.

It should be understood that the above embodiment shown in Figure 4 introduces the processing flow of the sending end. For the receiving end, the receiving end receives the data frame sent by the sending end, and then demaps the data frame to obtain the data. Among them, demapping can be understood as the inverse operation of mapping, which will not be described again here.

It should be noted that the design scheme of the data frame provided by this application can be divided into two types, which will be introduced respectively below.

Scheme 1: The data frame includes multiple time slot blocks, each time slot block includes V indicator bits and B bytes, integer V≥2, integer B≥1. The object carried by B bytes includes at least one of data and padding. The number of bits spaced between two of the V indication bits is greater than or equal to 8. The V indicator bits are one of N preset bit sequences. The Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2, and the integer N≥2. Each preset bit sequence is used to indicate the type of object carried by B bytes. The type of objects carried by B bytes is one of the following situations: (1) The objects carried by B bytes are all data; (2) The objects carried by B bytes are all padding; (3) Bytes carry objects including data and padding.

It should be understood that for the case where the object carried by B bytes includes data and padding, all the bits in a certain byte may be used to carry data, or all the bits may be used to carry padding. Or, some bits in a byte are used to carry data, and another part of the bits are used to carry padding.

It should be noted that among the N preset bit sequences, the length of each bit sequence is V bits. The Hamming distance represents the number of positions where corresponding bits in two bit sequences are different, which is known to those of ordinary skill in the art and will not be described in detail here. For example, if bit sequence 1 is 10 and bit sequence 2 is 01, then the Hamming distance between bit sequence 1 and bit sequence 2 is 2. For another example, if bit sequence 1 is 101 and bit sequence 2 is 010, then the Hamming distance between bit sequence 1 and bit sequence 2 is 3.

In a possible implementation, V=2, N=2; the two preset bit sequences are 00 and 11 respectively, or the two preset bit sequences are 01 and 10 respectively. In another possible implementation, V=3, N=2; the 2 preset bit sequences are 000 and 111 respectively, or the 2 preset bit sequences are 110 and 001 respectively, or 2 The preset bit sequences are 101 and 010 respectively, or the two preset bit sequences are 011 and 100 respectively.

It should be noted that in some specific embodiments, when the objects carried by B bytes are not all data, the specific amount of data carried by B bytes is fixed. At this time, the data carried by B bytes and The matching relationship between fillings is constrained. As an example, B bytes The type of object carried can only be one of the following two situations: (1) The objects carried by B bytes are all data. (2) The objects carried by B bytes are all filled. As another example, the type of object carried by B bytes can only be one of the following two situations: (1) The objects carried by B bytes are all data. (2) The object carried by B bytes includes a fixed amount of data and padding.

In some possible implementations, the value of B is 8, 16, 24, 32, 48 or 64, and the value of V is 2 or 3. When designing the value of B in this application, the value can be determined based on the maximum allowable jitter of service transmission. For example, for an optical service unit (OSU) positioned for 10M granular service transmission, it is usually necessary to ensure that the service does not have excessive jitter on the transmission path and that high-quality services require end-to-end (taking 20 stations as an example) ) transmission delay jitter should not be greater than 500us. The value of B will determine the transmission jitter and transmission delay of the 10M granularity service. Combined with the implementation cost of the chip, the value of B can be 8, 16, 24, or 32. In some scenarios where the delay and jitter requirements are not strict, the value of B can also be extended to 48, 64, etc. Given the values of B and V, the bit length of the slot block is V+8×B, and the corresponding overhead is At the same time, given the value of B, the larger the value of V, the greater the overhead of the slot block. When designing the values of B and V, it is necessary to consider the effective trade-off between overhead, jitter and delay.

Specifically, V indication bits may be used to indicate the amount of data and/or the amount of padding and/or the position of data and/or the position of padding carried by B bytes. That is to say, the V indication bits can indicate how many bits among the B bytes are used to carry data, how many bits are used to carry padding, which bits are used to carry data, and which bits are used to carry padding. In a possible implementation, if the object carried by the B bytes includes data and padding, the bytes used to carry the data among the B bytes are located before the bytes used to carry the padding.

It should be noted that, since the number of bits separated between two of the V indication bits is greater than or equal to 8, the V indication bits are not all arranged continuously together in the time slot block. When the OTN frame adopts RS (255, 239) encoding, each RS symbol including 8 bits includes at most some of the V indication bits. This makes the designed data transmission method highly reliable. In a specific implementation manner, the number of bits separated between any two indication bits among the V indication bits is greater than or equal to 8. Taking V=3 as an example, that is to say, any two indication bits among the three indication bits The number of bits between them is greater than or equal to 8. When the OTN frame adopts RS (255, 239) encoding, each RS symbol including 8 bits includes at most one bit among the V indication bits. Since RS decoding is based on the symbol domain, when an RS symbol is decoded incorrectly, at most one indicator bit will be affected. Considering that the Hamming distance of any two bit sequences in the N preset first indication sequences is greater than or equal to 2, an error in one indication bit can be detected, making the designed data transmission method more reliable.

It should be noted that for some OTN frames, the bytes in each row are encoded using 16 parallel RS (255,239). For details, please refer to the relevant descriptions in the current ITU-T protocol. At this time, by selecting appropriate values of V and B, the same RS codeword can contain at most 1 bit among the V indication bits. At this time, when an RS decoding error occurs for an RS codeword, at most one indicator bit will be affected, making the designed data transmission method more reliable.

Several specific implementations of the distribution positions of the V indication bits are introduced below, so that the indication bits can be evenly distributed in the data frame. It should be understood that the number of bytes spaced between two indication bits in the following implementations is just some examples. In practical applications, any non-zero number of bytes spaced between two indication bits is feasible.

Embodiment 1: V=2, interval between 2 indication bits or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.

Figure 7 is a schematic structural diagram of the first time slot block in this application. As shown in Figure 7, the time slot block length is 130 bits, and each time slot block corresponds to 1 time slot. The structure of each slot block includes V=2 indication bits and B=16 bytes. The two indication bits are the first indication bit and the second indication bit. The first indication bit is at the first bit position of the time slot block, and the second indication bit is separated from the first indication bit by 8 bytes.

Embodiment 2: V=2, the two indicator bits are respectively at the first bit position and the last bit position of the time slot block.

Figure 8 is a schematic diagram of the second structure of the time slot block in this application. As shown in Figure 8, the time slot block length is 130 bits, and each time slot block corresponds to 1 time slot. The structure of each slot block includes V=2 indication bits and B=16 bytes. The two indication bits are the first indication bit and the second indication bit. The first indication bit is at the first bit position of the slot block, and the second indication bit is at the last bit position of the slot block.

Embodiment 3: V=3, the first indication bit is at the first bit position of the time slot block, and there is an interval between the second indication bit and the first indication bit. or Bytes, the third indicator bit is in the last bit position of the slot block.

Figure 9 is a third structural schematic diagram of the time slot block in this application. As shown in Figure 9, the time slot block length is 195 bits, and each time slot block corresponds to 1 time slot. The structure of each slot block includes V=3 indication bits and B=24 bytes. The three indication bits are the first indication bit, the second indication bit and a third indication bit. The first indication bit is at the first bit position of the time slot block, the second indication bit is 12 bytes away from the first indication bit, and the third indication bit is at the last bit position of the time slot block.

Embodiment 4: V=3, the first indication bit is at the first bit position of the slot block, the second indication bit is at the second bit position of the slot block, and the third indication bit is at the last bit of the slot block Location.

Figure 10 is a schematic diagram of the fourth structure of the time slot block in this application. As shown in Figure 10, the time slot block length is 195 bits, and each time slot block corresponds to 1 time slot. The structure of each slot block includes V=3 indication bits and B=24 bytes. The three indication bits are the first indication bit, the second indication bit and the third indication bit. The first indication bit is at the first bit position of the time slot block, the second indication bit is at the second bit position of the time slot block, and the third indication bit is at the last bit position of the time slot block.

Embodiment 5: V=3, the first indication bit is at the first bit position of the slot block, the second indication bit is at the second bit position of the slot block, and there is an interval between the third indication bit and the second indication bit. or bytes.

Figure 11 is a schematic diagram of the fifth structure of the time slot block in this application. As shown in Figure 11, the time slot block length is 195 bits, and each time slot block corresponds to 1 time slot. The structure of each slot block includes V=3 indication bits and B=24 bytes. The three indication bits are the first indication bit, the second indication bit and the third indication bit. The first indication bit is in the first bit position of the time slot block, the second indication bit is in the second bit position of the time slot block, and there is an interval of 12 bytes between the third indication bit and the second indication bit.

Embodiment 6: V=3, the first indication bit is at the first bit position of the time slot block, the second indication bit is separated from the first indication bit by B bytes, and the third indication bit is at the end of the time slot block. a bit position.

Figure 12 is a schematic diagram of the sixth structure of the time slot block in this application. As shown in Figure 12, the time slot block length is 195 bits, and each time slot block corresponds to 1 time slot. The structure of each slot block includes V=3 indication bits and B=24 bytes. The three indication bits are the first indication bit, the second indication bit and the third indication bit. The first indication bit is at the first bit position of the time slot block, the second indication bit is spaced 24 bytes from the first indication bit, and the third indication bit is at the last bit position of the time slot block.

It should be noted that when the object carried by the B bytes includes padding, some of the bits used to carry the padding in the B bytes are one of the preset indication sequences, where the indication sequence includes multiple bits. That is to say, some of the bits used to carry padding in the B bytes can be used as an indication sequence, and the indication sequence can be combined with the indication bits to indicate the type of object carried by the B bytes. More specifically, the indication sequence may be used to indicate the amount of data and/or the amount of padding and/or the location of data and/or the location of padding in the object carried by B bytes. It should be understood that the indication sequence may occupy part or all of one padding bit, or the indication sequence may also occupy multiple padding bits.

Several specific examples in which the time slot block includes an indication sequence are introduced below. In order to facilitate distinction, in the following examples, the two indication bits are respectively recorded as the first indication bit and the second indication bit, and the indication sequence is recorded as the third indication sequence.

Figure 13 is a schematic diagram of the seventh structure of the time slot block in this application. As shown in Figure 13, when the first indication bit and the second indication bit are 0 and 1 respectively, the objects carried by bytes 1-16 are all service data. When the first indication bit and the second indication bit are 1 and 0 respectively, not all objects carried by bytes 1-16 are service data. It should be noted that in some specific embodiments, when the first indication bit and the second indication bit are 1 and 0 respectively, the objects carried by bytes 1-16 are all service data. When the first indication bit and the second indication bit are 0 and 1 respectively, not all objects carried by bytes 1-16 are service data. The specific implementation method can be simply extended according to this embodiment, which is known to those of ordinary skill in the art and will not be described again here.

The 2 indication bits are one of 2 preset bit sequences, of which 1 preset bit sequence is used to indicate that the objects carried by the 16 bytes are all data, and the other 1 preset bit sequence is used to indicate Not all objects carried by 16 bytes are data. More specifically, if the objects carried by the 16 bytes are not all data, it is one of the following situations: (1) the objects carried by the B bytes are all padding; (2) the objects carried by the B bytes are data and padding. It should be noted that the type of the preset bit sequence is considered to be padding.

When the objects carried by the 16 bytes are not all data, in order to more specifically indicate the type of objects carried by bytes 1-16, byte 1 is used as the third indication sequence, which can be 16 preset indication sequences {the third indication Sequence 0, third indication sequence 1,..., one of the third indication sequence 15}. The third indication sequence i (0≤i<16) indicates that there are i bytes of data in bytes 2-16, and when i>0, byte 2 to byte i+1 are data. In a specific implementation, the 16 preset bit sequences are the 16 codewords of (8,4) extended Hamming code, which have a correction ratio of 1 Special error, the ability to detect 2-bit errors.

Figure 14 is a schematic diagram of the eighth structure of the time slot block in this application. As shown in Figure 14, the difference from the time slot block shown in Figure 13 above is that the third indication sequence i (0≤i<16) can represent a total of i bytes of data in bytes 1-16, and for i When >0, a total of i bytes from byte (17-i) to byte 16 are data. It should be noted that in some specific implementations, the third indication sequence i (0≤i<16) may also represent a total of 16-i bytes of padding among bytes 1-16. Here, the type of the third indication sequence (ie, byte 1) is considered to belong to padding.

Figure 15 is a schematic structural diagram of the ninth time slot block in this application. As shown in Figure 15, the difference from the time slot block shown in Figure 13 and Figure 14 above is that when the objects carried by the 16 bytes are not all data, in order to more specifically indicate the type of objects carried by bytes 1-16, the word Section 16 serves as the third indication sequence, which may be one of 16 preset indication sequences {third indication sequence 0, third indication sequence 1, ..., third indication sequence 15}. The third indication sequence i (0≤i<16) represents a total of i bytes of data in bytes 1-16.

Figure 16 is a schematic diagram of the tenth structure of the time slot block in this application. As shown in Figure 16, the difference from the time slot block shown in Figure 13 above is that the second indication bit is located at the last bit position of the time slot block. In order to more specifically indicate the object type carried by bytes 1-16, byte 1 is used as the third indication sequence, which can be 16 preset indication sequences {third indication sequence 0, third indication sequence 1,..., third Indicates one of the sequences 15}. The third indication sequence i (0≤i<16) indicates that there are i bytes of data in bytes 1-16, and when i>0, byte 2 to byte i+1 are data. It should be noted that when the objects carried by the 16 bytes are not all data, in order to more specifically indicate the object type carried by bytes 1-16, byte 1 is used as another indication bit sequence, and its corresponding preset bit sequence is The number may be less than 16, that is, {third indication sequence 0, third indication sequence 1, ..., third indication sequence j}, where 0≤j<15.

It should be noted that in the above embodiments shown in FIGS. 13 to 16 , the third indication sequence i (0≤i<16) is 1 byte. When the object types carried by bytes 1-16 are not all data, the number of data may be 0-15, a total of 16 situations, which can be completely represented by 4 bits. In order to provide error correction and error detection capabilities, (8 ,4) The extended Hamming code encodes 4 bits to obtain an 8-bit length sequence. In some specific application scenarios, cyclic redundancy check (CRC) can be used for encoding, such as adding a 3-bit length CRC, and the remaining 1 bit in byte 1 can be used to carry other information. It should be noted that in this application, other information is considered to be filling, and it can also be considered to be a new type. Those of ordinary skill in the art can know the specific classification according to the context, and will not be described again here.

Figure 17 is a schematic structural diagram of an eleventh type of time slot block in this application. As shown in Figure 17, when the objects carried by the 16 bytes are not all data, in order to more specifically indicate the object type carried by bytes 1-16, byte 1 is used as the third indication sequence, which is two preset indications. One of the sequences {third indication sequence 0, third indication sequence 1}. The third indication sequence 0 indicates that the number of data in bytes 1-16 is 0, and the third indication sequence 1 indicates that the number of data in bytes 1-16 is 15 bytes, and bytes 2-16 are data. It should be noted that when the objects carried by 16 bytes are not all data, the amount of data carried by bytes 1-16 can be fixed. In this case, it is not necessarily necessary to use a third indication sequence to indicate that bytes 1-16 carry object type. In some specific implementations, when the objects carried by 16 bytes are not all data, the amount of data carried by bytes 1-16 can be fixed, and there will still be some bits of data that are not included in the 16 bytes. Used to indicate the specific type of object carried by the above 16 bytes to correct errors or detect errors, making the overall transmission more reliable.

Based on the embodiments of FIGS. 13 to 17 , it can be seen that the length of the time slot block is shorter than 130 bits, resulting in lower transmission delay; and the smaller overhead is 130/128-1=1.56%. At the same time, the 2 indicator bits in each time slot block are evenly distributed in the data frame. When the OTN frame uses RS (255,239) encoding, each RS symbol containing 8 bits contains at most 2 of each time slot block. Indicates one of the bits. Since RS decoding is based on the symbol domain, when an RS symbol is decoded incorrectly, at most one indicator bit will be affected. Considering that the Hamming distance of any two bit sequences in the two preset first indication sequences is greater than or equal to 2, an error in one indication bit can be detected, making the designed data transmission method highly reliable.

The following provides several embodiments in which all B bytes in the time slot block carry data or all carry padding.

Figure 18 is a twelfth structural diagram of a time slot block in this application. As shown in Figure 18, when the first indication bit and the second indication bit are 1 and 1 respectively, the objects carried by bytes 1-16 are all service data. When the first indication bit and the second indication bit are 0 and 0 respectively, the objects carried by bytes 1-16 are all padding. It should be noted that in some specific embodiments, when the first indication bit and the second indication bit are 0 and 0 respectively, the objects carried by bytes 1-16 are all data; when the first indication bit and the second indication bit are 0 and 0 respectively, the objects carried by bytes 1-16 are all data; When the second indication bit is 1 and 1 respectively, the objects carried by bytes 1-16 are all filled. The specific implementation method can be simply extended according to this embodiment, which is known to those of ordinary skill in the art and will not be described again here.

It should be noted that in some specific implementations, when the object carried by a certain byte is padding, it can be random information; it can also be It can be information with a fixed pattern; it can also be information with fixed constraints, such as a sequence with error correction and error detection capabilities, which is used to improve system reliability; it can also be part random information and part fixed pattern information; this There are no restrictions on application. It should be understood that the value of B in this embodiment is 16, and can also be extended to B = 8, 24, 32, 48, 64. Its specific implementation can be simply expanded according to this embodiment, which is for those of ordinary skill in the art. As can be seen, no further details will be given here.

Figure 19 is a schematic diagram of the thirteenth structure of the time slot block in this application. As shown in Figure 19, the three indication bits are one of the two preset bit sequences. When the first indication bit, the second indication bit and the third indication bit are 1, 0 and 1 respectively, the word The objects carried by sections 1-24 are all business data. When the first indication bit, the second indication bit and the third indication bit are 0, 1 and 0 respectively, the objects carried by bytes 1-16 are not all service data. More specifically, when the first indication bit, the second indication bit and the third indication bit are 0, 1 and 0 respectively, the objects carried by bytes 1-16 are all padding.

It should be noted that in some specific implementations, when the object carried by a certain byte is padding, it can be random information; it can also be information with a fixed pattern; or it can be information with fixed constraints, such as correction. A sequence with error and error detection capabilities is used to improve system reliability; it can also be partly random information and partly fixed pattern information; this application does not impose restrictions. Consider using a fixed pattern for filling, which has fixed constraints that can correct errors and detect errors. For example, consider a fixed pattern that can detect one error. The receiving end combines the specific values of 3 indicator bits to determine the 24 bytes carried in the current time slot block. A way to determine whether the object type is data or padding can be shown in Table 2 below:

Table 2

It should be noted that in some specific implementations, multiple fillings can be considered, and different fixed constraints can be adopted respectively to enhance the reliability of the decision, which can be expanded according to the above decision method.

According to the embodiment shown in Figure 19, it can be seen that the length of the time slot block is shorter than 195 bits, resulting in lower transmission delay; and the smaller overhead is 195/192-1=1.56%. At the same time, the 3 indicator bits in each time slot block are evenly distributed in the data frame. When the OTN frame uses RS (255,239) encoding, each RS symbol containing 8 bits contains at most 3 of each time slot block. Indicates one of the bits. Since RS decoding is based on the symbol domain, when an RS symbol is decoded incorrectly, at most one indicator bit will be affected. Considering that the Hamming distance of any two bit sequences in the two preset first indication sequences is greater than or equal to 3, one indication bit error can be corrected, and two bit errors can be detected, making the designed data transmission method Reliability is high.

Solution 2: The data frame includes multiple time slot block sets, and each of the time slot block sets includes P time slot blocks. Each of the time slot blocks includes V indication bits and B bytes, the integer V≥1, and the integer B≥1. The object carried by the B bytes includes at least one of data and padding. Each of the time slot block sets includes a byte set, and the byte set includes B bytes of each time slot block in the time slot block set, totaling B×P bytes. Each of the time slot block sets includes an indication bit set, and the indication bit set includes V indication bits of each time slot block in the time slot block set, totaling V×P indication bits. The W indicator bits in the indicator bit set are one of N ₁ preset bit sequences, and the Hamming distance of any two bit sequences in the N ₁ preset bit sequences is greater than or equal to 2, an integer P≥2, integer N ₁ ≥1, 1<W≤V×P.

In some possible implementations, when N ₁ =3 or 4, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to When N ₁ =5 or 6 or 7 or 8, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to in, Indicates rounding down the real number a.

It should be understood that filling refers to other types of information besides data, which is not specifically limited in this application. For example, the padding can be random information. For another example, the filling can also be information of a fixed pattern. For another example, padding can also be information with fixed constraints, such as a sequence with error correction and error detection capabilities. For another example, the filling may be partly random information and partly fixed pattern information.

It should be noted that the value of B can be 8, 16, 24, 32, 48 or 64.

It should be noted that among the N ₁ preset bit sequences, the length of each bit sequence is W bits. The Hamming distance represents the number of positions where corresponding bits in two bit sequences are different, which is known to those of ordinary skill in the art and will not be described in detail here. For example, N ₁ =2, N ₁ preset bit sequences include a first bit sequence and a second bit sequence, the first bit sequence is all 0s, and the second bit sequence is all 1s. For another example, N ₁ =2, the first bit of the first bit sequence is 1, and the values of two adjacent bits in the first bit sequence are different, that is, 101010...; the first bit of the second bit sequence is 0, and the values of two adjacent bits in the second bit sequence are different, that is, 010101….

In some possible implementations, N ₁ =3 or 4, W = 5, and the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 3. Or, N ₁ =3 or 4, W = 8, and the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 5. Or, N ₁ =3 or 4, W = 11, and the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 7. Or, N ₁ =3 or 4, W = 14, and the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to 9.

Figure 20 is a schematic structural diagram of the fourteenth time slot block in this application. As shown in Figure 20, the slot block includes 129 bits, where the slot block includes V=1 indication bit and B=16 bytes. The object carried by B=16 bytes includes at least one of data and padding. In a possible implementation, each time slot block includes V=1 indication bit, and the indication bit is at the first bit position of the time slot block. It should be understood that the specific structure of the time slot block in the case of V>1 can be transformed with reference to Figure 20, and the drawings will not be shown one by one here.

In a possible implementation, each time slot block includes V>1 indication bits, and these V indication bits are arranged in front of B bytes.

In another possible implementation, each time slot block includes V>1 indication bits, and the number of bits spaced between two of the V indication bits is greater than or equal to 8, that is, V The indication bits are not all arranged consecutively together in the slot block. When the OTN frame adopts RS (255, 239) encoding, each RS symbol including 8 bits includes at most some of the V indication bits. This makes the designed data transmission method highly reliable.

In another possible implementation, each time slot block includes V>1 indication bits, and the number of bits spaced between any two indication bits of the V indication bits is greater than or equal to 8, assuming V=3. For example, that is to say, the number of bits between any two indication bits among the three indication bits is greater than or equal to 8. When the OTN frame adopts RS (255, 239) encoding, each RS symbol including 8 bits includes at most one bit among the V indication bits. Since RS decoding is based on the symbol domain, when an RS symbol is decoded incorrectly, at most one indicator bit will be affected. Considering that the Hamming distance of any two bit sequences in the N ₁ preset indication sequences is greater than or equal to 2, an error in one indication bit can be detected, making the designed data transmission method more reliable.

As an example, each slot block includes V=2 indication bits. These two indication bits are respectively at the first bit position and the last bit position of the time slot block. Or, one of the two indication bits is at the first bit position of the time slot block, and there is a gap between the two indication bits. or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.

As another example, each slot block includes V=3 indication bits. The first indication bit among the 3 indication bits is at the first bit position of the time slot block, and the second indication bit is spaced from the first indication bit. or bytes, and the third indication bit is at the last bit position of the slot block. Alternatively, the first indication bit among the three indication bits is at the first bit position of the time slot block, the second indication bit is at the second bit position of the time slot block, and the third indication bit is at the second bit position of the time slot block. Last bit position. Alternatively, the first indication bit among the 3 indication bits is at the first bit position of the slot block, the second indication bit is at the second bit position of the slot block, the third indication bit and the second indication bit are bit interval or bytes. Or, the first indication bit among the 3 indication bits is at the first bit position of the time slot block, the second indication bit is separated from the first indication bit by B bytes, and the third indication bit is at the first bit position of the time slot block. the last bit position. in, means rounding down the real number a, Indicates rounding up the real number a.

It should be noted that for some OTN frames, the bytes in each row are encoded using 16 parallel RS (255,239). For details, please refer to the relevant descriptions in the current ITU-T protocol. At this time, by selecting appropriate values of V and B, for example, considering V=1 and B=16, or V=1 and B=32, the same RS codeword can contain at most V×P instructions. 1 bit in bits. At this time, when an RS decoding error occurs for an RS codeword, at most one indicator bit will be affected, making the designed data transmission method more reliable.

Figure 21 is a schematic diagram of multiple time slot block sets in this application. As shown in Figure 21, each cycle includes TS#1, TS#2,..., TS#K, a total of K time slot blocks. The time slot block TS#1 of each cycle in cycle 1 to cycle 5 can form a time slot block set. In the same way, the time slot block TS#2 in each period from period 1 to period 5 can form another time slot block set, and so on. Therefore, the data frame may specifically include K time slot block sets, and each time slot block set includes P=5 time slot blocks. Since each slot block includes V indication bits and B bytes, each slot block set includes V×P indication bits and B×P bytes. In the following, the V×P indication bits included in the slot block set will be uniformly recorded as an indication bit set, and the B×P bytes included in the slot block set will be noted as a byte set.

Specifically, the intervals between every two adjacent time slot blocks in each time slot block set in the data frame are the same. Taking Figure 20 as an example, the time slot block TS#1 in cycle 1 and the time slot block TS#1 in cycle 2 are two adjacent time slot blocks in the time slot block set. The time slot block TS in cycle 2 Time slot block #1 and TS#1 in cycle 3 are two adjacent time slot blocks in the time slot block set. It can be seen that time slot block TS#1 in cycle 1 and time slot block TS# in cycle 2 The interval between 1 is equal to the interval between time slot block TS#1 in period 2 and time slot block TS#1 in period 3. It should be noted that the intervals between P time slot blocks in the time slot block set can also be changed, and can be specifically set according to preset rules. In this application, the intervals are always the same and fixed as an example.

It should be understood that the starting position of the time slot block set can be indicated using the overhead of row 1, column 15 and column 16 in the OTN frame structure. The W indication bits in the slot block set are used to indicate the status of the object carried by the B×P bytes in the slot block set. Taking W=5 as an example, the 5 third indication bits are N ₁ =one of 2 preset bit sequences with a bit length of 5, and the 2 preset bit sequences are 01010 and 10101 respectively.

As an embodiment, the W indication bits in the current slot block set are used to indicate the status of the object carried by B×P bytes in the current slot block set. As another embodiment, the W indication bits in the current slot block set are used to indicate the status of objects carried by B×P bytes in other slot block sets located after the current slot block set. The two embodiments are introduced in detail below respectively.

Embodiment 1: W indicator bits in the current slot block set are used to indicate the status of objects carried by B×P bytes in the current slot block set. It should be understood that the W indication bits are specifically used to indicate the amount of data carried by B×P bytes in the current slot block set and/or the amount of padding and/or the location of the data and/or the location of the padding.

Figure 22 is a schematic structural diagram of the first type of data decision processing in this application. As shown in Figure 22, the two preset bit sequences are 10101 and 01010 respectively. The W indicator bits of the preset bit sequence are used to indicate the data in the object carried by B×P bytes in the time slot block set. or the amount of padding. A specific embodiment is that when the five indication bits are 10101, the B×P bytes in the time slot block set are all data, which is defined as state 1, as shown in example (a) in Figure 22. When the five indicator bits are 01010, the B×P bytes in the time slot block set are not all data, and state 2 is defined. A specific implementation method is that when the 5 indicator bits are 01010, that is, state 2, the B bytes in the P-1 time slot block in the time slot block set are all data, and the B bytes in the other time slot block are all data. B bytes are all padding, that is, in the time slot block set shown, B × (P-1) = 64 bytes are data, and B = 16 bytes are padding, as shown in example (b) in Figure 22 . It should be understood that for the above state 2, the time slot block with all B bytes filled should be placed as late as possible in the cycle, so that the processing delay of the receiving end is low, as shown in example (b) in Figure 22. A block of fully padded bytes is placed in cycle 5.

At the receiving end, the Hamming distance between the received 5 indicator bits and the preset bit sequence 01010 and 10101 are calculated respectively. When the Hamming distance between the received 5 indicator bits and the preset bit sequence 10101 is greater than the Hamming distance between the received 5 indicator bits and the preset sequence 01010 When the Hamming distance is small, the time slot block set is judged to be in state 1, and 16 bytes in the 5 time slot blocks and a total of 80 bytes are data, as shown in example (a) in Figure 22. When the Hamming distance between the received 5 indication bits and the preset bit sequence 01010 is smaller than the Hamming distance between it and the preset sequence 10101, it is decided that the time slot block set is state 2, in which 16 of the 4 time slot blocks A total of 64 bytes are data and 16 bytes in another slot block are padding, as shown in example (b) in Figure 22.

Figure 23 is a schematic diagram of the second structure of data decision processing in this application. As shown in Figure 23, in some possible implementations, W=3 indicator bits among the 5 indication bits in the time slot block set are used to indicate the status of the object carried by 80 bytes in the time slot block set. The 3 indication bits are one of N ₁ = 2 preset bit sequences with a bit length of 3. The 2 preset bit sequences are 010 and 101 respectively. The other 2 indication bits among the 5 indication bits can be reserved. bits for other purposes, such as to help indicate the traffic data signal rate.

The 2 preset bit sequences respectively indicate the amount of data and/or padding in the object carried by the 80 bytes in the time slot block set. A specific embodiment is that when the three indication bits are 101, all 80 bytes in the time slot block set are data, which is defined as state 1. When the three indicator bits are 010, all 80 bytes in the time slot block set are not data, and state 2 is defined. A specific implementation method is that when the three indicator bits are 010, that is, state 2, all 64 bytes in the 4 time slot blocks in the time slot block set are data, and 16 bytes in the other time slot block are All bytes are filling.

At the receiving end, the Hamming distance between the three received indication bits and the preset bit sequence 010 and 101 is calculated respectively. When the Hamming distance between the three received indication bits and the preset bit sequence 101 is greater than the Hamming distance between the received three indication bits and the preset sequence 010 When the Hamming distance is small, the time slot block set is judged to be in state 1, and 16 bytes in the 5 time slot blocks and a total of 80 bytes are data, as shown in example (a) in Figure 23. When the Hamming distance between the received 3 indication bits and the preset bit sequence 010 is smaller than the Hamming distance between it and the preset sequence 101, it is decided that the time slot block set is state 2, in which 16 of the 4 time slot blocks A total of 64 bytes are data, and 16 bytes in another slot block are padding, as shown in example (b) in Figure 23.

Figure 24 is a third structural schematic diagram of data judgment processing in this application. As shown in Figure 24, different from the embodiment shown in Figure 23 above, when the three indicator bits are 010 and the time slot block set is in state 2, the last 16 words of the 80 bytes in the time slot block set are Incomplete sections are filled. A specific implementation method is that when the three indicator bits are 010, that is, state 2, all 64 bytes in the 4 time slot blocks in the time slot block set are data, and 16 bytes in the other time slot block are 15 bytes of the bytes are data, and the last byte is padding, as shown in example (b) in Figure 24. It should be noted that in some specific implementations, when the three indicator bits are 010, that is, state 2, 64 bytes in the time slot block set carry other amounts of data, and the specific implementation can be carried out according to the above embodiments. Simple extensions are available, which are known to those of ordinary skill in the art and will not be described in detail here.

It should be noted that, taking the time slot block including 129 bits as an example, the length of the time slot block is shorter, resulting in lower transmission delay. Each time slot block contains only 1 indication bit, and the overhead is as small as 129/128-1=0.78%. A total of 5 indicator bits in 5 cycles are combined together, making the designed data transmission method highly reliable. When 3 indicator bits are used to indicate the status of the time slot block set, it ensures that even if any 1 bit of the 3 indicator bits is wrong, it can still be corrected, and if 2 bits are wrong, it can be detected; when all of the 5 indicator bits are wrong, When used to indicate the status of the time slot block set, it ensures that it can still be corrected when any 2 bits are wrong among the 5 indication bits, and can be detected when 4 bits are wrong.

Figure 25 is a schematic diagram of the fourth structure of data decision processing in this application. As shown in Figure 25, different from the embodiments shown in Figures 22 and 24 above, this embodiment uses P=4, V=2, W=7, and B=16 as an example. Other value combinations are The specific implementation manner can be simply extended according to this embodiment, which is known to those of ordinary skill in the art, and will not be described again here. Specifically, the set of slot blocks includes P=4 slot blocks. The starting position of the time slot block set can be indicated using the overhead in row 1, column 15 and column 16 in the OTN frame structure. W=7 indicator bits among the 8 indication bits in the time slot block set are used to indicate the status of the object carried by B×P=64 bytes in the time slot block set. The 7 indication bits are N ₁ = one of the 2 preset bit sequences with a bit length of 7, and the 2 preset bit sequences are 1010101 and 0101010 respectively. Another indication bit among the 8 indication bits in the time slot block set can be used as a reserved bit for other purposes, such as assisting in indicating the service data signal rate.

It should be noted that the two indicator bits in the time slot block can be placed at the first bit position and the second bit position of the time slot block. Alternatively, the two indication bits may be respectively located at the first bit position and the last bit position of the time slot block. Alternatively, the first indication bit among the 2 indication bits is at the first bit position of the time slot block, and the second indication bit is spaced apart from the first indication bit. or bytes.

The two preset bit sequences respectively indicate the amount of data or padding in the object carried by the 64 bytes in the time slot block set. A specific embodiment is that when the 7 indication bits are 1010101, all 64 bytes in the time slot block set are data, which is defined as state 1, as shown in the example of (a) of Figure 25. When the 7 indicator bits are 0101010, the first 48 bytes (i.e., the corresponding bytes in cycles 1-3) of the 64 bytes in the time slot block set are data, and the latter (i.e., the corresponding bytes in cycle 4) are data. 16 bytes are padding, defined as state 2, as shown in the example of (b) of Figure 25.

At the receiving end, the Hamming distance between the received 7 indicator bits and the preset bit sequence 1010101 and 0101010 is calculated respectively. When the Hamming distance between the received 7 indicator bits and the preset bit sequence 1010101 is greater than the Hamming distance between the received 7 indicator bits and the preset sequence 0101010 When the Hamming distance is small, the time slot block set is judged to be in state 1, and the 64 bytes in the time slot block set are all data, as shown in the example of (a) of Figure 25. When the Hamming distance between the received 7 indication bits and the preset bit sequence 0101010 is smaller than the Hamming distance between it and the preset sequence 1010101, the time slot block set is determined to be state 2, and the 64 words in the time slot block set are The first 48 bytes of the section (i.e., the corresponding bytes in cycles 1-3) are data, and the following 16 bytes (i.e., the corresponding bytes in cycle 4) are padding, as shown in the example of (b) of Figure 25.

It should be noted that, taking the time slot block including 130 bits as an example, the length of the time slot block is shorter, resulting in lower transmission delay. Each time slot block contains only 2 indication bits, and the overhead is as small as 130/128-1=1.56%. A total of 8 indication bits in 4 cycles are combined together, making the designed data transmission method highly reliable. When 7 indicator bits are used to indicate the status of the time slot block set, it ensures that any 3 bit errors among the 7 indicator bits can still be corrected, and 6 bit errors can be detected.

Embodiment 2: W indicator bits in the current slot block set are used to indicate the status of objects carried by B×P bytes in other slot block sets located after the current slot block set. It should be understood that the W indicator bits are specifically used to indicate the amount of data carried by B×P bytes in other time slot block sets located after the current time slot block set and/or the amount of padding and/or the location of the data. /or fill position.

In a possible implementation, the multiple time slot block sets include a first time slot block set and a second time slot block set. The first slot block set includes a first indication bit set and a first byte set. The second slot block set includes a second indication bit set and a second byte set. The W indication bits in the first indication bit set are used to indicate the amount of data and/or the amount of padding and/or the position of the data and/or the position of the padding carried by the second byte set.

In another possible implementation manner, the multiple time slot block sets include a first time slot block set, a second time slot block set, and a third time slot block set. The first time slot block set includes a first indicator bit set and a first byte set, the second time slot block set includes a second indicator bit set and a second byte set, and the third time slot block set includes a third indicator bit set. and the third byte set. The N ₁ preset bit sequences include a first type bit sequence and a second type bit sequence. When the W indicator bits in the first indicator bit set are the first type of bit sequences, the W indicator bits in the first indicator bit set are used to indicate the quantity and/or padding of the data carried by the second byte set. Quantity and/or location of data and/or location of fill. When the W indicator bits in the first indicator bit set are second type bit sequences, the W indicator bits in the first indicator bit set are used to indicate the quantity and/or padding of the data carried by the third byte set. Quantity and/or location of data and/or location of fill.

Figure 26 is a fifth structural schematic diagram of data judgment processing in this application. As shown in Figure 26, it includes four time slot block sets, which are respectively recorded as the first time slot block set, the second time slot block set, the third time slot block set, and the fourth time slot block set. Each slot block set includes P=8 slot blocks, and each slot block contains 1 indication bit and 16 bytes. W=8 indication bits among the 8 indication bits in each time slot block set are used to indicate the status of the object carried by B×P=128 bytes in the subsequent time slot block set. More specifically, the 8 indicator bits in the first time slot block set are used to indicate the status of the object carried by the 128 bytes in the second time slot block set, and the 8 indicator bits in the second time slot block set are used to indicate Indicates the status of the object carried by the 128 bytes in the third time slot set, and the 8 indication bits in the third time slot block set are used to indicate the status of the object carried by the 128 bytes in the fourth time slot set.

The byte carrying objects in the time slot block set have 3 states, that is, W = 8 indicator bits are one of N ₁ = 3 preset bit sequences with a length of 8 bits. The 3 preset bit sequences can be Select any 3 bit sequences from the set of 4 bit sequences with a length of 8 in Table 7. This embodiment considers a set of 4 bit sequences with a length of 8 as shown in Table 7, and selects 3 bit sequences from the 4 bit sequences, such as 00000000, 01001111 and 10110101, as three preset sequences. A specific embodiment is, as shown in Figure 26, when the indication bit in a certain time slot block set is 00000000, the 128 bytes in the next time slot block set are all data, which is defined as state 1. When the indication bit in a certain time slot block set is 01001111, the first 112 bytes of the 128 bytes in the next time slot block set (that is, the corresponding words in the first 7 cycles of the next time slot block section) is data, and the following 16 bytes (that is, the corresponding byte in the last cycle of the next time slot block) are padding, defined as state 2. When the indication bit in a certain time slot block set is 10110101, all 128 bytes in the next time slot block set are filled, which is defined as state 3.

At the receiving end, the Hamming distance is calculated between the 8 received indication bits and the three preset sequences of 00000000, 01001111 and 10110101. When the Hamming distance between the 8 received indication bits and the preset bit sequence 00000000 is the minimum, It is determined that the corresponding next time slot block set is in state 1, that is, the 128 bytes in the next time slot block set are all data. When the Hamming distance between the received 8 indicator bits and the preset bit sequence 01001111 is the smallest, it is determined that the corresponding next time slot block set is in state 2, that is, 128 bytes in front of the next time slot block set. 112 bytes are data, and the next 16 bytes are padding. When the Hamming distance between the received 8 indication bits and the preset bit sequence 10110101 is the smallest, it is determined that the corresponding next time slot block set is in state 3, that is, the 128 bytes in the next time slot block set All are filled.

In some possible implementations, transformations can also be made based on the embodiment shown in FIG. 26 . For example, the second time slot block set in FIG. 26 includes time slot block TS#2 for each period from period 9 to period 16. The indication bits in the first time slot block set are used to indicate the status of objects carried by the bytes of the 8 time slot blocks TS#2 in the second time slot block set. It should be understood that similar transformations based on this are within the protection scope of this application.

It should be noted that this embodiment considers that when a service has a rate of 10M, it occupies one time slot TS#1. When the service increases to 20M rate, it will occupy 2 time slots. At this time, a set of indication sequences can be used to indicate the status of the time slot block set in 2 time slots at the same time. 2 sets of indication sequences can also be used to independently indicate the status of 2 time slots. The status of the set of slot blocks in the slot. When the service rate is reduced from 20M to 10M, the time slot in a certain time slot can be The slot block collection state is set to state 3, and all its byte-carrying objects are filled. To achieve rapid rate change.

Figure 27 is a schematic structural diagram of a data control and instruction process in this application. As shown in Figure 27, its data transmission includes multiple transmission cycles, each cycle contains K time slots, and each time slot TS#t (1≤t≤K) carries a time slot block (also called a payload block PB). It should be noted that Figure 27 only includes the data transmission in the payload area, and the transmission of OPU overhead, OTN overhead, etc. is not reflected. A time slot carries a small particle rate of Z megabits per second. Suppose a specific service rate is a×Z megabits per second, and a is an integer; for a specific service rate less than a×Z megabits per second, some padding random information can be added to make the rate a×Z megabits per second, where The specific implementation manner is known to those of ordinary skill in the art and will not be described in detail here. As shown in Figure 27, a data control and instruction process includes K instruction processing units and a control unit. For data transmission of a certain service (defined as the first service), the control unit selects a time slot among K time slots (defined as time slots TS#t ₁ , TS#t ₂ ,..., TS#t _a ) To carry, the specific time slots TS#t ₁ , TS#t ₂ ,..., TS#t _a can be known by the agreement between the transceiver and the receiving end. For the time slots TS# _tx that do not carry specific service information among the K time slots, the corresponding indication processing unit _#tx is used to indicate that the object carried by the corresponding time slot block is padding. Instructing the processing unit _#t status to achieve.

When the bandwidth of the first service is increased to (a+Δ)×Z megabits per second, Δ time slots are added through the control unit and through its corresponding instruction processing unit Indicate processing unit Indicate processing unit Indicates the corresponding time slot block bearing object type to realize the transmission of the first service after the bandwidth is increased.

When the bandwidth of the first service is reduced to (a-Δ)×Z megabits per second, the control unit selects the Δ time slots that need to be reduced. and through its corresponding instruction processing unit Indicate processing unit Indicate processing unit Indicates that the corresponding time slot block bearer objects are all filled to realize the transmission of the first service after reducing the bandwidth.

It should be understood that this embodiment considers that a time slot block set includes P = 8 time slot blocks, each time slot block contains V = 1 indicator bit and B = 16 bytes, and the bytes in the time slot block set carry objects The type state N ₁ =3, the third indication bit length W=V×P=8. It can be extended to other states N ₁ =4 and other specific values of P, V, B, and W. The specific implementation method can be simply extended according to this embodiment, and will not be described again here.

It should be noted that, taking the time slot block including 130 bits as an example, the length of the time slot block is shorter, resulting in lower transmission delay. Each time slot block contains only 1 indication, and the overhead is as small as 129/128-1=0.78%. A total of 8 indicator bits in 8 cycles in the same time slot are combined to indicate 3 states, which can ensure that any 2 bit errors can still be corrected, and 4 bit errors can be detected, making the designed data transmission method reliable. higher.

It should be noted that this application provides a specific implementation method for determining N ₁ preset bit sequences, which will be introduced in detail below.

For the case of N ₁ =2, the two preset bit sequences are respectively recorded as the first bit sequence and the second bit sequence. The first bit sequence is all 0s, and the second bit sequence is all 1s. Or, the first bit in the first bit sequence is 1, and the values of every two adjacent bits in the first bit sequence are different. The first bit in the second bit sequence is 0, and the values of two adjacent bits in the second bit sequence are different.

For the case where N ₁ >2, a bit sequence combination with better error correction and error detection capabilities needs to be used. Considering N ₁ preset bit sequences, each bit sequence is of length W, and the number of combinations is When W>10 and N ₁ ≥3, the number of combinations is hundreds of millions. This embodiment provides a method to design a set containing N ₁ bit sequences based on linear block code characteristics.

Consider a linear block code whose minimum code distance d _min can correct g errors, then it satisfies the following constraints:

2g+1≤d _min ≤2g+2

At the same time, given the information bit length k and code length n of the linear block code, it satisfies the following constraints:

Some correspondences between linear block code information length, code length, and minimum code distance are shown in Table 3 below.

table 3

Given the preset number of bit sequences or the number of states N ₁ , an integer k ₀ can be found such that Given the expected number of error-correcting bits g of the preset bit sequence, select an integer d _min ≥ 2g+1; then, select a minimum integer n ₀ such that That is, there is a linear block code with code length n ₀ and information bit length k ₀ , and its minimum code distance is d _min ≥ 2g+1. The codebook of the linear block code contains sequences, select N ₁ sequences among them as the set of N ₁ bit sequences required to be designed. In order to facilitate the design, it may be assumed that the set containing N ₁ bit sequences contains a bit sequence of all 0s. Consider a W-long bit sequence with a code weight of d _min , d _min +1,..., d _min +Δ, where Δ is Positive integer, select any two bit sequence combinations whose Hamming distance is not less than d _min to form a set containing N ₁ bit sequences, which can be used as N ₁ preset bit indicator sequences.

It should be noted that the above set includes N ₁ kinds of W-long bit sequences. Each bit sequence is arbitrarily superposed with a new set composed of a W-long non-zero sequence. It can also be used as N ₁ preset bit indication sequences.

In a possible implementation, W≥3. When N ₁ =3 or 4, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to In another possible implementation, W≥3. When N ₁ =5, 6, 7 or 8, the Hamming distance of any two bit sequences among the N ₁ preset bit sequences is greater than or equal to

Table 4 is a set of bit sequences containing 4 bits with a length of 3, in which 3 bits in each row constitute a bit sequence. Its 4 bit sequence The column can use N ₁ = 4 preset bit sequences to indicate 4 states of objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 2, and 1 bit error can be detected. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a 3-bit length non-zero sequence, which can also be used as N ₁ =4 preset bit indication sequences. The superposition operation refers to performing a bit XOR operation on two bit sequences. It should be noted that the new set formed by rearranging the positions of the three columns in Table 4 can also be used as N ₁ =4 preset bit indication sequences.

Table 4

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 3 bits, any 3 bit sequences can be selected from the set of 4 bit sequences with a length of 3 described in Table 4 as the preset bit sequence. .

Table 5 is a set of bit sequences containing 4 bits with a length of 5, in which 5 bits in each row constitute a bit sequence. Its 4 bit sequences can use N ₁ =4 preset bit sequences to indicate the 4 states of the objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 3, which can correct 1 bit error and detect 2 bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a 5-bit length non-zero sequence, which can also be used as N ₁ =4 preset bit indication sequences. The superposition operation refers to performing a bit XOR operation on two bit sequences. It should be noted that the new set formed by rearranging the positions of the five columns in Table 5 can also be used as N ₁ =4 preset bit indication sequences.

table 5

It should be noted that for N ₁ =3 kinds of preset bit sequences of 5-bit length, any 3 bit sequences can be selected as the preset bit sequence from the set of 4 bit sequences with a length of 6 described in Table 5. .

Table 6 is a set of bit sequences containing 4 bits with a length of 6, in which 6 bits in each row constitute a bit sequence. Its 4 bit sequences can use N ₁ =4 preset bit sequences to indicate the 4 states of the objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 4, which can correct 1 bit error and detect 3 bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a 6-bit length non-zero sequence, which can also be used as N ₁ =4 preset bit indication sequences. It is known to those of ordinary skill in the art and will not be described in detail here. It should be noted that the new set formed by rearranging the positions of the 6 columns in Table 6 can also be used as N ₁ =4 preset bit indication sequences.

Table 6

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 6 bits, any 3 bit sequences can be selected as the preset bit sequences from the set of 4 bit sequences with a length of 6 described in Table 6 . It should be noted that the 4 bit sequences in the bit sequence set described in Table 6 can also be arbitrarily superimposed with a 6-bit length non-zero sequence to form a new bit sequence set, and then selected from the new bit sequence set. Any 3 bit sequences are used as preset bit sequences.

Table 7 is a set of bit sequences containing 4 bits with a length of 8, in which 8 bits in each row constitute a bit sequence. Its 4 bit sequence The column can use N ₁ = 4 preset bit sequences to indicate 4 states of objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 5, which can correct 2-bit errors and detect 4-bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a non-zero sequence of 8 bit length, which can also be used as N ₁ =4 preset bit indication sequences. It is known to those of ordinary skill in the art and will not be described in detail here. It should be noted that the new set formed by rearranging the positions of the 8 columns in Table 7 can also be used as N ₁ =4 preset bit indication sequences.

Table 7

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 8 bits, any 3 bit sequences can be selected as the preset bit sequences from the set of 4 bit sequences with a length of 8 bits described in Table 7 . It should be noted that the 4 bit sequences in the bit sequence set described in Table 7 can also be arbitrarily superposed with a non-zero sequence of 8 bit length to form a new bit sequence set, and then selected from the new bit sequence set. Any 3 bit sequences are used as preset bit sequences.

Table 8 contains a set of 4 bit sequences with a length of 8 bits, in which 10 bits in each row constitute a bit sequence. Its 4 bit sequences can use N ₁ =4 preset bit sequences to indicate the 4 states of the objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 6, which can correct 2-bit errors and detect 5-bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a 10-bit length non-zero sequence, which can also be used as N ₁ =4 preset bit indication sequences. It is known to those of ordinary skill in the art and will not be described in detail here. It should be noted that the new set formed by rearranging the positions of the 10 columns in Table 8 can also be used as N ₁ =4 preset bit indication sequences.

Table 8

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 10 bits, any 3 bit sequences can be selected as the preset bit sequence from the set of 4 bit sequences with a length of 10 bits described in Table 8 . It should be noted that the 4 bit sequences in the bit sequence set described in Table 8 can also be arbitrarily superposed with a 10-bit length non-zero sequence to form a new bit sequence set, and then selected from the new bit sequence set. Any 3 bit sequences are used as preset bit sequences.

Table 9 is a set of bit sequences containing 4 bits with a length of 11, in which 11 bits in each row constitute a bit sequence. Its 4 bit sequences can use N ₁ =4 preset bit sequences to indicate the 4 states of the objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 7, which can correct 3-bit errors and detect 6-bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a non-zero sequence with a length of 11 bits, which can also be used as N ₁ =4 preset bit indication sequences. It is known to those of ordinary skill in the art and will not be described in detail here. It should be noted that the new set formed by rearranging the positions of the 11 columns in Table 9 can also be used as N ₁ =4 preset bit indication sequences.

Table 9

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 11 bits, any 3 bit sequences can be selected as the preset bit sequence from the set of 4 bit sequences with a length of 11 bits described in Table 9 . It should be noted that the 4 bit sequences in the bit sequence set described in Table 9 can also be arbitrarily superimposed with a non-zero sequence of 11 bits in length to form a new bit sequence set, and then the new bit sequence can be Select any 3 bit sequences from the sequence set as the preset bit sequence.

Table 10 contains a set of 4 bit sequences with a length of 12 bits, in which 12 bits in each row constitute a bit sequence. Its 4 bit sequences can use N ₁ =4 preset bit sequences to indicate the 4 states of the objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 8, which can correct 3-bit errors and detect 7-bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a 12-bit length non-zero sequence, which can also be used as N ₁ =4 preset bit indication sequences. It is known to those of ordinary skill in the art and will not be described in detail here. It should be noted that the new set formed by rearranging the positions of the 12 columns in Table 10 can also be used as N ₁ =4 preset bit indication sequences.

Table 10

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 12 bits, any 3 bit sequences can be selected as the preset bit sequence from the set of 4 bit sequences with a length of 12 bits described in Table 10 . It should be noted that the 4 bit sequences in the bit sequence set described in Table 10 can also be arbitrarily superimposed with a 12-bit length non-zero sequence to form a new bit sequence set, and then selected from the new bit sequence set. Any 3 bit sequences are used as preset bit sequences.

Table 11 contains a set of 4 bit sequences with a length of 14 bits, in which 14 bits in each row constitute a bit sequence. Its 4 bit sequences can use N ₁ =4 preset bit sequences to indicate the 4 states of the objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 9, which can correct 4-bit errors and detect 8-bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a 14-bit length non-zero sequence, which can also be used as N ₁ =4 preset bit indication sequences. It is known to those of ordinary skill in the art and will not be described in detail here. It should be noted that the new set formed by rearranging the positions of the 14 columns in Table 11 can also be used as N ₁ =4 preset bit indication sequences.

Table 11

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 14 bits, any 3 bit sequences can be selected as the preset bit sequences from the set of 4 bit sequences with a length of 14 bits described in Table 11. . It should be noted that the 4 bit sequences in the bit sequence set described in Table 11 can also be arbitrarily superimposed with a 14-bit length non-zero sequence to form a new bit sequence set, and then selected from the new bit sequence set. Any 3 bit sequences are used as preset bit sequences.

Table 12 contains a set of 4 bit sequences with a length of 16 bits, in which 16 bits in each row constitute a bit sequence. Its 4 bit sequences can use N ₁ =4 preset bit sequences to indicate the 4 states of the objects carried by B×P bytes in the time slot block set. Using the above 4 preset bit indication sequences, the minimum Hamming distance is 10, which can correct 4 bit errors and detect 9 bit errors. It should be noted that the 4 bit sequences in the bit sequence set are arbitrarily superimposed to form a new set composed of a 16-bit length non-zero sequence, which can also be used as N ₁ =4 preset bit indication sequences. It is known to those of ordinary skill in the art and will not be described in detail here. It should be noted that the new set formed by rearranging the positions of the 16 columns in Table 12 can also be used as N ₁ =4 preset bit indication sequences.

Table 12

It should be noted that for N ₁ =3 kinds of preset bit sequences with a length of 16 bits, any 3 bit sequences can be selected as the preset bit sequences from the set of 4 bit sequences with a length of 14 bits described in Table 12 . It should be noted that the 4 bit sequences in the bit sequence set described in Table 12 can also be arbitrarily superimposed with a 16-bit length non-zero sequence to form a new bit sequence set, and then selected from the new bit sequence set. Any 3 bit sequences are used as preset bit sequences. You can also arbitrarily superimpose the 4 bit sequences in the bit sequence set described in Table 12 with a 16-bit length non-zero sequence to form a new bit sequence set, and then reorder the bit sequence set by column to form another bit sequence. set, and then select any 3 bit sequences from the other set of bit sequences as the preset bit sequence. You can also reorder the 4 bit sequences in the bit sequence set described in Table 12 by column to form a new bit sequence set, and then arbitrarily superimpose a 16-bit non-zero sequence on the new bit sequence set to form another bit sequence set, and then select any 3 bit sequences from the other bit sequence set as the preset bit sequence.

The data transmission device provided by this application is introduced below.

Figure 28 is a schematic structural diagram of a data transmission device in an embodiment of the present application. As shown in Figure 28, the data processing device includes a mapping unit 501 and a sending unit 502. The mapping unit 501 is used to perform the operation of step 401 above. The sending unit 502 is used to perform the operation of step 402 above. For details, please refer to the relevant introduction in the above data transmission method, and will not be repeated here.

Figure 29 is another schematic structural diagram of a data transmission device in an embodiment of the present application. As shown in Figure 29, the data processing device includes a receiving unit 601 and a demapping unit 602. The receiving unit 601 is used to receive data frames, and the demapping unit 602 is used to demap the data frames to obtain data. For details, please refer to the relevant introduction in the above data transmission method, and will not be repeated here.

It should be understood that the device provided in this application can also be implemented in other ways. For example, the unit division in the above device is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components may be combined or integrated into another system. In addition, each functional unit in various embodiments of the present application can be integrated into one processing unit, or it can be an independent physical unit, or two or more functional units can be integrated into one processing unit. The above integrated units can be implemented in the form of hardware or software functional units.

Figure 30 is another schematic structural diagram of a data transmission device in an embodiment of the present application. As shown in Figure 30, the data processing device includes a processor 701, a memory 702 and a transceiver 703. The processor 701, memory 702 and transceiver 703 are connected to each other via lines. Among them, memory 702 is used to store program instructions and data. Specifically, the processor 701 is used to perform operations of mapping data or demapping data frames, and the transceiver 603 is used to perform operations of sending and receiving data frames. In a possible implementation, the processor 701 may include the mapping unit 501 shown in FIG. 28 , and the transceiver 703 may include the sending unit 502 shown in FIG. 28 . In another possible implementation, the processor 701 may include the demapping unit 602 shown in FIG. 29 above, and the transceiver 703 may include the receiving unit 601 shown in FIG. 29 above.

It should be noted that the processor shown in Figure 30 above can be a general-purpose central processing unit (CPU), a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), or an on-site processor. Programmable gate array (FPGA) or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The memory shown in Figure 30 above can store the operating system and other application programs. When the technical solutions provided by the embodiments of this application are implemented through software or firmware, the program code used to implement the technical solutions provided by the embodiments of this application is stored in the memory and executed by the processor. In one embodiment, the processor may include memory internally. In another embodiment, the processor and memory are two separate structures.

Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the above-described systems, devices and units can be referred to the corresponding processes in the foregoing method embodiments, and will not be described again here.

Those of ordinary skill in the art can understand that all or part of the steps to implement the above embodiments can be completed by hardware, or can be completed by instructing relevant hardware through a program. The program can be stored in a computer-readable storage medium. The above-mentioned The storage media mentioned may be read-only memory, random access memory, etc. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each specific application, but such implementations should not be considered beyond the scope of this application.

When implemented using software, the method steps described in the above embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another, e.g., the computer instructions may be transferred from a website, computer, server, or data center Transmission to another website, computer, server or data center by wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains one or more available media integrated. The available media may be magnetic media (eg, floppy disk, hard disk, magnetic tape), optical media (eg, DVD), or semiconductor media (eg, Solid State Disk (SSD)), etc.

Claims

A data transmission method, characterized by including:

Mapping data to a data frame, the data frame including a plurality of time slot block sets, each of the time slot block sets including P time slot blocks, each of the time slot blocks including V indication bits and B words section, the integer V≥1, the integer B≥1, the objects carried by the B bytes include at least one of data and padding, each of the time slot block sets includes a byte set, and the byte set includes all B bytes of each time slot block in the time slot block set, a total of B×P bytes, each of the time slot block set includes an indication bit set, and the indication bit set includes the time slot block set The V indication bits of each time slot block total V×P indication bits, and the W indication bits in the indication bit set are one of N 1 preset bit sequences, integer P ≥ 2, integer N 1 ≥1, 1<W≤V×P, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to 2;

Send the data frame.
The method according to claim 1, characterized in that, W≥3;

When N 1 =3 or 4, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to

When N 1 =5 or 6 or 7 or 8, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to

in, Indicates rounding down the real number a.
The method according to claim 1 or 2, characterized in that, V=1, and the indication bit is at the first bit position of the time slot block.
The method according to claim 1 or 2, characterized in that, V>1, and the number of bits spaced between two of the V indication bits in each of the time slot blocks is greater than or equal to 8.
The method according to claim 4, characterized in that the number of bits separated between any two indication bits of the V indication bits in each time slot block is greater than or equal to 8.
The method according to claim 4 or 5, characterized in that, V=2, 2 indicator bits in each time slot block are respectively at the first bit position and the last bit position of the time slot block;

or,

One of the two indication bits in each time slot block is at the first bit position of the time slot block, and there is an interval between the two indication bits. or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.
The method according to any one of claims 1 to 6, characterized in that, N 1 =2, the N 1 preset bit sequences include a first bit sequence and a second bit sequence, and the first bit sequence The length of both the sequence and the second bit sequence is W;

The first bit sequence is all 0s, and the second bit sequence is all 1s;

or,

The first bit of the first bit sequence is 1, and the values of two adjacent bits in the first bit sequence are different; the first bit of the second bit sequence is 0, and the value of the second bit sequence is 0. The values of two adjacent bits in a two-bit sequence are different.
The method according to any one of claims 1 to 7, characterized in that every two adjacent time slot blocks in the P time slot blocks have the same interval in the data frame.
The method according to any one of claims 1 to 8, characterized in that the value of B is 8, 16, 24, 32, 48 or 64.
The method according to any one of claims 1 to 9, characterized in that the plurality of time slot block sets include a first time slot block set, and the first time slot block set includes a first indication bit set and A first set of bytes, and the W indication bits in the first set of indication bits are used to indicate the amount of data carried by the first set of bytes and/or the amount of padding and/or the location of the data and/or Filled position.
The method according to any one of claims 1 to 9, characterized in that the plurality of time slot block sets include a first time slot block set and a second time slot block set, and the first time slot block set It includes a first indication bit set and a first byte set, the second time slot block set includes a second indication bit set and a second byte set, and W indication bits in the first indication bit set are used to indicate The amount of data and/or the amount of padding and/or the location of data and/or the location of padding carried by the second byte set.
The method according to any one of claims 1 to 9, characterized in that the plurality of time slot block sets include a first time slot block set, a second time slot block set and a third time slot block set, so The first time slot block set includes a first indication bit set and a first byte set, the second time slot block set includes a second indication bit set and a second byte set, and the third time slot block set includes The third indication bit set and the third byte set, N 1 preset bit sequences include the first type of bit sequence and the second type of bit sequence;

When the W indication bits in the first indication bit set are the first type of bit sequence, the W indication bits in the first indication bit set are used to indicate the data carried by the second byte set. the amount of data and/or the amount of padding and/or the location of data and/or the location of padding;

When the W indication bits in the first indication bit set are the second type bit sequence, the W indication bits in the first indication bit set are used to indicate the third byte set carried The amount of data and/or the amount of padding and/or the location of data and/or the location of padding.
A data transmission method, characterized by including:

Data is mapped to a data frame, the data frame includes a plurality of time slot blocks, each of the time slot blocks includes V indication bits and B bytes, an integer V≥2, an integer B≥1, and the B The object carried by the byte includes at least one of data and padding. The number of bits spaced between two of the V indication bits is greater than or equal to 8. The V indication bits are N preset bits. One of the sequences, the Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2, the integer N≥2, each of the preset bit sequences is used to indicate the B The type of object carried by B bytes, the type of object carried by B bytes is one of the object type sets, and the object type set includes the objects carried by the B bytes, which are all data, the The objects carried by B bytes are all padding and the objects carried by the B bytes include data and padding;

Send the data frame.
The method according to claim 13, characterized in that V=2, N=2; the two preset bit sequences are 00 and 11 respectively, or the two preset bit sequences are 01 and 10 respectively.
The method according to claim 14, characterized in that the two indicator bits are respectively at the first bit position and the last bit position of the time slot block;

or,

One of the two indication bits is at the first bit position of the time slot block, and there is an interval between the two indication bits. or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.
The method according to claim 13, characterized in that V=3, N=2; the two preset bit sequences are 000 and 111 respectively, or the two preset bit sequences are 110 and 001 respectively, or , the 2 preset bit sequences are 101 and 010 respectively, or the 2 preset bit sequences are 011 and 100 respectively.
The method according to claim 16, characterized in that the first indication bit among the three indication bits is at the first bit position of the time slot block, and the second indication bit among the three indication bits is the same as the first indication bit. space between bits or Bytes, the third indication bit among the 3 indication bits is at the last bit position of the time slot block;

or,

The first indication bit among the 3 indication bits is at the first bit position of the timeslot block, the second indication bit among the 3 indication bits is at the second bit position of the timeslot block, and the 3rd indication bit among the 3 indication bits is at the second bit position of the timeslot block. Three indicator bits are at the last bit position of the slot block;

or,

The first indication bit among the 3 indication bits is at the first bit position of the timeslot block, the second indication bit among the 3 indication bits is at the second bit position of the timeslot block, and the 3rd indication bit among the 3 indication bits is at the second bit position of the timeslot block. The interval between the three indication bits and the second indication bit or bytes;

or,

The first indication bit among the 3 indication bits is at the first bit position of the time slot block, the second indication bit among the 3 indication bits is spaced B bytes from the first indication bit, and the 3 indication bits The third indication bit is at the last bit position of the time slot block;

in, means rounding down the real number a, Indicates rounding up the real number a.
The method according to any one of claims 13 to 16, characterized in that the number of bits separated between any two indication bits among the V indication bits is greater than or equal to 8.
The method according to any one of claims 13 to 17, characterized in that the value of B is 8, 16, 24, 32, 48 or 64.
The method according to any one of claims 13 to 18, characterized in that the set of object types includes that the objects carried by the B bytes are all data and the objects carried by the B bytes are all padding. .
The method according to any one of claims 13 to 18, characterized in that the set of object types includes that the objects carried by the B bytes are all data and the objects carried by the B bytes include a fixed number. data and padding.
The method according to claim 20 or 21, characterized in that the V indication bits are used to indicate the amount of data carried by the B bytes and/or the amount of padding and/or the position of the data and/or Filled position.
The method according to any one of claims 13 to 22, characterized in that the objects carried by the B bytes include data and padding, and the bytes used for carrying data among the B bytes are located at before the bytes carrying padding.
The method according to any one of claims 13 to 23, characterized in that the objects carried by the B bytes include padding, and some of the bits used to carry padding in the B bytes are preset indications. One of the sequences, the indication sequence includes multiple bits;

The indication sequence is used to indicate the amount of data carried by the B bytes and/or the amount of padding and/or the position of the data and/or the position of the padding.
A data transmission device, characterized by including: a mapping unit and a sending unit;

The mapping unit is configured to: map data to a data frame, the data frame includes a plurality of time slot block sets, each of the time slot block sets includes P time slot blocks, and each of the time slot blocks includes V indication bits and B bytes, the integer V≥1, the integer B≥1, the objects carried by the B bytes include at least one of data and padding, and each of the time slot block sets includes a byte set, The byte set includes B bytes of each time slot block in the time slot block set, a total of B×P bytes, each of the time slot block sets includes an indication bit set, and the indication bit set includes The V indication bits of each slot block in the time slot block set total V×P indication bits, and the W indication bits in the indication bit set are one of N 1 preset bit sequences, an integer P≥2, integer N 1 ≥1, 1<W≤V×P, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to 2;

The sending unit is used to: send the data frame.
The data transmission device according to claim 25, characterized in that, W≥3;

When N 1 =3 or 4, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to

When N 1 =5 or 6 or 7 or 8, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to

in, Indicates rounding down the real number a.
The data transmission device according to claim 25 or 26, characterized in that, V=1, and the indication bit is at the first bit position of the time slot block.
The data transmission device according to claim 25 or 26, characterized in that, V>1, and the number of bits spaced between two of the V indication bits in each of the time slot blocks is greater than or equal to 8.
The data transmission device according to claim 28, characterized in that the number of bits separated between any two indication bits of the V indication bits in each time slot block is greater than or equal to 8.
The data transmission device according to claim 28 or 29, characterized in that, V=2, and the two indicator bits in each time slot block are respectively at the first bit position and the last bit of the time slot block. Location;

or,

One of the two indication bits in each time slot block is at the first bit position of the time slot block, and there is an interval between the two indication bits. or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.
The data transmission device according to any one of claims 25 to 30, characterized in that, N 1 =2, the N 1 preset bit sequences include a first bit sequence and a second bit sequence, and the N 1 preset bit sequences include a first bit sequence and a second bit sequence. The lengths of one bit sequence and the second bit sequence are both W;

The first bit sequence is all 0s, and the second bit sequence is all 1s;

or,

The first bit of the first bit sequence is 1, and the values of two adjacent bits in the first bit sequence are different; the first bit of the second bit sequence is 0, and the value of the second bit sequence is 0. The values of two adjacent bits in a two-bit sequence are different.
The data transmission device according to any one of claims 25 to 31, characterized in that the intervals between every two adjacent time slot blocks in the data frame in the P time slot blocks are the same.
The data transmission device according to any one of claims 25 to 32, characterized in that the value of B is 8, 16, 24, 32, 48 or 64.
The data transmission device according to any one of claims 25 to 33, wherein the plurality of time slot block sets include a A time slot block set, the first time slot block set includes a first indication bit set and a first byte set, and the W indication bits in the first indication bit set are used to indicate the first byte set. The amount of data carried and/or the amount of padding and/or the location of data and/or the location of padding.
The data transmission device according to any one of claims 25 to 33, wherein the plurality of time slot block sets include a first time slot block set and a second time slot block set, and the first time slot block set The block set includes a first indication bit set and a first byte set, the second time slot block set includes a second indication bit set and a second byte set, and the W indication bits in the first indication bit set are used for Indicates the amount of data and/or the amount of padding and/or the location of data and/or the location of padding carried by the second set of bytes.
The data transmission device according to any one of claims 25 to 33, wherein the plurality of time slot block sets include a first time slot block set, a second time slot block set and a third time slot block set. , the first time slot block set includes a first indication bit set and a first byte set, the second time slot block set includes a second indication bit set and a second byte set, and the third time slot block set The set includes a third indicator bit set and a third byte set, and the N 1 preset bit sequences include a first type of bit sequence and a second type of bit sequence;

When the W indicator bits in the first indicator bit set are the first type of bit sequence, the W indicator bits in the first indicator bit set are used to indicate the data carried by the second byte set. the amount of data and/or the amount of padding and/or the location of data and/or the location of padding;

When the W indication bits in the first indication bit set are the second type bit sequence, the W indication bits in the first indication bit set are used to indicate the third byte set carried The amount of data and/or the amount of padding and/or the location of data and/or the location of padding.
A data transmission device, characterized by including: a mapping unit and a sending unit;

The mapping unit is used to: map data to a data frame, the data frame includes a plurality of time slot blocks, each of the time slot blocks includes V indication bits and B bytes, the integer V≥2, the integer B ≥1, the object carried by the B bytes includes at least one of data and padding, the number of bits spaced between two of the V indication bits is greater than or equal to 8, the V indication bits It is one of N preset bit sequences. The Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2. The integer N ≥ 2. Each of the preset bit sequences The sequence is used to indicate the type of object carried by the B bytes. The type of the object carried by the B bytes is one of the object type sets. The object type set includes the object type carried by the B bytes. The objects are all data, the objects carried by the B bytes are all padding, and the objects carried by the B bytes include data and padding;

The sending unit is used to: send the data frame.
The data transmission device according to claim 37, characterized in that V=2, N=2; the two preset bit sequences are 00 and 11 respectively, or the two preset bit sequences are 01 and 10 respectively. .
The data transmission device according to claim 38, characterized in that the two indicator bits are respectively at the first bit position and the last bit position of the time slot block;

or,

One of the two indication bits is at the first bit position of the time slot block, and there is an interval between the two indication bits. or bytes, among which, means rounding down the real number a, Indicates rounding up the real number a.
The data transmission device according to claim 37, characterized in that V=3, N=2; the two preset bit sequences are 000 and 111 respectively, or the two preset bit sequences are 110 and 001 respectively. , or the two preset bit sequences are 101 and 010 respectively, or the two preset bit sequences are 011 and 100 respectively.
The data transmission device according to claim 40, characterized in that the first indication bit among the three indication bits is at the first bit position of the time slot block, and the second indication bit among the three indication bits is the same as the first bit position of the time slot block. an indication of the interval between bits or Bytes, the third indication bit among the 3 indication bits is at the last bit position of the time slot block;

or,

The first indication bit among the 3 indication bits is at the first bit position of the timeslot block, the second indication bit among the 3 indication bits is at the second bit position of the timeslot block, and the 3rd indication bit among the 3 indication bits is at the second bit position of the timeslot block. Three indicator bits are at the last bit position of the slot block;

or,

The first indication bit among the 3 indication bits is at the first bit position of the timeslot block, the second indication bit among the 3 indication bits is at the second bit position of the timeslot block, and the 3rd indication bit among the 3 indication bits is at the second bit position of the timeslot block. The interval between the three indication bits and the second indication bit or indivual byte;

or,

The first indication bit among the 3 indication bits is at the first bit position of the time slot block, the second indication bit among the 3 indication bits is spaced B bytes from the first indication bit, and the 3 indication bits The third indication bit is at the last bit position of the time slot block;

in, means rounding down the real number a, Indicates rounding up the real number a.
The data transmission device according to any one of claims 37 to 41, characterized in that the number of bits separated between any two indication bits among the V indication bits is greater than or equal to 8.
The data transmission device according to any one of claims 37 to 42, wherein the value of B is 8, 16, 24, 32, 48 or 64.
The data transmission device according to any one of claims 37 to 43, wherein the object type set includes that the objects carried by the B bytes are all data and the objects carried by the B bytes are all data. It's padding.
The data transmission device according to any one of claims 37 to 43, wherein the set of object types includes that the objects carried by the B bytes are all data and the objects carried by the B bytes include Fixed amount of data and padding.
The data transmission device according to claim 44 or 45, characterized in that the V indication bits are used to indicate the amount of data carried by the B bytes and/or the amount of padding and/or the position of the data. /or fill position.
The data transmission device according to any one of claims 37 to 46, wherein the objects carried by the B bytes include data and padding, and the bytes used to carry data among the B bytes Before the bytes used to carry padding.
The data transmission device according to any one of claims 37 to 47, wherein the objects carried by the B bytes include padding, and some of the bits used to carry padding in the B bytes are preset One of the indication sequences, the indication sequence includes a plurality of bits;

The indication sequence is used to indicate the amount of data carried by the B bytes and/or the amount of padding and/or the position of the data and/or the position of the padding.
A data transmission method, characterized by including:

Receive a data frame, the data frame includes a plurality of time slot block sets, each of the time slot block sets includes P time slot blocks, and each of the time slot blocks includes V indication bits and B bytes, an integer V≥1, integer B≥1, the objects carried by the B bytes include at least one of data and padding, each of the time slot block sets includes a byte set, and the byte set includes the time slots B bytes of each time slot block in the block set total B×P bytes. Each time slot block set includes an indication bit set, and the indication bit set includes each time slot block set in the time slot block set. The V indication bits of the gap block total V×P indication bits, and the W indication bits in the indication bit set are one of N 1 preset bit sequences, integer P ≥ 2, integer N 1 ≥ 1, 1<W≤V×P, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to 2;

Demap the data frame to obtain data.
A data transmission method, characterized by including:

Receive a data frame, the data frame includes a plurality of time slot blocks, each of the time slot blocks includes V indication bits and B bytes, the integer V≥2, the integer B≥1, the B bytes carry The object includes at least one of data and padding, the number of bits spaced between two of the V indication bits is greater than or equal to 8, and the V indication bits are among the N preset bit sequences. One, the Hamming distance of any two bit sequences in the N preset bit sequences is greater than or equal to 2, the integer N≥2, each of the preset bit sequences is used to indicate the B bytes The type of object carried, the type of object carried by the B bytes is one of the object type sets, the object type set includes the objects carried by the B bytes are all data, the B words The objects carried by the section are all padding and the objects carried by the B bytes include data and padding;

Demap the data frame to obtain data.
A data transmission device, characterized by comprising: a receiving unit and a demapping unit;

The receiving unit is configured to: receive a data frame, the data frame includes a plurality of time slot block sets, each of the time slot block sets includes P time slot blocks, and each of the time slot blocks includes V indication bits. and B bytes, the integer V≥1, the integer B≥1, the objects carried by the B bytes include at least one of data and padding, each of the time slot block sets includes a byte set, and the word The section set includes B bytes of each time slot block in the time slot block set, totaling B×P bytes. Each of the time slot block sets includes an indication bit set, and the indication bit set includes The V indication bits of each slot block in the time slot block set total V×P indication bits, and the W indication bits in the indication bit set are one of N 1 preset bit sequences, an integer P≥2, integer N 1 ≥1, 1<W≤V×P, the Hamming distance of any two bit sequences among the N 1 preset bit sequences is greater than or equal to 2;

The demapping unit is used to: demap the data frame to obtain data.
A data transmission device, characterized by comprising: a receiving unit and a demapping unit;

The receiving unit is configured to: receive a data frame, the data frame includes a plurality of time slot blocks, each of the time slot blocks includes V indication bits and B bytes, the integer V≥2, the integer B≥1, The objects carried by the B bytes include at least one of data and padding, the number of bits spaced between two of the V indication bits is greater than or equal to 8, and the V indication bits are N One of the preset bit sequences, the Hamming distance of any two bit sequences among the N preset bit sequences is greater than or equal to 2, the integer N≥2, each of the preset bit sequences is used Indicates the type of object carried by the B bytes. The type of the object carried by the B bytes is one of the object type sets. The object type set includes the objects carried by the B bytes. The data and the objects carried by the B bytes are all padding, and the objects carried by the B bytes include data and padding;

The demapping unit is used to: demap the data frame to obtain data.