A signal processing method, device, storage medium and program product

Abstract

The application provides a signal processing method and device, a storage medium and a program product, relates to the technical field of communication, and comprises the following steps: deleting time slots in a first signal; deleting overhead of the first signal; re-adding the deleted overhead of the first signal to the first signal; obtaining a second signal after the first signal is processed in the above manner; and transmitting the second signal. The signal processing method provided in the application embodiment can reduce the rate of the second signal compared with the first signal, and the second signal is a fixed-length frame signal, thereby avoiding the problem that the overhead position in the signal obtained by directly deleting time slots from the first signal is not fixed.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a signal processing method, apparatus, storage medium, and program product. Background Technology

[0002] The Optical Data Unit-Cn (ODUCn) signal is an optical data unit signal with a rate exceeding 100 Gbit / s as defined in the Optical Transport Network (OTN) standard. The ODUCn signal consists of n ODUC signals with the same rate and aligned frame headers. The ODUC signal rate is 105.2581 Gbit / s, and its payload contains 20 time slots, each 16 bytes long. With the development of OTN technology, there is a desire to convert the ODUC signal to a reduced-rate ODUC-19 signal, or to convert the ODUCn signal to an ODUCn-M signal, where M = 19 * n. The ODUC-19 signal is obtained by deleting one invalid time slot from the ODUC signal; similarly, the ODUCn-M signal is obtained by deleting 20 * nM invalid time slots from the ODUCn signal.

[0003] In existing technology, taking the ODUC-19 signal as an example, if an invalid time slot is directly deleted from the ODUC signal, and the position of the deleted invalid time slot is not fixed (i.e., the 20 time slots in the ODUC signal are named time slot 0 to time slot 19 respectively), the overhead distribution of the resulting ODUC-19 signal will be uneven, and the overhead position will not be fixed. This phenomenon is caused by the fact that the ODUC signal frame consists of 4 rows and 3824 columns of bytes, with the first 16 columns being overhead and the last 3808 columns being payload. The payload is divided into 20 time slots, each with a length of 16 bytes. Since the number of bytes in a row of payload is not divisible by 20 * 16, the number of payload bytes in each row is unequal after deleting a time slot, resulting in uneven overhead distribution. Here, even overhead distribution means that if a group of overheads includes 16 bytes, and the number of payload bytes between two adjacent groups of overheads is equal, then the overhead distribution is considered even. After a time slot is deleted from the OTUC-19 signal, the payload of 4*3808 bytes in one frame cannot be divided by 20*16, so the number of bytes in each original signal frame is not equal. Thus, the signal frame is not a fixed-length frame signal based on the original signal frame.

[0004] Fixed-length frame signals require a fixed number of bits per frame, along with fixed bits for overhead and payload. However, since the payload of 5 frames is divisible by 20*16, if we consider 5 consecutive frames of the ODUC signal as a larger frame structure, this larger frame structure can still maintain a fixed number of bits after deleting one time slot, meaning the frame length is fixed. However, the overhead distribution remains uneven, and the overhead location is still not fixed, depending on the specific location of the deleted time slot. Thus, this larger frame structure is still not a fixed-length frame signal. The same problem exists with the ODUCn-M signal obtained by deleting 20*nM time slots from the ODUCn signal; that is, the ODUCn-M signal is not a fixed-length frame signal.

[0005] In the prior art, a common method for implementing ODUC-19 signals is to use ODUC signals and indicate the validity of each time slot in its MSI (Multiplex Structure Identifier) ​​overhead. Since this method actually uses ODUC signals, the actual data rate remains the same as the ODUC signal rate; the actual data rate is not reduced. Similarly, a common method for implementing ODUCn-M signals is to use ODUCn signals and indicate the validity of each time slot in its MSI overhead. The prior art does not currently provide methods for implementing reduced-data-rate ODUC-19 and ODUCn-M signals. This application provides a signal processing method that allows ODUC signals to be converted into reduced-data-rate ODUC-19 signals, and ODUCn signals to be converted into reduced-data-rate ODUCn-M signals. Furthermore, the reduced-data-rate signals are all fixed-length frame signals, and the reduced-data-rate ODUC-19 signals can be converted back to ODUC signals, and the reduced-data-rate ODUCn-M signals can be converted back to ODUCn signals. Summary of the Invention

[0006] This application provides a signal processing method, apparatus, storage medium, and program product that enables a second signal to be obtained after deleting a time slot from a first signal. The second signal has a lower rate than the first signal and is a fixed-length frame signal, thus avoiding the problem that the overhead position in the signal obtained by directly deleting a time slot from the first signal is not fixed.

