Turbo coding method and device, equipment and medium

The lightweight Turbo coding method using pre-stored mapping tables addresses the resource-intensive issues of FPGA-based implementations, enhancing efficiency and reducing complexity for Turbo coding, especially in digital signal processors.

CN119094085APending Publication Date: 2024-12-06SHANGHAI SMARTLOGIC TECHNOLOGY LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411238981.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-04
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

The implementation of Turbo coding in related technologies often relies on the Field-Programmable Gate Array (FPGA) platform, which consumes excessive hardware resources, increasing complexity and cost, posing challenges for large-scale deployment and commercial applications.

Method used

A lightweight Turbo coding method utilizing bit coding and state value update tables to store mapping relationships, enabling efficient encoding by quick lookup operations, reducing hardware resource occupancy and complexity.

Benefits of technology

This method improves processing efficiency and reduces hardware complexity, allowing Turbo coding to be implemented with minimal resource usage, particularly suitable for digital signal processors (DSPs).

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119094085A_ABST
    Figure CN119094085A_ABST
Patent Text Reader

Abstract

The invention provides a Turbo encoding method and device, equipment and a medium. The method comprises the following steps: acquiring a to-be-encoded data block through a sub-encoding unit in a Turbo encoder; determining at least one original bit sequence with a preset length from the to-be-coded data block; a bit coding table and a state value updating table are obtained according to a preset length, the bit coding table stores an original bit sequence and mapping relation data between current state values of the sub-coding units and coding bits, and the state value updating table is updated according to the original bit sequence; the state value updating table stores the original bit sequence, and mapping relation data between the current state value of the sub-coding unit and the updated state value of the sub-coding unit; and on the basis of the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value updating table, coding each original bit sequence in the at least one original bit sequence in sequence to obtain a coding bit sequence corresponding to each original bit sequence so as to form a coding data block containing each coding bit sequence.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a Turbo coding method, apparatus, device and medium. Background Art

[0002] In cellular mobile communication systems, the efficiency and reliability of data transmission between base stations and user equipment (UE) are key to ensuring system performance. Turbo coding, as a channel coding technology, achieves effective information coding by introducing an interleaving unit and two sub-coding units, thereby enhancing the stability of the communication link while ensuring data transmission rate.

[0003] However, the implementation of Turbo coding in related technologies often relies on the Field-Programmable Gate Array (FPGA) platform. Although FPGA provides high flexibility and parallel processing capabilities, it takes up more hardware resources to implement Turbo coding, which increases the complexity and cost of hardware design. Therefore, it is urgent to propose a lightweight Turbo coding implementation method. Summary of the invention

[0004] The embodiments of the present application provide a Turbo coding method, apparatus, device and medium.

[0005] According to a first aspect of an embodiment of the present application, a Turbo coding method is provided, including:

[0006] Obtaining a data block to be encoded through a sub-coding unit in a Turbo encoder;

[0007] Determine at least one original bit sequence of a preset length from the data block to be encoded;

[0008] Acquire a bit coding table and a state value update table according to the preset length, wherein the bit coding table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and the state value update table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit;

[0009] Based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table, each of the original bit sequences in at least one of the original bit sequences is encoded in turn to obtain a coded bit sequence corresponding to each of the original bit sequences, so as to form a coded data block containing each of the coded bit sequences.

[0010] In combination with the first aspect, in some possible implementations, based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table, encoding each original bit sequence in at least one of the original bit sequences in turn to obtain a coded bit sequence corresponding to each original bit sequence to form a coded data block containing each coded bit sequence, including: traversing each of the original bit sequences in turn; for the traversed target original bit sequence, traversing each original bit in the target original bit sequence in turn; for the target original bit in the traversed target original bit sequence, querying the bit coding table based on the target original bit sequence and the current state value of the sub-coding unit. code table, obtain the target coding bit corresponding to the target original bit; and, based on the target original bit sequence and the current state value of the sub-coding unit, query the state value update table to obtain the updated state value of the sub-coding unit, and determine the updated state value of the sub-coding unit as the current state value of the sub-coding unit; if the coding bit corresponding to each original bit in the target original bit sequence is obtained, then end the traversal of each original bit in the target original bit sequence to obtain the target coding bit sequence corresponding to the target original bit sequence; if the coding bit sequence corresponding to each original bit sequence is obtained, then end the traversal of each original bit sequence to form the coding data block containing each coding bit sequence.

[0011] In combination with the first aspect and the above-mentioned implementation manner, in some possible implementation manners, the preset length includes a preset first length and a preset second length, the preset first length is greater than the preset second length and is an integer multiple of the preset second length, and the total length of the data block to be encoded is greater than or equal to the preset first length and is an integer multiple of the preset second length; determining at least one original bit sequence of a preset length from the data block to be encoded includes: if the total length of the data block to be encoded is not an integer multiple of the preset first length, determining at least one original bit sequence of the preset first length and an original bit sequence of the preset second length from the data block to be encoded, wherein the original bit sequence of the preset second length is after at least one original bit sequence of the preset first length.

[0012] In combination with the first aspect and the above-mentioned implementation methods, in some possible implementation methods, obtaining a bit coding table and a state value update table according to the preset length includes: obtaining a first bit coding table and a first state value update table according to the preset first length, wherein the first bit coding table stores the original bit sequence of the preset first length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit, and the first state value update table stores the mapping relationship data between the original bit sequence of the preset first length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit; obtaining a second bit coding table and a second state value update table according to the preset second length, wherein the second bit coding table stores the original bit sequence of the preset second length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit, and the second state value update table stores the mapping relationship data between the original bit sequence of the preset second length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit.

[0013] In combination with the first aspect and the above-mentioned implementation manner, in some possible implementation manners, based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table, each original bit sequence in at least one of the original bit sequences is encoded in turn to obtain a coded bit sequence corresponding to each original bit sequence, so as to form a coded data block containing each coded bit sequence, including: based on the original bit sequence of the preset first length, the current state value of the sub-coding unit, the first bit coding table and the first state value update table, each original bit sequence of the preset first length in at least one original bit sequence of the preset first length is encoded in turn to obtain a coded bit sequence corresponding to each original bit sequence of the preset first length; based on the original bit sequence of the preset second length, the current state value of the sub-coding unit, the second bit coding table and the second state value update table, the original bit sequence of the preset second length is encoded to obtain a coded bit sequence corresponding to the original bit sequence of the preset second length, so as to form the coded data block containing each coded bit sequence of the preset first length and the coded bit sequence of the preset second length.

[0014] In combination with the first aspect and the above-mentioned implementation methods, in some possible implementation methods, the data block to be encoded is obtained from an original bit stream; based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table, each original bit sequence in at least one of the original bit sequences is encoded in turn to obtain a coded bit sequence corresponding to each original bit sequence to form a coded data block containing each coded bit sequence, it also includes: obtaining the original bit stream and a check bit stream composed of the coded data block; and outputting a Turbo hybrid coded bit stream according to the original bit stream and the check bit stream.

