CN101088242B - Low complexity blind transport format detection - Google Patents
Low complexity blind transport format detection Download PDFInfo
- Publication number
- CN101088242B CN101088242B CN2005800448110A CN200580044811A CN101088242B CN 101088242 B CN101088242 B CN 101088242B CN 2005800448110 A CN2005800448110 A CN 2005800448110A CN 200580044811 A CN200580044811 A CN 200580044811A CN 101088242 B CN101088242 B CN 101088242B
- Authority
- CN
- China
- Prior art keywords
- bit position
- end bit
- transformat
- path metric
- metric value
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0046—Code rate detection or code type detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Artificial Intelligence (AREA)
- Error Detection And Correction (AREA)
- Mobile Radio Communication Systems (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The present invention relates to a method, apparatus and computer program product for detecting a transport format of a multiplexed transport channel used for transferring binary data, wherein a path metric value which estimates likelihood for a hypothetical trellis path to end at a predetermined state is determined for every state of a trellis stage of a possible end bit position of a data block of the transport channel. Then, for each possible end bit position a number of path metric values which indicate higher likelihood for the hypothetical trellis path to end at said predetermined state than an initial state is calculated, and the best end bit positions which lead to highest values of the calculated number are selected and error checking is performed for the selected best end bit positions to detect the transport format. The proposed selection of best end bit positions leads to a reduced number of decoding operations and thus to a reduced processing complexity.
Description
Technical field
The present invention relates to a kind of method, equipment and computer program, be used to detect the transformat of the multiplexing transmission information channel that is used to transmit binary data.Particularly, the present invention relates to realizing such as low complex degree according to the descending blind transmission format detection (BTFD) at the wireless receiver place of the GSM of the system of UMTS (UMTS) standard.
Background technology
In WCDMA access system (WCDMA), can make current communication system a large amount of services that can't provide can supply to move with fixed-line subscriber and use.Therefore, WCDMA air interface and the service dynamic combined that comprises voice, data and grouped data.For the dynamic combined of this service is provided, it is vital successfully sending the service combined information at the receiver place and it is decoded.The WCDMA system uses so-called transmission channel combination indication (TFCI) sign indicating number to transmit above-mentioned information.According to the WCDMA standard of 3GPP (third generation gpp), but there be not the TFCI time spent, must be in descending support blind transport format detection (BTFD) under certain constraints.
In the UMTS communication system, defined corresponding at least one NodeB of traditional base station equipment and the portable terminal that is called as subscriber equipment (UE).NodeB and UE comprise transmitter and receiver.Descending, NodeB sends signal to the UE receiver through the NodeB transmitter.Up, the UE transmitter sends signal to the NodeB receiver through the UE transmitter.Some UE can communicate with single NodeB.In this case, these UE are considered to be in same sub-district.The sub-district is illustrated in the geographic area by specific NodeB service of UE wherein.In uplink and downlink communication, UE and NodeB will information transmitted and control data be mapped on two logic channels.Then, these logic channels are mapped to transmission channel (TrCH), transmission channel (TrCH) is mapped on the physical channel self.CCTrCH (sign indicating number divides combination TrCH) expression number of transmission channels is multiplexed to physical channel wherein.Through the air interface transmission characteristic data and through which type of performance data of air interface transmission, defined transmission channel by how.Usually, transmission channel is divided into dedicated channel (DCH) and common signal channel.In DS-CDMA (direct sequence CDMA access), the characteristic of physical channel can embody through the several parameters that comprises special carrier frequency, scrambler, spreading factor, channel code, time slot format, duration etc.Though these parameters are as well known to those skilled in the art,, will be described in more detail the mapping of symbol below to time slot for understanding transport format detection better.
Fig. 1 shows the frame structure of descending proprietary physical channel (DPCH), and it comprises two data field Data1 and Data2, TPC (through-put power control) field, pilot bits field and TFCI field.Time slot format has been specified the size (bitwise) of each field.Yet in the DS-CDMA system, carrying out filtering through the frequency expansion sequence that utilizes appointment is big bandwidth with sign extended.Spread symbol is called chip, and wherein, the duration of chip period is substantially equal to the factor of the bandwidth expansion factor of spread spectrum operation for a short time than duration of symbol period.This factor equals the number of chips of each symbol period, and is called as spreading factor.In the example of Fig. 1, suppose spreading factor K=0 ... Corresponding 2560 chips of duration of 7, one time slots, just 10 * 2
kBit.The duration of a radio frames is 10ms, and comprises 15 time slots.
For transport format detection, the specific fields of concern is the TFCI that directly relates to this detection.Transport format detection comprises the quantity and the size of the transmission block of confirming each TrCH among the CCTrCH.If use the TFCI field to send transformat combination, then above-mentioned detection can be based on the detection of TFCI.Yet, in order to minimize interference, do not transmit TFCI sometimes, particularly under the yet very high situation of the percentage of the very high TFCI bit number that makes each time slot of spreading factor to other user.If the TFCI bit is unavailable, and if for the transformat of given TrCH existence more than one, then can use the BTFD process.
At the receiver place, carry out descrambling, despreading at first to received signal, in decoder, it is handled then.Through inserting " 0 ", separate the repetition effect counter-rotating that speed (de-rate) matching module makes punching and transmission data at punch position (punctured position).Decode to separating the rate-matched data through the BTFD piece.
People's such as Insoo Sohn " Blind Rate Detection Algorithm in WCDMAMobile Receiver "; Radio&Broadcasting Tech.Lab; ETRI; IEEE 2001, described the BTFD algorithm that uses Cyclic Redundancy Check and Veterbi decoding matrix among the pp 1589-1592.For the voice service among the WCDMA, the convolutional encoding scheme is preferred channel coding method.Convolution coder is the finite state machine that comprises M state shift register, and this M state shift register has appointment with n modulo 2 adder and is connected.Through input block is carried out convolutional encoding, encoder has added correlation to input data sequence.Being used for the general-purpose algorithm that the convolutional encoding data are decoded is viterbi algorithm, viterbi algorithm or maximum likelihood decoding algorithm.Viterbi algorithm is sought the most similar decoding sequence, so that channel-encoded data is decoded through using the known correlation of input traffic.The basic step of viterbi algorithm comprises the first step of branch metric calculation, produces hypothesis therein, and this hypothesis will compare with the data block that receives.The amplitude of the data bit that receives through increase is come Branch Computed tolerance, and the data bit that wherein receives is different with the symbol of the hypothesis that is produced.In second step of state metric calculation, calculated branch metric is added to the state measurement that in previous stage, calculates.Identify path, and it is defined as survivor path with lowest metric.Then, in third step, when the state metric calculation accomplished all incoming symbols of receiving data block, come execution route return through following the survivor path of in second step, being discerned.
If rate information (for example, the TFCI field) is unavailable, then the rate-matched data bit of separating that from separate the rate-matched module, receives is decoded according to the BTFD method.Among the BTFD first operation is branch metric and the state measurement that calculates in the viterbi algorithm, and this is commonly called Jia-ratio-choosing (ACS) operation.Yet, because rate information disabled fact under variable rate environment, must might length n to the institute of the data block of all speed i of comprising the CRC parity check bit
End(i) carry out the ACS operation.
Receiver can only pick out possible transformat, and all possible data block length of the thing followed or end position n
End(i).The code block of receiver after to the convolutional encoding that receives carried out Veterbi decoding.Use the essential condition of BTFD to be: the CRC with non-zero length to be added on all transmission blocks of all explicit detectable transmission channels.CRC provides wrong detection to each transmission block.In the UMTS standard, the size of CRC can be 24,16,12,8 or 0 bit.At the transmitter place, each transmission block is calculated CRC, and it is directly added on the transmission block.At the receiver place, each decoded transmission block is recomputated CRC, and if exist differently with the CRC that adds in the transmitter place, the transmission block of then being considered is declared as mistake, otherwise is correct.The size of CRC is big more, and then the power of wrong detection is high more.In the ending of each encoding block, add 8 zero tail bits.Because these 8 zero tail bits, the correct trellis paths of Viterbi decoder is very big possibly to be finished at correct end bit position place with nought state.Use the BTFD method of CRC to date back to the survival trellis paths of sentencing nought state end (trellis paths of supposing) in each possible end bit position, so that the restore data sequence.For each data sequence that is resumed, come error detection through CRC check, if there be not wrong the generation, then institute's data recovered sequence is declared as correct.
But, in the TS25.212 of 3GPP standard Release 99, introduced the Path selection thresholding in order to reduce under the situation that selected path error crc error detects, to take place the probability of flase drop.This thresholding is confirmed at each end bit position n
End(i) locate whether should recall the hypothetical trellis path that is connected to nought state.If a plurality of end bit position produce the threshold parameter littler than Path selection thresholding, and the correct CRC of a plurality of end bit position generation, the end bit position that then will have the minimum threshold parameter value is claimed as correct.If there is not the path can satisfy the threshold parameter equation of all possible end bit position, then the frame data that receive are claimed as wrong.
Fig. 2 shows BTFD is applied to possible data structure wherein, wherein shows 4 kinds of possible end bit position n
End=1 to n
End=4.The tail bit of null value is designated as null field E.
Due to the fact that: be difficult to calculate based on the path selection criterion of above-mentioned threshold parameter equation, the above-mentioned standard proposal of BTFD has been caused complicated realization with hardware or even firmware.Maybe be in major cycle up to 16 times iteration, from must finding out that this is very consuming time in the fact that maximum 16 end bit position are carried out verification.In addition, the handling process that standard proposed has been carried out such implicit expression hypothesis: only have a transmission block, and therefore each encoding block has only a CRC check.Yet this hypothesis is not real usually.Generally, there are a plurality of transmission blocks for each encoding block.Therefore, the 3GPP that is proposed realizes the inreal transport format detection of carrying out reality, but is the length detection of having carried out a plurality of encoding blocks.
Summary of the invention
Therefore, the purpose of this invention is to provide a kind of blind transmission format detecting method and equipment thereof, can when satisfying the standard performance demand, realize with the processing complexity that reduces.
This purpose realizes through the method for claim 1, equipment as claimed in claim 9 and computer program as claimed in claim 13.
Therefore, the step after the Path selection thresholding is defined to best end bit position.To these best end bit position, error detection if do not detect mistake, then considers to detect current transformat, and BTFD finishes in this step then.Otherwise,, then stop this processing if current transformat causes detecting mistake.The BTFD that advised handles and optimally makes full use of whole available informations, and can be when satisfying performance requirement, is used with the processing time that reduces by the receiver of any type.Therefore, compare, can realize that the BTFD faster with low implementation complexity handles with above-mentioned traditional B TFD processing.
This selection can comprise: refusal makes path metric value less than the end bit position of predetermined threshold value, and according to tabulation, arranges the end bit position of not refusing from the order that is up to the lowest path metric value.Then, if all end bit position all are rejected, then can data block be claimed as wrong.The ordering of not refusing end bit position in the tabulation has been saved the time through the sum of decreased average error checking.
If two or more end bit position produce identical quantity in calculation procedure, then can select end bit position corresponding to big block size.Big block size causes path metric value more reliably, therefore at first handles more reliable and correct result, comes the optimal treatment order thus.
In addition, wrong detection can comprise following steps: the order according to transmission block quantity is successively decreased is arranged possible transformat; Begin then the transformat of the data block of maximum quantity is carried out verification operation.Thus, minimize the quantity of error checking, improved the reliability of transport format detection simultaneously.
If it is correct result that all error-correction operations of transformat all cause the piece of institute's verification, can confirm that then transformat detects.On the other hand, if unsuccessful ground verification all transformats relevant with selected best end bit position, be wrong then with the corresponding data block of current end bit position of testing.
Definite device of checkout equipment can comprise Viterbi decoder.In addition, calculation element can comprise counter, and this counter is controlled by the output signal of comparator, and this comparator is set to definite device is compared to current state and determined each path metric value of initial condition.Therefore, can realize needed control logic with low complex degree.
Description of drawings
Hereinafter,, the present invention is described in more detail based on predetermined embodiment with reference to accompanying drawing, in the accompanying drawings:
Fig. 1 shows the schematic structure of descending DPCH frame;
Fig. 2 shows the structure of the end bit position with possibility, can use according to frame proposed by the invention it and detect;
Fig. 3 shows the indicative flowchart of the format detection that proposes according to preferred embodiment;
Fig. 4 shows the schematic block diagram according to the format detection equipment of preferred embodiment;
Fig. 5 shows the most critical allocation list of possibility transformat.
Embodiment
Now, based on the exemplary embodiment with UMTS band receiver of base, for example traditional Rake receiver comes preferred embodiment is described.
Radio wave propagation in the mobile channel is characterised in that: repeatedly reflection, diffraction and the decay of signal energy.This is to be caused by the natural obstacle thing such as building, massif etc., and has produced so-called multipath transmisstion.Because different propagation paths have the time delay distribution figure (profile) that continues some microseconds, multipath transmisstion causes the signal energy diffusion.On the other hand, the signal cancellation that when receiver moves short distance, produces is called rapid fading.Preferably be interpreted as it is having described certain constantly along the phase shift and the decay in certain path of a plurality of weighted phases to signal cancellation with, this weighted phases.
The countermeasure that in the WCDMA system, is used to overcome decline is, utilizes a plurality of so-called Rake that is assigned to the delay position that remarkable energy arrives to refer to that (finger) will postpone energy dispersive and combine.For this reason, identify the delay positions that remarkable energy arrives, and correlation receiver or Rake are referred to be assigned to these peak values.Be used to obtain the duration that measurement grid that multipath postpones distribution map approximates a chip, this chip duration upgrades with the speed that approximates a few tens of milliseconds.In each correlation receiver, follow the trail of and remove the fast-changing phase place and the range value that are produced in the rapid fading process.At last, refer to pass through the symbol of separating the mediation phase correction in all activities and make up, and be sent to decoder so that further handle.Can the symbol behind the channel compensation be added to together simply, so that recover the energy on all delay positions.Then, radio frequency signals is carried out demodulation, so that produce digital baseband signal.Baseband signal is handled, so that recover the interested useful data information of user.
According to preferred embodiment, when it being defined again, reduced the complexity of the BTFD scheme that the 3GPP standard proposed in the notion that keeps path metric criteria (PMC) and with simple mode.
Under the particular case of UMTS standard, the constraint length K of Viterbi decoder should be " 9 ", so the number of internal states of each grid level (trellis stage) is 2
K-1=256.
Fig. 3 shows the schematic flow diagram according to the BTFD processing of preferred embodiment.At initial step S101, operational factor i is set to " 0 ", and another operational factor j is set to " 1 ", PMC parameter δ
sBe set to " 0 ", and with end bit position parameter n
EndBe set to " 1 ".Then, at step S102, to first end bit position n
End=the 1 and first internal state i=0, path metrics value PMV
iAt step S103, with the PMV that is calculated
iInitial p MV with state i=0
0Compare, if PMV
iThan higher, then in step S104, make PMC parameter δ
sIncrease progressively.Then, in step S105, operational factor i is increased progressively, and the pairing maximum N of number of internal states of itself and each grid level (for example 256) is compared.As stated, this maximum N depends on the constraint length K of Viterbi decoder.
As long as operational factor i is lower than maximum N, then repeat above-mentioned steps S102 to S105, as long as and detect the value PMV that is higher than initial condition i=0 place
0Pmv value, then make parameter δ
sIncrease progressively.
PMC parameter δ
sCan be 8 bit integer, its scope be { 0 ... 255}.For the low noise level on the radio channel, value δ
s=255 can be used as the desired value of correct end bit position.Therefore, PMC that proposed and that use above-mentioned threshold parameter equation to calculate compares with the 3GPP standard, and the PMC of this redetermination has obviously reduced the complexity that realizes.
At step S107, will be to the resulting PMC parameter of current state i δ
sCompare with the Path selection threshold delta, be greater than or equal to the Path selection threshold delta, then with itself and corresponding end bit parameter n if confirmed it
EndStorage (step S108) together.If PMC parameter δ
sLess than the Path selection threshold delta, then be not stored, and in step S109, make end bit position n
EndIncrease progressively.As long as also there is available end bit position, that is to say, as long as end bit position n
EndBe less than or equal to maximum or final end bit position n
Max, process arrives step S102 through step S110, and in the above described manner to next one value PMV
iCalculate and handle.
After all end bit position are carried out verification, in step S111, select M and have the highest PMC value δ
sEnd bit position, and with it according to PMC value δ
sFrom being up to minimum sequential storage tabulation.As the example of preferred embodiment, can use M=3, this is illustrated in selects and stores three best end bit position in the step 111.
Must carefully adjust the Path selection threshold delta.If it is too little, then false drop rate (UFDR) (undetected false detection rate) increases, and false drop rate (UFDR) is to utilize correct CRC to detect the verification and measurement ratio of erroneous block size.On the other hand, for having more optionally Path selection thresholding, loss (NDR) (non-detection rate) will reach unacceptable level, and loss (NDR) is the ratio of omission correct code block length.Can express, in Path selection threshold delta=200 o'clock, the reduction of complexity is still very remarkable, and performance loss to compare with the suggestion of traditional 3GPP be negligible, and can satisfy the performance requirement of UMTS standard.
At step S112, begin one of selected (n to best end bit positions area with the transformat of largest block quantity
j End) carry out CRC check.If it all is correct detecting all CRC at step S112, then program branches is confirmed the end bit position n that is considering then to step S114
j EndWith TF be true, and at this termination routine.On the other hand, in step S113, all be confirmed as correctly, then increase operational factor j so that the best end bit position of the next one is carried out verification if not all CRC.Yet, at first in step S116 another operational factor of verification j whether greater than the number M of selected best end bit.If be not more than, then program turns back to step S112 so that the best end bit position of the next one is carried out CRC check.If all best end bit position are not all by successfully verification (that is, all detecting at least one wrong CRC in each best end bit position), then in step S117, confirm the piece mistake, and termination routine.
In order to be without loss of generality, it must be emphasized that an important aspect.Because the particular viterbi that preferred embodiment relates to realizes that hypothetical trellis path possibly finish at given state more, then this state measurement is low more.Yet, can find other Viterbi to realize that wherein hypothetical trellis path possibly finish at given state more, this state measurement will be high more.In this Viterbi design, according to definition, PMC parameter δ
sBe the strict quantity that is lower than the value of initial condition i=0 in the path metric value of state 1 to N.Then, in step S104 to lower δ
sValue rather than high value are counted.
According to of the restriction of UMTS standard, maximum 16 the possible end bit position (being code block size) of verification to BTFD.Thus, must calculate PMC parameter δ up to 16
s, subsequently itself and Path selection threshold delta are carried out 16 comparisons.If n
sRepresent its δ
sGreater than the quantity of the end bit position of Δ, then n
sBelong to { 0 ... In the 16} scope.Yet, the complexity of whole BTFD and n
sValue be closely related.We can say, realize haveing nothing to do n with Viterbi
sBig more, the quantity of the CRC check that will carry out big more.When the transmission channel of Application of B TFD allowed multiple possible transformat, above-mentioned situation was especially obvious.
Yet, according to Fig. 3, can be through restriction decoding, especially with the Viterbi memory recall and CRC check is restricted to the best end bit position (being M=3) of predetermined quantity M, reduce the complexity of algorithm, that is, cause maximum PMC parameter δ
sM size, δ wherein
s＞Δ.In Fig. 3, n
1 End, n
2 EndAnd n
3 EndRepresent maximum δ
s, inferior big δ
sWith the third-largest δ
sCorresponding respectively best end bit position.Because δ
sThe big more fact of possibility of bigger then correct best end bit position is at first handled best end bit position n
1 EndCarry out recalling of Viterbi memory, and decoded bits is carried out CRC check, wherein, the CRC check sum depends on the quantity of possible transformat.If found all correct transformat of a kind of all CRC, then can one of the correspondence of best end bit position be claimed as right or correct end bit position, and should be claimed as blind Detecting this transformat.Thus, in this case, stop the BTFS program.On the other hand; If there is not transformat can satisfy " all CRC checks are for correct " such condition; Then check next best end bit position; And if above-mentioned condition still can't satisfy, then more next best bit positions is handled, all be processed until all best end bit position.
What can illustrate is, if only consider the best end bit position of M=3, then with tested all n
sThe situation of position is compared, and it is very limited that performance reduces.This be since in three best end bit position neither one cause having δ in the correct decoding of all CRC that one of maybe transformat to it
s＜δ
s(n
3 End) and the possibility of end bit position that all CRC are correctly decoded very low.
Be less than three the block size or the form that are used to check δ s＞Δ if exist, then keep identical scheme.Can begin with a position, with the descending end bit position with maximum δ s.What can illustrate is can UFDR be remained lower according to the method described above.Have in two or more end bit position under the situation of identical PMC parameter δ s value, give bigger that, promptly at first it is handled with preferentially.This is based on following hypothesis: size (size) is big more, and then the value of PMC parameter δ s is reliable more.The characteristic of some Veterbi decoding algorithms has proved above-mentioned hypothesis.The same as many other accumulation algorithm, integration or accumulation window are long more, and then the result is more reliable and accurate.
If neither one produces the correct decoding of all CRC in three end bit position, then this piece is confirmed as mistake.
Certainly, can select the best end bit position of varying number M based on the specific needs of practical application.
Fig. 4 shows the discrete or hard-wired schematic block diagram of the process among Fig. 3.To import data DI and offer Viterbi decoder 10, Viterbi decoder 10 is used to calculate the initial p MV of the internal state of each grid level
0And follow-up PMV
iValue PMV with particular state
iAnd initial value PMV
0Offer first comparator 12, if actual value PMV
iGreater than initial value PMV
0, then these first comparator, 12 output logic state or pulses.Based on this output valve, counter 14 increases progressively count value, after having handled all internal state N, will indicate PMC parameter δ
sThe final count value of value offers second comparator 20, in order to compare with corresponding Path selection threshold delta.The output of second comparator 20 is used to trigger storage or the write operation to memory 16, wherein with the end bit position of reality
With the count value or the PMC value δ that confirm
sStore as one of best bit positions together.Handling all end bit position, and predetermined quantity M best end bit position is stored in after the memory 16, CRC treatment circuit 18 reads the best end bit position n that is stored continuously
j End, and from a beginning of the best of best end bit position execution error verification, so that confirm that checked or correct end bit position n
v End, this end bit position n
v EndIndicated the transformat that is detected.If there is not end bit position to be confirmed as correctly, then produce the indication of piece mistake by CRC treatment circuit 18.
Therefore, transport format detection is carried out through all CRC are carried out verification basically, and this CRC selects the transformat of best end bit position corresponding with having.
Fig. 5 shows the poorest or the most critical allocation list of having indicated different transpost formats.In this table, indicated the quantity n of transformat jointly
TFWith possible transmission block size S
TBAnd transmission block quantity n
TBIn addition, also indicated CRC size S
CRCWith encoding scheme CS.Encoding scheme CS has indicated the convolution speed CR of convolution coder.For example, if constraint length is fixed as " 9 ", convolution coder is two bits of output in 1/2 o'clock at CR, is three bits of output in 1/3 o'clock at CR.
All 15 kinds of transformats of considering table among Fig. 5 produce " 480 " (n just
TBX (S
TB+ S
CRC) the fact of same code block size, this in fact also is the worst condition of 384kbps specified in the above-mentioned 3GPP standard.In this case, need 188 CRC to calculate, so that test all transformats.
In order to reduce the complexity of whole process, a kind of method has been proposed, so that minimize the quantity of CRC to be verified, improve the reliability of transport format detection simultaneously.Its thought is to arrange transformat according to the descending of transmission block quantity, and begins to carry out the CRC detection from the transmission block of maximum quantity.Then, as long as a CRC check is wrong, then transformat is claimed as mistake.On the contrary, when all relevant CRC detect when correct, transformat is considered to detect, stops the BTFD process thus.
Can in the step S112 of Fig. 3, carry out this arbitration schemes by the CRC treatment circuit 18 of Fig. 4, this arbitration schemes has demonstrated some advantages.The transformat of height protection that comprises a plurality of CRC bits is with preferentially, and at first it handled.Consider the following fact: for a large amount of CRC checks, when transformat was incorrect, the possibility with all correct CRC can be ignored (in fact leveling off to zero) fully, and this method makes erroneous transmissions format detection rate reduce.In addition, the CRC check number is big more, and its erroneous transmissions format detection rate is low more.Another advantage is that the par of CRC check reduces, and this means that also the stand-by period reduces.
For example, suppose best end bit position n
1 EndBe correct end bit position, and relevant code block is carried out complete decoding.Then; If above-mentioned tabulation is not to arrange perhaps even do not arrange according to the order of being advised before, and confirms a kind of transformat, all CRC are all correct; But the CRC check number does not also correspond to maximum number, can not conclude that then this transformat is right or correct transformat.There is another kind of transformat, correct and the CRC check of all CRC with big total amount.In other words, when correctly above-mentioned tabulation not being arranged, should all carry out CRC check to all transformats, this finally causes the CRC check of bigger quantity, and in most of the cases produces the very important stand-by period.On the other hand,, then think and confirm that the first all correct transformat of all CRC is right transformat, thus, need not carry out any additional C RC verification remaining transformat if above-mentioned tabulation is suitably arranged.Therefore, this method reduces the stand-by period through the sum of decreased average CRC check.
In a word; Described and be used for method, equipment and the computer program that the transformat to multiplexing transmission information channel detects; This multiplexing transmission information channel is used to transmit binary data; Wherein to each state of the grid level of possible the end bit position of the data block of transmission channel, confirmed path metric value, this path metric value has been estimated the possibility of hypothetical trellis path in the predetermined state end.Then; To each possible end bit position, calculated a plurality of path metric values, this path metric value has indicated hypothetical trellis path higher than the possibility that finishes in initial condition in the possibility that said predetermined state finishes; And selected best end bit position; This best end bit position causes the peak of (lead to) number that calculates, then to selected best end bit position execution error verification, so that transformat is detected.The suggestion of best end bit position selects to make that decode operation quantity reduces, and therefore makes the complexity of handling reduce.
It should be noted that the present invention is not limited to the specific implementation of the foregoing description, and can under the prerequisite of the scope of the present invention that does not depart from the accompanying claims to be limited, change and revise.Particularly, the present invention is not limited to the UMTS application.It can be used for any application of DS-CDMA or other wireless communication system, and communication standard has been imagined the existence of logic channel therein, and this logic channel comprises symbol or the signal waveform that transceiver is unknown.Suppose that single hardware or software can carry out some functions, then have several different methods, be used to utilize hardware or software item or both to realize function according to the method for the invention.It is not got rid of hardware or software item or both combinations and carries out function.Particularly, can realize the process of Fig. 3, maybe can its software routines as the treatment facility that is used for receiver control be realized based on discrete hardware equipment as shown in Figure 4.Can software routines be stored in computer-readable medium, and after computer-readable medium is inserted receiver, can it be loaded in the memory of receiver.
Can realize hardware or software item through some modes, such as relying on wired electronic circuit or can be by the integrated circuit of suitable programming.This integrated circuit can be the part of receiver, and this receiver can be included in computer or computer system, mobile communication handheld device, base station or arbitrarily in other the communication system equipment.Receiver can comprise and be suitable for carrying out all operations necessary so that support the device of the communication service of particular type that this device is realized as hardware or software item.Particularly, this device can be implemented as hardware or software item or both combinations, is specifically designed to specific function, and perhaps it can be the single item that is used to carry out some functions.For example, integrated circuit can be included in included instruction set in computer-readable memory or the independent receivers memory, and can make this computer or transceiver carry out the different step of the BTFD process of suggestion.Through reading data medium, can this instruction set be loaded into programmable memory such as dish.The service provider also can make instruction set use through the communication network such as the Internet.
It should be noted, above the embodiment illustration mentioned and and unrestricted the present invention, and under the prerequisite of the scope that does not depart from dependent claims, those skilled in the art can design many optional embodiment.In claim, any Reference numeral between the bracket should not constitute the restriction claim.Speech " comprises " and the element listed in the claim or the existence of element outside the step or step do not got rid of in similar speech.The singular reference of element is not got rid of the existence of a plurality of this elements, and vice versa.If listed some measure in the dependent claims that differs from one another, this combination of not representing these measures can not produce beneficial effect.
Claims (12)
1. method that is used to detect the transformat of multiplexing transmission information channel, said multiplexing transmission information channel is used to transmit binary data, said method comprising the steps of:
A) to each state of the grid level of the possible end bit position of the data block of said transmission channel, confirm path metric value, said path metric value has been estimated the possibility that hypothetical trellis path finishes at predetermined state;
B), calculate and indicated the quantity (δ of hypothetical trellis path at the possibility of the said predetermined state end path metric value higher than the possibility that finishes in initial condition to each possible end bit position
s);
C) select the best end bit position of predetermined quantity, the peak of the said quantity that said best end bit position causes calculating in the step b); And
D) to selected best end bit position, the execution error verification is so that detect said transformat.
2. the method for claim 1; Wherein, Said selection step comprises: refusal makes path metric value less than the end bit position of predetermined threshold value, and according to tabulation, arranges the end bit position of not refusing from the order that is up to the lowest path metric value.
3. method as claimed in claim 2 also comprises step: if all end bit position all are rejected, then said data block is claimed as mistake.
4. like the described method of arbitrary aforementioned claim, wherein, said predetermined quantity is 3.
5. like one of any described method of claim 1 to 3, also comprise step:, then select end bit position corresponding to big block size if two or more end bit position causes identical quantity in step b).
6. like one of any described method of claim 1 to 3, wherein, said error checking step comprises step: the order according to transmission block quantity is successively decreased is arranged possible transformat, and begins verification operation with the transformat of the data block of maximum quantity.
7. method as claimed in claim 6 also comprises step: if all error-correction operations of said transformat all cause the piece of institute's verification is correct result, then can confirm detected transmission form.
8. method as claimed in claim 6 also comprises step: if the verification of unsuccessful ground all transformats relevant with selected best end bit position, then the specified data piece is wrong.
9. equipment that is used to detect the transformat of multiplexing transmission information channel, said multiplexing transmission information channel is used to transmit binary data, and said equipment comprises:
A) confirm device (10), be used for each state to the grid level of the possible end bit position of the data block of said transmission channel, confirm path metric value, said path metric value has been estimated the possibility that hypothetical trellis path finishes at predetermined state;
B) calculation element (14) is used for to each possible end bit position, calculates and has indicated the quantity (δ of hypothetical trellis path at the possibility of the said predetermined state end path metric value higher than the possibility that finishes in initial condition
s);
C) choice device (16,18) is used to select the peak of the said quantity that the best end bit position of predetermined quantity, said best end bit position cause being calculated by said calculation element; And
D) calibration equipment (18) is used for to selected best end bit position, and the execution error verification is so that detect said transformat.
10. equipment as claimed in claim 9, wherein, said definite device comprises Viterbi decoder (10).
11. like claim 9 or 10 described equipment; Wherein, Said calculation element comprises the calculator of being controlled by the output signal of comparator (12) (14), and said comparator (12) is set to said definite device (10) is compared to current state and the determined path metric value of said initial condition respectively.
12. like one of any described equipment of claim 9 to 10, wherein, said equipment comprises the receiver device of wireless communication system.
Applications Claiming Priority (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP04106920 | 2004-12-23 | ||
| EP04106920.4 | 2004-12-23 | ||
| EP05101091 | 2005-02-14 | ||
| EP05101091.6 | 2005-02-14 | ||
| PCT/IB2005/054290 WO2006067720A1 (en) | 2004-12-23 | 2005-12-16 | Low complexity blind transport format detection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101088242A CN101088242A (en) | 2007-12-12 |
| CN101088242B true CN101088242B (en) | 2012-07-11 |
Family
ID=36118081
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2005800448110A Expired - Fee Related CN101088242B (en) | 2004-12-23 | 2005-12-16 | Low complexity blind transport format detection |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US7979782B2 (en) |
| EP (1) | EP1832030B1 (en) |
| JP (1) | JP4940400B2 (en) |
| CN (1) | CN101088242B (en) |
| AT (1) | ATE545228T1 (en) |
| WO (1) | WO2006067720A1 (en) |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7643993B2 (en) * | 2006-01-05 | 2010-01-05 | Broadcom Corporation | Method and system for decoding WCDMA AMR speech data using redundancy |
| US8286058B2 (en) * | 2005-04-07 | 2012-10-09 | Nokia Corporation | Blind transport format detection based on decoder metric |
| JP4758765B2 (en) * | 2006-01-05 | 2011-08-31 | ルネサスエレクトロニクス株式会社 | Transport format detection apparatus and transport format detection method |
| JP2007195076A (en) * | 2006-01-20 | 2007-08-02 | Nec Corp | Radio communication system, and transmission power control method and device thereof |
| US8379738B2 (en) * | 2007-03-16 | 2013-02-19 | Samsung Electronics Co., Ltd. | Methods and apparatus to improve performance and enable fast decoding of transmissions with multiple code blocks |
| KR101392446B1 (en) * | 2007-08-23 | 2014-05-07 | 삼성전자주식회사 | Apparatus and method for rate dematching in communication system |
| US8687745B2 (en) | 2007-12-13 | 2014-04-01 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for blind decoding |
| US8565811B2 (en) * | 2009-08-04 | 2013-10-22 | Microsoft Corporation | Software-defined radio using multi-core processor |
| US9753884B2 (en) * | 2009-09-30 | 2017-09-05 | Microsoft Technology Licensing, Llc | Radio-control board for software-defined radio platform |
| US8627189B2 (en) * | 2009-12-03 | 2014-01-07 | Microsoft Corporation | High performance digital signal processing in software radios |
| US20110136439A1 (en) * | 2009-12-04 | 2011-06-09 | Microsoft Corporation | Analyzing Wireless Technologies Based On Software-Defined Radio |
| CN101820389B (en) * | 2010-03-15 | 2013-01-23 | 南通大学 | Network path situation assessment method based on intelligent computation |
| US8687746B2 (en) * | 2010-05-27 | 2014-04-01 | Qualcomm Incorporated | SMU architecture for turbo decoder |
| EP2705631B1 (en) | 2011-05-04 | 2022-07-27 | Microsoft Technology Licensing, LLC | Spectrum allocation for base station |
| US8989286B2 (en) | 2011-11-10 | 2015-03-24 | Microsoft Corporation | Mapping a transmission stream in a virtual baseband to a physical baseband with equalization |
| US9558062B2 (en) * | 2014-07-28 | 2017-01-31 | Qualcomm Incorporated | Cyclic redundancy check (CRC) false detection reduction in communication systems |
| WO2018207155A2 (en) * | 2017-05-12 | 2018-11-15 | Telefonaktiebolaget Lm Ericsson (Publ) | Adaptive crc length for beam sweeping |
| CN110719140B (en) * | 2018-07-13 | 2022-03-11 | 北京小米松果电子有限公司 | Transmission format blind detection method and device, storage medium and electronic equipment |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1498486A (en) * | 2001-02-15 | 2004-05-19 | �����ɷ� | System and method for transmission format detection |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| ES2166710B1 (en) * | 2000-04-25 | 2004-10-16 | J. URIACH & CIA, S.A. | NEW HETEROCICLIC COMPOUNDS WITH ANTI-INFLAMMATORY ACTIVITY. |
| GB2389020B (en) * | 2002-05-23 | 2006-02-01 | Ubinetics Ltd | Blind transport format detection for transmission link |
| US7730381B2 (en) * | 2004-06-09 | 2010-06-01 | Qualcomm Incorporated | Erasure detection and power control for a transport channel with unknown format in a wireless communication system |
| JP4758765B2 (en) * | 2006-01-05 | 2011-08-31 | ルネサスエレクトロニクス株式会社 | Transport format detection apparatus and transport format detection method |
-
2005
- 2005-12-16 AT AT05826748T patent/ATE545228T1/en active
- 2005-12-16 CN CN2005800448110A patent/CN101088242B/en not_active Expired - Fee Related
- 2005-12-16 JP JP2007547746A patent/JP4940400B2/en not_active Expired - Fee Related
- 2005-12-16 EP EP05826748A patent/EP1832030B1/en not_active Not-in-force
- 2005-12-16 US US11/722,683 patent/US7979782B2/en not_active Expired - Fee Related
- 2005-12-16 WO PCT/IB2005/054290 patent/WO2006067720A1/en active Application Filing
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1498486A (en) * | 2001-02-15 | 2004-05-19 | �����ɷ� | System and method for transmission format detection |
Also Published As
| Publication number | Publication date |
|---|---|
| ATE545228T1 (en) | 2012-02-15 |
| WO2006067720A1 (en) | 2006-06-29 |
| JP4940400B2 (en) | 2012-05-30 |
| EP1832030B1 (en) | 2012-02-08 |
| JP2008526074A (en) | 2008-07-17 |
| EP1832030A1 (en) | 2007-09-12 |
| US7979782B2 (en) | 2011-07-12 |
| US20090119570A1 (en) | 2009-05-07 |
| CN101088242A (en) | 2007-12-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101088242B (en) | Low complexity blind transport format detection | |
| US7376209B2 (en) | Method and apparatus for near-optimal scaling of log-likelihood ratio (LLR) computation in turbo decoding for hybrid automatic repeat request (ARQ) | |
| US7688915B2 (en) | Method and system for blindly detecting a discontinuously transmitted shared channel, in particular blind high speed shared control channels detection | |
| KR100654515B1 (en) | Decoder and decoding method | |
| CN101471689B (en) | Method for transmitting data in communication system, communication device and communication system | |
| US6463097B1 (en) | Rate detection in direct sequence code division multiple access systems | |
| WO2002056556A2 (en) | Data-rate detection in cdma systems | |
| EP0852853A1 (en) | Cellular communication system with multiple code rates | |
| WO1997011535A9 (en) | Cellular communication system with multiple code rates | |
| WO2000016512A1 (en) | Rate detection in radio communication systems | |
| US6687233B1 (en) | Rate detection in direct sequence code division multiple access systems | |
| US6734810B2 (en) | Apparatus and method for decoding | |
| CN100438391C (en) | Blind transport format detection for a transmission link | |
| US20090059883A1 (en) | Radio base station and method of receiving physical control channel | |
| CN104509017A (en) | Improved blind transport format detection depending on the conditions of reception of the signal | |
| CA2720420C (en) | System and method for decoding a message using a priori information | |
| EP1817860B1 (en) | Tfci decoding apparatus and method | |
| WO2001043330A2 (en) | Data rate estimation in a communication system | |
| CN101151836B (en) | Blind transport format detection based on decoder metric | |
| CN103581986A (en) | Channel detection method and device | |
| GB2389021A (en) | Blind transport format detection with preselection of candidate transport formats | |
| CN102265541A (en) | Bler estimation method and communication device | |
| KR100450952B1 (en) | Method and apparatus for receiving multiplexing packet data control channels | |
| JP2002051104A (en) | System for determining transmission information rate and method for determining the same | |
| Wang et al. | Optimal blind transport format detection for the UMTS uplink |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: NXP CO., LTD. Free format text: FORMER OWNER: KONINKLIJKE PHILIPS ELECTRONICS N.V. Effective date: 20080404 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20080404 Address after: Holland Ian Deho Finn Applicant after: Koninkl Philips Electronics NV Address before: Holland Ian Deho Finn Applicant before: Koninklijke Philips Electronics N.V. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120711 Termination date: 20181216 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |