Title of Invention

METHOD OF AND SYSTEM FOR DELAY ESTIMATION WITH MINIMIZED FINGER ALLOCATION

Abstract A signal-path delay-estimation method (200) includes correlating (210) a computed coarse delay profile of at least one detected signal path cluster with a waveform to yield a strongest correlated peak for each of the at least one detected signal path cluster. The method also includes, for each of the at least one detected signal path cluster, using(212) the strongest correlated peak to determine an adjusted delay-profile phase, re-sampling (214) the computed coarse delay profile in accordance with the adjusted delay-profile phase, and detecting (216) signal-path-cluster edges using the re-sampled (214) computed coarse delay profile. This Abstract is provided to comply with rules requiring an Abstract that allows a searcher or other reader to quickly ascertain subject matter of the technical disclosure. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
Full Text BACKGROUND OF THE INVENTION
TECHNICAL FIELD
The present invention relates generally to digital wireless communications systems
in which delays of multi-path components of a time-varying fading channel are to be
estimated, such as, for example, systems using RAKE receivers in Code Division Multiple
Access (CDMA) systems. The invention is particularly suitable for, but is not limited to,
receivers that operate in fading environments and have limited processing resources, such as
those in Wideband CDMA (WCDMA) terminals.
HISTORY OF RELATED ART
In wireless communications, a physical channel between a transmitter and a receiver
is formed by a radio link. In most cases, a transmit antenna is not narrowly focused towards
the receiver and, in addition to a possible direct path, many other propagation paths exist
between the transmitter and the receiver. The propagation paths are often caused by
reflections from surrounding objects. Rays with similar propagation distances combine at
the receiver depending on an instantaneous phase relationship and form a distinct multi-path
component. The effect of the combining depends on an instantaneous relationship of a
carrier wavelength and distance differences and, in the case of destructive interference, the
combining leads to a significant reduction in path-gain magnitude (i.e., fading).
Performance of a CDMA receiver is oftentimes improved if signal energy carried by
many multi-path components is utilized via a RAKE receiver. In the RAKE receiver, a
number of multi-path components are each assigned a despreader having a reference copy
of a spreading code that is delayed equally to a path delay of a corresponding muiti-path
signal component. Outputs of the despreaders (i.e., RAKE fingers) are coherently
combined to produce a symbol estimate.
The RAKE receiver requires knowledge of the multi-path delays and channel-
impulse-response values for as many signal paths as possible. To achieve an optimal signal-
to-noise ratio (SNR) at an output of a RAKE combiner, signal energy from as many
physical paths as possible should be collected. In addition, tracking of as many different


physical paths as possible (i.e., higher utilized diversity) tends to significantly increase
reception robustness by reducing the probability of a simultaneous deep fade of all tracked
signal paths. Simultaneous deep fading of all tracked signal paths is a phenomenon that
leads to undesirable block error rate (BLER) degradation.
A propagation channel structure (i.e., absolute and relative delays of individual
multi-path components) does not remain constant over time. Due to relative movement of
the transmitter, the receiver, and nearby objects, existing path delays change, old paths
disappear, and new paths appear. In addition, a frequency offset between the transmitter
and receiver often gives rise to a slow clock drift, which may manifest itself as a gradual
delay-profile time-axis movement In order to ensure proper operation of the RAKE
receiver, varying delays of all known multi-path components should be tracked, and new
paths should be discovered quickly after they appear.
FIGURE 1 is a block diagram of a typical RAKE receiver. A RAKE receiver 100
includes a delay estimator block 102, a channel estimator block 104, and a RAKE
despreader/combiner block 106. Received data are fed to the delay estimator block 102.
The delay estimator block 102 evaluates an impulse response of a channel over a range of
possible delays of the channel. A resulting delay profile, which may be a complex delay
profile or a power delay profile, may then be subjected to peak detection and detected peak
locations reported to the RAKE despreader/combiner block 106 as delay estimates for the
multi-path components. The delay estimates are also used by the channel estimator block
104 to estimate corresponding complex channel coefficients by despreading a pilot
sequence and possibly filtering results over time to reduce the effects of noise and
interference. Channel parameters are estimated in collaboration between the delay
estimator block 102, which determines temporal alignment of a despreader portion of the
RAKE despreader/combiner block 106, and the channel estimator block 104, which
estimates the complex coefficients to be used by a combiner portion of the RAKE
despreader/combiner block 106.
European Patent Application EP-A-1 480 369, published on 24 November 2004,
appears to disclose a method and device that compensate sampling instant errors in digital
receivers wherein a received signal is downconverted and sampled, yielding a digital
baseband signal. The digital baseband signal is men, directly or after an oversampling, fed
to a path delay estimator, which provides information about the power delay profile (PDP).