[0015] In combination with the first aspect and the above implementations, in some possible implementations, the Turbo encoding method is applied to a digital signal processor DSP.

[0016] According to a second aspect of the embodiments of the present application, a Turbo encoding device is provided, the device comprising:

[0017] A first acquisition module, used for acquiring a data block to be encoded through a sub-encoding unit in a Turbo encoder;

[0018] A determination module, used to determine at least one original bit sequence of a preset length from the data block to be encoded;

[0019] A second acquisition module is used to acquire a bit coding table and a state value update table according to the preset length, wherein the bit coding table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and the state value update table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit;

[0020] A coding module is used to encode each of the original bit sequences in at least one of the original bit sequences in turn based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table to obtain a coded bit sequence corresponding to each of the original bit sequences, so as to form a coded data block containing each of the coded bit sequences.

[0021] According to a third aspect of an embodiment of the present application, a computer device is provided, comprising: a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of any of the above methods when executing the computer program.

[0022] A fourth aspect of an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the steps of any of the above methods when executed by a processor. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0024] Figure 1 This is a schematic diagram of a Turbo coding scenario provided by an embodiment of the present application;

[0025] Figure 2 It is a flowchart of a Turbo coding method provided in an embodiment of the present application;

[0026] Figure 3 It is a schematic diagram of a process of encoding based on a table lookup method provided in an embodiment of the present application;

[0027] Figure 4 It is a flowchart of a Turbo coding method provided in an embodiment of the present application;

[0028] Figure 5 is an example schematic diagram of a mapping relationship in the first bit coding table provided in an embodiment of the present application;

[0029] Figure 6 is an example schematic diagram of a mapping relationship in a first state value update table provided in an embodiment of the present application;

[0030] Figure 7 is an example schematic diagram of a mapping relationship in the second bit coding table provided in an embodiment of the present application;

[0031] Figure 8 is an example schematic diagram of a mapping relationship in a second state value update table provided in an embodiment of the present application;

[0032] Fig. 9 It is a schematic diagram of a process of outputting a Turbo hybrid coded bit stream provided in an embodiment of the present application;

[0033] Fig.10 is a schematic diagram of the structure of a Turbo encoding device provided in an embodiment of the present application;

[0034] Fig.11 It is a structural diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0035] The solutions in the embodiments of the present application can be implemented using various computer languages, for example, the object-oriented programming language Java and the interpreted scripting language JavaScript.

[0036] In order to make the technical solutions and advantages in the embodiments of the present application more clearly understood, the exemplary embodiments of the present application are further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than an exhaustive list of all the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other without conflict.

[0037] The following is a brief description of the application scenarios of the Turbo coding method provided in the embodiment of the present application:

[0038] See also Figure 1 , Figure 1 This is a schematic diagram of a Turbo coding scenario provided by an embodiment of the present application. In a cellular mobile communication system, the efficiency and reliability of data transmission between the base station 001 and the user equipment 002 (UE for short) are indeed key factors in ensuring the performance of the entire system. As a channel coding technology, the core of Turbo coding technology lies in the introduction of an interleaving unit and two carefully designed sub-coding units. These two sub-coding units work in conjunction with the interleaving unit to achieve deep coding of the transmitted information, which not only effectively improves the anti-interference ability of the data, but also maintains the stability of the communication link at a high data transmission rate, which is crucial to improving the overall performance of the mobile communication system.

[0039] In practical applications, Turbo coding can be implemented on the base station 001 side or the user equipment 002 side, and the specific implementation location depends on the system design requirements and optimization goals. Implementing Turbo coding on the base station 001 side can centrally handle the coding requirements of a large number of users, and use the strong processing power of the base station 001 to optimize the coding efficiency and quality. Implementing Turbo coding on the user equipment 002 side can reduce the waiting time before data transmission and improve the response speed and autonomy of the user equipment 002. However, whether it is base station 001 coding or user equipment 002 coding, the Turbo coding implementation in related technologies mostly relies on the field programmable gate array (FPGA) platform. FPGA provides strong support for the implementation of Turbo coding with its high flexibility and powerful parallel processing capabilities. However, when FPGA implements the Turbo coding function, it needs to occupy a large amount of hardware resources, including logic units, memory blocks, and complex wiring resources. This not only increases the complexity of hardware design, but also pushes up manufacturing costs, posing certain challenges to large-scale deployment and commercial applications.

[0040] Therefore, in view of the problems existing in the current Turbo coding implementation, a lightweight Turbo coding implementation method is urgently needed.

[0041] In view of the above-mentioned problems of the related art, the embodiments of the present application mainly provide the following solutions: using a bit coding table to store the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and using a state value update table to store the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value. During the encoding process, based on these pre-stored mapping relationship data, the encoding process of each original bit sequence can be quickly completed to obtain the corresponding encoding bit sequence, thereby forming an encoded data block. In this way, the processing efficiency of Turbo coding is significantly improved and the complexity of the encoding process is reduced. At the same time, since this solution mainly relies on pre-stored mapping relationship data for encoding, when implementing the Turbo coding function, the occupancy of hardware resources is relatively low, which helps to support the lightweight implementation of Turbo coding technology.

[0042] based on Figure 1 The scene shown is shown below. Figure 2 - Fig. 9 , the Turbo encoding method provided in the embodiment of the present application is introduced in detail.

[0043] See also Figure 2 , Figure 2 A flow chart of a Turbo coding method provided in an embodiment of the present application. Figure 2 As shown, the method of the embodiment of the present application may include the following steps S101-S104. The execution subject of this embodiment may be a base station, a user equipment or other equipment that may have Turbo coding requirements, wherein a Turbo encoder is provided. The Turbo encoder includes an interleaving unit and two sub-coding units, and steps S101-S104 may be performed by the two sub-coding units respectively.

[0044] S101, obtaining a data block to be encoded through a sub-encoding unit in a Turbo encoder.

[0045] Specifically, the sub-coding unit in the Turbo encoder obtains the data block to be encoded from the original bit stream for subsequent Turbo encoding processing. The original bit stream is composed of at least one data block to be encoded, and these data blocks to be encoded may have different lengths. In the Turbo encoding process, the sub-coding unit needs to process these data blocks to be encoded of different lengths and convert them into encoded data blocks.

[0046] The Turbo encoder includes an interleaving unit and two sub-coding units, assuming that the two sub-coding units are divided into a first sub-coding unit and a second sub-coding unit. Among them, the first sub-coding unit can directly obtain the data block to be encoded from the original bit stream that has not been interleaved by the interleaving unit, and the second sub-coding unit can obtain the data block to be encoded from the original bit stream that has been interleaved by the interleaving unit. That is, both the first sub-coding unit and the second sub-coding unit have the ability to obtain the data block to be encoded, and whether the original bit stream is interleaved by the interleaving unit does not affect the implementation of the solution of this embodiment.

[0047] S102: Determine at least one original bit sequence of a preset length from a data block to be encoded.

[0048] Specifically, the preset length refers to the data length of a single encoding process performed by the sub-coding unit. By dividing the data block to be encoded based on the preset length, at least one original bit sequence of the preset length can be obtained. For example, the preset length may include 16 bits, so the original bit sequence of the preset length is composed of 16 original bits; for another example, the preset length may include 8 bits, so the original bit sequence of the preset length is composed of 8 original bits. Generally speaking, the data block to be encoded is composed of multiple bytes, and its total length is an integer multiple of 8 bits. Therefore, the preset length is an integer multiple of 8 bits, and the optional values ​​include 8, 16, 24, 32, 40, etc.

[0049] It should be noted that, in some cases, the preset length includes only one length, for example, the preset length includes only 16 bits, indicating that the data block to be encoded is composed of data of an integer multiple of 16 bits. In some cases, the preset length may include multiple lengths, for example, the preset length includes 16 bits and 8 bits, indicating that the data block to be encoded is composed of data of an integer multiple of 8 bits, rather than data of an integer multiple of 16 bits.

[0050] It should be noted that, in some cases, at least one original bit sequence of a preset length has a clear order, and generally, an original bit sequence of a shorter length is arranged after an original bit sequence of a longer length.

[0051] S103, obtaining a bit coding table and a state value update table according to a preset length, wherein the bit coding table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and the state value update table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit.

[0052] Specifically, the Turbo encoder needs to obtain two key mapping relationship tables according to a preset length: a bit encoding table and a state value update table.

[0053] The bit encoding table is a data table that stores the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the encoding bit. This means that for each specific original bit sequence and the current state value of the sub-coding unit, there is a corresponding encoding bit in the bit encoding table. The existence of this mapping relationship data enables the sub-encoder to quickly find the encoding bit corresponding to the original bit sequence and the current state value of the sub-encoder, thereby improving the speed and accuracy of encoding.

[0054] The state value update table stores the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit. This means that for each specific original bit sequence and the current state value of the sub-coding unit, there is a corresponding updated state value of the sub-coding unit in the state value update table. During the encoding process, the current state value of the sub-coding unit will be updated according to the original bit sequence, and the state value update table provides a fast way to find this update relationship. In this way, the sub-encoder can quickly find the updated state value of the sub-coding unit according to the original bit sequence and the current state value of the sub-coding unit, so as to update the current state value of the sub-coding unit according to the updated state value of the sub-coding unit, thereby ensuring the continuity and correctness of the encoding process.

[0055] S104, based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table, encode each original bit sequence in at least one original bit sequence in turn to obtain a coded bit sequence corresponding to each original bit sequence, so as to form a coded data block containing each coded bit sequence.

[0056] Specifically, for each original bit sequence, the sub-encoder will search for the corresponding multiple coding bits from the bit coding table according to the original bit sequence and the current state value of the sub-encoder to form a corresponding coding bit sequence. At the same time, after each search for the corresponding coding bit from the bit coding table, the sub-encoder will search for the corresponding updated state value of the sub-encoder from the state value update table according to the original bit sequence and the current state value of the sub-encoder, and update the current state value of the sub-encoding unit according to the updated state value of the sub-encoding unit, so as to provide a suitable current state value of the sub-encoding unit for the next search action for the bit coding table. In this way, after processing all the original bit sequences in sequence, the coding bit sequence corresponding to each original bit sequence can be obtained.

[0057] Finally, the coded bit sequences are combined to form a coded data block containing the coded bit sequences. It is understandable that there may be multiple coded data blocks in the original bit stream, so the sub-encoder may also obtain and encode multiple coded data blocks to obtain multiple coded data blocks.

[0058] In this embodiment, a bit coding table is used to store the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and a state value update table is used to store the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value. During the encoding process, based on these pre-stored mapping relationship data, the encoding process of each original bit sequence can be quickly completed to obtain the corresponding encoding bit sequence, thereby forming a coded data block. In this way, the processing efficiency of Turbo coding is significantly improved and the complexity of the coding process is reduced. At the same time, since this solution mainly relies on pre-stored mapping relationship data for encoding, when implementing the Turbo coding function, the occupation of hardware resources is relatively low, which helps to support the lightweight implementation of Turbo coding technology.

[0059] Based on the above Figure 2 In the embodiment shown, in one embodiment of the present application, the Turbo encoding method is applied to a digital signal processor DSP.

[0060] Specifically, when implementing Turbo coding on DSP, it is first necessary to obtain the bit coding table and the state value update table according to the preset length. These two mapping relationship tables are the core of Turbo coding. They store the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit. The existence of these mapping relationship data enables the coding bits and updated state values ​​corresponding to the original bit sequence and the current state value of the sub-coding unit to be found quickly and accurately when Turbo coding is performed on DSP, thereby improving the speed and accuracy of coding.

[0061] Since the bit encoding table and the state value update table store all possible mapping relationships, the DSP does not need to perform complex calculations during the encoding process. It only needs to find the corresponding encoding bits and update the state value from the two tables based on the current original bit sequence and the current state value of the sub-coding unit. This encoding method based on search significantly reduces the computational burden of the DSP, allowing Turbo coding to be implemented with a small amount of memory resources.

[0062] Specifically, after obtaining the data block to be encoded, the DSP will divide it into original bit sequences of preset length. Then, for each original bit sequence, the DSP will search for the corresponding multiple encoding bits from the bit encoding table according to the original bit sequence and the current state value of the sub-coding unit to form a corresponding encoding bit sequence. At the same time, the DSP will also search for the corresponding updated state value of the sub-coding unit from the state value update table according to the original bit sequence and the current state value of the sub-coding unit, and update the current state value of the sub-coding unit according to this updated state value. In this way, after processing all the original bit sequences in sequence, the DSP can obtain the encoding bit sequences corresponding to each original bit sequence, and combine them to form an encoded data block.

[0063] In this embodiment, the Turbo coding method is applied to DSP, and Turbo coding can be implemented in combination with a small amount of memory. This is due to the design of the bit coding table and the state value update table, which makes the coding process mainly rely on the search operation, reduces the calculation complexity, and improves the coding efficiency. At the same time, this implementation method also makes full use of the powerful data processing capability of DSP, so that Turbo coding can be implemented in a lightweight manner.

[0064] See also Figure 3 , a schematic diagram of a process for encoding based on a table lookup method is provided for an embodiment of the present application, such as Figure 3 As shown, the method of the embodiment of the present application may include the following steps S201-S205, and steps S201-S205 may be used as Figure 2 The refinement of step S104 in the illustrated embodiment.

