CN105897277A - Decoding performance analysis method and apparatus for decoder - Google Patents

Decoding performance analysis method and apparatus for decoder Download PDF

Info

Publication number
CN105897277A
CN105897277A CN201610183746.XA CN201610183746A CN105897277A CN 105897277 A CN105897277 A CN 105897277A CN 201610183746 A CN201610183746 A CN 201610183746A CN 105897277 A CN105897277 A CN 105897277A
Authority
CN
China
Prior art keywords
time
decoder
subtask
place
decoding
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610183746.XA
Other languages
Chinese (zh)
Other versions
CN105897277B (en
Inventor
杨婷
王耀辉
冉娜娜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaoda Signal Technology Co Ltd
Original Assignee
Beijing Jiaoda Signal Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jiaoda Signal Technology Co Ltd filed Critical Beijing Jiaoda Signal Technology Co Ltd
Priority to CN201610183746.XA priority Critical patent/CN105897277B/en
Publication of CN105897277A publication Critical patent/CN105897277A/en
Application granted granted Critical
Publication of CN105897277B publication Critical patent/CN105897277B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/01—Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/015—Simulation or testing of codes, e.g. bit error rate [BER] measurements
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • H03M13/091—Parallel or block-wise CRC computation

Abstract

The embodiment of the invention provides a decoding performance analysis method and apparatus for a decoder. The method comprises: first time of executing a decoding task by a decoder under field interference as well as second time of executing a task except the decoding task is tested, wherein the decoding task includes a plurality of sub tasks and the field interference refers to the interference causing that the decoder returns to execute a first sub task among the multiple sub tasks when executing any sub task; time of executing all sub tasks by the decoder respectively is tested, wherein all sub tasks correspond to moving digits respectively; according to the first time, the second time, the time executing all sub tasks by the decoder, and the moving digits corresponding to all sub tasks, whether the decoder meets a decoding performance requirement is determined; and if not, the decoder is optimized. Therefore, under the circumstance that the source code is under interference, the decoding performance of the decoder can be analyzed.

Description

Decoder decoding performance analyzes method and device
Technical field
The present embodiments relate to decoding technique field, particularly relate to a kind of decoder decoding performance and analyze method and dress Put.
Background technology
Nowadays responder system is applied widely in the railway system, and it includes ground installation and mobile unit, BTM Being the nucleus equipment in mobile unit, the Core Feature of BTM is decoding, concrete, the TA letter that BTM is received by the decoder of BTM Number it is decoded.It has been investigated that the decoding performance of decoder is directly connected to the train of the vulnerability to jamming of BTM and application BTM High speed per hour.
The decoding performance of decoder specifically can be from the standpoint of two: 1) the decoding time, refer to decoder from reception Start to the time finally solving legal user's message to a correct frame message source code, and decoding time the shortest decoding performance The best；2) the shortest source code length that can decode, when source code has been all code, in the case of i.e. source code is not affected by interference, long report The shortest source code length that can decode of literary composition is 1100, and the shortest source code length that can decode of short message is 462, But, in the case of source code is interfered, the shortest source code length that can decode of long message is more than 1100, short message The shortest source code length that can decode more than 462, if the shortest source code length that can decode is too big, will cause decoding Device does not decodes, and deadlock state occurs.
Prior art, uses large-scale simulator that BTM complete machine carries out functional test, or is only not affected by interference at source code In the case of test the decoding performance of decoder, but, at the scene under test environment, source code can be led by various interference The decoding performance causing decoder can reduce, and lacks in prior art in the case of source code is interfered, the solution to decoder The method that code performance is analyzed.
Summary of the invention
The embodiment of the present invention provides a kind of decoder decoding performance to analyze method and device, to realize being interfered at source code In the case of, the method that the decoding performance of decoder is analyzed.
One aspect of the embodiment of the present invention is to provide a kind of decoder decoding performance and analyzes method, including:
Test decoder disturbs the very first time of lower execution decoding task at the scene, and performs outside described decoding task The second time of task, described decoding task includes multiple subtask, and described on-the-spot interference performs arbitrary for described decoder May result in described decoder during subtask to return to perform the interference of first subtask in the plurality of subtask；
Test described decoder and perform the time of each subtask respectively, the mobile position of correspondence respectively, each subtask described Number, described mobile figure place is described decoder when disturbing the failure of lower execution described subtask at the scene, is input to described decoder The renewal figure place of source code；
Time and the institute of each subtask is performed respectively according to the described very first time, described second time, described decoder State each subtask corresponding mobile figure place respectively and judge whether described decoder meets decoding performance demand；
If described decoder is unsatisfactory for decoding performance demand, then described decoder is optimized.
Another aspect of the embodiment of the present invention is to provide a kind of decoder decoding performance analytical equipment, including:
Test module, disturbs the very first time of lower execution decoding task at the scene for testing decoder, and performs institute Stating the second time of task outside decoding task, described decoding task includes multiple subtask, and described on-the-spot interference is for described Decoder performs to may result in described decoder during arbitrary subtask and returns to perform first subtask in the plurality of subtask Interference；Test described decoder and perform the time of each subtask respectively, each subtask described mobile figure place of correspondence respectively, Described mobile figure place is described decoder when disturbing the failure of lower execution described subtask at the scene, is input to the source of described decoder The renewal figure place of code；
Judge module, for performing each height respectively appoint according to the described very first time, described second time, described decoder The time of business and each subtask described corresponding mobile figure place respectively judges whether described decoder meets decoding performance demand；
Optimizing module, if being unsatisfactory for decoding performance demand for described decoder, then described decoder being optimized.
The decoder decoding performance that the embodiment of the present invention provides analyzes method and device, is done at the scene by test decoder Disturb the very first time of lower execution decoding task, perform the second time of task outside described decoding task, and decoder is held Time of subtask and the mobile figure place of source code in row decoding task, it is judged that whether decoder meets decoding performance demand, it is achieved In the case of source code is interfered, the method that the decoding performance of decoder is analyzed.
Accompanying drawing explanation
The decoder decoding performance that Fig. 1 provides for the embodiment of the present invention analyzes method flow diagram；
The flow chart of the decoding task that Fig. 2 provides for the embodiment of the present invention；
The structure chart of the decoder decoding performance analytical equipment that Fig. 3 provides for the embodiment of the present invention；
The structure chart of the decoder decoding performance analytical equipment that Fig. 4 provides for another embodiment of the present invention.
Detailed description of the invention
The decoder decoding performance that Fig. 1 provides for the embodiment of the present invention analyzes method flow diagram；Fig. 2 is the embodiment of the present invention The flow chart of the decoding task provided.The embodiment of the present invention for prior art lacking in the case of source code is interfered, The method that the decoding performance of decoder is analyzed, it is provided that decoder decoding performance analyzes method, the method concrete steps As follows:
Step S101, test decoder disturb the very first time of lower execution decoding task at the scene, and perform described solution Second time of the task outside code task, described decoding task includes multiple subtask, and described on-the-spot interference is described decoding Device performs to may result in during arbitrary subtask described decoder and returns to perform the dry of first subtask in the plurality of subtask Disturb；
It is illustrated in figure 2 decoder in the embodiment of the present invention and performs the flow chart of decoding task and other tasks, specifically walk Rapid as follows:
Step 21, decoder read source code by sliding window；
In embodiments of the present invention, the code that source code device the most to be decoded processes is stored in caching with lasting baud rate 564K, Decoder reads source code by sliding window from caching, and the size of sliding window is that decoder performs a decoding task process The length scale of source code.
Step 22, decoder judge that whether the length of source code is more than n+r bit；The most then perform step 24, otherwise, hold Row step 23；
If the message before Xie Ma is long message, then n=1023, r=77；If the message before Xie Ma is short message, then n= 341, r=121.
Step 23, sliding window increase source code；
Circulation perform step 21,22,23, until the length of source code is more than n+r bit.
Step 24, decoder carry out CRC check to source code；
Step 25, decoder judge whether CRC check is passed through；The most then perform step 27, otherwise, perform step 26；
Step 26, sliding window move n1 position, and return step 21；
Such as, before this step, sliding window has 1100 potential source codes, then be newly added n1 position not after the 1100th potential source code The source code processed, meanwhile, removes this sliding window by the source code of the 1st to the n-th 1, if the source code row processed in Huan Cun Before being listed in, after untreated source code is arranged in, then this step process is equivalent to the size of sliding window and keeps constant premise Under slided backward n1 position.
Step 27, decoder carry out n+r verification to source code；
Step 28, judge n+r verification whether pass through, the most then perform step 30, otherwise, perform step 29；
Step 29, sliding window move n2 position, and return step 21；
In like manner in step 26, here is omitted.
Source code is detected synchronization value by step 30, decoder；
Step 31, decoder judge that synchronization value is the most legal；The most then perform step 33, otherwise, perform step 32；
Step 32, sliding window move n3 position, and return step 21；
Step 33, decoder carry out legitimacy verification to source code；
Step 34, decoder judge whether that all bits are the most legal；The most then perform step 36, otherwise, perform step 35；
Step 35, sliding window move n4 position, and return step 21；
Step 36, decoder check that source code, the need of reversion, if desired inverts, then inverts；
Control bit in step 37, decoder verification source code；
Step 38, decoder judge that control bit is the most legal；The most then perform step 40, otherwise, perform step 39；
Step 39, sliding window move n5 position, and return step 21；
Step 40, decoder carry out inversion and descrambling to source code, obtain legal message and reversion position；
Step 41, sliding window move n6 position, and return step 21.
As in figure 2 it is shown, the decoding task that decoder performs includes multiple subtask, it is preferred that the embodiment of the present invention provides 6 Step, concrete, step 21-26 is the first step as first subtask of decoding task, step 27-29 is appointed as decoding Second subtask of business is second step, and step 30-32 is the 3rd step, step as the 3rd subtask of decoding task 33-35 is the 4th step as the 4th subtask of decoding task, and step 36-39 is as the 5th subtask of decoding task Being the 5th step, step 40 is the 6th step as the 6th subtask of decoding task.
On-the-spot interference is source code experienced interference, the interference of this scene can make decoder the execution first step, second step, the 3rd May result in described decoder during any step in step, the 4th step, the 5th step, the 6th step to return to perform the first step, it is preferred that This scene may result in described when disturbing any step that can make decoder in performing the first step, second step, the 3rd step, the 4th step Decoder returns to perform the first step, and decoder disturbs the very first time of lower execution decoding task for from the beginning of step 21 at the scene Go to the time of step 40, this very first time be designated as T, T may for t1, t2, t3, t4, t5, t6 add and, it is also possible to for whole T1, t2, t3, t4, t5 or t6 of several times adds and i.e. during step 21 starts to go to step 40, the first step, second Step, the 3rd step, the 4th step, the 5th step or the 6th step were performed repeatedly.In the embodiment of the present invention, decoder not only performs decoding Task, can also carry out other tasks, and decoder can executed in parallel the multi-task, it is also possible to serial performs this multi-task, this The decoder decoding performance that bright embodiment provides is analyzed method and is simultaneously suitable for parallel action method and serial executive mode, preferably , perform as a example by the multi-task by serial, other tasks multiple are crossed in decoder executed before performing decoding task, and perform Time be designated as the second time, represent with t0, as shown in Figure 2.
Step S102, testing described decoder and perform the time of each subtask respectively, each subtask described is the most right Should move figure place, described mobile figure place is described decoder when disturbing the failure of lower execution described subtask at the scene, is input to institute State the renewal figure place of the source code of decoder；
As shown in Figure 2, it is t1 that decoder performs the time of the first step, and the time continuously performing the first step and second step is T2, the time continuously performing the first step, second step and the 3rd step is t3, continuously performs the first step, second step, the 3rd step and the 4th The time of step is t4, and the time continuously performing the first step, second step, the 3rd step, the 4th step and the 5th step is t5, continuously performs the The time of one step, second step, the 3rd step, the 4th step, the 5th step and the 6th step is t6, and if decoder perform each subtask During failure, need to update the figure place of the source code being input to described decoder, concrete, when decoder performs first step failure, more The figure place of the newly inputted source code to described decoder is that n1 i.e. sliding window moves n1 position；When decoder performs second step failure, The figure place updating the source code being input to described decoder is that n2 i.e. sliding window moves n2 position；Decoder performs the 3rd step failure Time, the figure place updating the source code being input to described decoder is that n3 i.e. sliding window moves n3 position；Decoder performs the 4th step and loses When losing, the figure place updating the source code being input to described decoder is that n4 i.e. sliding window moves n4 position；Decoder performs the 5th step During failure, the figure place updating the source code being input to described decoder is that n5 i.e. sliding window moves n5 position；Decoder performs the 6th After step, the figure place updating the source code being input to described decoder is that n6 i.e. sliding window moves n6 position.
Step S103, perform each subtask respectively according to the described very first time, described second time, described decoder Time and each subtask described corresponding mobile figure place respectively judges whether described decoder meets decoding performance demand；
Concrete, according to very first time T, the second time t0, decoder perform respectively the time t1 of each subtask, t2, T3, t4, t5, t6, and each subtask difference correspondence moves figure place n1, whether n2, n3, n4, n5, n6 judge described decoder Meet decoding performance demand.
If judging, whether described decoder meets the condition of decoding performance demand and is Simultaneously Set up, then illustrate that described decoder meets decoding performance demand；If In at least one be false, Then determine that described decoder is unsatisfactory for decoding performance demand.
Wherein, Derivation will embodiment below be illustrated.
If the described decoder of step S104 is unsatisfactory for decoding performance demand, then described decoder is optimized.
If In at least one when being false, illustrate that decoder is unsatisfactory for decoding performance demand, then need described solution Code device is optimized, in order to improving the anti-interference of decoder, concrete optimization method will be illustrated in embodiment below.
The embodiment of the present invention disturbs the very first time of lower execution decoding task at the scene by test decoder, performs described Second time of the task outside decoding task, and decoder performs time and the movement of source code of subtask in decoding task Figure place, it is judged that whether decoder meets decoding performance demand, it is achieved that in the case of source code is interfered, the solution to decoder The method that code performance is analyzed.
On the basis of above-described embodiment, described according to the described very first time, described second time, described decoder difference The time mobile figure place the most corresponding with each subtask described performing each subtask judges whether described decoder meets solution Code performance demand, including: perform described first subtask according to the described very first time, described second time, described decoder The 3rd time, described decoder continuously perform described first subtask and the 4th time of second subtask, described What one subtask was corresponding first moves figure place second move figure place judge described decoding corresponding with described second subtask Whether device meets decoding performance demand.
In actual test process, lose owing to the existence of scene interference causes decoder to perform the first step and second step in Fig. 2 The probability lost is relatively big, if the decoder execution first step and second step are the most successfully, then performs the 3rd step and subsequent step failure Probability will be the least, therefore, embodiment of the present invention emphasis considers that decoder performs the feelings that the first step and second step in Fig. 2 are failed Shape, it is preferred that the embodiment of the present invention is according to very first time T, the second time t0, the time of first subtask of decoder execution T1, decoder perform mobile figure place n1 corresponding to the time t2 of second subtask, first subtask and second subtask Corresponding mobile figure place n2 judges whether described decoder meets decoding performance demand.
Judge whether described decoder meets the method for decoding performance demand and be: judge the described very first time, described second Time, described 3rd time and described first move figure place and whether meet formula (1):
t 1 ( T + t 0 ) 1.77 T ≤ n 1 - - - ( 1 )
Wherein, T represents the described very first time, and t0 represents described second time, and t1 represents described 3rd time, and n1 represents institute State first and move figure place；
Judge that the described very first time, described second time, described 4th time and described second move whether figure place meets Formula (2):
t 2 ( T + t 0 ) 1.77 T ≤ n 2 - - - ( 2 )
Wherein, t2 represents described 4th time, and n2 represents that described second moves figure place；
If formula (1) and formula (2) are set up, it is determined that described decoder meets decoding performance demand simultaneously；
If formula (1) and formula (2) at least one be false, it is determined that described decoder be unsatisfactory for decoding performance need Ask.
The derivation of formula (1) and formula (2) will be illustrated in embodiment below.
The embodiment of the present invention describes in detail Derivation, specifically comprise the following steps that
Owing to source code is stored in caching with lasting baud rate 564K, then within the T+t0 time, the needs newly increased in caching The source code processed is position, (T+t0)/(1000/564)=(T+t0)/1.77.If needing (T+t0)/1.77 to be processed potential source code In have x1 potential source code not pass through in the first step, have x2 potential source code not pass through at second step, have x3 potential source code not pass through in the 3rd step, There is x4 potential source code not pass through in the 4th step, have x5 potential source code not pass through in the 5th step, have x6 potential source code in the first step to the 5th step All pass through, disturb lower execution decoding to appoint according to the process time of the decoder source code to newly increasing at the scene less than or equal to decoder The very first time T of business understands formula (3) and sets up:
x 1 n 1 × t 1 + x 2 n 2 × t 2 + x 3 n 3 × t 3 + x 4 n 4 × t 4 + x 5 n 5 × t 5 + x 6 n 6 × t 6 ≤ T - - - ( 3 )
Total bit according to decoder single treatment source code need to be more than the source code number newly increased in the cycle time Formula (4) is set up:
x 1 + x 2 + x 3 + x 4 + x 5 + x 6 ≥ T + t 0 1.77 - - - ( 4 )
AssumeSet up, willSubstitute into formula Formula (3) can obtain formula (5):
( x 1 + x 2 + x 3 + x 4 + x 5 + x 6 ) × t 1 n 1 ≤ T - - - ( 5 )
Formula (6) can be obtained by formula (4) and (5):
T + t 0 1.77 × t 1 n 1 ≤ T - - - ( 6 )
From formula (6), as t0=0,I.e.When t0 ≠ 0,I.e. Obtain formula (1)
Further, sinceSet up, then All set up.
Foundation Understand decoder each moved further figure place number depend on each step The process time and in addition to decoding task the process time of other task.When Simultaneously During establishment, illustrate that decoder disturbs down at the scene and meet decoding performance demand, owing to the existence of scene interference causes decoder to be held In row Fig. 2, the first step and the failed probability of second step are relatively big, the most only need Set up simultaneously Time, can illustrate that decoder disturbs down at the scene and meet decoding performance demand.
The embodiment of the present invention details decoder and disturbs down the condition meeting decoding performance demand and this condition at the scene Expression, provides the foundation for the analysis of subsequent decoding performance and the optimization of decoder.
On the basis of any of the above-described embodiment, the method that described decoder is optimized by the embodiment of the present invention is said Bright, if particularly as follows: described decoder is unsatisfactory for decoding performance demand, then described decoder being optimized, including: if described solution Code device is unsatisfactory for decoding performance demand, then reduce described decoder and perform the second time of the task outside described decoding task； If or described decoder is unsatisfactory for decoding performance demand, then reduces described decoder and perform the 3rd of described first subtask the Time or reduce described decoder perform described second subtask the 4th time.
If the embodiment of the present invention describes described decoder in detail and is unsatisfactory for decoding performance demand, described decoder is optimized Method.When considering that decoder performs that in Fig. 2, the first step and second step probability of failure are bigger, if formula (1) and formula (2) at least one be false, it is determined that described decoder is unsatisfactory for decoding performance demand, it is assumed thatIt is false,Set up, then in order to makeSet up, it is preferred that described decoder can be reduced and perform described decoding Second time t0 of the task outside task, the embodiment of the present invention does not limit the method reducing t0.It can in addition contain consider to reduce T1, the embodiment of the present invention does not the most limit the method reducing t1.In like manner, forSet up,No The situation set up, it may be considered that reduce t0 or t2.ForIt is false,Invalid feelings Shape, it may be considered that reduce t0, or reduce t1 and t2 simultaneously, or reduce t0, t1 and t2 simultaneously.
Or, if described decoder is unsatisfactory for decoding performance demand, then described decoder is optimized, including: According to the described very first time, described second time, described 3rd Time Calculation meet the value of formula (1) minimum first move position Number, what described first subtask correspondence first moved figure place is revised as described value minimum first moves figure place；Or foundation The described very first time, described second time, described 4th Time Calculation meet the value of formula (2) minimum second move figure place, Described second subtask correspondence second is moved figure place be revised as described value minimum second move figure place.
In embodiments of the present invention, it is also possible to very first time T, the second time t0 and the 3rd time t1 obtained according to test The n1 value calculating the minimum meeting formula (1) is designated as min (n1), compares the n1 in min (n1) and Fig. 2, if min (n1) is more than N1, and min (n1) is in tolerance interval, then the n1 in Fig. 2 is revised as min (n1).In like manner, it is also possible to obtain according to test Very first time T, the second time t0 and the 4th time t2 calculate and meet the minimum n2 value of formula (2) and be designated as min (n2), than N2 in relatively min (n2) and Fig. 2, if min (n2) is more than n2, and min (n2) is in tolerance interval, then repaiied by the n2 in Fig. 2 Change min (n2) into.
The embodiment of the present invention disturbs down, according to decoder, the condition meeting decoding performance demand at the scene, it is proposed that optimizes and solves The method of code device.
The structure chart of the decoder decoding performance analytical equipment that Fig. 3 provides for the embodiment of the present invention.The embodiment of the present invention carries The decoder decoding performance analytical equipment of confession can perform decoder decoding performance and analyze the handling process that embodiment of the method provides, As it is shown on figure 3, decoder decoding performance analytical equipment 30 includes testing module 31, judge module 32 and optimizing module 33, wherein, Test module 31 disturbs the very first time of lower execution decoding task at the scene for testing decoder, and performs described decoding and appoint Second time of the task outside business, described decoding task includes that multiple subtask, described on-the-spot interference are held for described decoder May result in described decoder during the arbitrary subtask of row to return to perform the interference of first subtask in the plurality of subtask；Survey Try described decoder and perform the time of each subtask respectively, each subtask described mobile figure place of correspondence respectively, described movement Figure place is described decoder when disturbing the failure of lower execution described subtask at the scene, is input to the renewal of the source code of described decoder Figure place；Judge module 32 is for performing each subtask respectively according to the described very first time, described second time, described decoder Time and each subtask described corresponding mobile figure place respectively judge whether described decoder meets decoding performance demand；Optimize If module 33 is unsatisfactory for decoding performance demand for described decoder, then described decoder is optimized.
The embodiment of the present invention disturbs the very first time of lower execution decoding task at the scene by test decoder, performs described Second time of the task outside decoding task, and decoder performs time and the movement of source code of subtask in decoding task Figure place, it is judged that whether decoder meets decoding performance demand, it is achieved that in the case of source code is interfered, the solution to decoder The method that code performance is analyzed.
The structure chart of the decoder decoding performance analytical equipment that Fig. 4 provides for another embodiment of the present invention.In above-mentioned enforcement On the basis of example, it is judged that module 32 is specifically for performing described according to the described very first time, described second time, described decoder 3rd time of first subtask, described decoder continuously perform described first subtask and the 4th of second subtask the What time, described first subtask were corresponding first moves figure place second move figure place sentence corresponding with described second subtask Whether disconnected described decoder meets decoding performance demand.
Judge module 32 includes first judging unit the 321, second judging unit 322 and determines unit 323, wherein, first Judging unit 321 is used for judging that the described very first time, described second time, described 3rd time and described first move figure place and is No meet formula (1):
t 1 ( T + t 0 ) 1.77 T ≤ n 1 - - - ( 1 )
Wherein, T represents the described very first time, and t0 represents described second time, and t1 represents described 3rd time, and n1 represents institute State first and move figure place；
Second judging unit 322 is used for judging the described very first time, described second time, described 4th time and described Whether two move figure place meets formula (2):
t 2 ( T + t 0 ) 1.77 T ≤ n 2 - - - ( 2 )
Wherein, t2 represents described 4th time, and n2 represents that described second moves figure place；
If determining, unit 323 is set up for formula (1) and formula (2) simultaneously, it is determined that described decoder meets decoding property Can demand；If formula (1) and formula (2) at least one be false, it is determined that described decoder is unsatisfactory for decoding performance demand.
If optimizing module 33 to be unsatisfactory for decoding performance demand specifically for described decoder, then reduce described decoder and perform Second time of the task outside described decoding task；If or described decoder is unsatisfactory for decoding performance demand, then reducing institute State decoder perform the 3rd time of described first subtask or reduce described second subtask of described decoder execution 4th time.
Or optimize module 33 specifically for according to the described very first time, described second time, described 3rd Time Calculation Meet the value of formula (1) minimum first move figure place, described first subtask correspondence first is moved figure place and is revised as institute State value minimum first moves figure place；Or meet according to the described very first time, described second time, described 4th Time Calculation The second of the value minimum of formula (2) moves figure place, described second subtask correspondence second is moved figure place and is revised as described value Minimum second moves figure place.
The decoder decoding performance analytical equipment that the embodiment of the present invention provides can be provided specifically for performing above-mentioned Fig. 1 Embodiment of the method, here is omitted for concrete function.
The embodiment of the present invention details decoder and disturbs down the condition meeting decoding performance demand and this condition at the scene Expression, provides the foundation for the analysis of subsequent decoding performance and the optimization of decoder；Do at the scene according to decoder Disturb the lower condition meeting decoding performance demand, it is proposed that the method for optimal decoder.
In sum, the embodiment of the present invention by test decoder disturb at the scene lower execution decoding task first time Between, perform the second time of task outside described decoding task, and decoder performs the time of subtask in decoding task Mobile figure place with source code, it is judged that whether decoder meets decoding performance demand, it is achieved that in the case of source code is interfered, The method that the decoding performance of decoder is analyzed；Detail decoder and disturb down the bar meeting decoding performance demand at the scene Part and the expression of this condition, provide the foundation for the analysis of subsequent decoding performance and the optimization of decoder；According to solving Code device disturbs down the condition meeting decoding performance demand at the scene, it is proposed that the method for optimal decoder.
In several embodiments provided by the present invention, it should be understood that disclosed apparatus and method, can be passed through it Its mode realizes.Such as, device embodiment described above is only schematically, such as, and the division of described unit, only Being only a kind of logic function to divide, actual can have other dividing mode, the most multiple unit or assembly to tie when realizing Close or be desirably integrated into another system, or some features can be ignored, or not performing.Another point, shown or discussed Coupling each other or direct-coupling or communication connection can be the INDIRECT COUPLING by some interfaces, device or unit or logical Letter connects, and can be electrical, machinery or other form.
The described unit illustrated as separating component can be or may not be physically separate, shows as unit The parts shown can be or may not be physical location, i.e. may be located at a place, or can also be distributed to multiple On NE.Some or all of unit therein can be selected according to the actual needs to realize the mesh of the present embodiment scheme 's.
It addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it is also possible to It is that unit is individually physically present, it is also possible to two or more unit are integrated in a unit.Above-mentioned integrated list Unit both can realize to use the form of hardware, it would however also be possible to employ hardware adds the form of SFU software functional unit and realizes.
The above-mentioned integrated unit realized with the form of SFU software functional unit, can be stored in an embodied on computer readable and deposit In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions with so that a computer Equipment (can be personal computer, server, or the network equipment etc.) or processor (processor) perform the present invention each The part steps of method described in embodiment.And aforesaid storage medium includes: USB flash disk, portable hard drive, read only memory (Read- Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disc or CD etc. various The medium of program code can be stored.
Those skilled in the art are it can be understood that arrive, for convenience and simplicity of description, only with above-mentioned each functional module Division be illustrated, in actual application, can be as desired by complete by different functional modules for above-mentioned functions distribution Become, the internal structure of device will be divided into different functional modules, to complete all or part of function described above.On State the specific works process of the device of description, be referred to the corresponding process in preceding method embodiment, do not repeat them here.
Last it is noted that various embodiments above is only in order to illustrate technical scheme, it is not intended to limit；To the greatest extent The present invention has been described in detail by pipe with reference to foregoing embodiments, it will be understood by those within the art that: it depends on So the technical scheme described in foregoing embodiments can be modified, or the most some or all of technical characteristic is entered Row equivalent；And these amendments or replacement, do not make the essence of appropriate technical solution depart from various embodiments of the present invention technology The scope of scheme.

Claims (10)

1. a decoder decoding performance analyzes method, it is characterised in that including:
Test decoder disturbs very first time of lower execution decoding task at the scene, and performs appointing outside described decoding task Second time of business, described decoding task includes that multiple subtask, described on-the-spot interference perform arbitrary son for described decoder and appoint May result in described decoder during business to return to perform the interference of first subtask in the plurality of subtask；
Test described decoder and perform the time of each subtask respectively, each subtask described mobile figure place of correspondence respectively, institute Stating mobile figure place is described decoder when disturbing the failure of lower execution described subtask at the scene, is input to the source code of described decoder Renewal figure place；
According to the described very first time, described second time, described decoder perform respectively each subtask time and described respectively Individual subtask corresponding mobile figure place respectively judges whether described decoder meets decoding performance demand；
If described decoder is unsatisfactory for decoding performance demand, then described decoder is optimized.
Method the most according to claim 1, it is characterised in that described according to the described very first time, described second time, institute State decoder to perform time of each subtask movement the most corresponding with each subtask described figure place respectively and judge described decoding Whether device meets decoding performance demand, including:
The 3rd time of described first subtask, institute is performed according to the described very first time, described second time, described decoder Stating decoder, to continuously perform described first subtask and the 4th time of second subtask, described first subtask corresponding First move figure place second move figure place judge described decoder whether meet decoding corresponding with described second subtask Performance requirement.
Method the most according to claim 2, it is characterised in that described according to the described very first time, described second time, institute State decoder to perform the 3rd time of described first subtask, described decoder and continuously perform described first subtask and the 4th time of two subtasks, described first subtask corresponding first to move figure place corresponding with described second subtask Second move figure place and judge whether described decoder meets decoding performance demand, including:
Judge that the described very first time, described second time, described 3rd time and described first move whether figure place meets formula (1):
t 1 ( T + t 0 ) 1.77 T ≤ n 1 - - - ( 1 )
Wherein, T represents the described very first time, and t0 represents described second time, and t1 represents described 3rd time, and n1 represents described One moves figure place；
Judge that the described very first time, described second time, described 4th time and described second move whether figure place meets formula (2):
t 2 ( T + t 0 ) 1.77 T ≤ n 2 - - - ( 2 )
Wherein, t2 represents described 4th time, and n2 represents that described second moves figure place；
If formula (1) and formula (2) are set up, it is determined that described decoder meets decoding performance demand simultaneously；
If formula (1) and formula (2) at least one be false, it is determined that described decoder is unsatisfactory for decoding performance demand.
4. according to the method described in any one of claim 1-3, it is characterised in that if described decoder is unsatisfactory for decoding property Energy demand, then be optimized described decoder, including:
If described decoder is unsatisfactory for decoding performance demand, then reduce the task outside described decoder performs described decoding task The second time；Or
If described decoder is unsatisfactory for decoding performance demand, then reduces described decoder and perform the 3rd of described first subtask the Time or reduce described decoder perform described second subtask the 4th time.
5. according to the method described in any one of claim 1-3, it is characterised in that if described decoder is unsatisfactory for decoding property Energy demand, then be optimized described decoder, including:
The first shifting that the value of formula (1) is minimum is met according to the described very first time, described second time, described 3rd Time Calculation Dynamic figure place, moves described first subtask correspondence first figure place and is revised as the first of described value minimum and moves figure place；Or
The second shifting that the value of formula (2) is minimum is met according to the described very first time, described second time, described 4th Time Calculation Dynamic figure place, moves described second subtask correspondence second figure place and is revised as the second of described value minimum and moves figure place.
6. a decoder decoding performance analytical equipment, it is characterised in that including:
Test module, disturbs the very first time of lower execution decoding task at the scene for testing decoder, and performs described solution Second time of the task outside code task, described decoding task includes multiple subtask, and described on-the-spot interference is described decoding Device performs to may result in during arbitrary subtask described decoder and returns to perform the dry of first subtask in the plurality of subtask Disturb；Test described decoder and perform the time of each subtask respectively, each subtask described mobile figure place of correspondence respectively, described Mobile figure place is described decoder when disturbing the failure of lower execution described subtask at the scene, is input to the source code of described decoder Update figure place；
Judge module, for performing each subtask respectively according to the described very first time, described second time, described decoder Time and each subtask described corresponding mobile figure place respectively judges whether described decoder meets decoding performance demand；
Optimizing module, if being unsatisfactory for decoding performance demand for described decoder, then described decoder being optimized.
Decoder decoding performance analytical equipment the most according to claim 6, it is characterised in that described judge module is specifically used In the 3rd time, described performing described first subtask according to the described very first time, described second time, described decoder It is corresponding that decoder continuously performs described first subtask and the 4th time of second subtask, described first subtask First moves figure place second move figure place judge described decoder whether meet decoding property corresponding with described second subtask Can demand.
Decoder decoding performance analytical equipment the most according to claim 7, it is characterised in that described judge module includes:
First judging unit, is used for judging that the described very first time, described second time, described 3rd time and described first move Whether figure place meets formula (1):
t 1 ( T + t 0 ) 1.77 T ≤ n 1 - - - ( 1 )
Wherein, T represents the described very first time, and t0 represents described second time, and t1 represents described 3rd time, and n1 represents described One moves figure place；
Second judging unit, is used for judging that the described very first time, described second time, described 4th time and described second move Whether figure place meets formula (2):
t 2 ( T + t 0 ) 1.77 T ≤ n 2 - - - ( 2 )
Wherein, t2 represents described 4th time, and n2 represents that described second moves figure place；
Determine unit, if set up for formula (1) and formula (2) simultaneously, it is determined that described decoder meets decoding performance demand； If formula (1) and formula (2) at least one be false, it is determined that described decoder is unsatisfactory for decoding performance demand.
9. according to the decoder decoding performance analytical equipment described in any one of claim 6-8, it is characterised in that described optimization mould If block is unsatisfactory for decoding performance demand specifically for described decoder, then reduces described decoder and perform outside described decoding task The second time of task；If or described decoder is unsatisfactory for decoding performance demand, then reduces described decoder and perform described 3rd time of first subtask or reduce described decoder and perform the 4th time of described second subtask.
10. according to the decoder decoding performance analytical equipment described in any one of claim 6-8, it is characterised in that described optimization Module is minimum specifically for the value meeting formula (1) according to the described very first time, described second time, described 3rd Time Calculation First move figure place, described first subtask correspondence first is moved figure place be revised as described value minimum first move position Number；Or meet that the value of formula (2) is minimum according to the described very first time, described second time, described 4th Time Calculation the Two move figure place, described second subtask correspondence second is moved figure place be revised as described value minimum second move figure place.
CN201610183746.XA 2016-03-28 2016-03-28 Decoder decoding performance analysis method and device Active CN105897277B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610183746.XA CN105897277B (en) 2016-03-28 2016-03-28 Decoder decoding performance analysis method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610183746.XA CN105897277B (en) 2016-03-28 2016-03-28 Decoder decoding performance analysis method and device

Publications (2)

Publication Number Publication Date
CN105897277A true CN105897277A (en) 2016-08-24
CN105897277B CN105897277B (en) 2019-06-14

Family

ID=57014565

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610183746.XA Active CN105897277B (en) 2016-03-28 2016-03-28 Decoder decoding performance analysis method and device

Country Status (1)

Country Link
CN (1) CN105897277B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1620760A (en) * 2001-12-21 2005-05-25 数字方敦股份有限公司 Multi-stage code generator and decoder for communication systems
US20090282319A1 (en) * 2008-05-09 2009-11-12 Samsung Electronics Co., Ltd. Hierarchical decoding apparatus
CN104796156A (en) * 2014-01-20 2015-07-22 联想(北京)有限公司 LDPC (low density parity check) decoder and LDPC decoding method
CN105247808A (en) * 2013-03-07 2016-01-13 马维尔国际贸易有限公司 Systems and methods for decoding with late reliability information

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1620760A (en) * 2001-12-21 2005-05-25 数字方敦股份有限公司 Multi-stage code generator and decoder for communication systems
US20090282319A1 (en) * 2008-05-09 2009-11-12 Samsung Electronics Co., Ltd. Hierarchical decoding apparatus
CN105247808A (en) * 2013-03-07 2016-01-13 马维尔国际贸易有限公司 Systems and methods for decoding with late reliability information
CN104796156A (en) * 2014-01-20 2015-07-22 联想(北京)有限公司 LDPC (low density parity check) decoder and LDPC decoding method

Also Published As

Publication number Publication date
CN105897277B (en) 2019-06-14

Similar Documents

Publication Publication Date Title
EP3754495B1 (en) Data processing method and related products
CA2948250C (en) System and method for safety-critical software automated requirements-based test case generation
RU2016130094A (en) DETERMINING A VEHICLE'S TRAJECTORY
RU2012127581A (en) SOURCE CODE GENERATOR FOR DEVELOPING AND TESTING SOFTWARE FOR MULTI-PROCESSING MEDIA
CN1866206A (en) Generating performance tests from UML specifications using Markov chains
CN108595815B (en) Artificial intelligence body training system and passive circuit optimization design system and method
US10755175B2 (en) Early generation of individuals to accelerate genetic algorithms
CN109614103A (en) A kind of code completion method and system based on character
US20100229131A1 (en) Swarm intelligence for electrical design space modeling and optimization
CN105897376B (en) Decoder decoding performance test method and device
CN108139929B (en) Task scheduling apparatus and method for scheduling a plurality of tasks
CN109784484A (en) Neural network accelerated method, device, neural network accelerate chip and storage medium
US20120096247A1 (en) Reconfigurable processor and method for processing loop having memory dependency
CN102004660A (en) Realizing method and device of business flows
CN105897277A (en) Decoding performance analysis method and apparatus for decoder
CN108287771A (en) A kind of data verification method, device and equipment
CN110032815B (en) Culture gene-based octagonal Steiner tree construction method
CN109815108B (en) Weight-based combined test case set prioritization ordering method and system
CN116541268A (en) Method and system for context-aware dependency-guided kernel fuzzy test case variation
CN103593220A (en) OPENCL compilation
CN104866297A (en) Method and device for optimizing kernel function
CN105677559B (en) A kind of detection method and device
CN116883709A (en) Carbonate fracture-cavity identification method and system based on channel attention mechanism
CN114356680A (en) Verification method and device and electronic equipment
US20160104066A1 (en) Optimization method for a computer system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant