WO2004107599A1 - Positionnement d'une fenetre de recherche de trajets multiples - Google Patents

Positionnement d'une fenetre de recherche de trajets multiples Download PDF

Info

Publication number
WO2004107599A1
WO2004107599A1 PCT/EP2004/005345 EP2004005345W WO2004107599A1 WO 2004107599 A1 WO2004107599 A1 WO 2004107599A1 EP 2004005345 W EP2004005345 W EP 2004005345W WO 2004107599 A1 WO2004107599 A1 WO 2004107599A1
Authority
WO
WIPO (PCT)
Prior art keywords
search window
power
delay
previous
delay profile
Prior art date
Application number
PCT/EP2004/005345
Other languages
English (en)
Inventor
Andres Reial
Original Assignee
Telefonaktiebolaget L M Ericsson (Publ)
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
Priority claimed from EP03388038A external-priority patent/EP1482649B1/fr
Application filed by Telefonaktiebolaget L M Ericsson (Publ) filed Critical Telefonaktiebolaget L M Ericsson (Publ)
Priority to US10/558,613 priority Critical patent/US7826515B2/en
Publication of WO2004107599A1 publication Critical patent/WO2004107599A1/fr

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/711Interference-related aspects the interference being multi-path interference
    • H04B1/7113Determination of path profile

