Accompanying calculation method and calculation device

Abstract

The syndrome calculation method disclosed in this invention includes: receiving two consecutive reference signal codewords; each reference signal codeword includes T data blocks, and the data bit width of each data block is divided into T×n corresponding data groups, each data group including symbol elements; performing a first calculation process on the multiple data groups with corresponding finite field elements to obtain multiple first calculation results, the multiple first calculation results corresponding one-to-one with the multiple data groups; taking the Tth data block of the previous reference signal codeword as the first termination position, obtaining a first set of syndromes based on the T×n first calculation results corresponding to the previous reference signal codeword; iteratively processing the first set of syndromes and the multiple first calculation results to obtain T×n sets of syndromes corresponding to the two reference signal codewords. This invention can accelerate the calculation of syndromes and reduce the search time.

Description

Technical Field

[0001] This invention relates to the field of channel decoding technology, and in particular to a syntactic calculation method and a computing device. Background Technology

[0002] Existing reference signal (RS, Reed-Solomon) codewords, i.e., (N, K)RS codewords, require syntactic calculation during decoding. For example, a (528, 514) reference signal codeword consists of 528 10-bit symbols, where 528 represents the length of the reference signal codeword and 514 represents the information length within the codeword. Let the j-th symbol be r. j-1 Then the reference signal codeword can be represented as The reference signal codeword has a total of 14 syndromes, of which the i-th syndrome S i The calculation is as follows: .

[0003] α i Let be the i-th element in the finite field, 0 ≤ i ≤ 13, and N be the length of the reference signal codeword. Then the syndrome of the (528, 514) codeword is:

[0004]

[0005] As can be seen from the above formula, the syndrome of a codeword can only be obtained after the complete codeword has been received. For example, in a syndrome calculation module with a data bit width of 16 bits, receiving a complete codeword requires at least 33 clock cycles. The reference signal codeword requires data synchronization during decoding, meaning the starting position of each codeword must be accurately found. When the reference signal codeword finds its accurate starting position and there are no transmission errors, all 14 calculated syndromes are 0. Based on this characteristic, the accuracy of the starting position of the codeword can be determined by the result of the syndrome calculation. A (528, 514) reference signal codeword has 5280 bits. The traditional syndrome algorithm requires one complete codeword cycle to calculate the syndrome of a codeword. (If the data valid is of bus type, meaning the data is valid in every clock cycle, and the data bit width is 160 bits per clock cycle, then T=33). Therefore, traversing 5280 possible starting positions requires at least 5280 × T clock cycles.

[0006] Therefore, there is an urgent need to provide a new calculation method to improve the speed of searching for the initial position. Summary of the Invention

[0007] Therefore, in order to overcome at least some of the defects and problems in the prior art, the present invention provides an adjoint calculation method and a computing device, which can improve the speed of adjoint calculation and the speed of searching for the initial position.

[0008] Specifically, in one aspect, an embodiment of the present invention provides a syntactic computation method comprising: receiving two consecutive reference signal codewords; each reference signal codeword comprising T data blocks, wherein the data bit width of each data block is... bit; where N is the length of each reference signal codeword, and m is the symbol rate; the two reference signal codewords are divided into multiple data groups; each reference signal codeword corresponds to Each data group includes [number] data packets. Each code element; the multiple data groups are respectively processed by a first calculation with the corresponding finite field elements to obtain multiple first calculation results, the multiple first calculation results corresponding one-to-one with the multiple data groups; the Tth data block of the previous reference signal codeword The bit is the first termination position, based on the codeword corresponding to the previous reference signal. The first set of syndromes is obtained from the first calculation result; the first set of syndromes and the plurality of first calculation results are iteratively processed to obtain the codewords corresponding to the two reference signals. Group accompaniment.

[0009] In one embodiment, the first calculation process includes: performing a first multiplication process on the code elements in the first target data group among the multiple data groups and the finite field element respectively to obtain multiple first multiplication results; the first multiplication process specifically involves: multiplying the k-th code element in the first target data group with the finite field element... Multiply by power; add the multiple first multiplication results in the first target data group to obtain the first calculation result corresponding to the first target data group.

[0010] In one embodiment, the step of referring to the codeword corresponding to the previous reference signal... Obtaining a first set of syndromes from the first calculation result includes: performing a second calculation process on n first calculation results corresponding to n data groups in the first target data block in the previous reference signal codeword to obtain the sum of the first target data blocks; obtaining a first raised result after performing a first raised process on the intermediate result of the previous data block of the first target data block; accumulating the sum of the first target data blocks into the first raised result as the intermediate result of the target data block; wherein zero is accumulated in the sum of the first data block in the first target data block; repeating this process sequentially to obtain the sum of T data blocks and intermediate results; the Tth intermediate result in the previous reference signal codeword is the first set of syndromes.

[0011] In one embodiment, the second calculation process specifically involves: merging the p-th first calculation result among the n first calculation results corresponding to the first target data block with the finite field element. Multiplying by powers yields n second multiplication results corresponding to the n first calculation results; adding the n second multiplication results corresponding to the first target data block yields the sum of the first target data block.

[0012] In one embodiment, the first promotion process specifically involves multiplying the intermediate result of the previous data block by the element of the finite field. The power, where the intermediate result of the (T-1)th data block is multiplied by the element of the finite field. Power of 1.

[0013] In one embodiment, the iterative process includes: respectively using the first reference signal codeword of the previous reference signal codeword... bit is the second start position, the first bit of the next reference signal codeword bit is the second termination position, calculate the... Group syntactic; taking the (t+1)th data block in the previous reference signal code as the second target data block, and the (t+1)th data block in the next reference signal code as the third target data block; taking the pth group of the n data groups of the second target data block as the second target data group; taking the pth group of the n data groups of the third target data block as the third target data group; performing a second up-order processing on the first calculation result corresponding to the second target data group to obtain a second up-order result; performing a first down-order processing on the first calculation result corresponding to the third target data group to obtain a first down-order result; and performing a second down-order processing on the pth group of the n data groups of the third target data block. The group of adjoint expressions is processed to the third degree to obtain the third degree result; the third degree result is added to the first degree result and the second degree result is subtracted to obtain the (nt+p)+1th group of adjoint expressions; where t is selected from 0 to (T-1) and p is selected from 1 to n; when t=0 and p=1, the (nt+p)th group of adjoint expressions is the first group of adjoint expressions.

[0014] In one embodiment, the third ascending step includes: combining the (nt+p)th group of syndromes with the elements of the finite field. Multiplying by powers.

[0015] In one embodiment, the second ascending process includes: multiplying the first calculation result corresponding to the second target data group by the N-1 power of the finite field element.

[0016] In one embodiment, the first reduction process includes: multiplying the first calculation result corresponding to the third target data group by the -1 power of the finite field element.

[0017] Another embodiment of the present invention provides a syntactic computing device, comprising: a receiving module for receiving two consecutive reference signal codewords; each reference signal codeword comprising T data blocks, each data block having a data bit width of... bit; where N is the length of each reference signal codeword, and m is the symbol rate; the input data module is used to divide the two reference signal codewords into multiple data groups; each reference signal codeword corresponds to Each data group includes [number] data packets. Each code element; the multiple data groups are respectively processed by a first calculation with the corresponding finite field elements to obtain multiple first calculation results, the multiple first calculation results corresponding one-to-one with the multiple data groups; the Tth data block of the previous reference signal codeword The bit is the first termination position, based on the codeword corresponding to the previous reference signal. The first calculation result is used to obtain a first set of syndromes; the iterative operation module is used to iteratively process the first set of syndromes and the plurality of first calculation results to obtain the codewords corresponding to the two reference signals. Group accompaniment.