[0007] On one hand, a signal processing method is provided, comprising: deleting a time slot from a first signal; deleting the overhead of the first signal; adding the deleted overhead of the first signal back to the first signal to obtain a second signal, and transmitting the second signal.

[0008] In another aspect, a data transmission apparatus is provided, comprising: a communication signal transmitting module and a communication signal receiving module. The communication signal transmitting module is used to delete a time slot from a first signal; add the overhead of the deleted first signal back to the first signal; obtain a second signal from the first signal after the above processing; and transmit the second signal.

[0009] The communication signal receiving module is used to receive the second signal; add a time slot to the second signal; delete the overhead of the second signal; and add the deleted overhead of the second signal back to the second signal. After the second signal is processed in the above way, the first signal is obtained.

[0010] In another aspect, a computer-readable storage medium is provided, on which computer program instructions are stored, which, when executed by a processor, implement the above-described signal processing method.

[0011] In another aspect, a computer program product is provided, which includes computer program instructions that, when executed, implement the above-described signal processing method.

[0012] This application allows the first signal to be converted into a second signal after deleting time slots. At the same time, the second signal has a lower rate than the first signal and is a fixed-length frame signal, thus avoiding the problem that the overhead position is not fixed in the signal obtained by directly deleting time slots from the first signal. Attached Figure Description

[0013] To more clearly illustrate the technical solutions in this application, the accompanying drawings used in some embodiments of this application will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings.

[0014] Figure 1 This is a hardware structure block diagram of the computer terminal on which the signal processing method provided in the embodiments of this application runs;

[0015] Figure 2 This is a flowchart of the signal processing method provided in the embodiments of this application;

[0016] Figure 3 This is a flowchart of a signal processing method in an exemplary embodiment of this application;

[0017] Figure 4 This is a schematic diagram of the signal frame structure of the ODUCn-Me signal in Embodiment 1 of this application;

[0018] Figure 5 This is a schematic diagram of the signal frame structure of the ODUCn signal in Embodiment 1 of this application;

[0019] Figure 6 This refers to the position of the 20 overhead base block groups in the ODUCn-19*ne signal frame in Embodiment 3 of this application;

[0020] Figure 7 This is a schematic diagram of the signal frame structure of the ODUCn-19*ne signal in Embodiment 3 of this application. Detailed Implementation

[0021] The technical solutions of this application will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0022] It should be noted that, in this application, the terms "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or design solutions. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0023] Hereinafter, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature.

[0024] In the description of this application, unless otherwise stated, " / " means "or". For example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "multiple" means two or more.

[0025] In optical transport network standards, it is desirable to obtain a second signal by deleting some time slots from a first signal, where the first signal is a fixed-length frame signal. However, if the payload of one line in the signal frame of the first signal is not divisible by a*g, where a is the number of time slots divided in the payload and g is the time slot length (i.e., the number of bits included in a time slot), then the second signal obtained after deleting some time slots is not a fixed-length frame signal. Since all signals defined in the optical transport network standard are fixed-length frame signals, it is desirable for the second signal to be a fixed-length frame signal.

[0026] To address the aforementioned problems, this application provides a signal processing method that involves deleting time slots from a first signal; deleting the overhead of the first signal; adding the deleted overhead back to the first signal; and obtaining a second signal from the first signal after the above processing, and then transmitting the second signal. The signal processing method provided in this application allows the second signal to have a lower rate than the first signal and is a fixed-length frame signal, avoiding the problem of inconsistent overhead positions in the signal obtained by directly deleting time slots from the first signal.

[0027] The methods and embodiments provided in this application can be executed on a mobile terminal, a computer terminal, or a similar computing device. Taking running on a computer terminal as an example, Figure 1 This is a hardware structure block diagram of the computer terminal on which the signal processing method provided in this application operates. For example... Figure 1 As shown, a computer terminal may include one or more ( Figure 1 Only one is shown in the diagram. A processor 101 (which may include, but is not limited to, a microprocessor MCU or a programmable logic device FPGA, etc.) and a memory 102 for storing data are also shown. Those skilled in the art will understand that... Figure 1 The structure shown is for illustrative purposes only and does not limit the structure of the computer terminal described above. For example, the computer terminal may also include components that are more complex than those described above. Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown.

[0028] The memory 102 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the signal processing method in this embodiment of the invention. The processor 101 executes various functional applications and data processing by running the computer program stored in the memory 102, thereby implementing the above-described method. The memory 102 may include high-speed random access memory and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 102 may further include memory remotely located relative to the processor 101, and these remote memories can be connected to a computer terminal via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0029] The application scenarios of the embodiments in this application are not limited. The system architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided by the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of this application are also applicable to similar technical problems.