[0065] S201, traverse each original bit sequence in turn;

[0066] S202, for the traversed target original bit sequence, traverse each original bit in the target original bit sequence in sequence;

[0067] S203, for the target original bit in the traversed target original bit sequence, query the bit coding table based on the target original bit sequence and the current state value of the sub-coding unit to obtain the target coding bit corresponding to the target original bit; and query the state value update table based on the target original bit sequence and the current state value of the sub-coding unit to obtain the updated state value of the sub-coding unit, and determine the updated state value of the sub-coding unit as the current state value of the sub-coding unit;

[0068] S204, if the coded bits corresponding to the original bits in the target original bit sequence are obtained, then the traversal of the original bits in the target original bit sequence is terminated to obtain the target coded bit sequence corresponding to the target original bit sequence;

[0069] S205: If the coded bit sequences corresponding to the original bit sequences are obtained, the traversal of the original bit sequences is terminated to form a coded data block containing the coded bit sequences.

[0070] Specifically, the sub-encoder will traverse each original bit sequence divided in the data block to be encoded in a preset order, ensuring that each original bit sequence will be encoded one by one without omission. The traversal process is orderly and can be sorted according to their position in the data block to be encoded to ensure the consistency and repeatability of the encoding.

[0071] After determining the target original bit sequence to be traversed, the sub-encoder will further process each original bit in the target original bit sequence one by one. This step is the core of the encoding process because it involves converting each original bit in the target original bit sequence into the corresponding coded bit. By traversing each original bit in the target original bit sequence, the sub-encoder can ensure the integrity and accuracy of the data while maintaining the orderliness of the encoding process.

[0072] For each traversed original bit in the target original bit sequence, the sub-encoder uses two key mapping relationship tables: the bit encoding table and the state value update table. The bit encoding table stores the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coded bit, which enables the encoder to quickly find the coded bit corresponding to the original bit and the current state value of the sub-encoder. At the same time, the state value update table stores the mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit, which allows the sub-encoder to update the current state value of the sub-coding unit during the encoding process to ensure the continuity and correctness of the encoding. Through the coordinated use of these two tables, the sub-encoder can efficiently complete the conversion from original bits to coded bits and update the current state value of the sub-coding unit in real time.

[0073] After the sub-encoder has traversed all the original bits in the target original bit sequence and converted them into corresponding coded bits, the coded bits can be further combined to form a target coded bit sequence corresponding to the target original bit sequence.

[0074] When the sub-encoder has processed all the original bit sequences and converted them into corresponding coded bit sequences, it combines these coded bit sequences to form the final coded data block.

[0075] In this embodiment, by traversing each original bit sequence and each original bit therein in turn, the integrity and orderliness of the encoding process are ensured, and the omission and confusion of data are avoided. At the same time, the bit encoding table and the state value update table are used for fast table lookup encoding, which not only improves the encoding speed, but also ensures the correctness and continuity of the encoding. This table lookup method avoids complex calculation processes, reduces the complexity of encoding, and makes the encoding process more efficient and reliable. In addition, by combining the encoded bit sequences into encoded data blocks, compact storage and efficient transmission of data are achieved.

[0076] See also Figure 4 , which is a flow chart of a Turbo coding method provided in an embodiment of the present application. Figure 4 As shown, the method of the embodiment of the present application may include the following steps S301-S307.

[0077] S301, obtaining a data block to be encoded through a sub-coding unit in a Turbo encoder;

[0078] For details on the implementation process of step S301, please refer to Figure 2 The explanation of step S101 in the illustrated embodiment will not be repeated here.

[0079] In some cases, the preset length includes only the preset first length; in some cases, the preset length includes the preset first length and the preset second length. The preset first length is greater than the preset second length and is an integer multiple of the preset second length, and the total length of the data block to be encoded is greater than or equal to the preset first length and is an integer multiple of the preset second length. Next, according to the relationship between the total length of the data block to be encoded and the preset length, steps S302-S304 or steps S305-S307 can be selectively performed.

[0080] S302: If the total length of the data block to be encoded is an integer multiple of a preset first length, determine at least one original bit sequence of the preset first length from the data block to be encoded.

[0081] S303, obtaining a first bit coding table and a first state value update table according to a preset first length, wherein the first bit coding table stores mapping relationship data between an original bit sequence of a preset first length, a current state value of a sub-coding unit and coding bits, and the first state value update table stores mapping relationship data between an original bit sequence of a preset first length, a current state value of a sub-coding unit and an updated state value of the sub-coding unit;

[0082] S304, based on the original bit sequence of the preset first length, the current state value of the sub-coding unit, the first bit coding table and the first state value update table, encode each original bit sequence of the preset first length in at least one original bit sequence of the preset first length in turn to obtain a coded bit sequence corresponding to each original bit sequence of the preset first length, so as to form a coded data block containing each coded bit sequence of the preset first length.

[0083] Specifically, first, when the total length of the data block to be encoded is an integer multiple of the preset first length, it is necessary to determine at least one original bit sequence of the preset first length from the data block to be encoded, so as to ensure that the data block to be encoded can be effectively divided and processed according to the preset first length. The selection of the preset first length is based on the consideration of coding efficiency and performance, and it can be an optimized length that can strike a balance between coding complexity and coding efficiency.

[0084] Next, the first bit coding table and the first state value update table are obtained according to the preset first length. These two tables are the core data structures in the coding process, and they store all the mapping relationships and data required for coding. The first bit coding table contains the mapping relationship data between the original bit sequence of the preset first length, the current state value of the sub-coding unit and the coding bit. In other words, for each original bit sequence of the preset first length and the current state value of the sub-coding unit, the corresponding coding bit can be found in the first bit coding table. The first state value update table stores the mapping relationship data between the original bit sequence of the preset first length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit. This table is used to update the state value of the sub-coding unit during the coding process to ensure the continuity and correctness of the coding.

[0085] Finally, based on the original bit sequence of the preset first length, the current state value of the sub-coding unit, the first bit coding table and the first state value update table, the original bit sequences of the preset first length in at least one original bit sequence of the preset first length are encoded in sequence, and the process involves searching for the corresponding coding bit from the first bit coding table and forming the corresponding coding bit sequence. At the same time, the sub-coding unit will also search for the updated state value of the corresponding sub-coding unit according to the first state value update table after searching for the corresponding coding bit from the first bit coding table each time, and update the current state value of the sub-coding unit. In this way, after processing all the original bit sequences of the preset first length in sequence, the coding bit sequences corresponding to the original bit sequences of the preset first length can be obtained. These coding bit sequences will be combined in order to form the final coded data block.

