CN101720537A - Reliable decoding of a high-speed shared control channel - Google Patents

Reliable decoding of a high-speed shared control channel Download PDF

Info

Publication number
CN101720537A
CN101720537A CN200880022452A CN200880022452A CN101720537A CN 101720537 A CN101720537 A CN 101720537A CN 200880022452 A CN200880022452 A CN 200880022452A CN 200880022452 A CN200880022452 A CN 200880022452A CN 101720537 A CN101720537 A CN 101720537A
Authority
CN
China
Prior art keywords
message
likelihood
candidate
optimal candidate
decoded
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
CN200880022452A
Other languages
Chinese (zh)
Other versions
CN101720537B (en
Inventor
L·安德森
A·赖亚尔
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.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of CN101720537A publication Critical patent/CN101720537A/en
Application granted granted Critical
Publication of CN101720537B publication Critical patent/CN101720537B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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/0072—Error control for data other than payload data, e.g. control data
    • 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
    • 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3738—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with judging correct decoding
    • 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3776—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using a re-encoding step during the decoding process
    • 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • 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/65—Purpose and implementation aspects
    • H03M13/6522—Intended application, e.g. transmission or communication standard
    • H03M13/653—3GPP HSDPA, e.g. HS-SCCH or DS-DSCH related
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0023—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
    • 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • 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/20—Arrangements for detecting or preventing errors in the information received using signal quality detector
    • 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/20—Arrangements for detecting or preventing errors in the information received using signal quality detector
    • H04L1/208—Arrangements for detecting or preventing errors in the information received using signal quality detector involving signal re-encoding

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Artificial Intelligence (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Error Detection And Correction (AREA)
  • Executing Machine-Instructions (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

Methods and apparatus are disclosed for detecting a control channel message transmitted on one of a plurality of shared control channels and targeted to a wireless receiver. In an exemplary method, messages transmitted over a plurality of shared control channels are decoded, and at least one likelihood metric is determined for each of the decoded messages. A best candidate is selected from the decoded messages, based on the likelihood metrics, and the at least one likelihood metric for the best candidate is compared to corresponding likelihood metrics for the messages other than the best candidate to determine whether the best candidate is a valid message. Wireless communication receivers configured correspondingly are also disclosed.

Description

The reliable decoding of High-Speed Shared Control Channel
Technical field
The present invention relates generally to wireless communication system, relates more particularly to the message detection in the broadband CDMA system, and for example HS-SCCH part 1 detects.
Background technology
In third generation partner program (3GPP) standard version 5, introduced high-speed downlink packet access (HSDPA), to provide the enhanced data transfer rate to Wideband Code Division Multiple Access (WCDMA) (W-CDMA) portable terminal at the third generation mobile system.Be called as the transmission channel of high-speed downlink shared channel (HS-DSCH), the physical data channel support HSDPA that is called as the physical control channel of High-Speed Shared Control Channel (HS-SCCH) and is called as High-Speed Physical Downlink Shared Channel (HS-PDSCH).All signalings that the HS-SCCH carrying is relevant with HS-DSCH, and the HS-DSCH user data is carried on the HS-PDSCH.
Revision to the HSDPA technical specification recently provides further enhancing to power system capacity and portable terminal efficient, comprises that also increase is to advanced person's the multi-antenna technology (being multiple-input and multiple-output (MIMO) technology) and the support of so-called continuous grouping connection (CPC).These are revised each and all comprise the expansion of HS-SCCH being gone up signaling content and use.
CPC introduces in W-CDMA version 7, technical specification developer's original intention is to reduce to be increased by the caused uplink noise of the transmission of the physical control channel that is used for packet data user, makes to allow more packet data user be in the state (CELL-DCH state) of connection simultaneously and do not reduce cell throughout in long-time section.Owing to avoided consuming time reconnecting, so therefore packet data user will experience time delay and significantly reduce, thereby bring and the similar user experience of being experienced in the fixed broadband data network at present.But, it is wider that the target of CPC has become, comprises expense that reduces down link and the power consumption of mobile terminals that reduces packet data user now.
Be used for the new Cyclic Redundancy Check computational methods (type 2 CPC) of HS-DSCH and the new feature that new HS-SCCH message format (type 2 HS-SCCH) is supported CPC.Importantly, support the portable terminal of version 7 also should be able to handle tradition (version 6) the HSDPA form that is known as Class1 simultaneously.
To one of new feature of the CPC of HSDPA technical specification revision is that so-called HS-SCCH cuts down (HS-SCCH-less) operation.The HS-SCCH reduction operation is intended to be used for low data-rate applications, as voice (VoIP) service of internet protocol-based.Usual way is the transmission that reduces HS-SCCH by the transmission of HS-SCCH during the elimination data initial transmission, and this transmission produces a large amount of expenses at little packet usually.(after portable terminal confirmed successfully to receive the initial transmission failure of data, the mixed automatic repeat request (HARQ) that can reach twice subsequently retransmitted, and retransmits use pattern 2 HS-SCCH signalings at every turn and comes " declaration ").Because the initial transmission of not coming the signaling new data by the HS-SCCH in the HS-SCCH reduction operation, so portable terminal must utilize the finite aggregate of coding parameter and transport block size, employing " blind " to detect these transmission.
Service wireless network controller or SRNC are based on every subscriber equipment, by distributing four predetermined transport block size and two predetermined HS-PDSCH sign indicating numbers to dispose the HS-SCCH reduction operation to given subscriber equipment (UE).Therefore the UE of configuration attempts to be chosen as condition with limited transport block size, and blind decoding is carried out in all groupings that receive on one or two HS-PDSCH, utilizes new type 2 CRC to detect the successful decoding that HS-SCCH cuts down transmission.But, simultaneously, US should continue to monitor nearly four HS-SCCH that are used in reference to the control messages of this UE.Version 7 UE answer type of detection 1 and type 2 HS-SCCH message, and should be able to determine that the HS-SCCH that is received is Class1 or type 2.
(any kind) HS-SCCH subframe is made of the two parts that transmit on three time slots.Part 1 (it is mapped to first time slot in three time slots) is used for determining following information by UE: this information description is at the HS-PDSCH that the closes on transmission of this UE, this information comprise will be in HS-PSDCH transmission the sign and the modulator approach of the channel code of use.To distinguish as part 1 message of target and other with particular UE by using specific to the scramble sequence of UE.Part 2 (it is mapped to the second and the 3rd time slot of HS-SCCH subframe) provides information and HARQ process information about transport block size.Because the transmission of part 2 and the transmission crossover of HS-PDSCH subframe, the part 1 of the HS-SCCH subframe that transmitted before corresponding HS-PDSCH subframe is designed to slightly: comprise the enough information that makes UE can begin to receive corresponding HS-PDSCH subframe.HS-SCCH also is used for giving an order under unexpected situation, by only identifying these orders by zero part 1 message that constitutes.For non-MIMO operation, part 1 is made of 8 data bits that are encoded into 40 bits (1/3 convolution code, rate-matched is to 40 bits), makes mask with the 16 bit UE sign that is encoded to 40 bits (1/2 convolution code, rate-matched is to 40 bits).
Also introduced MIMO in the version 7.Be similar to the HS-SCCH reduction operation, the MIMO pattern is configured at every UE.Another new HS-SCCH form (type M) is introduced into to support MIMO.The MIMO operation is a different mode; Therefore, the UE that is configured in the MIMO pattern should only detect and support HS-SCCH type M but not Class1 and type 2.HS-SCCH type M subframe is divided into two parts as mentioned above, but amount of bits and implication difference thereof.Particularly, part 1 by 12 data bits but not 8 bits constitute, although 12 bits are encoded into 40 bits the transmission, as Class1 part 1 message.
Tradition HS-SCCH decoder for example may utilize the every certain applications convolution decoder of Viterbi (Viterbi) decoder to message.Decoded part 1 message is used for the configuring receiver circuit, and this circuit is used for the soft value of mediation of separating of HS-PDSCH and extracts.After receiving part 2, CRC can be used for determining that current message is at given UE.Because nearly four HS-SCCH sign indicating numbers (channel) are monitored simultaneously, so part 1 message is decoded at each.Certainly, at any given subframe, only one of message can be pointed to this UE.Typically, the message corresponding to " the best " decoded result is used to receive and be provided with at traffic data.The defective of this method is, traffic data always be buffered and to small part by demodulation, whether no matter the message at this given UE arranged really.
When not at the data of given UE, be closed for saving decode resources and allowing HS-PDSCH to receive, various improved HS-SCCH detection methods have been proposed.In one approach, part 1 sequences of code bits that is received is not clearly decoded, and detects but utilize maximum likelihood (ML) to handle.Given Class1 HS-SCCH calculates 40 bit hypothetical sequences in 256 possible 8 bit parts, 1 message each.In 256 hypothesis each is relevant with the soft value that is received on each of nearly four the different HS-SCCH that monitored.The hypothesis that produces the highest correlation is selected, and begins to receive corresponding HS-DSCH under the sufficiently high situation of this correlation.In the modification of this method, only at this highest correlation under the situation of other (255) individual correlated results, just start the reception of corresponding HS-DSCH.For example, UE may need " triumph " correlated results be at least the relevant τ of average absolute among other candidate doubly.The selection of τ is compromise (its demodulation owing to unnecessary HS-PDSCH increases the UE power consumption) missed between detection (it causes owing to retransmit the throughput decline that brings) and the false alarm.Certainly, the τ value must be greater than 1, and the choose reasonable at the τ value may be 4.5 in some implementations.
With respect to Class1 HS-SCCH signaling, above-mentioned Maximum Likelihood Detection is handled more more effective on calculating than traditional Veterbi decoding method.It also produces the useful degree of reiability at preferred hypothesis, and it can be used for, and deciding section 2 detects and whether the traffic data demodulation is necessary.This causes the power consumption of UE to reduce again.Yet the ML detection scheme of implementing (Class1 HS-SCCH) at version 6 only needs to consider 256 hypothesis (40 bits of every hypothesis) corresponding to 8 bit data field in the part 1.And support that version 7 enforcements of HS-SCCH type M need be corresponding to 4096 hypothesis (each supposes 40 bits) of 12 bit data field in the part 1.This a kind of substituting that makes the ML of HS-SCCH part 1 message detect as the convolution decoder method lacks attraction.
Considered to miss trading off between detection and the false alarm at the Maximum Likelihood Detection scheme of above-mentioned HS-SCCH part 1 message.Under the situation that increases type 2 HS-SCCH signalings, false alarm will not only cause the non-existent Class1 HS-DSCH because UE attempts to decode and power consumption increases, and cut down transmission and will be intended for use in corresponding to the throughput under the situation of the HS-DSCH subframe of the false alarm of HS-SCCH by actual but also will be reduced in HS-SCCH.In order to save power when type of detection 1 part 1 message and to avoid false alarm, need a kind of coding/decoding method, it helps decoded messages reality estimates corresponding to the likelihood of the message that sends to given UE, and allows the false probability of alarming and miss detection to be adjusted to acceptable level.
Summary of the invention
Here given of the present invention one or more embodiment provide the HS-SCCH part 1 detection method, it is effective at 3GPP version 7 HS-SCCH structures on calculating, and it has comprised and has been used to distinguish the mechanism that successfully detects and get nowhere and detect, and makes to use that suitable missing detects and false alarm criterion.Whether at each the one or more alternate message of decoding in a plurality of HS-SCCH channels that received, and compare with other candidate's likelihood tolerance at the likelihood of optimal candidate tolerance, be efficient message with definite optimal candidate.
In some embodiment, use the mixed method of maximum likelihood detection method to be used to estimate that optimal candidate is the likelihood of efficient message.In some of these embodiment, used correlation at the candidate subset that constitutes by Viterbi decoder output and the additional candidate who selects at random.In other embodiments, only can be used for the actual received likelihood of estimating part 1 message at the Viterbi decoder output quality of all HS-SCCH sign indicating numbers tolerance.
In the exemplary universal method, the control channel message of transmitting on a plurality of shared control channels is decoded, and determines at least one likelihood tolerance at each decoded messages.Based on this likelihood tolerance, from decoded messages, select optimal candidate, and at least one the likelihood tolerance at optimal candidate is compared with the corresponding likelihood tolerance at the message except that this optimal candidate, to determine whether this optimal candidate is efficient message.
In certain embodiments, generated one or more additional alternate message, and calculated additional likelihood tolerance corresponding to this additional alternate message.In these embodiments, compare with additional likelihood tolerance, and compare with corresponding likelihood tolerance at decoded messages except that this optimal candidate at least one likelihood tolerance of optimal candidate.
In certain embodiments, by to decoded messages and any additional alternate message recompile and make the bit sequence of this recompile relevant, be formed for determining whether selected optimal candidate is the likelihood tolerance of efficient message with the soft bit values sequence that is received.In some embodiment of these embodiment, by testing needle whether the likelihood of optimal candidate message tolerance (being correlation in these embodiments) has been surpassed at the scale average (scaled average) of other candidate's likelihood tolerance and to have determined that optimal candidate is effectively, for example whether satisfied c i max mean i ≠ i max [ | c i | ] ≥ τ , Wherein
Figure G2008800224522D00052
Be at the likelihood of optimal candidate in all alternate message tolerance, wherein to have correlation be c to message i i, and wherein τ is a proportionality constant greater than 1.
Said method and modification thereof can realize in the receiver of the treatment circuit that comprises one or more suitable configurations that it can comprise hardware, software and mix arbitrarily.For example, special use or general purpose microprocessor or digital signal processor can be configured to the computer program instruction, and the packet transaction of combination and the said method of modification thereof are carried out in described instruction.
As nonrestrictive example, the mentioned here instruction and the modification of these instructions can be applied to provides HSDPA (high-speed downlink packet access) business and/or professional W-CDMA (Wideband Code Division Multiple Access (WCDMA)) network of HSUPA (High Speed Uplink Packet access).
Certainly, the invention is not restricted to above scope, also be not limited to above feature and advantage.In fact, those of ordinary skill in the art below reading detailed description and check accompanying drawing after, will recognize additional feature and advantage.
Description of drawings
Fig. 1 is the block diagram that part is described the cordless communication network that comprises the example wireless communication control processor.
Fig. 2 is the block diagram of example wireless communication control processor.
Fig. 3 is the logical flow chart of describing at the processing logic of an embodiment of the method that is used to detect control channel.
Fig. 4 is a flow chart of describing another illustrative methods be used to detect control channel.
Embodiment
Fig. 1 has partly described cordless communication network 8, this network comprises: transmitter 10, be used for to (long-range) receiver 12 launching code packets of information, wherein receiver 12 is arranged to the control channel message that detection and decoding are associated with one or more coded messages groupings.According to the one or more embodiment that instructed here, 12 pairs of message that send on a plurality of shared control channels of receiver are decoded, and determine at least one the likelihood tolerance at each decoded message.Measure after from decoded messages, selecting optimal candidate based on this likelihood, receiver 12 is relatively measured with the corresponding likelihood at message except that this optimal candidate at the likelihood tolerance of this optimal candidate, to determine whether this optimal candidate is efficient message.After detecting efficient message, receiver 12 configurable receiver resources are so that decode to the grouped data of pointing to this receiver 12 and launch on common share communication amount channel.The method of this detection control channel message can especially provide the power consumption of receiver 12 of improvement and the data throughout of 12 the improvement from transmitter 10 to receiver.
As non-limiting example, cordless communication network 8 comprises supports high-speed downlink packet to insert (HSDPA) and/or professional Wideband Code Division Multiple Access (WCDMA) (W-CDMA) network of High Speed Uplink Packet access (HSUPA).In this class embodiment, transmitter 10 comprises the Node B transceiver and/or supports RNC (radio network controller), and receiver 12 comprises Wireless Telecom Equipment, for example cellular radio, PDA (portable digital-assistant), beep-pager, wireless communication card or module etc.Therefore, should understand, cordless communication network 8 seems that form is simple, and each can be used as tranmission/reception apparatus or system operation transmitter 10 and receiver 12, promptly, here, word " transmitter " and " receiver " are provided under transmitted in packets, reception and the retransmission operation environment reference term easily.
Fig. 2 has described the functional circuit details of the one or more embodiment that are used for receiver 12.Receiver 12 comprises control/treatment circuit 40 and RF transceiver circuit 44, and wherein this control/treatment circuit 40 comprises HSDPA processor 42.The each several part that it will be appreciated by the skilled addressee that the control/treatment circuit 40 that comprises HSDPA processor 42 can be realized in hardware, software or its any combination.For example, in at least one embodiment., control/treatment circuit 40 comprises one or more special uses or general purpose microprocessor, digital signal processor and/or other digital processing element, it is arranged to the computer program instruction especially, and described instruction is carried out control channel according to any embodiment that is instructed here and handled.
Fig. 3 has described according to one or more this class embodiment that are used for the control channel processing, as utilizing the processing logic of the Wireless Telecom Equipment realization that comprises receiver 12.Although illustrated processing is an order, should be understood that under possible situation illustrated one or more treatment steps also can be carried out simultaneously.And should be understood that illustrated processing can carry out on ongoing basis (on an on-goingbasis), and can be included in ongoing receiver and handle in the more big collection of operation.At last, although Fig. 3 relates to the detection of HS-SCCH message in the W-CDMA system, those of ordinary skill in the art will recognize that technology wherein illustrated and described below can be applicable to other system and network topology.
Under any circumstance, illustrated processing with in two or more monitored High-Speed Shared Control Channel (HS-SCCH) sign indicating numbers each, begun decoding to what receive corresponding to part 1 symbol of message, as shown in the frame 310.Those of ordinary skill in the art will understand, and each monitored HS-SCCH sign indicating number comprises different control channels, and wherein each channel is distinguished by its unique channel code according to traditional CDMA method.In the HSDPA edition 6 system, portable terminal (subscriber equipment, or UE) can be assigned to monitor simultaneously nearly four HS-SCCH sign indicating numbers, and is more although transmitter 10 may send at any given time.But, it will be appreciated by the skilled addressee that method and apparatus as described herein is applicable to the system that the HS-SCCH more than four whiles is monitored
In exemplary embodiments, utilize RAKE receiver to receive at part 1 bit sequence of each monitored HS-SCCH sign indicating number, and utilize convolutional decoder to decode.This part 1 bit sequence can use the special-purpose mask of UE to carry out mask, therefore requires receiver 12 to utilize the special-purpose mask of this UE that this bit sequence is removed mask before decoding.In any case, produce at least one decoded alternate message at each monitored HS-SCCH sign indicating number.As will be discussed further, in certain embodiments,, can produce one or more additional candidates based on the convolutional decoder result at each monitored HS-SCCH sign indicating number.
In frame 320, determine at least one likelihood tolerance at each alternate message.In certain embodiments, likelihood tolerance is included in the decoder metric to producing during each source codec, as the path metric from the Veterbi decoding process.As one of ordinary skill in the known, the branch metric of each bit-level in the Veterbi decoding algorithm computation decoding sequence amounts to determine path metric these branch metrics at the specific bit sequence.Maximum path metric is represented the most approximate sequence of bit, and path metric is high more, is that the message of original transmission is just more possible thereby corresponding sequence is the corresponding decoded messages of bit sequence of actual transmission.
In other embodiments, by according to convolution code to the message recompile, utilize the special-purpose mask of UE to carry out mask again, the original soft bit values that obtains of resulting candidate's bit sequence and RAKE receiver is carried out relevant then, can determine that likelihood measures at alternate message.High more correlation shows that given alternate message is possible more corresponding to the sequence that is sent.
In frame 330,, from the alternate message set, select optimal candidate based on likelihood tolerance.Typically, for example under the situation of the likelihood tolerance that comprises Viterbi decoder path metric or correlation discussed above, " the best " candidate only is the alternate message with the highest likelihood tolerance, although can use other likelihood tolerance, wherein lower metric is better.
In frame 340, compare at the likelihood of optimal candidate tolerance and likelihood tolerance, to determine whether this optimal candidate is effective message at other alternate message.In certain embodiments, at the likelihood tolerance of optimal candidate and on average comparing that the likelihood of other alternate message is measured.In some embodiment, optimal candidate likelihood tolerance is tested to determine whether it is sufficiently more than the average of other likelihood tolerance.In other words, optimal candidate likelihood tolerance and on average the comparing at the likelihood value of other message of multiply by proportionality constant.In these embodiments, if measure by λ at the likelihood of message i iProvide, exist so λ best > τ · mean i ≠ best [ λ i ] Situation under, optimal candidate message is effective.Change kind of an expression way, if λ best mean [ λ i ] i ≠ best > τ , Then optimal candidate message is effective.In other embodiments, can use power measurement.For example, if | λ best | 2 | var i ≠ best [ | λ i | ] | ≥ τ , Then optimal candidate can be considered to effective.Certainly, depend on the type of likelihood tolerance at the appropriate value of proportionality constant τ, and whether used amplitude, power or other expression mode.The value of τ also can be adjusted at the given design under certain condition, produce the probability that detection was alarmed or missed in specific vacation.
Whether with reference to figure 3, enough be better than measuring at the likelihood of other alternate message by the likelihood tolerance of testing needle to optimal candidate in frame 350 again, making optimal candidate message is determining of efficient message.This test can comprise one of above-mentioned comparison, each in the perhaps multiple alternative mode.In certain embodiments, for example, whether surpass enough absolute surplus of other alternate message likelihood tolerance average, can test optimal candidate message by determining optimal candidate.In other embodiments, whether surpass enough surplus of the highest likelihood tolerance of other candidate (i.e. second optimal candidate), can test optimal candidate message by determining optimal candidate message.Needed surplus can be absolute, or relative, i.e. whether this test λ Best＞λ 2nd_best+ a or λ whether Best＞b λ 2nd_bestPower measurement (for example square likelihood tolerance) also can be used in some of these alternative tests.In certain embodiments, can use test more than 1.For example, can be tested at the likelihood tolerance of optimal candidate to determine whether it surpasses the ratio average of other likelihood tolerance and surpass specific surplus of the second the highest likelihood tolerance.
Determine that alternate message is that " effectively " message represents that the actual expectation of decision message is to be used for receiver 12.As described definite result, control processing circuit 40 typically utilizes the indicated demodulation parameter of message to come configuring receiver 12 to receive suitable traffic channel data, for example by the subframe on the HS-PDSCH of effective control channel message indication.This is shown in the frame 370 of Fig. 3.The detection of live part 1 message also triggers receiving the decode of counterpart 2 data in the HSDPA system, and it especially can be used for checking by means of CRC (cyclic redundancy check (CRC)) field the validity of optimal candidate message.On the other hand, if this message be considered to not be effectively, in version 7 HSDPA systems, carry out the blind decoding of one or more HS-PDSCH sign indicating number channels so, as shown in frame 360.
Therefore those of ordinary skills should understand, determine that optimal candidate message is effectively must be experimental definite, because remain with such finite probability: one of other alternate message is actually predetermined message, perhaps in the interested time interval of institute, there is not control channel message directs receiver 12 at all.But, method described above and that explain in detail below provides the approach that is used to find the most approximate message candidate and is used to improve the reliability of message detection decision.Described decision process can be finely tuned as mentioned above, to realize the false alarm rate of expecting or to miss verification and measurement ratio.And the low technology of complexity as described herein allows portable terminal hardware to be designed to be more effective, saves chip area, cost and/or reduction receiver power consumption.
In certain embodiments, by expanding the alternate message pond, can further improve the reliability that efficient message detects to obtain additional statistical at comparison procedure.Decoded alternate message (nearly four of typical cases) constitute from 2 8(Class1 or 2) or 2 12Some main candidates' of (type M) individual possibility message set T.The available Q of the set of this possibility message (i.e. hypothesis set) marks.Main candidate collection T utilizes additional candidate set U to expand subsequently, with the statistics that obtains to add.Typically, | U|＞＞| T|, simultaneously | U|＜＜| Q|.
Among some embodiment in these embodiments, this additional candidate is from 2 8(Class1 or 2) or 2 12(type M) is individual may to be produced in the message at random.In other embodiments, can use the more method of " intelligence " that produces additional candidate.For example, can from the message of frequent use, select one or more additional candidate message, also permission use five the message sequence of normal use as accompanying information.Those skilled in the art will appreciate that, in some cases, " the best " candidate (being actually proper messages) can be one of these additional message that produce sometimes, especially produces under decoded messages candidate's the situation at the coding/decoding method that uses complexity to reduce.
In some embodiment, produce corresponding to every 40 bits of encoded (and in case of necessity by mask) bit sequence among total candidate collection V=T ∪ U, and relevant with the data that received.This and above-mentioned maximum likelihood process are similar, but have used the candidate who quite lacks than whole hypothesis set.If correlation c at each candidate i iMark has the candidate i of maximal correlation value so MaxBe chosen as " triumph " candidate, perhaps optimal candidate.The correlation of optimal candidate
Figure G2008800224522D00091
Subsequently the noise floor that forms with correlation by other candidate relatively, to determine candidate i MaxWhether be efficient message.In certain embodiments, describedly determine based on whether c i max mean i ≠ i max [ | c i | ] ≥ τ . As mentioned above, can change other form of using relative value or power measurement into.For example, can based on the test of power measurement based on whether | c i max | 2 var i ≠ i max [ | c i | ] ≥ τ . In addition, thresholding can be determined based on specific receiver design and the false probability of alarming and miss detection of target.Yet in the embodiment of the alternate message set that use is expanded, the statistics of comparison procedure improves usually, allows the false fine setting of alarming and missing detection statistics.Utilize this method in the HSDPA system that supports the MIMO operation, whether optimal candidate and relevant this optimal candidate can be determined corresponding to the authentic communication of part 1 message that is received, the huge complexity of having avoided the PRML at 12 bit parts, 1 field to detect simultaneously.
In some embodiment of these embodiment, the Viterbi decoder that can use complexity to reduce, this decoder produces one or more main candidates at each monitored shared control channel.Owing to utilize aforesaid PRML correlated process afterwards to determine optimal candidate, can relax to the requirement of Viterbi decoder.Therefore, can reduce the complexity of Viterbi decoder, for example, when finding main candidate, can use the pruning grid, thereby save power and decoder resources.In the embodiment of the Viterbi decoder that has used grid to descend, can produce additional alternate message by disturbance triumph candidate information bit sequence, thereby may recover any lost path in the grid.Utilize this method, for example, can be at each monitored control channel, produce one or more next ones recently like decoded result.
Utilize the illustrative methods of the candidate pool detection control channel message of transmission on one of one or more shared control channels that expands shown in Figure 4.In frame 410, alternate message is decoded from one or more shared control channels.As previously mentioned, receiver 12 can be used for monitoring in the HSDPA system nearly four HS-SCCH sign indicating number channels.In certain embodiments, can use Viterbi decoder single alternate message to be decoded at each sign indicating number.In some embodiment of these embodiment, Viterbi decoder can comprise the Viterbi decoder that complexity reduces, as using the Viterbi decoder of pruning grid.
In frame 420, produce additional alternate message.Bigger candidate pool produces more predictable statistics usually, thereby allows the meticulous control of message detection performance.In one or more embodiments, from possible massage set, select additional alternate message at random.In some embodiment of these embodiment, additional alternate message is selected at random and is utilized convolution code to encode so that subsequent treatment, and in other embodiments, can select the precoding bit sequence corresponding to possible decoded message.In other embodiments, can from the message of frequent use, select one or more additional alternate message; In these embodiments, can store coded sequence especially easily, with the processing time during the minimizing message detection process corresponding to the message of often using.In other embodiments still, can produce additional alternate message by the decode procedure that produces original alternate message.For example, can analyze the Viterbi decoder branch metric to determine potential alternative sequence.Those of ordinary skills will be familiar with being used for the decoded sequence of the Viterbi decoder that the disturbance grid dwindles so that recover technology corresponding to the alternative bit sequence of additional alternate message.
In certain embodiments, by from alternate message sequence pond, removing candidate's (shown in frame 425) of " impossible ", can further improve the message detection process.In many cases, as under the situation of HS-SCCH, some possible message may be undefined, and be sent out never.For example, HS-SCCH part 1 message can comprise 7 bit channel code character parameters.128 possible code characters can be received the portable terminal support owing to be less than all, and therefore some 7 bit code group argument sequences will take place never.Similarly, only defined five kinds of combinations of modulation at the HS-SCCH signaling, three in eight the 3 therefore possible bit modulation group parameters will take place never.Before the test candidate, can from the alternate message pond, remove the sequence of these and other " impossible ", thereby reduce the processing time and improve detection statistics.It will be appreciated by the skilled addressee that impossible message sequence can only be detected by scanning the candidate at undelegated sequence.In case detect, can remove each " impossible " candidate simply from the pond that is used for finding optimal candidate and/or is used to test the optimal candidate quality.Those of ordinary skills should also be understood that can utilize 8 bits or 12 bit alternate message or utilize can not message sequence corresponding to those coded sequence detect these impossible message sequences.
In frame 430, determine likelihood tolerance at each decoded messages and at each additional alternate message.As mentioned above, in some embodiment, carry out relevantly can being used as the correlation that likelihood is measured by the recompile alternate message and with the bit sequence of this recompile and corresponding soft bit values, thereby definite likelihood is measured to produce.(as mentioned above, in certain embodiments, some message in the additional alternate message may be stored with coding form, thereby make the recompile step unnecessary).In other embodiments, Viterbi decoder tolerance can be used as likelihood tolerance.
In frame 440, measure based on likelihood and to select optimal candidate.In certain embodiments, only from original decoded messages, select optimal candidate, rather than from whole alternate message pond, select (decode messages adds additional alternate message).In other embodiments, optimal candidate can be selected from all alternate message.In fact, no matter adopt which kind of method, its result is normally identical.But, in certain embodiments, in the embodiment that uses the likelihood tolerance except decoder metric, be possible for example because the additional candidate message that the path metric of one of approaching decoded message of the path metric of additional candidate message is selected can produce " better " likelihood value.
In any case, in frame 450, at the likelihood of optimal candidate tolerance with compare at the likelihood tolerance of other decoded message and with likelihood tolerance at additional candidate message, whether be efficient message with definite optimal candidate.Notice that this does not more need with two steps, although may be so in certain embodiments.This comparison procedure can be according to aforementioned arbitrary method or its modification.The candidate pool that one of skill in the art will recognize that expansion will make that usually candidate's statistical fluctuation is less.In many execution modes, this mode can be controlled more accurately to the performance of expectation, no matter be about verification and measurement ratio false alarm rate or that miss.
In certain embodiments, the comparison procedure shown in the frame 450 can adopt proportionality constant, other likelihood tolerance that makes likelihood tolerance at optimal candidate to surpass to be taken advantage of by this proportionality constant average.In some embodiment of these embodiment, can whether be arranged to the HS-SCCH reduction operation based on receiver and come selection percentage constant from two or more possible proportionality constants.More commonly, can whether be configured to receive on corresponding to one or more traffic channel of shared control channel the transmission of not declared based on receiver and come the selection percentage constant.In these embodiment or other embodiment, whether the selection of scale factor can be arranged to the MIMO operation based on mobile terminal receive.Therefore, can regulate the vacation alarm of receiver and/or the detection performance of missing at different operator schemes
Those of ordinary skills should also be understood that in the frame 450 employed be used for determining optimal candidate whether than other candidate more likely be considered to fully efficient message likelihood tolerance needn't be used to select the likelihood tolerance of optimal candidate identical.For example, consider an embodiment, wherein by recompile and the relevant likelihood tolerance that produces at decoded message and other alternate message with the soft bit values sequence that is received.In these embodiments, resulting correlation is used in the comparison procedure of frame 450 determine whether optimal candidate should be considered to effective.In these embodiments, can also utilize these identical likelihood values to select optimal candidate.Typically, the candidate corresponding to best correlation is chosen as optimal candidate.Yet in certain embodiments, optimal candidate can be selected based on decoder metric.For example, the decoded messages (in the HSDPA system, from the middle of four decoded messages nearly) with maximum path metric can be considered to optimal candidate.In some embodiment of these embodiment, additional alternate message can be selected in the middle of possible message at random, and these message of selecting at random will not have corresponding decoder tolerance.Therefore, decoder metric can be used for selecting optimal candidate, and the PRML correlation is used to determine whether optimal candidate is effective simultaneously.
Above-mentioned any method and modification thereof and expansion available wireless communication device (receiver 12 as illustrated in fig. 1 and 2) realize.Therefore, in one or more embodiments, receiver 12 is arranged to the message that detection transmits on a plurality of shared control channels, determine at least one likelihood tolerance at each decoded messages, from decoded messages, select optimal candidate based on likelihood tolerance, and relatively measure with the corresponding likelihood at the message except that optimal candidate at least one likelihood tolerance of optimal candidate, to determine whether optimal candidate is effective message.As mentioned above, be used for optimal candidate and other likelihood that compares tolerance can be used in the middle of decoded messages, selecting the likelihood tolerance of optimal candidate inequality.
In certain embodiments, receiver 12 also is configured to produce one or more additional candidate message and calculate corresponding to the additional likelihood of additional candidate message and measure.In these embodiments, compare with corresponding likelihood tolerance at least one likelihood tolerance of optimal candidate, and compare with additional likelihood tolerance at the message except that optimal candidate.
In certain embodiments, by to decoded messages and any additional candidate message recompile and each is undertaken relevant by the bit sequence of recompile and the soft bit values sequence that is received, be formed for determining whether selected optimal candidate is the likelihood tolerance of efficient message.In some embodiment of these embodiment, receiver 12 is configured to: by testing needle whether the likelihood of optimal candidate message tolerance is surpassed at the scale of other candidate's likelihood tolerance average, for example whether c i max mean i ≠ i max [ | c i | ] ≥ τ , Determine that optimal candidate message is effective.
Under the situation of consideration these and other modification and expansion, those skilled in the art will appreciate that the non-limiting example of method and apparatus that is used to detect effective control channel message that the representative of above stated specification and accompanying drawing is instructed here, no matter this method and/or equipment still are used in another wireless communication system in W-CDMA HSDPA system.Therefore, inventive arrangement of being instructed here and technology are not subject to above stated specification and accompanying drawing.But the present invention is only limited by following claims and legal equivalents thereof.

Claims (25)

1. method that is used to detect control channel message, described method comprises:
The message of transmitting on a plurality of shared control channels is decoded;
Determine at least one likelihood tolerance at each decoded messages;
From described decoded messages, select optimal candidate based on described likelihood tolerance; And
Relatively measure with corresponding likelihood, to determine whether described optimal candidate is effective message at the decoded message except that optimal candidate at described at least one likelihood tolerance of optimal candidate.
2. the method for claim 1, also comprise: produce one or more additional candidate message, and calculate corresponding to the additional likelihood of described additional candidate message and measure, wherein relatively comprise with corresponding likelihood tolerance: compare with measuring at the likelihood tolerance of optimal candidate, and measure with described additional likelihood and to compare at the likelihood of the decoded message except that optimal candidate at the message except that optimal candidate at described at least one likelihood tolerance of optimal candidate.
3. method as claimed in claim 2 wherein produces one or more additional candidate message and comprises: select described one or more additional candidate message from possible message groups at random.
4. method as claimed in claim 2, wherein determine that at each decoded messages at least one likelihood tolerance comprises: to described decoded messages recompile, to obtain the bit sequence of recompile, and carry out relevant with the soft value sequence that is received the bit sequence of described recompile corresponding to this decoded message, to obtain measuring the correlation that uses as described at least one likelihood, and wherein, calculating comprises corresponding to the additional likelihood tolerance of described additional candidate message: described additional candidate message is encoded, and coded additional candidate message and the soft value sequence that is received are carried out relevant, to obtain described additional likelihood tolerance.
5. method as claimed in claim 2 wherein produces one or more additional alternate message and comprises: select the message of one or more frequent uses to use as additional candidate message.
6. method as claimed in claim 2 wherein produces one or more additional alternate message and comprises: determine one or more next the most probable decoded result corresponding to one or more decoded messages.
7. method as claimed in claim 6, determine that wherein one or more next most probable decoded result comprise: disturbance is corresponding to the information bit sequence of one of decoded messages, with the potential lost path in the Viterbi decoder that recovers grid decline.
8. method as claimed in claim 2, also be included in at the likelihood of optimal candidate tolerance with compare at the likelihood tolerance of the decoded message except that optimal candidate and with additional likelihood measure compare before, removing has the decoded message or the additional candidate message of impossible information bit sequence.
9. the method for claim 1, wherein determine that at each decoded messages at least one likelihood tolerance comprises: to the decoded messages recompile, to obtain the bit sequence of recompile, and the bit sequence of described recompile and the soft value sequence corresponding to decoded messages that is received are carried out relevant, to obtain measuring the correlation that uses as described at least one likelihood.
10. method as claimed in claim 9, wherein from decoded messages, select optimal candidate to comprise: to select message corresponding to best decoder metric, wherein, relatively at described at least one likelihood tolerance of optimal candidate with at the corresponding likelihood tolerance of the message except that optimal candidate to determine whether described optimal candidate is that effective message comprises: compare at the correlation of optimal candidate and at the correlation of the message except that optimal candidate.
11. the method for claim 1 wherein relatively comprises at the correlation of optimal candidate and correlation at the message except that optimal candidate: relatively at the correlation of optimal candidate with taken advantage of by proportionality constant at the correlation of the message except that optimal candidate on average.
12. the described method of claim 11 also comprises based on mobile terminal receive whether being configured to receive the transmission of not declared on corresponding to one or more traffic channel of shared control channel, select described proportionality constant.
13. method as claimed in claim 11 also comprises: whether be arranged to multiple-input and multiple-output (MIMO) operation based on mobile terminal receive, select described proportionality constant.
14. the method for claim 1 wherein relatively comprises at the correlation of optimal candidate and correlation at the message except that optimal candidate: relatively at the correlation of optimal candidate and average at the scale of the correlation of the message except that optimal candidate.
15. the method for claim 1, comprise also whether based on optimal candidate be that effective message is come optionally: (a) utilize the decoding parametric of determining from the optimal candidate traffic channel of decoding, perhaps (b) utilizes one or more predetermined decoding parameters that one or more traffic channel are carried out blind decoding.
16. method as claimed in claim 15, wherein a plurality of shared control channels comprise the High-Speed Shared Control Channel (HS-SCCH) in Wideband Code Division Multiple Access (WCDMA) (W-CDMA) system, this traffic channel comprises High-Speed Physical Downlink Shared Channel (HS-PDSCH), and described message comprises part 1 message of HS-SCCH.
17. a wireless communication receiver comprises one or more treatment circuits, it is configured to:
The message that detection is transmitted on a plurality of shared control channels;
Determine at least one likelihood tolerance at each decoded messages;
From described decoded messages, select optimal candidate based on described likelihood tolerance; And
Relatively measure with corresponding likelihood, to determine whether described optimal candidate is effective message at the message except that optimal candidate at described at least one likelihood tolerance of optimal candidate.
18. wireless communication receiver as claimed in claim 17, wherein said one or more treatment circuit also is configured to: produce one or more additional candidate message, and calculate corresponding to the additional likelihood of described additional candidate message and measure, and wherein said one or more treatment circuit is configured to: relatively comprise with corresponding likelihood tolerance at the message except that optimal candidate at described at least one likelihood tolerance of optimal candidate: compare with measuring at the likelihood of the decoded message except that optimal candidate at the likelihood tolerance of optimal candidate, and measure with described additional likelihood and to compare.
19. wireless communication receiver as claimed in claim 18, wherein said one or more treatment circuits are configured to: by select one or more additional candidate message at random from possible message groups, produce described one or more additional candidate message.
20. wireless communication receiver as claimed in claim 18, wherein said one or more treatment circuit is configured to: by to the decoded messages recompile to obtain the bit sequence of recompile, and carry out relevant with the soft value sequence that is received the bit sequence of described recompile corresponding to this decoded message, measure the correlation that uses with acquisition as described at least one likelihood, thereby determine at least one likelihood tolerance at each decoded message; And wherein, described one or more treatment circuit is configured to: by described additional candidate message is encoded, and coded additional candidate message and the soft value sequence that is received are carried out relevant obtaining described additional likelihood tolerance, thereby calculate additional likelihood tolerance corresponding to described additional candidate message.
21. wireless communication receiver as claimed in claim 18, wherein said one or more treatment circuit is configured to: by the information bit sequence of disturbance corresponding to one of decoded messages, produce one or more additional candidate message, with the potential lost path in the Viterbi decoder that recovers grid decline.
22. wireless communication receiver as claimed in claim 18, wherein said one or more treatment circuit also is configured to: will at the likelihood of optimal candidate tolerance with compare at the likelihood tolerance of the decoded message except that optimal candidate and with additional likelihood measure compare before, removing has the decoded message or the additional candidate message of impossible information bit sequence.
23. wireless communication receiver as claimed in claim 17, wherein said one or more treatment circuit is configured to: by to the decoded messages recompile to obtain the bit sequence of recompile, and carry out relevant with the soft value sequence that is received the bit sequence of described recompile corresponding to decoded message, measure the correlation that uses with acquisition as described at least one likelihood, thereby determine described at least one likelihood tolerance at each decoded message.
24. wireless communication receiver as claimed in claim 23, wherein said one or more treatment circuit is configured to: by selecting to select optimal candidate corresponding to the message of best decoder metric from decoded messages, and wherein said one or more treatment circuit is configured to: by relatively at the correlation of optimal candidate and correlation at the message except that optimal candidate, come relatively to measure with corresponding likelihood, to determine whether described optimal candidate is effective message at the message except that optimal candidate at described at least one likelihood tolerance of optimal candidate.
25. wireless communication receiver as claimed in claim 17, wherein said one or more treatment circuit also is configured to: whether based on optimal candidate is that effective message is come optionally: (a) utilize the decoding parametric of determining from the optimal candidate traffic channel of decoding, perhaps (b) utilizes one or more predetermined decoding parameters that one or more traffic channel are carried out blind decoding.
CN2008800224522A 2007-06-28 2008-06-17 Method and device for detecting control channel information of high speed shared control channel Expired - Fee Related CN101720537B (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US94693707P 2007-06-28 2007-06-28
US60/946,937 2007-06-28
US11/944,773 US9209937B2 (en) 2007-06-28 2007-11-26 Reliable decoding of a high-speed shared control channel
US11/944,773 2007-11-26
PCT/EP2008/057585 WO2009000697A2 (en) 2007-06-28 2008-06-17 Reliable decoding of a high-speed shared control channel

Publications (2)

Publication Number Publication Date
CN101720537A true CN101720537A (en) 2010-06-02
CN101720537B CN101720537B (en) 2013-09-25

Family

ID=40160427

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008800224522A Expired - Fee Related CN101720537B (en) 2007-06-28 2008-06-17 Method and device for detecting control channel information of high speed shared control channel

Country Status (8)

Country Link
US (1) US9209937B2 (en)
EP (1) EP2171898B1 (en)
JP (1) JP5220851B2 (en)
KR (1) KR101504375B1 (en)
CN (1) CN101720537B (en)
AT (1) ATE535068T1 (en)
MY (1) MY147561A (en)
WO (1) WO2009000697A2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103297187A (en) * 2012-02-28 2013-09-11 马维尔国际有限公司 Mitigation of false pdcch detection
CN107852272A (en) * 2015-07-16 2018-03-27 英特尔Ip公司 Method and associated mobile device for quick blind decoding

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ITMI20062417A1 (en) * 2006-12-18 2008-06-19 Nautilus S R L METHOD AND SYSTEM TO DETECT VOCAL DATA FLOW IN A FLOW DATA PACKAGE
US9209937B2 (en) * 2007-06-28 2015-12-08 Telefonaktiebolaget L M Ericsson (Publ) Reliable decoding of a high-speed shared control channel
CN101431370B (en) * 2007-11-09 2012-08-08 华为技术有限公司 Method, apparatus and system for controlling operation mode of high speed downlink grouping access system
EP2269338B1 (en) 2008-03-31 2015-09-16 Marvell World Trade Ltd. Method and apparatus for selective combining and decoding of the multiple code blocks of a transport block
JP5121752B2 (en) * 2009-02-19 2013-01-16 日本電信電話株式会社 Spatial multiplexed multicarrier receiver and spatially multiplexed multicarrier receiving method
JP5121753B2 (en) * 2009-02-19 2013-01-16 日本電信電話株式会社 Spatial multiplex receiving apparatus and spatial multiplex receiving method
US8724571B2 (en) * 2009-04-20 2014-05-13 Lg Electronics Inc. Carrier construction for effective control channel decoding
US20110182385A1 (en) * 2009-07-30 2011-07-28 Qualcomm Incorporated Method and apparatus for reliability-aided pruning of blind decoding results
US9118442B2 (en) * 2009-08-18 2015-08-25 Broadcom Corporation Method and system for continuous packet connectivity
US8878913B2 (en) 2010-03-12 2014-11-04 Sony Corporation Extended command stream for closed caption disparity
CN102215183B (en) * 2010-04-01 2014-06-11 中兴通讯股份有限公司 Blind detection device and method
US8621321B2 (en) * 2010-07-01 2013-12-31 Densbits Technologies Ltd. System and method for multi-dimensional encoding and decoding
US8843792B2 (en) * 2012-02-03 2014-09-23 Blackberry Limited Method and apparatus for reducing false detection of control information
CN105452648B (en) 2013-08-02 2018-07-20 欧电风能源株式会社 With the wind power generation stepped of vertical axis lift-type wind turbine
KR101372248B1 (en) 2013-08-02 2014-03-10 (주)미가람 Wind power generation tower
WO2015026214A1 (en) 2013-08-23 2015-02-26 Samsung Electronics Co., Ltd. Interference signal control information acquisition method and apparatus for use in wireless communication system
FR3043807B1 (en) * 2015-11-18 2017-12-08 Bull Sas COMMUNICATION VALIDATION DEVICE

Family Cites Families (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4087787A (en) * 1977-04-19 1978-05-02 Bell Telephone Laboratories, Incorporated Decoder for implementing an approximation of the Viterbi algorithm using analog processing techniques
GB8327084D0 (en) * 1983-10-11 1983-11-09 Gordon J Error correction decoder apparatus
CA2012120C (en) * 1989-03-15 1994-10-18 Seiji Kondou Interference detection apparatus for use in digital mobile communications system
JPH10289539A (en) * 1997-04-11 1998-10-27 Sony Corp Information reproducing device and method therefor
US7031408B2 (en) * 1997-12-10 2006-04-18 Adtran Inc. Mechanism for reducing recovery time after path loss in coded data communication system having sequential decoder
US6526104B1 (en) * 1999-03-31 2003-02-25 International Business Machines Corporation Maximum likelihood detection with programmed coefficients
JP2001352254A (en) * 2000-06-08 2001-12-21 Sony Corp Decoder and decoding method
JP4115690B2 (en) * 2001-10-15 2008-07-09 富士通株式会社 Data recording device
US7162675B2 (en) 2002-04-05 2007-01-09 Lucent Technologies Inc. Error detection methods in wireless communication systems
US7508804B2 (en) * 2002-04-05 2009-03-24 Alcatel-Lucent Usa Inc. Shared signaling for multiple user equipment
GB0211005D0 (en) * 2002-05-15 2002-06-26 Ipwireless Inc System,transmitter,receiver and method for communication power control
US7680216B2 (en) * 2002-07-01 2010-03-16 Texas Instruments Incorporated Adaptive thresholds for high speed downlink shared control channel (HS-SCCH) (part I) detection schemes
US7609777B2 (en) * 2002-08-30 2009-10-27 Alcatel-Lucent Usa Inc. Maximum likelihood a posteriori probability detector
US7206363B2 (en) * 2003-06-24 2007-04-17 Intersymbol Communications, Inc. Method and apparatus for delayed recursion decoder
KR20050027679A (en) * 2003-09-16 2005-03-21 삼성전자주식회사 Apparatus and method for transceiving high speed packet data in a mobile communication system
JP4041445B2 (en) * 2003-09-19 2008-01-30 ソニー・エリクソン・モバイルコミュニケーションズ株式会社 Decoding device, communication device, and decoding method
DE10345638A1 (en) 2003-09-29 2005-06-02 Siemens Ag Method for data transmission
US7406070B2 (en) * 2003-10-09 2008-07-29 Telefonaktiebolaget L M Ericsson (Publ) Adaptive threshold for HS-SCCH part 1 decoding
US20050100038A1 (en) * 2003-11-12 2005-05-12 Interdigital Technology Corporation Wireless communication method and apparatus for efficiently providing channel quality information to a Node-B downlink scheduler
US20050169399A1 (en) * 2004-02-04 2005-08-04 Texas Instruments Incorporated Signal field scaler, method of scaling a signal field and communications system employing the same
US7054288B2 (en) * 2004-02-13 2006-05-30 Interdigital Technology Corporation Method and apparatus for providing fast detection of a high speed shared control channel
US7392459B2 (en) * 2004-04-14 2008-06-24 Lucent Technologies Inc. Method and apparatus for preventing a false pass of a cyclic redundancy check at a receiver during weak receiving conditions in a wireless communications system
JP4576868B2 (en) * 2004-04-14 2010-11-10 富士通株式会社 Wireless device, receiving method, mobile station
EP1605597A1 (en) * 2004-06-03 2005-12-14 STMicroelectronics N.V. Method and system for blindly detecting a shared channel out of a plurality of shared channels received in parallel
US7701844B2 (en) * 2005-02-09 2010-04-20 Interdigital Technology Corporation Method and apparatus for recognizing radio link failures associated with HSUPA and HSDPA channels
US8995547B2 (en) * 2005-03-11 2015-03-31 Qualcomm Incorporated Systems and methods for reducing uplink resources to provide channel performance feedback for adjustment of downlink MIMO channel data rates
JP4689316B2 (en) * 2005-03-28 2011-05-25 富士通株式会社 Error detection method of control information for transmitting downlink channel of radio communication and mobile terminal
TWI247488B (en) * 2005-04-07 2006-01-11 Sunext Technology Co Ltd Decoding system for eight to fourteen modulation or eight to sixteen modulation (FEM/ESM)
US7424071B2 (en) * 2005-06-27 2008-09-09 Icera Inc. Decoder and a method for determining a decoding reliability indicator
US7764741B2 (en) * 2005-07-28 2010-07-27 Broadcom Corporation Modulation-type discrimination in a wireless communication network
US8086257B2 (en) * 2005-08-11 2011-12-27 Alcatel Lucent Dedicated control channel detection for enhanced dedicated channel
WO2007118132A2 (en) * 2006-04-05 2007-10-18 Agere Systems Inc. Hsdpa co-processor for mobile terminals
GB0612405D0 (en) 2006-06-22 2006-08-02 Ttp Communications Ltd Signal evaluation
US7876861B2 (en) * 2007-04-04 2011-01-25 Lsi Corporation Methods, apparatus, and systems for determining 1T state metric differences in an nT implementation of a viterbi decoder
US9209937B2 (en) * 2007-06-28 2015-12-08 Telefonaktiebolaget L M Ericsson (Publ) Reliable decoding of a high-speed shared control channel

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103297187A (en) * 2012-02-28 2013-09-11 马维尔国际有限公司 Mitigation of false pdcch detection
CN103297187B (en) * 2012-02-28 2018-05-11 翱捷科技(上海)有限公司 The method and apparatus of the suppression of mistake PDCCH detections
CN107852272A (en) * 2015-07-16 2018-03-27 英特尔Ip公司 Method and associated mobile device for quick blind decoding
CN107852272B (en) * 2015-07-16 2020-11-13 苹果公司 Method for fast blind decoding and related mobile device

Also Published As

Publication number Publication date
EP2171898A2 (en) 2010-04-07
US20090003377A1 (en) 2009-01-01
CN101720537B (en) 2013-09-25
KR20100044796A (en) 2010-04-30
WO2009000697A2 (en) 2008-12-31
EP2171898B1 (en) 2011-11-23
US9209937B2 (en) 2015-12-08
KR101504375B1 (en) 2015-03-19
JP5220851B2 (en) 2013-06-26
ATE535068T1 (en) 2011-12-15
WO2009000697A3 (en) 2009-02-19
MY147561A (en) 2012-12-31
JP2010531594A (en) 2010-09-24

Similar Documents

Publication Publication Date Title
CN101720537B (en) Method and device for detecting control channel information of high speed shared control channel
CN107359967B (en) Blind detection method for reducing PDCCH blind detection times based on polarization code
US7688915B2 (en) Method and system for blindly detecting a discontinuously transmitted shared channel, in particular blind high speed shared control channels detection
CN101689967B (en) Hs-pdsch blind decoding method and receiver
CN107070594B (en) Multi-carrier acknowledgement signaling
CN101543110B (en) System, mobile communication unit and method for testing a receiver performance
US8248938B2 (en) Preamble miss detection in transmission of multi-slot packets
US20060203821A1 (en) Receive method and receiver
CN101895369A (en) The adaptive threshold that is used for HS-SCCH Part 1 decoding
EP3796580B1 (en) Wireless communication with repetition detection
EP1603265A2 (en) Apparatus and method for detecting a time division multiplexing frame in a mobile communication system
CN101116360A (en) Retransmitting method and system
JP4432645B2 (en) Communication device, wireless communication system
CN109889308A (en) The mixed automatic retransmission request method of joint polarization coding and decoding in Internet of Things
US11637652B2 (en) Methods and apparatus for encoding and decoding a downlink control channel transmission
JP2008533938A (en) Method for determining error rate and suitable test apparatus
KR101163619B1 (en) Systems and methods for sending an acknowledgement message in a wireless communication system
CN101997638B (en) Method and device for determining parameters used for detecting hybrid automatic repeat request-acknowledgement (HARQ-ACK) signals
CN102292926B (en) Decoding method and receiving device in the system using network coding for retransmission
KR101467761B1 (en) Methods of transmitting and receving data in communication system
CN1972170B (en) Wireless communication channel detection method
KR101048446B1 (en) Method and apparatus for transmitting / receiving feedback information in a communication system using a plurality of antennas

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
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130925