[0018] As can be seen from the above, the embodiments of the present invention can achieve one or more of the following beneficial effects: dividing the reference signal codeword into multiple data groups, and acquiring data within two reference signal codeword periods. The group of adjoints accelerates the calculation of adjoints, thereby reducing the time required to search for the initial position. Attached Figure Description

[0019] To more clearly illustrate the technical solutions of the embodiments of this application, the drawings used in the description of the embodiments will be briefly introduced below. Obviously, the 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 without creative effort.

[0020] Figure 1 This is a flowchart illustrating an adjoint computation method according to an embodiment of the present invention.

[0021] Figure 2 This is a schematic diagram illustrating the iterative calculation of the reference timing sequence provided by an adjoint calculation method according to an embodiment of the present invention. Figure 3 This is a schematic diagram of the structure of a companion computing device provided in one embodiment of the present invention. Detailed Implementation

[0022] To make the above-mentioned objects, features and advantages of the present invention more apparent and understandable, the specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0023] To enable those skilled in the art to better understand the technical solutions of the present invention, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0024] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such terms can be used interchangeably where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0025] It should also be noted that the division of multiple embodiments in this invention is only for the convenience of description and should not constitute a special limitation. Features in various embodiments can be combined and referenced in each other without contradiction.

[0026] One embodiment of the present invention provides a method for calculating adjoint sequences, such as... Figure 1 As shown, the method includes:

[0027] S11: Receive two consecutive reference signal codewords; each reference signal codeword includes T data blocks, and the data bit width of each data block is... bit; where N is the length of each reference signal codeword, and m is the symbol rate;

[0028] S13: Divide the two reference signal codewords into multiple data groups; each reference signal codeword corresponds to... Each data group includes [number] data packets. Each code element; the multiple groups of data are respectively processed by a first calculation with the corresponding finite field elements to obtain multiple first calculation results, and the multiple first calculation results correspond one-to-one with the multiple groups of data;

[0029] S15: The Tth data block of the previous reference signal codeword The bit is the first termination position, based on the codeword corresponding to the previous reference signal. The first set of syndromes is obtained from the first calculation result;

[0030] S17: Iteratively process the first set of syndromes and the plurality of first calculation results to obtain the codewords corresponding to the two reference signals. Group accompaniment.

[0031] In this embodiment, the reference signal codeword is divided into multiple data groups, which can be acquired within two reference signal codeword periods. The group of adjoints accelerates the calculation of adjoints, thereby reducing the time required to search for the initial position.

[0032] Specifically, the first calculation process in step S13 includes:

[0033] Step S131: Perform a first multiplication process on the code elements in the first target data group among the multiple data groups and the finite field element respectively to obtain multiple first multiplication results; the first multiplication process specifically involves: multiplying the k-th code element in the first target data group with the finite field element... Multiplying by powers;

[0034] Step S133: Add the plurality of first multiplication results in the first target data group to obtain the first calculation result corresponding to the first target data group.

[0035] Step S15 specifically includes: performing a second calculation process on the n first calculation results corresponding to the n data groups in the first target data block in the previous reference signal codeword to obtain the sum of the first target data blocks; obtaining the intermediate result of the previous data block of the first target data block and performing a first ascending process to obtain the first ascending result; accumulating the sum of the first target data blocks into the first ascending result as the intermediate result of the target data block; wherein zero is accumulated in the sum of the first data block in the first target data block; repeating this process sequentially to obtain the sum of T data blocks and intermediate results; the Tth intermediate result in the previous reference signal codeword is the first set of syndromes.

[0036] In one embodiment, the second calculation process specifically involves: merging the p-th first calculation result among the n first calculation results corresponding to the first target data block with the finite field element. Multiplying by powers yields n second multiplication results corresponding to the n first calculation results; adding the n second multiplication results corresponding to the first target data block yields the sum of the first target data block.

[0037] In one embodiment, the first promotion process specifically involves multiplying the intermediate result of the previous data block by the element of the finite field. The power, where the intermediate result of the (T-1)th data block is multiplied by the element of the finite field. Power of 1.