The optimal sampling instant is computed by placing finger at delays corresponding to
the peaks of the PDP and sampling instants are adjusted. The disclosed process does not
compute a delay profile of the detected signal path clusters using a fixed grid. In addition,
the disclosed process does not determine an adjusted delay profile based on phase.
In "Rake receiver finger placement for realistic channels" by C.Cozzo et al., two different
finger placement approaches appear to be disclosed for Rake receivers using a path
searcher, which estimates the power/delay profile (PDP) of the received signal to
determine where signal energy is present. The first finger placement approach places
fingers at delays corresponding to the peaks of the PDP, with a restriction that fingers can
be no closer than some minimum spacing. The second finger placement approach places
fingers on an equally-spaced grid of delays. The grid approach is determined to be
promising and warrant further studies. See Wireless Communications and Networking
Conference (WCNC) 2004, IEEE, Atlanta, GA, USA, 21-25 March 2004, Piscataway,
NJ, USA, IEEE, vol.1, 21 March 2004 (2004-03-21), pages 316-321, XP010708544
ISBN : 0-7803-8344-3. The disclosed process does not combine these approaches or
compute a delay profile of each detected signal path. In addition, the disclosed process
does not determine an adjusted delay profile based on phase.
STATEMENT OF THE INVENTION
According to one aspect of the present invention there is provided a signal-path delay-
estimation method that determines a coarse delay profile of at least one detected signal
path cluster using a fixed grid approach by means of a processor and the said method
characterized by correlating the determined coarse delay profile of at least one detected
signal path cluster with a waveform to yield a strongest correlated peak for each of the at
least one detected signal path cluster, using the strongest correlated peak to determine an
adjusted delay-profile phase; re-sampling the computed coarse delay profile in
accordance with the adjusted delay-profile phase; and detecting signal-pathcluster edges
using the re-sampled computed coarse delay profile.


An article of manufacture for signal-path delay estimation includes at least one computer
readable medium and processor instructions contained on the at least one computer
readable medium. The processor instructions are configured to be readable from the at
least one computer readable medium by at least one processor and thereby cause the at
least one processor to operate as to correlate a computed coarse delay profile of at least
one detected signal path cluster with a waveform to yield a strongest correlated peak for
each of the at least one detected signal path cluster and, for each of the at least one
detected signal path cluster, use the strongest correlated peak to determine an adjusted
delay-profile phase, re-sample the computed coarse delay profile in accordance with the
adjusted delay-profile phase, and detect signal-path-cluster edges using the re-sampled
computed coarse delay profile.
A signal-path delay-estimation system includes a delay estimator for correlating a
computed delay profile of at least one detected signal path cluster with a waveform to
yield a strongest correlated peak for each of the at least one detected signal path cluster.
The delay estimator is also for each of the at least one detected signal path cluster, using
the strongest correlated peak to determine an adjusted delay-profile phase, re-sampling
the computed delay profile in accordance with the adjusted delay-profile phase, and
detecting signal-path-cluster edges using the re-sampled computed delay profile. The
system also includes a channel estimator inter-operably connected to an output of the
delay estimator and a despreader/combiner inter-operably connected to an output of the
channel estimator and the output of the delay estimator.
BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS
A more complete understanding of the present invention may be obtained by reference to
the following Detailed Description of Exemplary Embodiments of the Invention, when
taken in conjunction with the accompanying Drawings, wherein :
FIGURE 1, previously described, is a block diagram of a typical RAKE receiver, and
FIGURE 2, is a flow chart that illustrates a delay-estimation process


DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS OF THE
INVENTION
Embodiment(s) of the invention will now be described more fully with reference to
the accompanying Drawings. The invention may, however, be embodied in many different
forms and should not be construed as limited to the embodimen(s) set forth herein. The
invention should only be considered limited by the claims as they now exist and the
equivalents thereof.
Two approaches to delay estimation (DE) are as follows: 1) peak-detection-oriented
DE; and 2) fixed-grid DE. In peak-detection-oriented DE, a precise position (i.e., a delay)
of a particular multi-path component is estimated in order to tune a respective despreader
precisely to the estimated delay. In principle, peak-detection-oriented DE involves
evaluating a channel impulse response over an entire range of possible delays (i.e., delay
spread) of the channel in question. A resulting complex delay profile (CDP) or power delay
profile (PDP) may then be subjected to peak detection. The peak locations (di) are reported
to the RAKE receiver as delay estimates.
Processing and power-consumption expenses of frequently executing a full path-
searching routine in accordance with peak-detection-oriented DE are usually prohibitive.
Therefore, typical implementations may use path searchers (PS) with observation windows
shorter than a full search area (i.e., maximal assumed delay spread) and reduced PS
resolution (e.g., 1 chip). Additional densely-sampled windows of despreaders may be used
that produce higher-resolution (e.g., 1/4 chip) estimates of certain areas of the PDP for
precise reporting of delays.
Fixed-grid DE is based on the principle that, in order to capture all available signal
energy, it is not necessary to place RAKE fingers exactly on path positions. It is instead
sufficient to lay a grid of fingers with a certain minimal spacing, equal to the Nyquist
sampling rate of the received signal, over a delay-domain area where a dominant portion of
the signal energy lies.
In fixed-grid DE, the grid is fixed in the sense that the only delay values allowed are
kT, where T is the grid spacing (e.g., T = 3/4Tc, where Tc is the chip period) and k is an
integer value. Thus, in fixed-grid DE, it is necessary only to determine the edges of a PDP
active region and turn on the grid positions . In
6

fixed-grid DE, no attempt is made to isolate the precise location of individual paths. In
some cases, if the active PDP includes several clusters, the grid is placed in several
positions. So-called empty regions of the PDP are not covered.
While fixed-grid DE does not attempt to estimate the precise delays of the individual
components, the delay list at its output provides similar information to that provided by
peak-detection-oriented DE. The delay list provided by either fixed-grid DE or peak-
detection-oriented DE is used identically by subsequent RAKE-receiver blocks.
Peak-detection-oriented DE provides an economical despreading arrangement if, for
example, the channel consists of a single well-defined path. A location of the single path
may then be detected relatively easily and precisely and a single RAKE finger may extract
all available energy. In similar fashion, if the channel consists of several separated well-
defined paths and the peak detection may be applied to each of them, peak-detection-
oriented DE is quite economical.
On the other hand, if the channel consists of a closely-spaced cluster of paths, it may
be difficult to identify individual path positions, since signal energy from the different paths
typically overlaps due to side lobes of transmit/receive ("tx/rx") filters. Furthermore, while
the physical-path delays may remain constant, multi-path fading and a constantly-changing
complex combining pattern of neighboring paths often causes a constant fluctuation of the
observed PDP; therefore, tracking of the apparently-changing, but actually physically-fixed,
delay positions can be quite challenging. Resulting difficulties for a DE process oftentimes
create a need for heuristic mechanisms to avoid various pathological behaviors. However,
the heuristic mechanisms can serve to tune the DE process to special cases and reduce the
general applicability of the process. If an attempt is made to catch a path with a single
finger, and the finger is misplaced even by 1/4 chip or 1/2 chip, a significant portion of the
path energy is lost, and the interference is increased.
Fixed-grid DE, in contrast, provides a much more robust way to capture the signal
energy, since no assumptions are made about the precise path locations of the paths, inter-
path distances, or fading behavior. As long as the true delay di satisfies Ï„left detected signal energy is optimally utilized. However, since it is not certain that di = kT for
some k, but rather kT capture full path energy from a single path.