Definitions

  • the invention relates to a method of detecting multipath components in a time-varying fading radio channel in a digital wireless communications system in which individual multipath components of a signal transmitted through said channel are received with individual delays within a range of possible delay values, and wherein said individual delays are estimated and a delay profile calculated repetitively, the method comprising the steps of searching repetitively for new multipath components in a search window constituting a subset of said range of possible delays; and positioning said search window based on at least one previous delay profile.
  • the invention further relates to a receiver having means for detecting multipath components in a time-varying fading radio channel.
  • the physical channel between a transmitter and a receiver is typically formed by a radio link.
  • the transmitter could be a base station, and the receiver could be a mobile station, or vice versa.
  • the transmit antenna is not narrowly focused towards the receiver. This means that the transmitted signals may propagate over multiple paths.
  • many other propagation paths caused by reflec- tions from objects in the surroundings exist.
  • the receiver may receive multiple instances of the same signal at different times, i.e. with different delays, because different portions of the signal are reflected from various objects, such as buildings, moving vehicles or landscape details.
  • portions with similar propagation distances combine at the receiver and form a distinct multipath component.
  • the effect of the combining depends on the instantaneous relationship of the carrier wavelength and distance differences, and it may thus for a given multipath component be either enhancing or destructive.
  • the combining leads to significant decrease of the magnitude, or fad- ing, of the path gain for that path.
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • PN pseudo-random noise
  • chips The number of chips used to spread one data bit, i.e. chips/bit, may vary, and it depends, at least in part, on the data rate of the channel and the chip rate of the system.
  • the received signal In the receiver the received signal must be despread and demodulated with the same spreading code using the same chip rate to recover the transmitted data. Furthermore, the timing of the demodulation must be synchronized, i.e. the despreading code must be applied to the received signal at the correct instant in time, which can be difficult due to the multipath effects mentioned above.
  • the performance of a CDMA receiver is improved if the signal energy carried by many multipath components is utilized. This is achieved by using a RAKE receiver, where each multipath component is assigned a despreader whose reference copy of the spreading code is delayed equally to the path delay of the corresponding multipath component.
  • the outputs of the de- spreaders, i.e. the fingers of the RAKE receiver are then coherently combined to produce a symbol estimate.
  • the RAKE receiver requires knowledge of the multipath delays and the values of the channel impulse response for all paths.
  • SNR signal-to-noise ratio
  • the signal energy from as many physical paths as possible should be collected.
  • tracking as many different physical paths as possible significantly increases the robustness of reception, since this reduces the probability of a simultaneous deep fade of all paths, a phenomenon leading to serious and sometimes catastrophic degradation of the block error rate (BLER).
  • BLER block error rate
  • the structure of the propagation channel i.e. the absolute and relative delays of the individual multipath components, does not remain constant over time. Due to relative movement of the transmitter, the receiver and the objects in their vicinity, the delays of existing paths change, old paths disappear and new paths appear. In addition, the frequency offset between the transmitter and receiver circuits gives rise to a slow clock drift, which manifests itself as a gradual movement of the whole delay profile along the time axis. To ensure proper operation of the RAKE receiver, the changing delays of all known multipath components should be tracked, and new paths should be discovered quickly after they appear.
  • An approach to delay estimation in a RAKE receiver implementation could involve evaluating the impulse response of the channel over the whole range of possible delays of the channel.
  • the resulting delay profile which may be a complex delay profile (CDP) or a power delay profile (PDP) may then be subjected to peak detection, and the peak locations are reported to the RAKE receiver as the delay estimates.
  • CDP complex delay profile
  • PDP power delay profile
  • the processing and power con- sumption expenses of frequently executing this full path searching routine are usually prohibitive.
  • typical implementations may use path searchers with observation windows shorter than the full search area.
  • the path searcher resolution may be reduced and additional densely-sampled windows of de- spreaders may be used that produce higher-resolution estimates of certain areas of the delay profile.
  • the path searcher stage is used periodically to re-scan the delay range with the purpose of detecting new paths.
  • a current power delay profile may comprise a set of power values for a number of delay values. This set may represent the set of currently tracked paths, in which case the delay values will usually not be contiguous. It may also represent a contiguous region over which the path search is conducted. Other ways of representing the power delay profile are also possible.
  • the task is then to determine a suitable start position for the path searcher window.
  • a typically used method for determining a suitable path searcher window po- sition for the next path search activation is based on computing the center of gravity (COG), also known as the mean excess delay, of the presently known power delay profile estimate.
  • COG center of gravity
  • the path searcher window is placed so that most of the channel power would be covered by the window.
  • a typical shape of the power delay profile exhibits exponential decay, i.e. the energy is concentrated towards the beginning of the region of interest. For a reasonable coverage the window could thus be placed e.g. 1/3 ahead of and 2/3 behind the center of gravity value.
  • the center of gravity gives a consistent and reliable estimate of the true energy concentration in the channel.
  • the signal-to-noise ratio of the power delay profile is poor, and/or when the power delay profile used to compute the center of gravity is significantly time-varying due to fading, the center of gravity result tends to exhibit two types of problems.
  • the noise-induced component of the power delay profile values will cause a bias term which shifts the center of gravity result towards the aver- age (non-power weighted) delay of all the entries of the power delay profile.
  • the size of the bias term depends on how far from each other the true center of gravity and the "average delay" are separated, and on the signal-to-noise ratio. In many practical cases, the bias term may be large enough to shift the path searcher window away from significant portions of the true power delay profile.
  • the power delay profile values may be thresholded, which will remove a certain fraction of the noise-only samples and reduce the bias.
  • efficient noise removal assumes the use of a rather high threshold, which in turn may remove the channel components from the power delay profile as well, and thus distort the power delay profile.
  • the noise effect may also be reduced by noise subtraction, where the average noise power in the power delay profile is estimated, and instead of the original power delay profile values, values reduced by the average noise power are used in the center of gravity computation. In this way the bias is reduced, but since the noise floor cannot be estimated exactly, it cannot be removed completely, and a residual bias effect remains.
  • the window must be positioned precisely in order to include all clusters of energy in the power delay profile. Any temporary fluctuation in the power delay profile seen by the cen- ter of gravity algorithm, e.g. due to fading, may offset the computed center of gravity value, and the window will be placed so that some of the true paths will be located outside the window. In subsequent center of gravity computations only the remaining paths are used, and the window shifts away from the lost (but physically still present) paths. This leads to increased interference levels, reduced signal-to-interference ratio and reduced diversity, and in some cases it can cause loss of synchronization with the transmitter side.
  • the object is achieved in that the method comprises the steps of determining for each of a number of different search window positions a sum of power for those multipath components of at least one previous delay profile that are located in the search window with that position; and selecting the position of the search window, in which the search for new multipath components is performed, based on the determined sums of power.
  • the method allows maintaining proper path searcher window positioning also when the available power delay profile is an instantaneous version of the fading channel response.
  • This criterion for path searcher window placement directly takes into account the quantity of interest, i.e. the amount of signal power due to known paths captured by the window. No heuristically determined offset for the window start position is necessary, making the method suitable for arbitrary channel models. Further, pathological situations are avoided where the center of gravity method could place the window so that one or more path clusters are excluded, simply due to the loss of information in the computation process.
  • the search window position having the highest sum of power is selected as the search window in which the search for new multipath compo- nents is performed, it is ensured that the search window position is not affected by a high noise level.
  • the step of determining a sum of power for each of said search window positions is performed by first determining the sum of power for a search window starting with the lowest delay value in said range of possible delays, and then repeatedly performing the step of determining the sum of power for a search window of unchanged size, the position of which is decided by moving the previous search window to a position including the delay value incrementally higher than the delay values of the previous search window, until the highest delay value in said range of possible delays has been included. In this way, it is ensured that the power sum is determined for all possible windows in a natural order.
  • each new power sum is obtained from the previous sum by performing only a few additions, i.e. one addition and only a few, if any, subtractions, to be more precise. In this way the computational complexity is not significantly larger than that associated with the center of gravity computation.
  • the possible delay values constitute a contiguous sequence of equally spaced samples.
  • the captured power is computed by effectively shifting the window, requiring two additions to obtain the power for the next position, given the power at the previous position.
  • the method further comprises the step of calculating a modified delay profile by combining the power of a number of neighbouring delay values
  • the number of window positions to be evaluated may be reduced.
  • the use of this coarse version of the original power delay profile further reduces the computational complexity of the method.
  • the possible delay values consist of a limited number of sparse samples. These samples could typically be the currently tracked or detected paths. Due to the limited number of samples there will be fewer possible window positions, and thus the number of computations will also be reduced.
  • the method further comprises the step of calculating the at least one previous delay profile as an averaged delay profile generated from a number of repetitively calculated instantaneous delay profiles, a more robust algorithm is achieved.
  • the method may further comprise the step of thresholding said at least one previous delay profile before said sums of power are determined.
  • the method further comprises the step of searching occasionally for new multipath components outside said search window, paths that have ap- peared far from the presently tracked paths can also be detected.
  • the method further comprises the step of including an artificial multi- path component in said at least one previous delay profile at a delay value on which a multipath component from an earlier delay profile is significantly de- creased in the at least one previous delay profile, further protection against erratic window placement decisions is provided, which could otherwise result in window shifts and potential loss of paths.
  • This artificial multipath component will guide the window placement even when the particular channel realization is strongly faded. Thus it is possible to maintain the window position even when some paths have faded.
  • the invention further relates to a receiver having means for detecting multipath components in a time-varying fading radio channel in a digital wireless communications system in which individual multipath components of a signal transmitted through said channel are received with individ- ual delays within a range of possible delay values, the receiver comprising means for estimating said individual delays and calculating a delay profile repetitively; and means for searching repetitively for new multipath components; said searching means being adapted to perform each search for new multipath components in a search window constituting a subset of said range of possible delays; and position said search window based on at least one previous delay profile.
  • a receiver is provided in which the detection of multipath components is less influenced by the average noise floor of the delay profile, and which is also effective for channels having a wide delay spread and/or channels with significantly time-varying delay profiles.
  • the receiver is adapted to select the window position having the highest sum of power as the search window in which the search for new multipath components is performed, it is ensured that the search window position is not affected by a high noise level.
  • the receiver is further adapted to determine the sum of power for each of said search window positions by first determining the sum of power for a search window starting with the lowest delay value in said range of possible delays, and then repeatedly performing the step of determining the sum of power for a search window of unchanged size, the position of which is decided by moving the previous search window to a position in- eluding the delay value incrementally higher than the delay values of the previous search window, until the highest delay value in said range of possible delays has been included. In this way, it is ensured that the power sum can be determined for all possible windows in a natural order.
  • each new power sum can be obtained from the previous sum by performing only a few additions, i.e. one addition and only a few, if any, subtractions, to be more precise. In this way the computational complexity is not significantly larger than that associated with the center of gravity computation.
  • the possible delay values constitute a contiguous sequence of equally spaced samples.
  • the captured power can be computed by effectively shifting the window, requiring two additions to obtain the power for the next position, given the power at the previous position.
  • the receiver When the receiver is further adapted to calculate a modified delay profile by combining the power of a number of neighbouring delay values, the number of window positions to be evaluated may be reduced.
  • the use of this coarse version of the original power delay profile further reduces the computational complexity of the method.
  • the possible delay values consist of a limited number of sparse samples. These samples could typically be the currently tracked or detected paths. Due to the limited number of samples there will be fewer possible window positions, and thus the number of computations will also be reduced.
  • the receiver is further adapted to calculate the at least one previous delay profile as an averaged delay profile generated from a number of repetitively calculated instantaneous delay profiles, a more robust algorithm is achieved.
  • the receiver is further adapted to threshold said at least one previous delay profile before said sums of power are determined.
  • the receiver When the receiver is further adapted to search occasionally for new multipath components outside said search window, paths that have appeared far from the presently tracked paths can also be detected.
  • the receiver is further adapted to include an artificial multipath compo- nent in said at least one previous delay profile at a delay value on which a multipath component from an earlier delay profile is significantly decreased in the at least one previous delay profile, further protection against erratic window placement decisions is provided, which could otherwise result in window shifts and potential loss of paths.
  • This artificial multipath component will guide the window placement even when the particular channel realization is strongly faded. Thus it is possible to maintain the window position even when some paths have faded.
  • the receiver may expediently be adapted for use in a Wideband Code Division Multiple Access system.
  • figure 1 shows an example of multiple paths between a base station and a mobile station
  • figure 2 shows a power delay profile for the paths illustrated in figure 1 ,
  • figure 3 illustrates the use of a path searcher in combination with a RAKE receiver
  • figure 4 shows a sampled power delay profile corresponding to the profile shown in figure 2
  • figure 5 shows a flow chart illustrating the steps of a method according to the invention
  • figure 6 shows a more detailed flow chart for the situation where the power delay profile constitutes a contiguous sequence of equally spaced samples
  • figure 7 shows how the windows are positioned according to the flow chart in figure 6,
  • figure 8 shows an example of a power delay profile that is recomputed by combining neighbouring delay values
  • figure 9 shows a more detailed flow chart for the situation where the power delay profile consists of a limited number of sparse samples
  • figure 10 shows how the windows are positioned according to the flow chart in figure 9,
  • figure 11 shows a power delay profile having three strong paths
  • figure 12 shows the power delay profile of figure 11 wherein one of the strong paths has faded and has been replaced by a "pilot path".
  • Figure 1 shows a situation in which a base station 1 and a mobile station 2 of a wireless communications system communicate with each other.
  • a signal transmitted from the base station 1 is received by the mobile station 2.
  • the transmitted signal travels along multiple paths from the base station to the mobile station.
  • there is a direct and unobstructed propagation path 3 but in addition to this direct path, reflections from objects in the surroundings cause a number of indirect paths to exist. Two such paths are shown in the figure.
  • One indirect path 4 is reflected from a house 5, while another path 6 is caused by reflection from another building 7.
  • the power P re- ceived at the mobile station 2 as a function of the time t may look as illustrated in figure 2, which shows an example of a power delay profile.
  • the power delay profile shows all signals received at the mobile station, including noise and interference signals.
  • only the peaks in the power delay profile correspond to the multipath components of the transmitted signal.
  • these peaks form the impulse response of the channel.
  • the peak P 3 received at the time t 3 corresponds to the direct path 3 in figure 1
  • the peaks P and P 6 received at the times t 4 and t ⁇ , respectively correspond to the indirect paths 4 and 6 in figure 1.
  • the delay of the path 6 (corresponding to the peak P ⁇ ) is larger than the delay of the path 3 (corresponding to the peak P 3 ).
  • the mobile station 2 and the base station 1 may be adapted for use in e.g. a Code Division Multiple Access (CDMA) system or a Wideband Code Division Multiple Access (WCDMA) system, and in that case the mobile station 2 may use a RAKE receiver, which is capable of identifying and tracking the various multipath signals for a given channel. In this way the energy or power of several multipath components can be utilized in the receiver. As mentioned above, this may be achieved by using a RAKE receiver, where each multi- path component is assigned a despreader whose reference copy of the spreading code is delayed equally to the path delay of the corresponding multipath component. The outputs of the despreaders, i.e. the fingers of the RAKE receiver, are then coherently combined to produce a symbol estimate.
  • the RAKE receiver requires knowledge of the multipath delays and the values of the channel impulse response for all paths. The signal energy from as many physical paths as possible should be collected.
  • the impulse response of the channel could be evaluated over the whole range of possible delays in the channel, and the resulting delay profile could then be subjected to peak detection and the peak locations reported to the RAKE receiver as the delay estimates.
  • the processing and power consumption of executing such a full path searching routine frequently is usually so high that it cannot be realized in a practical system. Therefore, infrequently activated limited-range path searchers are typically used for detecting new paths and, in some implementations, for re-detecting temporarily faded existing paths. This is illustrated in figure 3, in wh ich a path searcher 11 is used in combination with a RAKE receiver 13.
  • the path searcher 11 is a device that periodically computes instantaneous impulse response estimates (complex or power) over a range of delays that only constitutes a fraction of the maximum delay spread allowed by the system. This reduced range of delays is also called a path search window.
  • the complex or power values for a given delay value may be estimated e.g. by correlating the received data for pilot symbols with an appropriately delayed copy of the spreading sequence. Since the path searcher 11 is mainly used only to detect the existence of paths, its output resolution may be lower than that required by the RAKE receiver 13.
  • the RAKE receiver 13 itself uses a general delay estimation algorithm 12, which is able to extract the path positions and find their delays with sufficient accuracy, once they are discovered by the path searcher 11.
  • an important task in the path searcher is to position the path searcher window so that new paths can be expected to be included in the window.
  • new paths will with high probability appear in the vicinity of the currently known paths, and thus the path search window for a new search is normally placed so that it covers the currently known paths.
  • This can be done in different ways.
  • One method is the center of gravity method, but as mentioned this method suffers from a number of problems.
  • the path search window is positioned so that maximal possible amount of presently known path power is included within the window range.
  • the power capture is computed by summing the power of all the known power delay profile elements that would be covered by the window at a particular position, and the window position with the largest sum of powers will be chosen.
  • the algorithm for placing a path searcher window of length N may be expressed as a series of operations in which the captured power P k is computed for each of the windows having start positions £ ⁇ [l, -N+l]:
  • step 102 this value is temporarily chosen as the highest power sum P max .
  • the computation of the sum of power covered by each possible position of the search window can be performed in different ways.
  • One efficient implementation of the algorithm slides the window sequentially across the possible positions, and the captured power for each new position is computed by taking the sum of powers in the previous position, adding the ele- ments of the power delay profile that are included in the present position but were not included in the previous position, and subtracting the elements of the power delay profile that were included in the previous position but are no longer included in the present position. In this way the computational complexity is not significantly larger than that associated with the center of gravity computation.
  • step 201 the sum of power covered by the first window position (i.e. k-l) is calculated in the first step, which is here step 201 , as
  • the steps of this loop are executed for all start positionsA: e [2,. " -N+l] as illustrated with the series of window positions shown in figure 7, which corresponds to figure 4 with the exception that the series of windows is shown. Since the window is moved only one position (i.e. ⁇ ) between each calculation of the power sum, the next power sum can easily be calculated by adding only one power value to the p revious sum and subtracting another one.
  • step 204 the next element (gfa+N-x)) is added to the previous sum, and in step 205 the element (g( ⁇ k . ⁇ )) that should no longer be included is sub- tracted.
  • each power sum P k is calculated as
  • the original power delay profile gfc) (which is often given at chip- or sub-chip-resolution), e.g. corresponding to figure 4, may be re-computed to a coarser scale by summing L neighbouring bins
  • the available estimate of the power delay profile may instead consist of only a limited number of samples over the possible delay range.
  • this limited number of samples could be the currently tracked or detected paths, or it could be all sample values above a certain threshold.
  • the power capture may efficiently be computed as described below and illustrated in the flow chart 300 in figure 9. An example of such a delay profile is shown in figure 10.
  • step 304 the power of the next delay element is added to the previ- ous power sum.
  • step 305 the new left edge of the window is determined as described above, and in step 306 the power of the elements, if any, that should no longer be included is subtracted. The result is that the new power sum is
  • the window could also be moved so that one delay value at the left edge is subtracted each time, and those new delay values, if any, located within the new right edge are included. Further marginal computational savings may be realized by skipping the computation of P k when one more path to the right of the window position may be added to the window without excluding any presently included paths.
  • the window start position is selected as:
  • the window placement may be based on either averaged or instantaneous path powers gfc).
  • the power delay profile may be averaged over a number of cycles to ensure that temporarily faded paths are still taken into consideration in the calculation of the next position of the path searcher window. Using path powers averaged across fading provides the highest robustness. However, when the power delay profile gfc) is not averaged over several fading cycles, the instantaneous power delay profile may differ significantly from one evaluation to the next.
  • the power delay profile may be averaged over a number of cycles to ensure that temporarily faded paths are still taken into consideration in the calculation of the next position of the path searcher window.
  • a complex delay profile may be used instead of a power delay profile, in which case the power of each delay profile element is found by multiplying the complex coefficient by its complex conjugate.
  • the path searcher window placement algorithm may be completed by conducting occasional searches outside the positions returned by the method described above in order to detect paths that have appeared far from the presently tracked paths.
  • the power delay profile may be thresholded before the power cap- ture computations.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé consistant à recevoir les composantes multitrajet d'un signal transmis par une voie de radiocommunication numérique à variation temporelle, avec des retards individuels (t) compris dans un intervalle de valeurs de retard possibles (t1...tM), à estimer les valeurs des retards individuels, et à calculer de manière répétée un profil de retard (g(ti)). Le procédé décrit consiste à rechercher de manière répétée de nouvelles composants multitrajet dans une fenêtre de recherche constituant un sous-groupe des retards possibles, et à positionner cette fenêtre de recherche en fonction d'un profil de retard antérieur (g(ti)). Pour chacune d'un nombre donné de positions (k) de la fenêtre de recherche, une somme de puissance est déterminée pour les composantes multitrajet placées dans la fenêtre à cette position particulière, et la position de la fenêtre de recherche est sélectionnée en fonction de la somme de puissance ainsi déterminée. Ce procédé permet de réduire l'influence du bruit de fond sur la détection multitrajet, et il est également efficace pour les voies présentant un large éventail de retards et/ou des profils de retard présentant une variation importante dans le temps.