[0038] In one embodiment, the iterative processing in step S17 specifically includes: taking the first codeword of the previous reference signal respectively... bit is the second start position, the first bit of the next reference signal codeword bit is the second termination position, calculate the... Group syntactic; taking the (t+1)th data block in the previous reference signal code as the second target data block, and the (t+1)th data block in the next reference signal code as the third target data block; taking the pth group of the n data groups of the second target data block as the second target data group; taking the pth group of the n data groups of the third target data block as the third target data group; performing a second up-order processing on the first calculation result corresponding to the second target data group to obtain a second up-order result; performing a first down-order processing on the first calculation result corresponding to the third target data group to obtain a first down-order result; and performing a second down-order processing on the pth group of the n data groups of the third target data block. The third ascending order of the group of adjoint expressions is obtained by performing a third ascending order processing; the third ascending order result is added to the first descending order result, and the second ascending order result is subtracted to obtain the (nt+p)+1th group of adjoint expressions; where t is selected from 0 to (T-1), and p is selected from 1 to n; when t=0 and p=1, the group of adjoint expressions is... The group of syntactic expressions is the first group of syntactic expressions.

[0039] In one embodiment, the third ascending process specifically includes: [the process is described in the original text]. Group of adjoints and the elements of the finite field Multiplication by powers. In one embodiment, the second ascending-order process includes: multiplying the first calculation result corresponding to the second target data group by the N-1 power of the finite field element. In one embodiment, the first descending-order process includes: multiplying the first calculation result corresponding to the third target data group by the -1 power of the finite field element.

[0040] Taking a reference signal codeword of (528, 514) as an example, i.e., N=528, and assuming T=33 and symbol rate m=10, its data bit width is... =160 bits, each data block includes For example, if n=4, then a data block includes n=4 data groups. Therefore, each reference signal codeword is divided into... Each data group includes [number] groups. One codeword. The first codeword in the two reference signal codewords is, for example, (That is, the previous reference signal codeword), let The first codeword is the earliest transmitted and also the earliest received code element, while r0 is the latest transmitted and the latest received code element. The first data block of the first reference signal codeword (the data received in the first clock cycle) is... The first group of data in the first data block is... The second data group is And so on. The second reference signal codeword (i.e., the next reference signal codeword) is... The first data block of the second reference signal codeword (the data received in the first clock cycle) is The first data group of the first data block of the second codeword is The second data group is And so on.

[0041] The first calculation results obtained by processing the multiple data groups of the first reference signal codeword are respectively denoted as M0~M 131 The first calculation results obtained by processing the multiple data groups of the second reference signal codeword through the first calculation are denoted as M. 132 ~M 263Either data group from the first reference signal codeword and the second reference signal codeword can be used as the first target data group. For example, the first data group in the first data block can be used as the first target data group, and the first symbol (k=1) in the first target data group is r. 527 The second codeword (k=2) is r 526 Then the first multiplication result corresponding to the first symbol in the first target data group is the product of the first symbol. The first multiplication result corresponding to the second symbol is the product of the second symbol. The first multiplication result corresponding to the k-th symbol is the product of the k-th symbol. .

[0042] but ,

[0043] ,

[0044] And so on. The first calculation result corresponding to the first reference signal codeword can be denoted as... In this context, t means that the first calculation result corresponds to the (t+1)th data block. For example, if t=0, it corresponds to the first data block. p means that the first calculation result is in the pth data group in the corresponding data block. If t=0 and p=0, then the first calculation result corresponds to the first data group of the first data block.

[0045] in, ,

[0046]

[0047] And so on. The first calculation result corresponding to the second reference signal codeword can be denoted as... , where t means the (t+1)th data block of the second reference signal codeword corresponding to the first calculation result. For example, if t=0, it corresponds to the first data block. p means the pth data group of the first calculation result in the corresponding data block. If t=0 and p=0, then the first calculation result corresponds to the first data group of the first data block of the second reference signal codeword.