As a general principle, in fixed-grid DE, to capture energy from a cluster of width
mT (or from m Nyquist-spaced neighboring paths), m + 1 fingers are needed. The number
of necessary m + 1 fingers is always greater than for peak-detection-oriented DE, and may
be as much as twice the number of fingers used in peak-detection-oriented DE if the delay
profile contains only stand-alone paths. For an extended path cluster, the extra expenditure
of fingers is negligible.
In various embodiments of the invention, a DE approach is used that allows non-
peak-specific finger positions for multi-peak clusters, while avoiding mis-sampling and
wasted fingers under single-path circumstances. A DE process applies fixed-grid finger
placement to each PDP path cluster, while a grid offset is adjusted individually for each
cluster, thereby allowing sampling-phase optimization for single-peak objects in the PDP,
avoiding placement of unnecessary fingers, and maintaining robust coverage of extended
clusters. A mechanism detects the proper sampling phase for a given cluster by correlating
the PDP of the cluster with a single-path PDP or other waveform at various sampling
offsets; if a peak is found in the filtering result, the fixed grid phase for the given cluster is
adjusted without affecting the phase of the other clusters. Various embodiments of the
invention allow handling of smgle-path-dominated clusters efficiently as single paths
without requiring a heuristic decision operation on each signal cluster.
FIGURE 2 is a flow chart that illustrates a delay-estimation process 200. In
connection with the process 200, an input data sampling period is denoted Ts (e.g., Ts = Tc/4,
where Tc is a CDMA chip period). A PDP with values gk is calculated at a resolution T
(e.g., T = 3Tc/4), which is typically a lesser resolution than the input sampling period Ts in
order to conserve computation resources. The DE process 200 may report as many as P
paths.
The DE process 200 begins at step 202. At step 202, regions of energy (i.e., signal
path clusters) j in the PDP are defined by detecting a left and a right boundary for each:
The boundary detection performed at step 202 may be implemented
as, for example, a thresholding operation requiring that a signal-path cluster element be
greater than a pre-defined value, such as, for example, two times stronger than a PDP noise
floor.
From step 202, execution proceeds to step 204. At step 204, a counter j is started at
an initial value of zero. At step 206, the counter j is incremented. At step 208, a

determination is made whether the counter j has exceeded the pre-defined value J, J being
the number of previously-detected signal clusters from step 202. If, at step 208, it is not
determined that the counter has exceeded J, execution proceeds to step 210.
From step 208, if it is determined that the counter has not exceeded J, steps 210-218
are performed for j = 1... J (i.e., for each signal path cluster). Although steps 210-218 are
illustrated in FIG. 2 as being performed sequentially, those having ordinary skill in the art
will appreciate that steps 210-218 may also be performed in parallel without departing from
principles of the invention. In particular, at step 210, the signal path cluster under
consideration (i.e., signal path cluster j) is correlated with a waveform suitable for
deducing the path structure of the cluster (i.e., a different waveform for each grid phase t
within the Ts scale). The waveform may be, for example, a single-path PDP waveform or
the response of a filter implementing the inverse of a single-path pulse shaping operation.
At step 212, the grid phase tj that produces the strongest correlation peak in the signal path
cluster j is found. In other words, for t = 0.. . L-1, a correlation product is
calculated as follows: The grid phase tj is determined as

From step 212, execution proceeds to step 214. At step 214, the PDP of cluster,/ is
re-sampled, via interpolation, to produce in the interval Those
having ordinary skill in the art will recognize that various different interpolation schemes
may be used without departing from principles of the invention. From step 214, execution
proceeds to step 216. At step 216, the edges of the current cluster (i.e., cluster
J) are detected with an offset grid determined via the interpolation of step 214. If the cluster
j is a single-path object, the new boundaries are From step 216, execution
proceeds to step 218. At step 218, a position list and a corresponding

PDP value list are reported for the cluster j. From step 218,
execution returns to step 206.
> If, at step 208, it is determined that; > J, execution proceeds to step 220. At step
220, the P largest values over all Gj, j-\ .. .J are selected and corresponding delays from
Dj are reported as the delay estimates and output from the delay estimator. From step 220,
execution returns to step 202.
The PDP generation may be performed for the original fixed grid positions kT at all
times in order to simplify, for example, a hardware implementation, as the re-sampling
provides the necessary shift per cluster. The correlation may be done rarely, for example,
every N-th DE update cycles, where N is chosen so as to limit path movement/drift during
the NTDE slots to a distance less than TS, where TDE is the time corresponding to a DE update
cycle.
In some embodiments of the invention, the grid phase correction is helpful if a clear
correlation peak exists (i.e., a single defined peak exists in the cluster), while in the absence
of a clear peak near the edge of the cluster, the correction does not necessarily noticeably
improve the finger-allocation economy. Therefore, in some embodiments, processing
resources may be saved by an implementation that performs the re-sampling and edge re-
detection only if a correlation peak is found at a cluster edge. Furthermore, in some
embodiments of the invention, a procedure targeting only single-path objects in the PDP for
re-sampling may skip all processing for clusters wider than the single-path PDP waveform.
A CDP may be used instead of a PDP, in which case the power of each delay profile
element is found by multiplying the complex coefficient by its complex conjugate. Edge
detection criteria and threshold values other than those described above may be used
without departing from principles of the invention. The PDP may be computed for the
adjusted delay positions; if so, no PDP re-sampling is needed in many cases. Correlation
peak detection periods may be equal to or different from the DE update period. Different
criteria for processing individual PDP clusters may be used.
Various embodiments of the present invention may be implemented in, for example,
hardware, software (e.g., carried out by a processor that executes computer-readable
instructions), or a combination thereof. The computer-readable instructions may be
program code loaded in a memory such as, for example, Random Access Memory (RAM),
or from a storage medium such as, for example, Read Only Memory (ROM). For example,

a processor may be operative to execute software adapted to perform a series of steps in
accordance with principles of the present invention. The software may be adapted to reside
upon a computer-readable medium such as, for example, a magnetic disc within a disc drive
unit. The computer-readable medium may also include a flash memory card, EEROM
based memory, bubble memory storage, ROM storage, etc. The software adapted to
perform steps according to principles of the present invention may also reside, in whole or
in part, in static or dynamic main memories or in firmware within a processor (e.g., within
microcontroller, microprocessor, or a microcomputer internal memory).
It should be emphasized that the terms "comprise/comprises/comprising" when used
in this specification are taken to specify the presence of stated features, integers, steps, or
components, but do not preclude the presence or addition of one or more other features,
integers, steps, components or groups thereof.
The previous Detailed Description is of embodiment(s) of the invention. The scope
of the invention should not necessarily be limited by this Description. The scope of the
invention is instead defined by the following claims and the equivalents thereof.

WE CLAIM
1. A signal-path delay-estimation method (200) that determines a coarse delay profile of
at least one detected signal path cluster using a fixed grid approach by means of a
processor and is characterized by :
correlating (210) the determined coarse delay profile of at least one detected
signal path cluster with a waveform to yield a strongest correlated peak for each of the at
least one detected signal path cluster; and
for each of the at least one detected signal path cluster;
a) using (212) the strongest correlated peak to determine an adjusted
delay-profile phase;
b) re-sampling (214) the computed coarse delay profile in accordance
with the adjusted delay-profile phase; and
c) detecting (216) signal-pathOcluster edges using the re-sampled
computed coarse delay profile.

2. The method of claim 1, further characterized by detecting edges of the at least one
signal path cluster of the computed coarse delay profile.
3. The method of claim 2, wherein the step of detecting the edges of the at least one
signal comprises a thresholding operation.
4. The method of claim 3, wherein the thresholding operation comprises requiring that
the at least one signal path cluster be greater than a pre-defined value times a delay-
profile noise floor.
5. The method of claim 1, further characterized by for each of the at least one detected
signal path cluster, reporting (218) the detected signal-path-cluster edges and delay-
profile values of the re-sampled computed coarse delay profile.
6. The method of claim 1, wherein at least two of the at least one detected signal path
cluster have the same adjusted delay-profile phase.

7. The method of claim 1, wherein :
the step of correlating is performed every N delay-estimation cycles; and
N is chosen so as to limit signal-path drift during N delay-estimation cycles to
less than an input data sampling period Ts
8. The method of claim 2, wherein for each of the at least one detected signal path
cluster, steps (a), (b) and (c) are performed only if the strongest correlated peak is within
a pre-defined time from a detected edge of the signal path cluster.
9. The method of claim 1, wherein for each of the at least one detected signal path
cluster, steps (a), (b) and (c) are performed only if the strongest correlated peak is the
single defined peak within the signal path cluster.
10. The method of claim 9, wherein the single defined peak is a peak that is a predefined
amount greater than any other correlated peak.
11. The method of claim 1, wherein the coarse delay profile is selected from the group
consisting of a coarse complex delay profile (CDP) and a coarse power delay profile
(PDP).
12. The method of claim 1, wherein a power-delay-profile correlation period is identical
to a delay-estimation update period.
13. The method of claim 3, wherein an identical threshold is used for each detected
signal-path cluster.
14. The method of claim 1, wherein the waveform is a single-path waveform.
15. The method of claim 1, wherein the waveform is the inverse of a single-path pulse
shape function.