[0086] S305: If the total length of the data block to be encoded is not an integer multiple of the preset first length, determine at least one original bit sequence of the preset first length and an original bit sequence of the preset second length from the data block to be encoded, wherein the original bit sequence of the preset second length is after at least one original bit sequence of the preset first length.

[0087] S306, obtaining a first bit coding table and a first state value update table according to a preset first length, wherein the first bit coding table stores the original bit sequence of the preset first length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit, and the first state value update table stores the mapping relationship data between the original bit sequence of the preset first length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit; and, obtaining a second bit coding table and a second state value update table according to a preset second length, wherein the second bit coding table stores the original bit sequence of the preset second length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit, and the second state value update table stores the mapping relationship data between the original bit sequence of the preset second length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit.

[0088] S307, based on the original bit sequence of the preset first length, the current state value of the sub-coding unit, the first bit coding table and the first state value update table, encode each original bit sequence of the preset first length in at least one original bit sequence of the preset first length in turn to obtain a coded bit sequence corresponding to each original bit sequence of the preset first length; based on the original bit sequence of the preset second length, the current state value of the sub-coding unit, the second bit coding table and the second state value update table, encode the original bit sequence of the preset second length to obtain a coded bit sequence corresponding to the original bit sequence of the preset second length, so as to form a coded data block containing the coded bit sequences of each preset first length and the coded bit sequences of the preset second length.

[0089] Specifically, first, when the total length of the data block to be encoded is not an integer multiple of the preset first length, at least one original bit sequence of the preset first length and an original bit sequence of the preset second length should be divided from the data block to be encoded. Here, the original bit sequence of the preset second length follows the original bit sequence of the preset first length. Such a division strategy ensures that all data in the data block to be encoded can be processed completely without omission. The selection of the preset second length is also based on considerations of coding efficiency and performance. It is usually a length that is smaller than the preset first length and can optimize coding complexity and efficiency.

[0090] Next, according to the preset first length and the preset second length, the corresponding first bit coding table, the first state value update table, the second bit coding table and the second state value update table are obtained respectively. These four tables are the core data structures in the encoding process, and they store all the mapping relationships and data required for encoding. The first bit coding table and the second bit coding table respectively contain the original bit sequences of the preset first length and the preset second length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit. This means that for each original bit sequence of the preset length and the current state value of the sub-coding unit, the corresponding coding bit can be found in these two tables. The first state value update table and the second state value update table respectively store the mapping relationship data between the original bit sequences of the preset first length and the preset second length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit. These two tables are used to update the state value of the sub-coding unit during the encoding process to ensure the continuity and correctness of the encoding.

[0091] Finally, based on the original bit sequences of the preset first length and the preset second length, the current state value of the sub-coding unit, and the corresponding bit coding table and state value update table, the divided original bit sequences are coded in sequence. The process first processes all the original bit sequences of the preset first length, searches for the corresponding coding bits from the first bit coding table, and forms the corresponding coding bit sequences. At the same time, the sub-coding unit will also search for the updated state value of the corresponding sub-coding unit according to the first state value update table after each search for the corresponding coding bit from the first bit coding table, and update the current state value of the sub-coding unit according to the updated state value of the sub-coding unit. After processing all the original bit sequences of the preset first length, the original bit sequences of the preset second length are then processed, the corresponding coding bits are searched from the second bit coding table, and the corresponding coding bit sequences are formed. At the same time, the updated state value of the corresponding sub-coding unit is also searched according to the second state value update table, and the current state value of the sub-coding unit is updated according to the updated state value of the sub-coding unit. In this way, after processing all the divided original bit sequences in sequence, the coding bit sequences corresponding to the original bit sequences of each preset length can be obtained. These coded bit sequences will be combined in order to form the final coded data block.

[0092] In this embodiment, when the total length of the data block to be encoded is an integer multiple of the preset first length, the first bit encoding table and the first state value update table are directly used for encoding, ensuring the consistency and efficiency of the encoding process. When the total length of the data block to be encoded is not an integer multiple of the preset first length, the original bit sequences of different lengths are encoded separately by combining the first bit encoding table, the first state value update table, the second bit encoding table, and the second state value update table, thereby achieving effective processing of data blocks to be encoded of any length. This method not only avoids the waste of data blocks, but also improves the flexibility and applicability of encoding, so that the Turbo encoding method can better adapt to different encoding requirements and data characteristics.

[0093] To facilitate understanding of the above Figure 4 The embodiment shown, combined with Figure 5 , Figure 6 , Figure 7 , Figure 8 , an example of Turbo coding is provided below: The transfer function of the sub-coding unit is the basis of the Turbo coding method, and its expression is: G(D)=[1,g1(D) / g0(D)]. In this transfer function, g0(D)=1+D^2+D^3, g1(D)=1+D+D^3, and D represents the state of the shift register. When the encoding process starts, the current state value in the sub-coding unit is set to 0. The original bits of the original bit sequence in the data block to be encoded are represented by Y1, Y2, Y3,..., Y16, and the coded bits corresponding to the original bits are represented by Z1, Z2, Z3,..., Z16, while the current state value of the sub-coding unit is represented by X1, X2, X3, and its initial value is 0.

[0094] During the encoding process, there is a clear correspondence between the original bits and the encoded bits.

[0095] The corresponding relationship formula between the original bit sequence and the coded bit is:

[0096] Z1=Y1+X2+X3+X1+X3=Y1+X1+X2

[0097] The current state value of the next encoding is: [Y1+X2+X3,X1,X2]

[0098] Z2=Y2+X1+X2+Y1+X2+X3+X2=Y1+Y2+X1+X2+X3

[0099] The current state value of the next encoding is: [Y2+X1+X2,Y1+X2+X3,X1]

[0100] Z3=Y3+Y1+X2+X3+X1+Y2+X1+X2+X1=Y3+Y2+Y1+X1+X3

[0101] The current state value of the next encoding is: [Y3+Y1+X2+X3+X1,Y2+X1+X2,Y1+X2+X3]

[0102] …

[0103] Z16=Y16+Y15+Y14+Y13+Y10+Y8+Y7+Y6+Y3+Y1+X1+X2+X3

[0104] The current state value of the next encoding is: [Y16+Y14+Y13+Y12+Y9+Y7+Y6+Y5+Y2+X1+X2, Y15+Y13+Y12+Y11+Y8+Y6+Y5+Y4+Y1+X2+X3, Y14+Y12+Y11+Y10+Y7+Y5+Y4+Y3+X1]

[0105] After deriving the formula between the original bit sequence and the coded bits, we can get Figure 5 The first bit encoding table of the mapping relationship data is recorded in the Figure 5 , it can be clearly seen that the coded bit sequence composed of 16 bits output each time is closely related to the original bit sequence composed of the current 16 bits input and the current state value of 3 bits. The original bit sequence has 2^16=65536 possibilities, and the current state value has 2^3=8 possibilities. After 16-bit encoding, the updated state value of the next 16-bit encoding also has its corresponding formula. The updated state value of the sub-coding unit is represented by X1", X2", and X3", and the formula is derived as follows:

[0106] X1”=Y16+Y14+Y13+Y12+Y9+Y7+Y6+Y5+Y2+X1+X2,

[0107] X2”=Y15+Y13+Y12+Y11+Y8+Y6+Y5+Y4+Y1+X2+X3,

[0108] X3”=Y14+Y12+Y11+Y10+Y7+Y5+Y4+Y3+X1,

[0109] After deriving the formula between the original bit sequence and the updated state value of the sub-coding unit, we can get Figure 6 The first state value update table that records the mapping relationship data.

[0110] In the TDD-LTE protocol, the total length of the data block to be encoded is not always a multiple of 16. Therefore, when the data block to be encoded cannot be divided by 16, the remaining remainder will be an 8-bit original bit sequence. To this end, the preset length may include a preset first length of 16 bits and a preset first length of 8 bits. For this case, the table lookup method is also used for encoding.

[0111] The original bits are represented by Y1, Y2, Y3, ..., Y8, the coded bits are represented by Z1, Z2, Z3, ..., Z8, and the current state value is represented by X1, X2, X3. It should be noted that the current state value here is the updated state value after the last original bit sequence of the preset first length is looked up in the table.

[0112] Similarly, the corresponding relationship formula between the original bit sequence and the coded bit can be derived when the 8-bit original bit sequence is encoded. After the formula derivation between the original bit sequence and the coded bit, we can get Figure 7 A second bit encoding table recording mapping relationship data.

[0113] pass Figure 7 , it can be clearly seen that the coded bit sequence composed of 8 bits output each time is closely related to the original bit sequence composed of 8 bits currently input and the current state value of 3 bits. Similar to the first state value update table, after the formula derivation between the original bit sequence and the updated state value of the sub-coding unit, we can get Figure 8 Based on the above first bit encoding table, first state value update table, second bit encoding table, second state value update table, and combined with Figure 4 Each step in the illustrated embodiment can effectively implement lightweight deployment of Turbo coding.

[0114] See also Fig. 9 , provides a schematic diagram of a process of outputting a Turbo hybrid coded bit stream according to an embodiment of the present application. The data block to be coded is obtained from the original bit stream. Fig. 9 As shown, the method of the embodiment of the present application may include the following steps S401-S402, and steps S401-S402 may be Figure 2 In the illustrated embodiment, it is performed after step S104.

[0115] S401, obtaining an original bit stream and a check bit stream consisting of coded data blocks;

[0116] S402: Output a Turbo hybrid coded bit stream according to the original bit stream and the check bit stream.

[0117] Specifically, two core components are first obtained: the original bit stream and the check bit stream. The original bit stream is the initial data to be transmitted or stored, which may contain various types of information, such as text, audio, video or other forms of data. These data need to be encoded before transmission or storage to ensure their integrity and reliability. The check bit stream is composed of coded data blocks, which are the results of processing by a specific coding algorithm (such as Turbo code). Turbo code is a forward error correction (FEC) technology that enhances the error resistance of data by introducing redundant information, so that the receiving end can recover the original data through the decoding algorithm even when receiving partially erroneous data. Each coded data block in the check bit stream is a coded representation of a part of the data in the original bit stream, and they contain enough redundant information to support the subsequent decoding and error correction process.

[0118] Next, the process of outputting the Turbo hybrid coded bit stream based on the original bit stream and the check bit stream. The original bit stream and the check bit stream are combined according to certain rules to form a unified bit stream. This unified bit stream contains both the original data to be transmitted and the redundant information used for error correction and recovery. When outputting the Turbo hybrid coded bit stream, the synchronization and correspondence between the original bit stream and the check bit stream are ensured so that the receiving end can correctly separate and decode the two parts of data.

[0119] The output of Turbo hybrid coded bit stream requires not only data accuracy and integrity, but also transmission efficiency. Therefore, when generating Turbo hybrid coded bit stream, some optimization techniques, such as bit filling and data compression, can be used to reduce the time and bandwidth required for transmission. At the same time, in order to ensure that the receiving end can correctly decode and restore the original data, the sending end will also add some control information and synchronization marks to the Turbo hybrid coded bit stream to help the receiving end achieve data synchronization and error detection.

[0120] In this embodiment, the data encoding and transmission preparation process is realized by obtaining the original bit stream and the check bit stream and combining them into a Turbo hybrid coded bit stream. This process not only ensures the reliability and integrity of the data, but also improves the efficiency and stability of data transmission through the error correction capability of the Turbo code. In practical applications, this process is of great significance for ensuring the safe and efficient transmission of various types of data.

[0121] After obtaining the coded data block containing each of the coded bit sequences based on the Turbo coding method, the communication between the base station and the user equipment can be carried out based on the coded data block. In the process of carrying out the communication between the base station and the user equipment based on the coded data block, the noise interference of each antenna in the communication is reduced. In the process of reducing the noise, the inverse operation of the noise correlation matrix can be simplified based on the following data processing method. The simplified process can reduce the burden of system resources and reduce time consumption and memory usage. Therefore, in an optional embodiment of the present application, the Turbo coding method also includes

[0122] Get interference and covariance matrices;

[0123] Calculating the mutual correlation coefficient matrix and its corresponding related intermediate variables according to the interference and covariance matrix;

[0124] The mutual correlation coefficient matrix is ​​subjected to partial inversion operation and dynamic calibration based on relevant intermediate variables corresponding to the mutual correlation coefficient matrix to obtain an inverse matrix corresponding to the mutual correlation coefficient matrix.

[0125] In an optional embodiment of the present application, the step of calculating the mutual correlation coefficient matrix and its corresponding related intermediate variables according to the interference and covariance matrix includes:

[0126] Reading data at the same position of different matrices in the interference and covariance matrix to obtain parallel read data;

[0127] Calculate the first column of data of the mutual correlation coefficient matrix and its corresponding subsequent calculation related intermediate variables according to the parallel read data;

[0128] The next column of data and its corresponding subsequent calculation related intermediate variables are calculated based on the first column of data and its corresponding subsequent calculation related intermediate variables, until the mutual correlation coefficient matrix and its corresponding related intermediate variables are obtained.

[0129] In an optional embodiment of the present application, the step of reading data at the same position of different matrices in the interference and covariance matrix to obtain parallel reading data includes:

[0130] Retrieving preset position data for the interference and covariance matrix;

[0131] The preset position data are arranged in a target data format, and the preset position data arranged in the target data format are read through a preset row and column mode to obtain the parallel read data.

