CN1620050A - Blind transmission format detecting method suitable for broad band CDMA system - Google Patents
Blind transmission format detecting method suitable for broad band CDMA system Download PDFInfo
- Publication number
- CN1620050A CN1620050A CN 200410065236 CN200410065236A CN1620050A CN 1620050 A CN1620050 A CN 1620050A CN 200410065236 CN200410065236 CN 200410065236 CN 200410065236 A CN200410065236 A CN 200410065236A CN 1620050 A CN1620050 A CN 1620050A
- Authority
- CN
- China
- Prior art keywords
- fusion
- max
- fusion amount
- crc check
- crc
- 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
Links
Images
Landscapes
- Investigating Or Analysing Biological Materials (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
A blind transmission format check method for WCDMA contains calculating path measurement fusion quantity, CRC check result fusion quantity and ant group fusion quantity, then fusing above fusion quantity according to confidence relation to get fusion measurement, finally using said fusion measurement to check blind format. Said invention raises the check accuracy and reduces error rate.
Description
Technical field
The present invention is 3-G (Generation Three mobile communication system) 3GPP WCDMA (3
RdGeneration PartnershipProject Wideband Code Division Multiple Access Wideband Code Division Multiple Access (WCDMA)) blind checking method of transformat belongs to the base band signal process technical field in the cdma cellular mobile communication in.
Background technology
In the down link of WCDMA system, in order to save channel capacity, some transmission channel does not send the information of transformat.By the negotiation on upper strata, only know possible transformat (possible end bit position { n
End), as shown in Figure 1.Therefore, must detect the current actual transmissions form that is using according to the operating state of Viterbi (Viterbi) decoder and the result of CRC (Cyclic Redundancy Check cyclic redundancy code) verification.
The WCDMA standard provides the blind transport format detection that is applicable under above-mentioned situation flow process, and its concrete steps are as described below:
Begin to recall survivor path in each bit position that may finish from nought state, and recover the data sequence of respective length.For each data sequence that is resumed, carry out error detection by checking CRC, and if can pass through CRC check, and path metric meets some requirements, and illustrates that the sequence that is resumed is correct.
Variable below the definition:
S (n
EndThe 10log ((a of)=-
0(n
End)-a
Min(n
End))/(a
Max(n
End)-a
Min(n
End))) (formula 1)
A in the formula
Max(n
End) and a
Min(n
End) be at end bit position n
EndAll states in the maximum and the minimum value of path metric value, a
0(n
End) be the path metric value of nought state.
For the possibility that reduces error detection (, this type of situation taking place), introduce a Path selection thresholding D when the path of selecting is wrong and CRC when being correct.Whether thresholding D has determined should be at each end bit position n
EndRecall.If the path metric at this possible end bit position place satisfies condition:
S (n
End)≤D (formula 2)
Then can recall and recover data from this end bit position, wherein D be the path metric thresholding, is a design parameter.
If the data that a more than end bit position that satisfies formula 2 recovers have all been passed through CRC check, then think to have minimum S (n
End) end bit position of value is correct.If for all end bit position, all do not satisfy formula 2, think that then the frame data stream that receives is wrong.
Fig. 2 has illustrated existing blind transport format detection flow process in the WCDMA system.
Existing blind transport format detection flow process is difficult to take all factors into consideration the relation between path metric and the CRC check result based on the pattern of branch's judgement in the WCDMA system.What of CRC bit number are closely related with CRC check result's the degree of reliability, and this association does not obtain embodying in existing testing process.In the practical application since the characteristics of voice signal and vocoder caused transformat in use between on certain continuity is arranged; the system that is to say can continue to use one period at random of this transformat usually after enabling certain transformat, these characteristics are not utilized by existing blind transport format detection flow process as a Given information.
Summary of the invention
Technical problem: the purpose of this invention is to provide a kind of blind transmission format detecting method that is applicable to broadband CDMA system, this method has improved the accuracy of blind transport format detection in the WCDMA system.
Technical scheme: the blind transmission format detecting method that is applicable to broadband CDMA system of the present invention is to adopt ant group system and path metric criterion, CRC check drawn to merge after criterion and ant group criterion merge according to the relation of confidence level separately the fusion amount of being converted into as a result to measure, and uses this fusion to measure blind transport format detection flow process as the WCDMA system that is applicable to that detects foundation.1) adopted testing process to replace existing testing process based on branch's judgement based on fusion; 2) for different CRC bit numbers, in testing process, introduced different weights; 3) increased ant group fusion amount criterion.
Next the production method of each fusion amount is described:
(1) path metric fusion amount
End bit position is at n
EndThe calculating formula of the path metric fusion amount at place is a formula 3, that is:
S (n
End)=(a
0(n
End)-a
Min(n
End))/(a
Max(n
End)-a
Min(n
End)) (formula 3)
A in the formula
Max(n
End) and a
Min(n
End) be at end bit position n
EndAll states in the maximum and the minimum value of path metric value, a
0(n
End) be the path metric value of nought state.
As seen, the maximum of path metric fusion amount is 1, at this moment a
0(n
End)=a
Max(n
End), show that nought state is the state that arrives the possibility maximum in this position; The minimum value of path metric fusion amount is 0, at this moment a
0(n
End)=a
Min(n
End), show that nought state is the state that arrives the possibility minimum in this position.In addition, path metric fusion amount S (n
End) with a
0(n
End)-a
Min(n
End) increase and dull increasing.Denominator a
Max(n
End)-a
Min(n
End) played the effect of normalization path metric fusion amount.
(2) CRC check fusion amount as a result
What of CRC check result's the degree of reliability and CRC bit number are closely related, and CRC bit number many CRC check result's the degree of reliability more is just high more, and same error data frame descends about 50% by the probability of CRC check during every increase by 1 bit CRC bit number.
According to standard, the Frame that the WCDMA system is received can use these four kinds of CRC bit numbers of 8 bits, 12 bits, 16 bits or 24 bits, and the CRC bit number of known current use.
Confidence level with reference to path metric fusion amount, definition CRC bit number be 8 and the value of the CRC check fusion amount as a result during by CRC check be 0.5, and draw thus the CRC bit number be respectively 12,16 and the value of 24 o'clock CRC check fusion amounts as a result during by CRC check be respectively 0.875,0.96875 and 0.99609375.As fail by CRC check, then the value of CRC check fusion amount as a result is 0.
In sum, end bit position is at n
EndThe calculating formula of the CRC check fusion amount as a result at place is a formula 4, that is:
As seen, CRC fusion amount is 0 to 1 interval interior variable.C (n
End) numerical value big more showing use this frame end bit position that the CRC criterion draws at n
EndThe possibility at place is big more.
(3) ant group fusion amount
Ant group SYSTEM SUMMARY:
Observe according to entomologist ground, though find that natural ant vision is undeveloped, but it can find the shortest path from the food source to the nest under the situation without any prompting, and after can change at environment (as on original path barrier having been arranged), the optimal path that adaptive search is new.This ability is because ant discharges a kind of special secretion-telergone (pheromone) at the Lu Shanghui that passes by, make other ant in the certain limit can aware and influence thus their action, telergone on a road is more and more (certainly, passing in time can weaken gradually), ant afterwards selects the probability of this paths also increasing, thereby increase the telergone intensity in this path, this selection course is called the self-catalysis process of ant, its principle is a kind of positive feedback mechanism, strengthens the inquiry learning system so the ant system is also referred to as.
The basic thought of ant group system is that the imitation ant relies on that pheromones (pheromone) communicates and the social action that demonstrates, on the basis of intelligent body (agent) definition, action by each the intelligent body (agent) of self-catalysis (autocatalytic) process wizard under the greedy method guidance, it is a kind of general heuristic at random, can be used to find the solution various combinatorial optimization problem.
The present invention is based on above-mentioned principle and introduce ant group fusion amount as one of criterion of blind transport format detection, the concrete production method of ant group fusion amount is as described below:
Might as well suppose that possible end bit position has N, the blind transport format detection flow process is selected the end bit position of current actual transmissions in this N possible end bit position.The pheromone concentration matrix P on definition N * N rank, wherein P[n
End", n
End] characterize from n
End" individual end bit position is converted to n
EndThe pheromone concentration of individual end bit position.As seen, when the detected end bit position of former frame be n
End" time, P[n
End", n
End] be exactly end bit position be n
EndAnt group fusion amount, be abbreviated as P[n
End).
The more new technological process of pheromone concentration matrix defines plain concentration p_max (maximum pheromone strength) of pheromones release coefficient p_r (pheromone release factor), pheromones volatility coefficient p_v (pheromone volatilizefactor) and maximum information and the plain concentration p_min (minimum pheromone strength) of minimal information for convenience of description.The plain concentration matrix of lastest imformation in the following ways after finishing present frame and detecting: in the pheromone concentration matrix on the relevant position with the speed release pheromone of pheromones release coefficient, and make the pheromone concentration after upgrading be not more than the plain concentration of maximum information; All locational pheromones are volatilized with the speed of pheromones volatility coefficient in the pheromone concentration matrix, and make the pheromone concentration after the volatilization be not less than the plain concentration of minimal information.If the detected end bit position of former frame is n
End", the detected end bit position of present frame is n
End *, then the process of lastest imformation prime matrix can be described as following two steps: the first step, use formula 5 is at the n of matrix
End" OK, n
End *The position release pheromone of row
P[n
End", n
End *]=P[n
End", n
End *]+p_r (formula 5) is if the P[n after upgrading
End", n
End *] greater than p_max, then make P[n
End", n
End *] equaling p_max: in second step, use formula 6 is each positions of elements Back stroke photos and sending messages element in matrix, and i and the j in the formula 6 is [0, N-1] interval interior arbitrary integer
P[i, j]=P[i, j]-p_v (formula 6) if any one P[i after upgrading, j] less than p_min, then make this P[i, j] equal p_min.
The end bit position n that the present invention is possible with each
EndM (n is measured in the fusion that draws this end bit position place after above-mentioned three kinds of fusion amounts at place merge in proportion
End).A kind of feasible amalgamation mode is above-mentioned three kinds of fusion amounts to be merged to draw to merge according to the ratio that equates measure, and computational methods are formula 7, that is:
M (n
End)=S (n
End)+C (n
End)+P (n
End) (formula 7)
Might as well suppose that possible end bit position has N, try to achieve this N possible end bit position fusion separately successively and measure, subsequently by relatively drawing this N maximum M (n that merges in measuring
End *), n then
End *It is exactly the detected end bit position of blind transport format detection flow process of the present invention.
Blind transport format detection flow process of the present invention can be expressed as the step of carrying out in the following order:
Step 1: the operand that uses in the initialization flow process, wherein n
End=1, M
Max=0, n
End"=1, n
End *=1, the equal assignment of all elements in the pheromone concentration matrix is 0,
Step 2: with n
EndCarry out Viterbi decoding as end bit position, draw data sequence and path metric a
0(n
End), a
Max(n
End) and a
Min(n
End),
Step 3: calculating path is measured fusion amount S (n
End), the computational methods of this path metric fusion amount as shown in Equation 3, i.e. S (n
End)=(a
0(n
End)-a
Min(n
End))/(a
Max(n
End)-a
Min(n
End)),
Step 4: carry out the calculating of CRC check according to the CRC bit number, draw the result of the correct or CRC check mistake of CRC check,
Step 5: calculate CRC check fusion amount as a result C (n according to the CRC bit number
End), the computational methods of this CRC check fusion amount as a result as shown in Equation 4, promptly
Step 6: read ant group fusion amount P (n
End).If the detected end bit position of former frame is n
End", P (n then
End) value equal n in the pheromone concentration matrix
End" OK, n
EndThe element of row, i.e. P (n
End)=P[n
End", n
End],
Step 7: path metric fusion amount, CRC check fusion amount as a result and the ant group fusion amount of using step 3, step 5 and step 6 to try to achieve calculated to merge and measured M (n
End), the computational methods of this fusion amount as shown in Equation 7, i.e. M (n
End)=S (n
End)+C (n
End)+P (n
End),
Step 8: M (n is measured in fusion
End) and M
MaxCompare, as M (n
End)＞M
Max, then make M
Max=M (n
End), n
End *=n
End,
Step 9: judge n
EndWhether reach maximum, as n
EndDo not reach maximum as yet, then n
End=n
End+ 1, and n
EndJump to step 2 after the renewal,
Step 10: use the n that obtains
End *The plain concentration matrix of lastest imformation, update method is: the first step, use P[n
End", n
End *]=P[n
End", n
End *]+p_r is at the n of matrix
End" OK, n
End *The position release pheromone of row, i.e. P[n
End", n
End *]=P[n
End", n
End *If]+p_r is the P[n after upgrading
End", n
End *] greater than p_max, then make P[n
End", n
End *] equal p_max; Second step, use " P[i, j]=P[i; j]-p_v " each positions of elements Back stroke photos and sending messages element in matrix, i.e. P[i, j]=P[i, j]-p_v, i and j wherein is [0, N-1] interval interior arbitrary integer, if any one P[i after upgrading, j] less than p_min, then make this P[i, j] equal p_min
Step 11: make n
End"=n
End *,
Step 12: output n
End *As detected end bit position.
Beneficial effect: beneficial effect of the present invention is mainly reflected in the following aspects:
1) adopted testing process to replace existing testing process based on branch's judgement based on fusion.Advantage based on the testing process that merges is: flowsheet synthesis is considered to detect after the quality of all criterions again, has avoided because the generation of the detection mistake that the relatively poor face of a certain single criterion causes.
2) for different CRC bit numbers, in testing process, introduced different weights.Because CRC check result's the degree of reliability and CRC bit number is how much closely related, adopts corresponding with it weight better to reflect the confidence level of CRC check result for blind transport format detection than existing methods according to the CRC bit number.Less at the CRC bit number especially, when the confidence level that CRC check result provides is low, reduce CRC check as a result the weight of criterion effectively raise the accuracy of blind transport format detection.
3) increased ant group fusion amount criterion.In the practical application since the characteristics of voice signal and vocoder caused transformat in use between on certain continuity is arranged; the system that is to say can continue to use one period at random of this transformat usually after enabling certain transformat, these characteristics are not utilized by existing blind transport format detection flow process as a Given information.The present invention has increased the assistant criteria of ant group fusion amount as blind transport format detection, the ant group is merged the operating position that scale has been levied transformat in certain memory time, and the introducing of this fusion amount has improved the accuracy of blind transport format detection in real system is used.
Description of drawings
Fig. 1 is the Frame example of variable number of bits.n
EndBe possible end bit position, four possible end bit position are arranged among the figure, be respectively n
End=1～4, and the end bit position of actual transmissions is n
End=3.
Fig. 2 is the blind transport format detection flow process of the existing WCDMA of being applicable to system.
Fig. 3 is the blind transmission format detecting method flow chart of the WCDMA of being applicable to of the present invention system.
Embodiment
The blind transmission format detecting method that is applicable to broadband CDMA system of the present invention is to adopt ant group system and path metric criterion, CRC check drawn to merge after criterion and ant group criterion merge according to the relation of confidence level separately the fusion amount of being converted into as a result to measure, and uses this fusion to measure blind transport format detection flow process as the WCDMA system that is applicable to that detects foundation.
Be example with the actual speech business frame that uses of WCDMA system below, the specific embodiment of the present invention and the present invention and the comparison of existing blind transport format detection flow process on performance are described.
The structure of language traffic frame has end bit position n possible in 10 referring to Fig. 1
End=1～10, their each self-corresponding frame lengths are respectively 16,55, and 58,65,71,74,77,91,81 and 97 totally 10 kinds, CRC bit number wherein is 8 bits.The frame length of actual transmissions is according to given frame length period of change picked at random from above-mentioned 10 kinds of frame lengths in the emulation.Require the blind transport format detection flow process in these 10 kinds of possible end bit position, to select the end bit position of current actual transmissions.
Blind transport format detection flow process of the present invention can be expressed as the step of carrying out in the following order as shown in Figure 3:
Step 1: the operand that uses in the initialization flow process.N wherein
End=1, M
Max=0, n
End"=1, n
End *=1, the equal assignment of all elements in the pheromone concentration matrix is 0.
Step 2: with n
EndCarry out Viterbi decoding as end bit position, draw data sequence and path metric a
0(n
End), a
Max(n
End) and a
Min(n
End).
Step 3: calculating path is measured fusion amount S (n
End).The computational methods of this path metric fusion amount as shown in Equation 3, i.e. S (n
End)=(a
0(n
End)-a
Min(n
End))/(a
Max(n
End)-a
Min(n
End)).
Step 4: carry out the calculating of CRC check according to the CRC bit number, draw the result of the correct or CRC check mistake of CRC check.
Step 5: calculate CRC check fusion amount as a result C (n according to the CRC bit number
End).The computational methods of this CRC check fusion amount as a result as shown in Equation 4, promptly
Step 6: read ant group fusion amount P (n
End).If the detected end bit position of former frame is n
End",
P (n then
End) value equal n in the pheromone concentration matrix
End" OK, n
EndThe element of row, i.e. P (n
End)=P[n
End", n
End].
Step 7: path metric fusion amount, CRC check fusion amount as a result and the ant group fusion amount of using step 3, step 5 and step 6 to try to achieve calculated to merge and measured M (n
End).The computational methods of this fusion amount as shown in Equation 7, i.e. M (n
End)=S (n
End)+C (n
End)+P (n
End).
Step 8: M (n is measured in fusion
End) and M
MaxCompare, as M (n
End)＞M
Max, then make M
Max=M (n
End), n
End *=n
End
Step 9: judge n
EndWhether reach maximum, as n
EndDo not reach maximum as yet, then n
End=n
End+ 1, and n
EndJump to step 2 after the renewal.
Step 10: use the n that obtains
End *The plain concentration matrix of lastest imformation.Update method is: the first step, use formula 5 is at the n of matrix
End" OK, n
End *The position release pheromone of row, i.e. P[n
End", n
End *]=P[n
End", n
End *If]+p_r is the P[n after upgrading
End", n
End *] greater than p_max, then make P[n
End", n
End *] equal p_max; In second step, use formula 6 is each positions of elements Back stroke photos and sending messages element in matrix, i.e. P[i, j]=P[i, j]-p_v, i and j wherein is [0, N-1] interval interior arbitrary integer, if any one P[i after upgrading, j] less than p_min, then make this P[i, j] equal p_min.Wherein the p_r selection of parameter is 0.1, and the p_v selection of parameter is 0.05, and the p_max selection of parameter is 0.25, and the p_min selection of parameter is 0.
Step 11: make n
End"=n
End *
Step 12: output n
End *As detected end bit position.
Under AWGN (additive white Gaussian noise) channel condition, the present invention and the comparison of existing blind transport format detection flow process on the detection performance have been drawn by method of computer simulation.The professional frame number of the emulational language of each data is 100,000 frames, bit signal to noise ratio E
b/ N
oBe 1.0dB.
Wherein, the kind 1 of flow process is existing blind transport format detection flow process; The kind 2 of flow process is not for using the blind transmission testing process of the present invention of ant group fusion amount; The kind 3 of flow process is a blind transport format detection flow process of the present invention.DER is a false detection rate, shows that the quantity of the frame of failing correctly to detect end bit position accounts for the ratio of the total quantity of the frame of receiving; PDER is clean false detection rate, shows that Viterbi decoding is correct but the quantity of failing correctly to detect the frame of end bit position accounts for the ratio of the total quantity of the frame of receiving; FDR is misinformation transport format verification and measurement ratio, shows that the quantity of failing correctly to detect end bit position but having passed through the frame of CRC check accounts for the ratio of the total quantity of the frame of receiving.In these three kinds of performance index, FDR is the blind transport format false detection rate measurement index that defines in the WCDMA travelling carriage minimum performance testing standard.
The detection performance of table 1 the present invention and existing procedure relatively
| The frame length period of change | Per 100 frames | Per 10 frames | Per 1 frame | ||||||
| The kind of flow process | ????1 | ????2 | ????3 | ????1 | ????2 | ????3 | ????1 | ????2 | ????3 |
| DER | 5.01e-2 | ?1.08e-2 | ?2.48e-3 | ?5.02e-2 | ?1.13e-2 | ?5.16e-3 | ?5.05e-2 | ?1.07e-2 | ?1.07e-2 |
| PDER | 6.90e-4 | ?8.90e-4 | ?6.00e-5 | ?5.40e-4 | ?8.10e-4 | ?2.90e-4 | ?6.60e-4 | ?8.50e-4 | ?8.90e-4 |
| FDR | 1.80e-3 | ?1.17e-3 | ?2.60e-4 | ?1.72e-3 | ?1.14e-3 | ?6.10e-4 | ?1.65e-3 | ?1.03e-3 | ?1.07e-3 |
Claims (2)
1, a kind of blind transmission format detecting method that is applicable to broadband CDMA system, it is characterized in that: its basic procedure is: at first, calculating path is measured fusion amount, CRC check fusion amount as a result and ant group fusion amount; Subsequently, draw to merge after above-mentioned fusion amount is merged according to the relation of confidence level and measure; At last, use this fusion to measure and carry out blind transport format detection, these method concrete steps are:
Step 1: the operand that uses in the initialization flow process, wherein n
End=1, M
Max=0, n
End"=1, n
End *=1, the equal assignment of all elements in the pheromone concentration matrix is 0;
Step 2: with n
EndCarry out Viterbi decoding as end bit position, draw data sequence and path metric a
0(n
End), a
Max(n
End) and a
Max(n
End);
Step 3: calculating path is measured fusion amount S (n
End);
Step 4: carry out the calculating of CRC check according to the CRC bit number, draw the result of the correct or CRC check mistake of CRC check;
Step 5: calculate CRC check fusion amount as a result C (n according to the CRC bit number
End);
Step 6: read ant group fusion amount P (n
End);
Step 7: path metric fusion amount, CRC check fusion amount as a result and the ant group fusion amount of using step 3, step 5 and step 6 to try to achieve calculated to merge and measured M (n
End);
Step 8: M (n is measured in fusion
End) and M
MaxCompare, as M (n
End)＞M
Max, then make M
Max=M (n
End), n
End *=n
End
Step 9: judge n
EndWhether reach maximum, as n
EndDo not reach maximum as yet, then n
End=n
End+ 1, and n
EndJump to step 2 after the renewal;
Step 10: use the n that obtains
End *The plain concentration matrix of lastest imformation;
Step 11: make n
End"=n
End *
Step 12: output n
End *As detected end bit position.
2, the blind transmission format detecting method that is applicable to broadband CDMA system according to claim 1 is characterized in that: in the step 10, use the n that obtains
Endz *The plain concentration matrix of lastest imformation, update method is: the first step, use " p[n
End", n
End *]=P[n
End", n
End *]+p_r " at the n of matrix
End" OK, n
End *The position release pheromone of row, i.e. P[n
End", n
End *]=P[n
End", n
End *If]+p_r is the P[n after upgrading
End", n
End *] greater than p_max, then make P[n
End", n
End *] equal p_max; Second step, use " P[i, j]=P[i; j]-p_v " each positions of elements Back stroke photos and sending messages element in matrix, be P[i, j]=P[i, j]-p_v, wherein i and j are [0, N-1] interval interior arbitrary integer, if any one P[i after upgrading, j] less than p_min, then make this P[i, j] equal p_min.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410065236XA CN100366034C (en) | 2004-11-03 | 2004-11-03 | Blind transmission format detecting method suitable for broad band CDMA system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410065236XA CN100366034C (en) | 2004-11-03 | 2004-11-03 | Blind transmission format detecting method suitable for broad band CDMA system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1620050A true CN1620050A (en) | 2005-05-25 |
| CN100366034C CN100366034C (en) | 2008-01-30 |
Family
ID=34764651
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200410065236XA Expired - Fee Related CN100366034C (en) | 2004-11-03 | 2004-11-03 | Blind transmission format detecting method suitable for broad band CDMA system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100366034C (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100442306C (en) * | 2007-09-13 | 2008-12-10 | 北京航空航天大学 | Unmanned machine vision image matching method based on ant colony intelligence |
| CN101377850B (en) * | 2008-09-27 | 2011-03-16 | 北京航空航天大学 | Method of multi-formwork image segmentation based on ant colony clustering |
| WO2011038642A1 (en) * | 2009-09-29 | 2011-04-07 | 华为技术有限公司 | Blind detection method and user equipment based on multi-carrier |
| CN101552990B (en) * | 2009-01-16 | 2011-09-28 | 北京邮电大学 | Method for distributing subcarrier with distributed mode based on ant colony optimization |
| CN103546239A (en) * | 2013-09-24 | 2014-01-29 | 东南大学 | Blind test system and blind test method for LTE (long term evolution) downlink control channel |
| CN103581080A (en) * | 2013-10-28 | 2014-02-12 | 温州大学 | Complex number field multiple-valued communication signal blind detection method based on reservoir computing |
| CN110719140A (en) * | 2018-07-13 | 2020-01-21 | 北京松果电子有限公司 | Transmission format blind detection method and device, storage medium and electronic equipment |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR2801450B1 (en) * | 1999-11-24 | 2001-12-28 | Mitsubishi Electric France | METHOD FOR MULTIPLEXING TRANSPORT CHANNELS IN FLEXIBLE POSITIONS, APPLICATION AND DEVICE THEREOF |
| US8014473B2 (en) * | 2001-01-26 | 2011-09-06 | Qualcomm Incorporated | Method and apparatus for detecting messages with unknown signaling characteristic |
| GB2380909A (en) * | 2001-10-09 | 2003-04-16 | Ubinetics | Blind transport format detection via signal power changes |
-
2004
- 2004-11-03 CN CNB200410065236XA patent/CN100366034C/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100442306C (en) * | 2007-09-13 | 2008-12-10 | 北京航空航天大学 | Unmanned machine vision image matching method based on ant colony intelligence |
| CN101377850B (en) * | 2008-09-27 | 2011-03-16 | 北京航空航天大学 | Method of multi-formwork image segmentation based on ant colony clustering |
| CN101552990B (en) * | 2009-01-16 | 2011-09-28 | 北京邮电大学 | Method for distributing subcarrier with distributed mode based on ant colony optimization |
| WO2011038642A1 (en) * | 2009-09-29 | 2011-04-07 | 华为技术有限公司 | Blind detection method and user equipment based on multi-carrier |
| CN103546239A (en) * | 2013-09-24 | 2014-01-29 | 东南大学 | Blind test system and blind test method for LTE (long term evolution) downlink control channel |
| CN103546239B (en) * | 2013-09-24 | 2017-02-01 | 东南大学 | Blind test system and blind test method for LTE (long term evolution) downlink control channel |
| CN103581080A (en) * | 2013-10-28 | 2014-02-12 | 温州大学 | Complex number field multiple-valued communication signal blind detection method based on reservoir computing |
| CN103581080B (en) * | 2013-10-28 | 2017-01-25 | 温州大学 | Complex number field multiple-valued communication signal blind detection method based on reservoir computing |
| CN110719140A (en) * | 2018-07-13 | 2020-01-21 | 北京松果电子有限公司 | Transmission format blind detection method and device, storage medium and electronic equipment |
| CN110719140B (en) * | 2018-07-13 | 2022-03-11 | 北京小米松果电子有限公司 | Transmission format blind detection method and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100366034C (en) | 2008-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1096163C (en) | Multirate serial viterbi decoder for code division multiple access system applications | |
| CN106230555A (en) | The stages cycle redundancy check method of polarization code | |
| CN1739255A (en) | Speed data receiver with detection of channel coding rate | |
| CN103546239B (en) | Blind test system and blind test method for LTE (long term evolution) downlink control channel | |
| CN1265787A (en) | List output viterbi decoding with CRC outer code multi-rate signal | |
| CN1720683A (en) | Re-formatting variable-rate vocoder frames for inter-system transmissions | |
| CN1756138A (en) | Decoding apparatus and decoding method | |
| CN1212607C (en) | Predictive speech coder using coding scheme selection patterns to reduce sensitivity to frame errors | |
| CN1620050A (en) | Blind transmission format detecting method suitable for broad band CDMA system | |
| CN1859067A (en) | Channel blind detecting method | |
| CN1855732A (en) | Encoding method and encoder for tailing convolution codes | |
| CN110611551B (en) | Control channel coding and blind detection method based on nested polarization code | |
| CN102170649B (en) | Method and apparatus of PDCCH blind detection apparatus | |
| CN1126314C (en) | Transmission system with adaptive channel encoder and decoder | |
| CN1153397C (en) | Bit detection method in a radio communication system | |
| US20170041041A1 (en) | System and Apparatus for Decoding Tree-Based Messages | |
| CN1751531A (en) | Faster frame error detection in a CDMA network | |
| CN1787502A (en) | Method for enhancing detecting performance by transmitting style combined information of indicating words | |
| CN1741614A (en) | Method and system for decoding video, voice, and speech data using redundancy | |
| CN1147169C (en) | Decoding method and decoder for Turbo code | |
| CN1310924A (en) | Apparatus and method for adaptive MAP channel decoding in radio telecommunication system | |
| CN1812348A (en) | Testing method and system | |
| CN1272254A (en) | Transmission system having simplified channel decoder | |
| CN101547454B (en) | Method for estimating error rate | |
| CN101656542A (en) | Method and device for decoding double binary convolution Turbo codes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080130 Termination date: 20101103 |