PCT/EP2004/005345 2003-05-27 2004-05-14 Positionnement d'une fenetre de recherche de trajets multiples WO2004107599A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/558,613 US7826515B2 (en) 2003-05-27 2004-05-14 Positioning a multipath search window

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
EP03388038A EP1482649B1 (fr) 2003-05-27 2003-05-27 Positionnement d'une fenêtre de recherche pour des trajets multiples
EP03388038.6 2003-05-27
US47632703P 2003-06-06 2003-06-06
US60/476,327 2003-06-06

Publications (1)

Publication Number Publication Date
WO2004107599A1 true WO2004107599A1 (fr) 2004-12-09

Family

ID=33492163

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2004/005345 WO2004107599A1 (fr) 2003-05-27 2004-05-14 Positionnement d'une fenetre de recherche de trajets multiples

Country Status (1)

Country Link
WO (1) WO2004107599A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100373795C (zh) * 2005-05-26 2008-03-05 北京北方烽火科技有限公司 一种用于wcdma上行专用链路的多径跟踪方法
CN100420329C (zh) * 2006-08-09 2008-09-17 华为技术有限公司 一种上行专用物理信道搜索方法及装置
CN1822527B (zh) * 2006-03-17 2011-04-20 上海宣普实业有限公司 估计窗的有效性的检测方法

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5644591A (en) * 1994-07-29 1997-07-01 Qualcomm Incorporated Method and apparatus for performing search acquisition in a CDMA communications system
US5805648A (en) * 1995-07-31 1998-09-08 Qualcomm Incorporated Method and apparatus for performing search acquisition in a CDMA communication system
EP0951148A2 (fr) * 1998-04-14 1999-10-20 Matsushita Electric Industrial Co., Ltd. Appareil et procédé de synchronisation pour communicaition à spectre étalé par séquence directe
WO1999057819A1 (fr) * 1998-05-01 1999-11-11 Telefonaktiebolaget Lm Ericsson (Publ) Surveillance du retard d'une fenetre de recherche dans des systemes de communication a acces multiple par code de repartition
WO2001076087A1 (fr) * 2000-03-31 2001-10-11 Qualcomm Incorporated Acquisition rapide d'un signal pilote dans un dispositif de communication sans fil
EP1225707A1 (fr) * 1999-10-06 2002-07-24 NEC Corporation Recepteur amcr et methode afferente

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5644591A (en) * 1994-07-29 1997-07-01 Qualcomm Incorporated Method and apparatus for performing search acquisition in a CDMA communications system
US5805648A (en) * 1995-07-31 1998-09-08 Qualcomm Incorporated Method and apparatus for performing search acquisition in a CDMA communication system
EP0951148A2 (fr) * 1998-04-14 1999-10-20 Matsushita Electric Industrial Co., Ltd. Appareil et procédé de synchronisation pour communicaition à spectre étalé par séquence directe
WO1999057819A1 (fr) * 1998-05-01 1999-11-11 Telefonaktiebolaget Lm Ericsson (Publ) Surveillance du retard d'une fenetre de recherche dans des systemes de communication a acces multiple par code de repartition
EP1225707A1 (fr) * 1999-10-06 2002-07-24 NEC Corporation Recepteur amcr et methode afferente
WO2001076087A1 (fr) * 2000-03-31 2001-10-11 Qualcomm Incorporated Acquisition rapide d'un signal pilote dans un dispositif de communication sans fil

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100373795C (zh) * 2005-05-26 2008-03-05 北京北方烽火科技有限公司 一种用于wcdma上行专用链路的多径跟踪方法
CN1822527B (zh) * 2006-03-17 2011-04-20 上海宣普实业有限公司 估计窗的有效性的检测方法
CN100420329C (zh) * 2006-08-09 2008-09-17 华为技术有限公司 一种上行专用物理信道搜索方法及装置