[0132] In an optional embodiment of the present application, the subsequent calculation-related intermediate variables corresponding to the first column of data include a reciprocal value and a square root reciprocal value, and the step of calculating the first column of data of the mutual correlation coefficient matrix and the subsequent calculation-related intermediate variables corresponding thereto according to the parallel reading data includes:

[0133] Reading the data of the first row and the first column of the interference and covariance matrix in the parallel read data, and dynamically calibrating the data of the first row and the first column to obtain a temporary variable and a first shift value;

[0134] Performing a reciprocal table lookup operation on the temporary variable to obtain the reciprocal value;

[0135] Performing a modulo-2 and integer operation on the first shift value to obtain a second shift value;

[0136] A square root reciprocal table lookup operation is performed on the second shift value and the data in the first row and first column to obtain the square root reciprocal value.

[0137] In an optional embodiment of the present application, the step of calculating the next column of data and its corresponding subsequent calculation-related intermediate variables based on the first column of data and its corresponding subsequent calculation-related intermediate variables includes:

[0138] According to the first column of data and its corresponding subsequent calculation-related intermediate variables, combined with the partial position data of the interference and covariance matrix, at least one of complex multiplication, subtraction, reciprocal table lookup and square root reciprocal table lookup is performed to obtain the next column of data and its corresponding subsequent calculation-related intermediate variables in turn.

[0139] In an optional embodiment of the present application, the step of performing partial inversion operation and dynamic calibration on the mutual correlation coefficient matrix based on the relevant intermediate variables corresponding to the mutual correlation coefficient matrix to obtain the inverse matrix corresponding to the mutual correlation coefficient matrix includes:

[0140] Dividing the mutual correlation coefficient matrix into parts according to the computational complexity to obtain each part matrix;

[0141] Based on the relevant intermediate variables corresponding to the mutual correlation coefficient matrix, the inverse operation is performed on each of the partial matrices to obtain a preliminary inverse matrix;

[0142] The preliminary inverse matrix is ​​dynamically calibrated to obtain an inverse matrix corresponding to the mutual correlation coefficient matrix.

[0143] In an optional embodiment of the present application, the partial matrices include an upper left partial matrix, a lower right partial matrix, and a lower left partial matrix, and the step of performing inverse operations on the partial matrices based on the relevant intermediate variables corresponding to the mutual correlation coefficient matrix to obtain a preliminary inverse matrix includes:

[0144] According to the relevant intermediate variables corresponding to the mutual correlation coefficient matrix, complex multiplication and / or shift operation is performed on the upper left corner partial matrix to obtain an upper left corner preliminary inverse matrix;

[0145] According to the relevant intermediate variables corresponding to the mutual correlation coefficient matrix, complex multiplication and / or shift operation is performed on the lower right corner partial matrix to obtain a lower right corner preliminary inverse matrix;

[0146] According to the relevant intermediate variables corresponding to the mutual correlation coefficient matrix, at least one of complex multiplication, shift operation and accumulation operation is performed on the lower left corner partial matrix to obtain a lower left corner preliminary inverse matrix;

[0147] The preliminary inverse matrix is ​​composed of the upper left preliminary inverse matrix, the lower right preliminary inverse matrix and the lower left preliminary inverse matrix.

[0148] It should be understood that, although the various steps in the flow chart are shown in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear description in this article, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a part of the steps in the figure may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the sub-steps or stages of other steps.

[0149] See also Fig.10 , an embodiment of the present application provides a Turbo encoding device 800. Fig.10 As shown, the Turbo coding device 800 includes: a first acquisition module 801, used to obtain a data block to be encoded through a sub-coding unit in a Turbo encoder; a determination module 802, used to determine at least one original bit sequence of a preset length from the data block to be encoded; a second acquisition module 803, used to obtain a bit coding table and a state value update table according to the preset length, wherein the bit coding table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and the state value update table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit; an encoding module 804, used to sequentially encode each original bit sequence in at least one original bit sequence based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table, to obtain a coded bit sequence corresponding to each original bit sequence, so as to form a coded data block containing each coded bit sequence.

[0150] Optionally, in some embodiments, the encoding module 804 can be used to: traverse each original bit sequence in sequence; for the traversed target original bit sequence, traverse each original bit in the target original bit sequence in sequence; for the target original bit in the traversed target original bit sequence, query the bit encoding table based on the target original bit sequence and the current state value of the sub-coding unit to obtain the target encoding bit corresponding to the target original bit; and, query the state value update table based on the target original bit sequence and the current state value of the sub-coding unit to obtain the updated state value of the sub-coding unit, and determine the updated state value of the sub-coding unit as the current state value of the sub-coding unit; if the encoding bit corresponding to each original bit in the target original bit sequence is obtained, then end the traversal of each original bit in the target original bit sequence to obtain the target encoding bit sequence corresponding to the target original bit sequence; if the encoding bit sequence corresponding to each original bit sequence is obtained, then end the traversal of each original bit sequence to form an encoding data block containing each encoding bit sequence.

[0151] Optionally, in some embodiments, the preset length includes a preset first length and a preset second length, the preset first length is greater than the preset second length and is an integer multiple of the preset second length, and the total length of the data block to be encoded is greater than or equal to the preset first length and is an integer multiple of the preset second length; the determination module 802 can be used to: if the total length of the data block to be encoded is not an integer multiple of the preset first length, then determine at least one original bit sequence of the preset first length and an original bit sequence of the preset second length from the data block to be encoded, wherein the original bit sequence of the preset second length is after at least one original bit sequence of the preset first length.

[0152] Optionally, in some embodiments, the second acquisition module 803 can be used to: acquire a first bit coding table and a first state value update table according to a preset first length, wherein the first bit coding table stores the original bit sequence of the preset first length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit, and the first state value update table stores the original bit sequence of the preset first length, the mapping relationship data between the current state value of the sub-coding unit and the updated state value of the sub-coding unit; acquire a second bit coding table and a second state value update table according to a preset second length, wherein the second bit coding table stores the original bit sequence of the preset second length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit, and the second state value update table stores the original bit sequence of the preset second length, the mapping relationship data between the current state value of the sub-coding unit and the updated state value of the sub-coding unit.

[0153] Optionally, in some embodiments, the encoding module 804 can be used to: based on the original bit sequence of the preset first length, the current state value of the sub-coding unit, the first bit encoding table and the first state value update table, encode each original bit sequence of the preset first length in at least one original bit sequence of the preset first length in turn to obtain a coded bit sequence corresponding to each original bit sequence of the preset first length; based on the original bit sequence of the preset second length, the current state value of the sub-coding unit, the second bit encoding table and the second state value update table, encode the original bit sequence of the preset second length to obtain a coded bit sequence corresponding to the original bit sequence of the preset second length, so as to form a coded data block containing coded bit sequences of each preset first length and coded bit sequences of the preset second length.