[0030] This application provides a signal processing method. Figure 2 This is a flowchart of the signal processing method provided in the embodiments of this application, such as... Figure 2 As shown, it includes the following steps:

[0031] Step S201: Delete the time slot in the first signal.

[0032] In an exemplary embodiment, the first signal consists of a signal frame of fixed length, the signal frame including overhead and payload; the payload of the signal frame of the first signal is divided into a time slots, where a is an integer greater than 1.

[0033] As can be understood, a fixed-length signal frame refers to a signal frame containing a fixed number of bits, with bits at fixed positions corresponding to overhead and bits at fixed positions corresponding to payload. An example of a fixed-length signal frame is as follows: the signal frame consists of 4 rows and 3824 columns of bytes, with 1 byte corresponding to 8 bits. The first 16 columns are overhead, and the last 3808 columns are payload.

[0034] In an exemplary embodiment, a number d of consecutive signal frames is determined, where d is an integer greater than 0, such that d*f is divisible by a*g, where f is the number of bits included in the payload of a signal frame, and g is the number of bits included in a time slot.

[0035] Understandably, all f bits in the payload of the first signal frame are used to divide the time slots; the f bits of d consecutive signal frames are divided into c groups, each group containing a*g bits. Since d*f is divisible by a*g, the payload of the first signal frame can be divided into a time slots. At this point, the d consecutive signal frames include c time slot periods, where c = d*f / (a*g). One time slot period includes a*g bits, corresponding to a time slots.

[0036] In an exemplary embodiment, d consecutive signal frames can also be replaced by d consecutive rows. That is, the number d consecutive rows in the signal frame is determined such that d*p is divisible by a*g, where p is the number of bits included in one row of payload. Then, d consecutive signal frames can be replaced by d consecutive rows.

[0037] In one exemplary embodiment, deleting a time slot in the first signal includes: deleting b time slots from a time slots in the payload of d consecutive signal frames of the first signal, where b is an integer greater than 0 and less than a. It is understood that after deleting b time slots, the payload of the first signal in the d consecutive signal frames still includes c time slot periods, but only one time slot period includes (ab)*g bits, corresponding to ab time slots.

[0038] Step S202: Remove the overhead of the first signal.

[0039] In one exemplary embodiment, removing the overhead of the first signal includes: removing all overhead in d consecutive signal frames of the first signal.

[0040] Step S203: Add the overhead of the deleted first signal back to the first signal.

[0041] In one exemplary embodiment, adding the overhead of the deleted first signal back to the first signal includes: adding all the deleted overhead back to the payload of the first signal for d consecutive signal frames according to a preset distribution method, such that the distance between the location of the added overhead and the location of the overhead before deletion is less than a preset value.

[0042] Understandably, the position of overhead can be represented by the number of bits between the overhead and the first bit interval of the first signal frame in d consecutive signal frames, and the positional distance between two overheads can be represented by the absolute value of the positional difference between the two overheads. For a single signal frame containing multiple rows, each row containing a fixed number of overhead bits, and all bits of the overhead in each row being clustered together, the overhead of one row is considered as a permutation unit. If d signal frames contain h rows, then there are h permutation units of overhead. These h permutation units of overhead are added to the payload according to a preset distribution method. Since the h permutation units of overhead are essentially uniformly distributed before overhead removal, and the position of the overhead after addition is close to the position of the overhead before removal, the preset distribution method can be the Sgima-delta algorithm.

[0043] Understandably, if before overhead removal, the first bit of each row was overhead, and there are h rows in d signal frames, each row containing one permutation unit of overhead, and now all overhead in the signal frames has been removed, leaving only the payload corresponding to ab time slots, then a pre-defined distribution method includes: adding the first permutation unit of overhead to the beginning of the payload of the d signal frames, where the payload of the d signal frames includes c*(ab)*g bits. Dividing the c*(ab)*g payload bits into e groups, each group containing j bits, where j equals g. Using the accumulation-difference algorithm, f groups are selected from e, and these selected groups serve as the positions for adding overhead. One permutation unit of overhead is added after each selected group position, with the last added overhead ignored. This results in a total of f-1 permutation units of overhead being added. Including the first permutation unit of overhead, a total of f permutation units of overhead are actually added, thus completing the overhead addition process. After the overhead addition is completed, the position of each permutation unit of overhead is less than a*g bits away from the corresponding overhead position before the overhead removal. Understandably, the choice of the value of j is crucial in the above processing. The value of j can be g, (ab)*g, 1 or other values, but it is required that c*(ab)*g must be divisible by j.