Similar Documents

Publication Publication Date Title
US7715464B2 (en) Positioning of a path searcher window in a CDMA receiver
EP1048127B1 (fr) Procede et appareil pour l'estimation du temps de propagation par trajets multiples dans des systemes de communication a spectre disperse avec sequences continues
US8503509B2 (en) Method and system for managing, controlling, and combining signals in a frequency selective multipath fading channel
EP1482649B1 (fr) Positionnement d'une fenêtre de recherche pour des trajets multiples
US20080144702A1 (en) Method of and apparatus for computation of unbiased power delay profile
US7822104B2 (en) Averaging a delay profile in a limited delay range
EP1704652B1 (fr) Procede et appareil de calcul de profil d'un retard de puissance non polarisee
WO2004107599A1 (fr) Positionnement d'une fenetre de recherche de trajets multiples
US7903723B2 (en) Selecting delay values for a rake receiver
EP1487127B1 (fr) Méthode et système pour le placement d'une fenêtre de recherche multitrajet
JP4838262B2 (ja) 最小限のフィンガ割り当てで遅延を推定する方法及びシステム
WO2004112269A1 (fr) Positionnement d'une fenetre de recherche de trajets multiples
WO2004107597A1 (fr) Calcul du profil de retard moyen dans une plage de retard limitee
US6917904B1 (en) Method of and apparatus for path-searcher window positioning
EP1715594B1 (fr) Sélection de valeurs de retard pour un récepteur rake
EP1482652A1 (fr) Déclenchement d'un rechercheur de voies
WO2004107598A1 (fr) Lancement d'un moyen de recherche de parcours
WO2006066765A1 (fr) Selection de valeurs de retard de cretes pour un recepteur en rateau

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase
WWE Wipo information: entry into national phase

Ref document number: 2007041431

Country of ref document: US

Ref document number: 10558613

Country of ref document: US

WWP Wipo information: published in national office

Ref document number: 10558613

Country of ref document: US