[0154] Optionally, in some embodiments, the data blocks to be encoded are obtained from an original bit stream; the Turbo encoding device 800 can be used to: obtain the original bit stream and a check bit stream composed of the encoded data blocks; and output a Turbo mixed encoding bit stream according to the original bit stream and the check bit stream.

[0155] Optionally, in some embodiments, the Turbo encoding method is applied to a digital signal processor DSP.

[0156] For the specific definition of the Turbo coding device 800, please refer to the definition of the Turbo coding method above, which will not be repeated here. Each module in the Turbo coding device 800 can be implemented in whole or in part by software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each module above.

[0157] In one embodiment, a computer device is provided, the internal structure diagram of which can be as follows: Fig.11As shown. The computer device includes a processor, a memory, a network interface and a database connected via a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a Turbo encoding method as described above can be implemented. It includes: a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, any step in the Turbo encoding method as described above is implemented.

[0158] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, any step in the above Turbo encoding method can be implemented.

[0159] Those skilled in the art will appreciate that the embodiments of the present application may provide methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0160] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0161] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1A function specified in one or more boxes.

[0162] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0163] Although the preferred embodiments of the present application have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the present application.

[0164] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A Turbo coding method, It is characterized in that include: Obtaining a data block to be encoded through a sub-coding unit in a Turbo encoder; Determine at least one original bit sequence of a preset length from the data block to be encoded; Acquire a bit coding table and a state value update table according to the preset length, wherein the bit coding table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and the state value update table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit; Based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table, each of the original bit sequences in at least one of the original bit sequences is encoded in turn to obtain a coded bit sequence corresponding to each of the original bit sequences, so as to form a coded data block containing each of the coded bit sequences.

2. The method according to claim 1, It is characterized in that The encoding process is performed on each of the original bit sequences in at least one of the original bit sequences in sequence based on the original bit sequence, the current state value of the sub-coding unit, the bit encoding table, and the state value update table to obtain a coded bit sequence corresponding to each of the original bit sequences to form a coded data block containing each of the coded bit sequences, including: Traversing each of the original bit sequences in turn; For the traversed target original bit sequence, traverse each original bit in the target original bit sequence in turn; For the target original bit in the traversed target original bit sequence, query the bit encoding table based on the target original bit sequence and the current state value of the sub-coding unit to obtain the target encoding bit corresponding to the target original bit; and query the state value update table based on the target original bit sequence and the current state value of the sub-coding unit to obtain the updated state value of the sub-coding unit, and determine the updated state value of the sub-coding unit as the current state value of the sub-coding unit; If the coded bits corresponding to the original bits in the target original bit sequence are obtained, then the traversal of the original bits in the target original bit sequence is terminated to obtain the target coded bit sequence corresponding to the target original bit sequence; If the coded bit sequences corresponding to the original bit sequences are obtained, the traversal of the original bit sequences is terminated to form the coded data blocks containing the coded bit sequences.

3. The method according to claim 1, It is characterized in that The preset length includes a preset first length and a preset second length, the preset first length is greater than the preset second length and is an integer multiple of the preset second length, and the total length of the to-be-encoded data block is greater than or equal to the preset first length and is an integer multiple of the preset second length; The step of determining at least one original bit sequence of a preset length from the to-be-encoded data block comprises: If the total length of the data block to be encoded is not an integer multiple of the preset first length, at least one original bit sequence of the preset first length and one original bit sequence of the preset second length are determined from the data block to be encoded, wherein the original bit sequence of the preset second length is after at least one original bit sequence of the preset first length.

4. The method according to claim 3, It is characterized in that The step of obtaining a bit encoding table and a state value updating table according to the preset length includes: Acquire a first bit encoding table and a first state value update table according to the preset first length, wherein the first bit encoding table stores the mapping relationship data between the original bit sequence of the preset first length, the current state value of the sub-coding unit and the encoding bit, and the first state value update table stores the mapping relationship data between the original bit sequence of the preset first length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit; A second bit coding table and a second state value update table are obtained according to the preset second length, wherein the second bit coding table stores the original bit sequence of the preset second length, the mapping relationship data between the current state value of the sub-coding unit and the coding bit, and the second state value update table stores the mapping relationship data between the original bit sequence of the preset second length, the current state value of the sub-coding unit and the updated state value of the sub-coding unit.

5. The method according to claim 4, It is characterized in that The encoding process is performed on each of the original bit sequences in at least one of the original bit sequences in sequence based on the original bit sequence, the current state value of the sub-coding unit, the bit encoding table, and the state value update table to obtain a coded bit sequence corresponding to each of the original bit sequences to form a coded data block containing each of the coded bit sequences, including: Based on the original bit sequence of the preset first length, the current state value of the sub-coding unit, the first bit coding table, and the first state value update table, encoding processing is performed on each original bit sequence of the preset first length in at least one original bit sequence of the preset first length in turn to obtain a coded bit sequence corresponding to each original bit sequence of the preset first length; Based on the original bit sequence of the preset second length, the current state value of the sub-coding unit, the second bit coding table and the second state value update table, the original bit sequence of the preset second length is encoded to obtain a coded bit sequence corresponding to the original bit sequence of the preset second length, so as to form the coded data block including the coded bit sequences of the preset first length and the coded bit sequences of the preset second length.

6. The method according to claim 1, It is characterized in that The data block to be encoded is obtained from an original bit stream; after the encoding process is performed on each original bit sequence in at least one original bit sequence based on the original bit sequence, the current state value of the sub-coding unit, the bit encoding table, and the state value update table, to obtain an encoded bit sequence corresponding to each original bit sequence to form an encoded data block including each encoded bit sequence, the method further includes: Acquire the original bit stream and a check bit stream consisting of the coded data blocks; A Turbo hybrid coded bit stream is outputted according to the original bit stream and the check bit stream.

7. The method according to claim 1, It is characterized in that The Turbo encoding method is applied to a digital signal processor DSP.

8. A Turbo encoding device, It is characterized in that The device comprises: A first acquisition module, used for acquiring a data block to be encoded through a sub-encoding unit in a Turbo encoder; A determination module, used to determine at least one original bit sequence of a preset length from the data block to be encoded; A second acquisition module is used to acquire a bit coding table and a state value update table according to the preset length, wherein the bit coding table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the coding bit, and the state value update table stores mapping relationship data between the original bit sequence, the current state value of the sub-coding unit and the updated state value of the sub-coding unit; A coding module is used to encode each of the original bit sequences in at least one of the original bit sequences in turn based on the original bit sequence, the current state value of the sub-coding unit, the bit coding table and the state value update table to obtain a coded bit sequence corresponding to each of the original bit sequences, so as to form a coded data block containing each of the coded bit sequences.

9. A computer device, include: The method comprises a memory and a processor, wherein the memory stores a computer program, and wherein the processor implements the steps of the method according to any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.