[0044] Step S204: After the first signal is processed as described above, a second signal is obtained and sent.

[0045] It is understandable that after the first signal undergoes deletion of time slots, deletion of overhead, and addition of overhead, the content has been changed and sent. The first signal after the above processing is named the second signal.

[0046] In one exemplary embodiment, sending a second signal includes: directly sending the second signal; or converting the second signal into a third signal and sending the third signal; or loading the second signal into a fourth signal and sending the fourth signal.

[0047] In one exemplary embodiment, after step S204, steps S205 to S208 are further included, such as... Figure 3 As shown, the second signal is converted into the first signal. Figure 3 This is a flowchart of a signal processing method in an exemplary embodiment of this application.

[0048] Step S205: Receive the second signal.

[0049] In one exemplary embodiment, receiving a second signal includes: directly receiving the second signal; or receiving a third signal and converting the third signal into a second signal; or receiving a fourth signal and extracting the second signal from the fourth signal.

[0050] Step S206: Add a time slot to the second signal

[0051] In one exemplary embodiment, adding time slots to the second signal includes: adding b time slots to c time slots of the payload of d consecutive signal frames of the second signal, where c is an integer and c = ab, and the positions of the added b time slots are the same as the positions of the b time slots deleted from a time slots of the payload of d consecutive signal frames of the first signal.

[0052] Step S207: Remove the overhead of the second signal.

[0053] In one exemplary embodiment, removing the overhead of the second signal includes removing all overhead in d consecutive signal frames of the second signal.

[0054] In step S208, the overhead of the deleted second signal is added back to the second signal, and the second signal is processed as above to obtain the first signal.

[0055] In one exemplary embodiment, adding the overhead of the deleted second signal back to the second signal includes: adding all the deleted overhead back to the payload of d consecutive signal frames of the second signal, such that the re-added overhead is located at the position of the overhead of d consecutive signal frames of the first signal. It is understood that since the re-added overhead is located at the same position as the overhead of the first signal, and the payload of d consecutive signal frames of the second signal is exactly the same as the payload of d consecutive signal frames of the first signal after adding b time slots, the second signal, after the above processing, is exactly the same as the first signal, thereby ultimately converting the second signal into the first signal.

[0056] The above steps provide a signal processing method, which includes: deleting time slots from a first signal; deleting the overhead of the first signal; adding the deleted overhead back to the first signal; obtaining a second signal from the first signal after the above processing; and transmitting the second signal. The signal processing method provided by this application embodiment allows the second signal to have a lower rate than the first signal and is a fixed-length frame signal, avoiding the problem of inconsistent overhead positions in the signal obtained by directly deleting time slots from the first signal.

[0057] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods according to the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods of the various embodiments of the present invention.

[0058] Embodiments of the present invention also provide a computer-readable storage medium storing a computer program, wherein the computer program is configured to perform the steps in any of the above method embodiments when executed.

[0059] In one exemplary embodiment, the aforementioned computer-readable storage medium may include, but is not limited to, various media capable of storing computer programs, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard disk, magnetic disk, or optical disk.

[0060] An embodiment of the present invention also provides a data transmission device, which includes a communication signal transmitting module and a communication signal receiving module, wherein the communication signal transmitting module is used to perform all the processes in steps S201 to S204 above, and the communication signal receiving module is used to perform all the processes in steps S205 to S208 above.

[0061] Specific examples in this embodiment can be found in the examples described in the above embodiments and exemplary implementations, and will not be repeated here.

[0062] The following provides specific embodiments based on the processing described in the exemplary embodiments above.

[0063] Example 1:

[0064] Define the ODUCn-Me signal as the ODUCn signal after deleting 20*nM time slots. The ODUCn-Me signal is a fixed-length frame signal, and its rate is the rate of the ODUCn signal * (20*n + 238*M) / (239*20*n). The signal frame structure of the ODUCn-Me signal is 1 row of 238*M + 20*n columns of base blocks. Each base block includes 128 bits, of which the overhead includes 20*n base blocks, and the payload includes 238*M base blocks. The 20*n overhead base blocks are divided into 20 overhead base block groups, and each overhead base block group includes the overhead of n base blocks, such as... Figure 4 As shown.