16. The method of claim 1, wherein the step of re-sampling (214) the computed coarse
delay profile is performed via interpolation.
17. A signal-path delay-estimation system (100) comprising a delay estimator (102) that
computes a coarse delay profile of at least one detected signal path cluster using a fixed
grid approach, a channel estimator (104) inter-operably connected to an output of the
delay estimator (102), a despreader/combine (106) inter-operably connected to an
output of the channel estimator (104) and the output of the delay estimator (102), and
the delay estimator (102) is characterized by :
correlating (210) the computed coarse delay profile of the at least one detected
signal path cluster with a waveform to yield a strongest correlated peak for each
of the at least one detected signal path cluster; and for each of the at least one
detected signal path cluster;
a) using (212) the strongest correlated peak to determine an adjusted delay-
profile phase;
b) re-sampling (214) the computed delay profile in accordance with the
adjusted delay-profile phase; and
c) detecting (216) signal-path-cluster edges using the re-sampled computed
delay profile.

18. The system of claim 17, wherein the delay estimator (102) is for detecting edges of
the at least one signal path cluster of the computed delay profile.
19. The system of claim 18, wherein the detection of the edges of the at least one signal
comprises a thresholding operation.
20. The system of claim 19, wherein the threasholding operation comprises requiring
that the at least one signal path cluster be greater than a pre-defined value times a
delay-profile noise floor.

21. The system of claim 17, wherein the delay estimator (102) is for, for each of the at
least one detected signal path cluster, reporting (218) the detected signal-path-cluster
edges and delay-profile values of the re-sampled computed delay profile.
22. The system of claim 17, wherein at least two of the detected signal path clusters
have the same adjusted delay-profile phase.
23. The system of claim 17, wherein :
The correlation is performed every N delay-estimation cycles; and
N is chosen so as to limit signal-path drift during N delay estimation cycles to less
than an input data sampling period Ts
24. The system of claim 18, wherein, for each of the at least one detected signal path
cluster, the delay estimator (102) performs (a), (b) and (c) only if the strongest correlated
peak is within a pre-defined time from a detected edge of the signal path cluster.
25. The system of claim 17, wherein, for each of the at least one detected signal path
cluster, the delay estimator (102) performs (a) (b) and (c) only if the strongest correlated
peak is the single defined peak within the signal path cluster.
26. The system of claim 25, wherein the single defined peak is a peak that is a
predefined amount greater than any other correlated peak.
27. The system of claim 17, wherein the delay profile is selected from the group
consisting of a complex delay profile (CDP) and a power delay profile (PDP).
28. The system of claim 17, wherein a delay-profile correlation period is identical to a
delay-estimator update period.
29. The system of claim 19, wherein an identical threshold is used for each detected
signal-path cluster.


30. The system of claim 17, wherein the re-sampling (214) of the computed delay profile
is performed via interpolation.
31. The system of claim 17, wherein the waveform is a single-path waveform.
32. The system of claim 17, wherein the waveform is the inverse of a single-path pulse
shape function.


ABSTRACT

METHOD OF AND SYSTEM FOR DELAY ESTIMATION
WITH MINIMIZED FINGER ALLOCATION
A signal-path delay-estimation method (200) includes correlating (210) a computed
coarse delay profile of at least one detected signal path cluster with a waveform to yield
a strongest correlated peak for each of the at least one detected signal path cluster. The
method also includes, for each of the at least one detected signal path cluster,
using(212) the strongest correlated peak to determine an adjusted delay-profile phase,
re-sampling (214) the computed coarse delay profile in accordance with the adjusted
delay-profile phase, and detecting (216) signal-path-cluster edges using the re-sampled
(214) computed coarse delay profile. This Abstract is provided to comply with rules
requiring an Abstract that allows a searcher or other reader to quickly ascertain subject
matter of the technical disclosure. This Abstract is submitted with the understanding that
it will not be used to interpret or limit the scope or meaning of the claims.

Documents:

02437-kolnp-2007-abstract.pdf

02437-kolnp-2007-assignment 1.1.pdf

02437-kolnp-2007-assignment.pdf

02437-kolnp-2007-claims.pdf

02437-kolnp-2007-correspondence others 1.1.pdf

02437-kolnp-2007-correspondence others.pdf

02437-kolnp-2007-description complete.pdf

02437-kolnp-2007-drawings.pdf

02437-kolnp-2007-form 1.pdf

02437-kolnp-2007-form 2.pdf