[0048] Among them, the first calculation results M0~M of the first reference signal codeword 131 The first calculation result M of the second reference signal codeword can be acquired after the first reference signal codeword has been received. 132 ~M 263 It can be obtained separately after each data block is received.

[0049] In step S15, the 0th bit of the first reference signal code is taken as the first start position, and the 159th bit of the 33rd data block of the first reference signal codeword is taken as the first end position. Based on the first calculation results M0~M corresponding to the first reference signal codeword... 131 The first set of syndromes can be calculated. Specifically, firstly, the sum of the first target data blocks is calculated using each data block in the first reference signal codeword as the first target data block.

[0050] The sum of the first data block of the first reference signal codeword is:

[0051]

[0052] The sum of the second data block of the first reference signal codeword is:

[0053]

[0054] The sum of the third data block of the first reference signal codeword is:

[0055]

[0056] And so on.

[0057] Then, based on the intermediate results of each data block in the first reference signal codeword.

[0058] Intermediate results of the first data block of the first reference signal codeword

[0059] Intermediate results of the second data block of the first reference signal codeword

[0060] The intermediate results of the 32nd data block of the first reference signal codeword are then applied in the same manner.

[0061] Intermediate result of the 33rd data block of the first reference signal codeword ,

[0062] Expand

[0063]

[0064] like Figure 2 As shown, the baseline syndrome is obtained. Then, the (nt+p)th * of the first reference signal code can be used sequentially. bit is the second start position, with the second reference signal codeword as the first bit. The bit is the second termination position, and the (nt+p)th group of syndromes is calculated. Here, t is taken sequentially from 0 to T, and p is taken sequentially from 0 to n. t represents the (t+1)th data block of the first reference signal codeword corresponding to this second start position, and p represents the pth group of the second target data packet within the n groups of the second target data block, and the pth group of the third target data packet within the n groups of the third target data block. When t=0, p=1, the second start position is the 40th bit of the first reference signal codeword. When t=0, p=2, the second start position is the 80th bit of the first reference signal codeword. And so on, when t=1, p=1, the second start position is the 200th bit of the first reference signal codeword. When t=1, p=2, the second start position is the 240th bit of the first reference signal codeword. That is, using the 40th, 80th, 120th, 160th, 200th, 240th...5200th, 5240th bits of the first reference signal codeword as the second starting positions, calculate 131 syndromes other than the first group of syndromes, denoted as follows:

[0065] At the first clock of the second codeword, the following can be calculated respectively: The calculation method has already been introduced above. For example, taking the 40th bit of the first reference signal codeword as the second starting point, then the second syndrome...

[0066]

[0067] The second set of syndromes can be obtained. .

[0068] The first calculation result corresponding to the second target data group is M0, and the second ascending result corresponding to M0 is... The first calculation result corresponding to the third target data group is M. 132 M 132 The corresponding first reduction result is The first group of accompanying patterns The corresponding third-order result is By analogy, we can obtain:

[0069] The third group of syndromes

[0070] Fourth group of accompanying patterns

[0071] Fifth group of accompaniment

[0072] Will Stored to the next clock cycle, using the same method described above, according to...

[0073] By performing iterative calculations, we can obtain the result after the second reference signal codeword is received. A total of 132 sets of syndrome calculation results correspond to 132 different reference signal codewords starting from the second starting position. The correct initial position can be determined by checking if the result is 0. Using the above scheme, the search time is significantly reduced; theoretically, traversing 5280 bits would require... Even with the addition of logical judgments after the accompanying output and bit adjustments to the input data, its time is still far less than the 5280T required by traditional technologies. The value of n in each data block, consisting of n data groups, is the speedup factor; this value can be modified, and the required time is... The larger the value of n, the faster the speed.