[0065] The method for determining 20 cost block groups from 238*M+20*n base blocks is as follows: The first n base blocks correspond to the first cost block group. The remaining 238*M+19*n base blocks are traversed, with the total number of iterations T for the cumulative-difference algorithm set to 238*M, and the number of selected blocks S set to 20. The cumulative-difference algorithm is used to traverse the 238*M+19*n base blocks, traversing one base block at a time. Before traversal begins, the accumulator sum is set to 0. For each base block traversed, sum is incremented by S, and it is checked whether it is greater than or equal to T. If it is greater than or equal to T, the current base block is considered one of the S selected base blocks. The n base blocks following this base block are considered a cost block group, and the cost of these n base blocks does not actually participate in the cumulative-difference algorithm. That is, while traversing these n base blocks, the sum remains unchanged. After traversing the overhead of these n base blocks, sum is set to sum - T, and then the traversal continues. After the above processing, the positions of 20 overhead base block groups are selected according to the cumulative-difference algorithm. The position of the last selected overhead base block group is discarded, thus selecting the positions of 19 overhead base block groups in total. Adding the first overhead base block group located in the first n base blocks of 238*M+20*n base blocks, the positions of 20 overhead base block groups are determined. Through the above method, the positions of 20 overhead base block groups can be determined in 238*M+20*n base blocks, thereby determining the positions of 20*n overheads. For the ODUCn-Me signal, the first overhead base block group includes frame alignment signal (FAS) overhead, which is used to determine the position of one row of 238*M+20*n base blocks. The other 19 overhead base block groups do not have frame alignment overhead.

[0066] The method for converting the ODUCn signal to an ODUCn-Me signal after deleting 20*nM time slots is as follows: The signal frame of the ODUCn signal is treated as 4 rows of 239*n blocks, each block consisting of 128 bits. The first n blocks of each row are the overhead, and the last 238*n blocks are the payload. The structure of the ODUCn signal frame is as follows: Figure 5As shown, the ODUCn signal determines 5 consecutive frames through the OMFI (OPU Multi-Frame Identifier, OMFI, Payload Multiframe Indicator) overhead. The OMFI overhead value ranges from 0 to 19, increasing by 1 for each signal frame. OMFI overhead values ​​of 0 to 4 are considered as 5 consecutive frames. Similarly, OMFI overhead values ​​of 5 to 9, 10 to 14, and 15 to 19 are also considered as 5 consecutive frames. The ODUCn signal of 5 consecutive frames includes 20*239*n base blocks, of which the payload includes 20*238*n base blocks and the overhead includes 20*n base blocks. For the payload of 20*238*n base blocks, n*20 consecutive base blocks are taken as a time slot period, which includes a total of 238 time slot periods. In each time slot period, 20*nM time slots are deleted, resulting in the payload of 238*M base blocks. This leaves the overhead of 20*n base blocks and the payload of 238*M base blocks. The 20*n overheads are divided into 20 overhead base block groups, and each overhead base block group includes the overhead of n base blocks. All overheads are deleted, that is, the overhead of 20*n base blocks is deleted, which also corresponds to the deletion of 20 overhead base block groups, leaving the payload of 238*M base blocks.

[0067] To add overhead to the payload of 238*M base blocks, add 20 base block groups as follows: Add one overhead base block group at the beginning of the 238*M base blocks. Select 20 base blocks from the 238*M base blocks using the cumulative-difference algorithm. Set the total number T of the cumulative-difference algorithm to 238*M, and the number of selected blocks S to 20. Take the first 19 base blocks from the 20 selected base blocks, and add one overhead base block group after each of these 19 base blocks. The order of the 20 overhead base block groups added above should be consistent with the order of the 20 overhead base block groups in the ODUCN signal. This will give you the ODUCN-Me signal.

[0068] For the 20 overhead base blocks of the ODUCn-Me signal, since these overheads all originate from the ODUCn signal, and the 1st, 5th, 10th, 15th, and 20th overhead base blocks of the ODUCn signal contain 7*n bytes of frame positioning overhead and multiframe alignment signal (MFAS) overhead. The frame positioning overhead and multiframe alignment overhead in the 1st overhead base block remain unchanged, while the frame positioning overhead and multiframe alignment overhead in the 5th, 10th, 15th, and 20th overhead base blocks are written to 0. This ensures that only the 1st overhead base block contains valid frame positioning overhead and multiframe alignment overhead in a single line of the ODUCn-Me signal. This processing also guarantees that when framing the ODUCn-Me signal at the receiving end, there is only one frame positioning overhead and one multiframe alignment overhead per signal frame, facilitating framing.