02437-kolnp-2007-form 3.pdf

02437-kolnp-2007-form 5.pdf

02437-kolnp-2007-gpa.pdf

02437-kolnp-2007-international exm report.pdf

02437-kolnp-2007-international publication.pdf

02437-kolnp-2007-international search report.pdf

02437-kolnp-2007-others.pdf

02437-kolnp-2007-pct request form.pdf

02437-kolnp-2007-priority document.pdf

2437-KOLNP-2007-(01-09-2011)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(09-03-2012)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(09-04-2012)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(09-04-2012)-FORM-3.pdf

2437-KOLNP-2007-(09-04-2012)-OTHERS.pdf

2437-KOLNP-2007-(09-04-2012)-PETITION UNDER RULE 137.pdf

2437-KOLNP-2007-(13-03-2013)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(20-09-2011)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(20-09-2011)-FORM 3.pdf

2437-KOLNP-2007-(21-03-2012)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(22-11-2011)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(22-11-2011)-FORM-3.pdf

2437-KOLNP-2007-(31-10-2011)-ASSIGNMENT.pdf

2437-KOLNP-2007-(31-10-2011)-CORRESPONDENCE.pdf

2437-KOLNP-2007-(31-10-2011)-OTHERS.pdf

2437-KOLNP-2007-(31-10-2011)-PA.pdf

2437-KOLNP-2007-ABSTRACT 1.1.pdf

2437-KOLNP-2007-AMANDED CLAIMS.pdf

2437-KOLNP-2007-AMANDED PAGES OF SPECIFICATION.pdf

2437-KOLNP-2007-ASSIGNMENT.pdf

2437-KOLNP-2007-CORRESPONDENCE 1.2.pdf

2437-KOLNP-2007-CORRESPONDENCE 1.5.pdf

2437-KOLNP-2007-CORRESPONDENCE OTHERS 1.3.pdf

2437-KOLNP-2007-CORRESPONDENCE-1.3.pdf

2437-KOLNP-2007-CORRESPONDENCE-1.4.pdf

2437-KOLNP-2007-DESCRIPTION (COMPLETE) 1.1.pdf

2437-KOLNP-2007-DRAWINGS 1.1.pdf

2437-KOLNP-2007-EXAMINATION REPORT REPLY RECIEVED.pdf

2437-KOLNP-2007-EXAMINATION REPORT.pdf

2437-KOLNP-2007-FORM 1-1.1.pdf

2437-KOLNP-2007-FORM 18 1.1.pdf

2437-kolnp-2007-form 18.pdf

2437-KOLNP-2007-FORM 2-1.1.pdf

2437-KOLNP-2007-FORM 3.pdf

2437-KOLNP-2007-FORM 5.pdf

2437-KOLNP-2007-GPA.pdf

2437-KOLNP-2007-GRANTED-ABSTRACT.pdf

2437-KOLNP-2007-GRANTED-CLAIMS.pdf

2437-KOLNP-2007-GRANTED-DESCRIPTION (COMPLETE).pdf

2437-KOLNP-2007-GRANTED-DRAWINGS.pdf

2437-KOLNP-2007-GRANTED-FORM 1.pdf

2437-KOLNP-2007-GRANTED-FORM 2.pdf

2437-KOLNP-2007-GRANTED-SPECIFICATION.pdf

2437-KOLNP-2007-OTHERS 1.1.pdf

2437-KOLNP-2007-OTHERS 1.2.pdf

2437-KOLNP-2007-OTHERS 1.3.pdf

2437-KOLNP-2007-REPLY TO EXAMINATION REPORT.pdf

abstract-02437-kolnp-2007.jpg


Patent Number 256419
Indian Patent Application Number 2437/KOLNP/2007
PG Journal Number 24/2013
Publication Date 14-Jun-2013
Grant Date 13-Jun-2013
Date of Filing 02-Jul-2007
Name of Patentee TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Applicant Address S-164 83 STOCKHOLM
Inventors:
# Inventor's Name Inventor's Address
1 REIAL, ANDRES SOFIAPARKEN 6A, S-222 41 LUND
PCT International Classification Number H04B 1/707
PCT International Application Number PCT/EP2005/012725
PCT International Filing date 2005-11-29
PCT Conventions:
# PCT Application Number Date of Convention Priority Country
1 11/007,687 2004-12-08 U.S.A.