[0074] An embodiment of the present invention also provides a companion computing device, such as Figure 3 As shown, it includes a receiving module 11, an input data processing module 13, and an iterative processing module 15. The receiving module 11 is used to receive two consecutive reference signal codewords; each reference signal codeword includes T data blocks, and the data bit width of each data block is... bit; where N is the length of each reference signal codeword, and m is the symbol rate. Input data processing module 13 is used to divide the two reference signal codewords into multiple data groups; each reference signal codeword corresponds to T*n data groups, and each data group includes... Each code element; the multiple data groups are respectively processed by a first calculation with the corresponding finite field elements to obtain multiple first calculation results, the multiple first calculation results corresponding one-to-one with the multiple data groups; the Tth data block of the previous reference signal codeword The bit is the first termination position. A first set of syndromes is obtained based on the T*n first calculation results corresponding to the previous reference signal codeword. The iterative operation module 15 is used to iteratively process the first set of syndromes and the multiple first calculation results to obtain the T*n sets of syndromes corresponding to the two reference signal codewords.

[0075] This accompanying computing device also includes, for example, a data storage module 17 for storing data during the computation process. See details [link to relevant documentation]. Figure 3 The receiving module 11 receives two consecutive reference signal codewords, and the input data processing module 13 is used to calculate M0~M during the first reference signal codeword period. 131 as well as In the (t+1)th clock cycle of the second reference signal codeword, the input data processing module calculates... , , as well as , M0~M 131 The output is stored in the data storage module. The output is then sent to the iterative computation module, which may include multiple iteration computation modules. The arithmetic unit, for example, when n is 4 in the above example, includes arithmetic unit arithmetic unit arithmetic unit and The arithmetic unit, in the first clock cycle, The arithmetic unit acquires input data, and the arithmetic module outputs the data. and M 132 And the M0 stored in the storage module is calculated and output to Operation unit. Acquisition of processing unit The input data processing module outputs M 133 And the calculation obtained from M1 stored in the storage module. And output to Operation unit. Acquisition of processing unit The input data processing module outputs M 134 And the M3 stored in the storage module is calculated to obtain And output to Operation unit. Acquisition of processing unit The input data processing module outputs M 135 And the M4 stored in the storage module is calculated to obtain And output to the next clock cycle. Similarly, output can be performed within two reference signal codeword cycles. There are a total of 132 adjoints. The calculation of adjoints is accelerated, reducing the search time.

[0076] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods.

[0077] The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention in any way. Although the present invention has been disclosed above with reference to preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art can make some modifications or alterations to the above-disclosed technical content to create equivalent embodiments without departing from the scope of the present invention. Any simple modifications, equivalent changes, and alterations made to the above embodiments based on the technical essence of the present invention without departing from the scope of the present invention shall still fall within the scope of the present invention.

Claims

1. A method of companion computing, the method comprising: include: Receive two consecutive reference signal codewords; each reference signal codeword includes T data blocks, and the data bit width of each data block is... bit; wherein, the reference signal codeword is an (N, K)RS codeword, where N is the length of each reference signal codeword, m is the symbol rate, and K is the information length in the reference signal codeword; The two reference signal codewords are divided into multiple data groups; each reference signal codeword corresponds to n is the number of data groups for each data block; each data group includes Each code element; the multiple groups of data are respectively processed by a first calculation with the corresponding finite field elements to obtain multiple first calculation results, and the multiple first calculation results correspond one-to-one with the multiple groups of data; The Tth data block of the above reference signal codeword The bit is the first termination position, based on the codeword corresponding to the previous reference signal. The first set of syndromes is obtained from the first calculation result; Based on the first set of syndromes and the plurality of first calculation results, iterative processing is performed to obtain the codewords corresponding to the two reference signals. Group accompaniment.

2. The companion computing method of claim 1, wherein, The first calculation process includes: The code elements in the first target data group among the multiple data groups are each multiplied by the finite field element to obtain multiple first multiplication results; the first multiplication process specifically involves multiplying the k-th code element in the first target data group by the finite field element. Multiplying by powers; The first calculation result corresponding to the first target data group is obtained by adding the multiple first multiplication results in the first target data group.

3. The companion computing method of claim 2, wherein, The first calculation result corresponding to the last reference signal code word is obtained The first calculation result corresponding to the last reference signal code word is obtained The sum of the first target data blocks is obtained by performing a second calculation process on the n first calculation results corresponding to the n data groups in the first target data block in the previous reference signal codeword; The first up-order result is obtained by performing a first up-order processing on the intermediate result of the previous data block of the first target data block; The sum of the first target data blocks is accumulated into the first ascending result as an intermediate result of the target data block; wherein zero is added to the sum of the first data block in the first target data block. Repeat this process to obtain the sum of T data blocks and intermediate results; The Tth intermediate result in the previous reference signal codeword is the first set of syntactic expressions.

4. The companion computing method of claim 3, wherein, The second calculation process is as follows: The p-th first calculation result among the n first calculation results corresponding to the first target data block is compared with the finite field element. Multiplying by powers yields n second multiplication results corresponding to the n first calculation results; The sum of the n second multiplication results corresponding to the first target data block is obtained by adding the sum of the first target data block.

5. The adjoint calculation method as described in claim 4, characterized in that, The first upgrade process is as follows: Multiply the intermediate result of the previous data block by the element of the finite field. The power, where the intermediate result of the (T-1)th data block is multiplied by the element of the finite field. Power of 1.

6. The adjoint calculation method as described in claim 5, characterized in that, The iterative process includes: The codeword of the previous reference signal is respectively used as the first... bit is the second start position, the first bit of the next reference signal codeword bit is the second termination position, calculate the... Group accompaniment; The (t+1)th data block in the previous reference signal codeword is taken as the second target data block, and the (t+1)th data block in the next reference signal codeword is taken as the third target data block; the pth group in the n groups of data groups of the second target data block is taken as the second target data group; the pth group in the n groups of data groups of the third target data block is taken as the third target data group. The second up-order processing is performed on the first calculation result corresponding to the second target data group to obtain the second up-order result; The first calculation result corresponding to the third target data group is subjected to a first reduction process to obtain a first reduction result; For the first The group of adjoints is used to perform the third-order increase process to obtain the third-order increase result; Add the third ascending result to the first descending result, and subtract the second ascending result to obtain the (nt+p)+1th group of adjoint equations; Where t is selected from 0 to (T-1), and p is selected from 1 to n; when t=0 and p=1, the first... The group of syntactic expressions is the first group of syntactic expressions.

7. The companion computing method of claim 6, wherein, The third raising processing includes: multiplying the first group of the finite field elements power.

8. The companion computing method of claim 7, wherein, The second upscaling process includes: multiplying the first calculation result corresponding to the second target data group by the N-1 power of the finite field element.

9. The companion computing method of claim 8, wherein, The first reduction process includes: multiplying the first calculation result corresponding to the third target data group by the -1 power of the element of the finite field.

10. A companion computing device, comprising: include: The receiving module is used to receive two consecutive reference signal codewords; each reference signal codeword includes T data blocks, and the data bit width of each data block is... bit; wherein, the reference signal codeword is an (N, K)RS codeword, where N is the length of each reference signal codeword, m is the symbol rate, and K is the information length in the reference signal codeword; The input data processing module is used to divide the two reference signal codewords into multiple data groups; each reference signal codeword corresponds to n is the number of data groups for each data block; each data group includes Each set of data groups is processed by a first calculation with its corresponding finite field element to obtain multiple first calculation results, each first calculation result corresponding one-to-one with the multiple sets of data groups; the T-th data block of the previous reference signal codeword. The bit is the first termination position, based on the codeword corresponding to the previous reference signal. The first set of syndromes is obtained from the first calculation result; The iterative calculation module is used to iteratively process the first set of syndromes and the plurality of first calculation results to obtain the codewords corresponding to the two reference signals. Group accompaniment.

Images