[0069] The method for converting ODUCN-Me to an ODUCN signal by adding 20*nM time slots is as follows: For a single-line ODUCN-Me signal, one signal frame includes a payload of 238*M base blocks and an overhead of 20*n base blocks. First, 20*nM time slots are added as follows: For the payload of 238*M base blocks, M consecutive base blocks are considered as one time slot period, resulting in a total of 238 time slot periods. 20*nM base blocks are added to each time slot period. The positions of the added base blocks are consistent with the positions of the time slots deleted when deleting 20*nM time slots from ODUCN to obtain ODUCN-Me. Thus, one time slot period ultimately includes 20*n base blocks. After adding time slots, the payload consists of 238*20*n base blocks. Next, 20 overhead base block groups are deleted, leaving only 238*20*n base blocks of payload. Third, the 238*20*n base blocks are divided into 20 rows, each containing 238*n consecutive base blocks of payload. One overhead base block group is added at the beginning of each row of payload. The order of these 20 added overhead base block groups is consistent with the order of the 20 overhead base block groups in the ODUCN-Me signal, thus obtaining the ODUCN signal.

[0070] Example 2:

[0071] Compared with Example 1, Example 2 only modifies the method for determining the overhead location in the ODUCN-Me signal; the other methods are the same as in Example 1.

[0072] In this embodiment, the ODUCn-Me signal is defined as the signal after deleting 20*nM time slots from the ODUCn signal. The signal rate and frame structure are the same as the ODUCn-Me signal in Embodiment 1. The only difference is the method for determining the positions of the 20 overhead base block groups. The method for determining the positions of the 20 overhead base block groups in this embodiment is as follows: In 238*M+20*n base blocks, the first n base blocks correspond to the first overhead base block group. The remaining 238*M+19*n base blocks are traversed. The total number T of the cumulative-difference algorithm is set to 238, and the number of selected blocks S is set to 20. The 238*M+19*n base blocks are traversed according to the cumulative-difference algorithm. M base blocks are traversed each time. Before the traversal begins, the accumulator sum is set to 0. S is added to sum every M base blocks traversed, and it is determined whether it is greater than or equal to T. If T is greater than or equal to T, then the current M blocks being traversed are considered to be one of the selected S M blocks. At this time, the n blocks following these M blocks are considered to be a group of overhead blocks. The overhead of these n blocks is skipped, that is, the traversal is temporarily changed to traversing n blocks at a time. These n blocks do not actually participate in the cumulative difference algorithm. That is, when traversing these n blocks, sum is kept unchanged. After traversing the overhead of these n blocks, sum is set to sum = sum - T. Then the traversal is resumed according to traversing M blocks at a time, and the above process is repeated until the last M blocks are traversed.

[0073] After the above processing, the positions of 20 overhead base block groups were selected using the cumulative difference algorithm. The position of the last selected overhead base block group was discarded, thus selecting a total of 19 overhead base block groups. Adding the first overhead base block group located in the first n blocks out of 238*M+20*n base blocks, a total of 20 overhead base block groups were determined. The only difference between this method and the method in Example 1 is the value of T. In Example 1, T was 238*M, while in this example, T is 238.

[0074] Similarly, the ODUCN signal can be converted into an ODUCN-Me signal by deleting 20*nM time slots, or the ODUCN-Me signal can be converted into an ODUCN signal by adding 20*nM time slots. For specific methods, please refer to Example 1, which will not be described in detail here.

[0075] Example 3:

[0076] This embodiment is equivalent to restricting the value of M in Embodiment 1, making it easier for readers to understand the processing procedure. In Embodiments 1 and 2, there is no restriction on the value of M, i.e., M is an integer greater than 0 and less than 20*n. In this embodiment, the value of M is restricted to 19*n, but the specific location of the 20*nM time slots to be deleted is not restricted. That is, 20*nM time slots can be arbitrarily selected from the 20*n time slots to be deleted, leaving M time slots. If the value of M is divisible by n, one ODUCn-Me signal can be simply split into n sub-signals with equal rates, and the overhead of 20*n base blocks will be evenly distributed to each sub-signal. The split sub-signals can be directly aligned using the frame positioning overhead of the ODUCn-Me signal. If the value of M is not divisible by n, after the ODUCn-Me signal is split into n sub-signals, it is necessary to additionally frame the n sub-signals or add alignment flag blocks to achieve the alignment of the n sub-signals.

[0077] Define the ODUCn-Me signal, where M is 19*n. The ODUCn-Me signal is then denoted as the ODUCn-19*ne signal. The rate of the ODUCn-19*ne signal is the rate of the ODUCn signal * (20 + 238*19) / (239*20), or the rate of the ODUCn signal * 2271 / 2390. The frame structure of the ODUCn-19*ne signal consists of 1 row of 238*19*n + 20*n columns of base blocks. Assuming n consecutive base blocks form a base block group, the frame structure includes 1 row of 4,542 base block groups, with 20 base block groups for overhead and 4,522 base block groups for payload. The method for determining 20 cost base block groups from 4,542 base block groups is as follows: The first base block group corresponds to the first cost base block group. One additional base block group is added to the end of the remaining 4,541 base block groups, resulting in 4,542 base block groups. These 4,542 base blocks are used as the traversal target. The total number of iterations T for the cumulative-difference algorithm is set to 4,542, and the number of selected elements S is set to 20. Each base block group is traversed using the cumulative-difference algorithm, traversing one base block group at a time. Before traversal begins, the accumulator sum is set to 0. For each base block group traversed, sum is incremented by S, and it is checked whether it is greater than or equal to T. If it is greater than or equal to T, the current base block group is considered a cost base block group, and sum is set to sum = sum - T. The traversal continues.

[0078] After processing, the positions of 20 cost base block groups were selected using the cumulative-difference algorithm. The position of the last selected cost base block group was discarded, resulting in a total of 19 selected cost base block group positions. Adding the first cost base block group among the first n base blocks out of 238*M+20*n base blocks, a total of 20 cost base block group positions were determined. Note that in the above process of selecting cost base block groups using the cumulative-difference algorithm, the selected positions are directly used as costs; that is, the positions of the selected cost base block groups participate in the cumulative-difference algorithm. In contrast, the positions of the cost base block groups selected in Embodiments 1 and 2 do not participate in the cumulative-difference algorithm. Furthermore, in this embodiment, T is the value of all cost base block groups in row 1 plus the corresponding payload, while in Embodiments 1 and 2, T is determined without including costs.

[0079] Figure 6 It is the position of the 20 overhead base blocks in the ODUCn-19*ne signal frame. Figure 6 In the ODUC n-19*ne signal, the signal frame consists of 4,542 base block groups in one row. Each base block group is assigned a column number, with values ​​ranging from 1 to 4,542. Figure 3 The column numbers of the 20 overhead base block groups are listed.

[0080] Figure 7 This is a schematic diagram of the frame structure of the ODUCn-19*ne signal. Figure 7 In this context, a rectangle represents a group of base blocks. For simplicity, Figure 7 Only the first three overhead base block groups and their locations are listed. Note that although the method for determining the 20 overhead base block groups described above is different from the method for determining the 20 overhead base block groups in Example 1, the actual locations of the 20 overhead base block groups are the same.

[0081] The method for converting the ODUCN signal to an ODUCN-19*ne signal after deleting n time slots is as follows: The ODUCN signal is determined by OMFI overhead over 5 consecutive frames. The 5 consecutive frames of the ODUCN signal include 4,780 base block groups, of which the payload includes 4,760 base block groups and the overhead includes 20 base block groups. For the payload of 4,760 base block groups, 20 consecutive base blocks are taken as a time slot period, resulting in a total of 238 time slot periods. In each time slot period, n time slots are deleted. Since n time slots correspond to 1 base block group, in terms of quantity, after deleting n time slots in each time slot period, 19 base block groups remain. This results in 238*19=4,522 base block groups of payload and 20 base block groups of overhead. Deleting all overhead, i.e., deleting 20 overhead base block groups, leaves 4,522 base block groups of payload.

[0082] To add overhead to the payload of 4,522 base block groups, add the overhead of 20 base block groups as follows: First, add the overhead of one base block group at the beginning of the 4,522 base block groups. Then, select 20 base block groups from the 4,522 base block groups using the cumulative-difference algorithm. Set the total number T of the cumulative-difference algorithm to 4,522, and the number of selected base block groups S to 20. Take the first 19 base block groups from the 20 selected base block groups, and add one overhead base block group after each of these 19 base block groups. The order of the 20 overhead base block groups added above should be consistent with the order of the 20 overhead base block groups in the ODUCn signal. This will give you the ODUCn-19*ne signal. For the 20 overhead base block groups of the ODUCn-19*ne signal, the frame positioning overhead and multiframe positioning overhead in the first overhead base block group are kept unchanged, and the frame positioning overhead and multiframe positioning overhead in the 5th, 10th, 15th and 20th overhead base block groups are written to 0. In this way, only the first overhead base block group in a row of ODUCn-19*ne signal contains valid frame positioning overhead and multiframe positioning overhead.

[0083] The ODUCn-19*ne signal will then need to be converted into n sub-signals. The method is as follows: For the ODUCn-19*ne signal, using one base block as the interleaving unit, divide the 4,542*n base blocks in one row into n parts, each part corresponding to one ODUC-19e signal. The frame structure of the ODUC-19e signal includes one row of 4,542 base blocks, of which the overhead includes 20 base blocks. The first base block in the 4,542 base blocks is the overhead. The method for locating the remaining 19 overhead blocks within the 4,542 base blocks can refer to the overhead location method in the ODUCn-19*ne frame structure above; simply replace the base block group with a base block. The ODUCn-19*ne signal is composed of n ODUC-19e signal frame headers aligned together.

[0084] The method for converting ODUCn-19*ne into an ODUCn signal by adding n time slots is as follows: For a single-row ODUCn-19*ne signal, there is an overhead of 20 base block groups and a payload of 4,522 base block groups. First, add n time slots as follows: For the payload of 4,522 base block groups, take 19 consecutive base block groups as one time slot period, for a total of 238 time slot periods. Add n time slots in each time slot period. The positions of the added n time slots are consistent with the positions of the time slots deleted when deleting n time slots from ODUCn to obtain ODUCn-19*ne. Since n time slots correspond to one base block group, in terms of quantity, adding n time slots per time slot period corresponds to 20 base block groups, meaning one time slot period ultimately includes 20 base block groups. After adding time slots, the payload includes a total of 4,760 base block groups. Secondly, 20 overhead base block groups are deleted, leaving only 4,760 base block groups of payload. Thirdly, these 4,760 base block groups are divided into 20 rows, each row containing 238 consecutive base block groups of payload. One overhead base block group is added at the beginning of each row. The order of these 20 added overhead base block groups is consistent with the order of the 20 overhead base block groups in the ODUCn-19*ne signal, thus obtaining the ODUCn signal.

Claims

1. A signal processing method, characterized in that, The method includes: Delete the time slot in the first signal; Remove the overhead of the first signal; Add the overhead of the deleted first signal back to the first signal; The first signal is processed as described above to obtain the second signal, and the second signal is then sent.

2. The method according to claim 1, characterized in that, The first signal consists of signal frames of fixed length, each signal frame including overhead and payload. The payload of the signal frame of the first signal is divided into a time slots, where a is an integer greater than 1.

3. The method according to claim 2, characterized in that, Deleting a time slot from the first signal includes: Determine the number of consecutive signal frames d, where d is a positive integer, such that d*f is divisible by a*g, where f is the number of bits in the payload of a signal frame, and g is the number of bits in a time slot. In the payload of the first signal for d consecutive signal frames, delete b time slots from a time slot, where b is an integer greater than 0 and less than a.

4. The method according to claim 3, characterized in that, The overhead of deleting the first signal includes: Remove all overhead from the first signal across d consecutive signal frames.

5. The method according to claim 4, characterized in that, The step of adding the overhead of the deleted first signal back to the first signal includes: According to a preset distribution method, all the deleted overhead is re-added to the payload of the first signal for d consecutive signal frames, such that the distance between the re-added overhead position and the previous overhead position is less than a preset value.

6. The method according to claim 5, characterized in that, Sending the second signal includes: Send the second signal directly; Alternatively, the second signal can be converted into a third signal and the third signal can be sent. Alternatively, the second signal can be incorporated into the fourth signal, and the fourth signal can be sent.

7. The method according to claim 6, characterized in that, After sending the second signal, the process also includes: Receive the second signal; Add a time slot to the second signal; Remove the overhead of the second signal; The overhead of the deleted second signal is added back to the second signal, and the second signal is processed as described above to obtain the first signal.

8. The method according to claim 7, characterized in that, Receiving the second signal includes: Directly receive the second signal; Alternatively, receive the third signal and convert the third signal into the second signal; Alternatively, the fourth signal can be received, and the second signal can be extracted from the fourth signal.

9. The method according to claim 8, characterized in that, Adding a time slot to the second signal includes: Add b time slots to the c time slots of the payload of the second signal for d consecutive signal frames, where c is an integer and c = ab. The positions of the added b time slots are the same as the positions of the b time slots deleted from the a time slots of the payload of the first signal for d consecutive signal frames.

10. The method according to claim 9, characterized in that, The overhead of deleting the second signal includes: Remove all overhead from d consecutive signal frames of the second signal.

11. The method according to claim 10, characterized in that, The step of adding the overhead of the deleted second signal back to the second signal includes: All the removed overhead is added back to the payload of the second signal for d consecutive signal frames, such that the added overhead is located at the position of the overhead of the first signal for d consecutive signal frames.

12. A data transmission device, characterized in that, include: Communication signal transmitting module and communication signal receiving module; The communication signal transmitting module is used to execute the signal processing method as described in any one of claims 1-6; The communication signal receiving module is used to execute the signal processing method as described in any one of claims 7-11.

13. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1-11.

14. A computer program product, characterized in that, The computer program product includes computer program instructions that, when executed, implement the method as described in any one of claims 1-11.

Images