Sélection de la langue

Search

Sommaire du brevet 2509947 

Énoncé de désistement de responsabilité concernant l'information provenant de tiers

Une partie des informations de ce site Web a été fournie par des sources externes. Le gouvernement du Canada n'assume aucune responsabilité concernant la précision, l'actualité ou la fiabilité des informations fournies par les sources externes. Les utilisateurs qui désirent employer cette information devraient consulter directement la source des informations. Le contenu fourni par les sources externes n'est pas assujetti aux exigences sur les langues officielles, la protection des renseignements personnels et l'accessibilité.

Disponibilité de l'Abrégé et des Revendications

L'apparition de différences dans le texte et l'image des Revendications et de l'Abrégé dépend du moment auquel le document est publié. Les textes des Revendications et de l'Abrégé sont affichés :

  • lorsque la demande peut être examinée par le public;
  • lorsque le brevet est émis (délivrance).
(12) Demande de brevet: (11) CA 2509947
(54) Titre français: TECHNIQUE D'EMISSION EN DIVERSITE POUR COMMUNICATIONS SANS FIL
(54) Titre anglais: TRANSMITTER DIVERSITY TECHNIQUE FOR WIRELESS COMMUNICATIONS
Statut: Réputée abandonnée et au-delà du délai pour le rétablissement - en attente de la réponse à l’avis de communication rejetée
Données bibliographiques
(51) Classification internationale des brevets (CIB):
  • H04B 1/02 (2006.01)
  • H03M 13/39 (2006.01)
  • H04B 7/0456 (2017.01)
  • H04L 1/02 (2006.01)
  • H04W 88/02 (2009.01)
(72) Inventeurs :
  • TAROKH, VAHID (Etats-Unis d'Amérique)
  • ALAMOUTI, SIAVASH (Etats-Unis d'Amérique)
(73) Titulaires :
  • AT&T WIRELESS SERVICES, INC.
  • AT&T WIRELESS SERVICES, INC.
(71) Demandeurs :
  • AT&T WIRELESS SERVICES, INC. (Etats-Unis d'Amérique)
  • AT&T WIRELESS SERVICES, INC. (Etats-Unis d'Amérique)
(74) Agent: OYEN WIGGS GREEN & MUTALA LLP
(74) Co-agent:
(45) Délivré:
(22) Date de dépôt: 1998-08-31
(41) Mise à la disponibilité du public: 1999-03-25
Requête d'examen: 2005-07-13
Licence disponible: S.O.
Cédé au domaine public: S.O.
(25) Langue des documents déposés: Anglais

Traité de coopération en matière de brevets (PCT): Non

(30) Données de priorité de la demande:
Numéro de la demande Pays / territoire Date
60/059016 (Etats-Unis d'Amérique) 1997-09-16
60/059219 (Etats-Unis d'Amérique) 1997-09-18
60/063780 (Etats-Unis d'Amérique) 1997-10-31

Abrégés

Abrégé anglais


A simple block coding arrangement is created with symbols transmitted over a
plurality of transmit channels, in connection with
coding that comprises only simple arithmetic operations, such as negation and
conjugation. The diversity created by the transmitter utilizes
space diversity and either time or frequency diversity. Space diversity is
effected by redundantly transmitting over a plurality of antennas,
time diversity is effected by redundantly transmitting at different times, end
frequency diversity is effected by redundantly transmitting at
different frequencies. Illustratively, using two transmit antennas and a
single receive antenna, one of the disclosed embodiments provides
the same diversity gain as the maximal-ratio receiver combining (MRRC) scheme
with one transmit antenna and two receive antennas. The
principles of this invention are applicable to arrangements with more than two
antennas, and an illustrative embodiment is disclosed using
the same apace block code with two transmit and two receive antennas.

Revendications

Note : Les revendications sont présentées dans la langue officielle dans laquelle elles ont été soumises.


-14-
WHAT IS CLAIMED IS:
1. A transmitter comprising:
a coder responsive to incoming symbols, forming a set of channel symbols
that impart redundancy, where the coder employs coding from the set
consisting of replications, negations, forming complex conjugates and
forming negative complex conjugates.
2. The transmitter of claim 1 where the coder encodes incoming symbols in
blocks of n symbols and where, when n=2, the coder encodes an incoming
block of symbols s0 and s1 into a first sequence of symbols s0 and s1, and
into a second sequence of symbols -s1* and s0*, where s i* is defined as the
complex conjugate of s i.

Description

Note : Les descriptions sont présentées dans la langue officielle dans laquelle elles ont été soumises.


CA 02509947 1998-08-31
Transmitter Diversity Technique for Wireless Communications
Background of the Inyention
This invention relates to wireless communication and, more particularly, to
techniques for effective wireless communication in the presence of fading and
other
to degradations.
The most effective technique for mitigating multipath fading in a wireless
radio channel is to cancel the effect of fading at the transmitter by
controlling the
transmitter's power. That is, if the channel conditions are known at the
transmitter
(on one side of the link), then the transmitter can pre-distort the signal to
overcome
15 the effect of the channel ai the receiver (on the other side). However,
there are two
fundamental problems with this approach. The first problem is the
transmitter's
dynamic range. For the transmitter to overcome an x dB fade, it must increase
its
power by x dB which, in most cases, is not practical because of radiation
power
limitations, and the size and cost of amplifiers. The second problem is that
the
2o transmitter does not have any knowledge of the channel as seen by. the
receiver
(except for time division duplex systems, where the transmitter receives power
from
a known other transmitter over the. same channel). Therefore, if one wants to
control a transmitter based on channel characteristics, channel information
has to be
sent from the receiver to the transmitter, which results in throughput
degradation
25 and added complexity to both the transmitter and the receiver.
Other effective techniques are time and frequency diversity_ Using time
interleaving together with coding can provide diversity improvement. The same
holds for frequency hopping and spread spectnim_ However, time interleaving
results in unnecessarily large delays when the channel is slowly varying.

CA 02509947 1998-08-31
2
Equivalently, frequency diversity techniques are ineffective when the
coherence
bandwidth of the channel is large (small delay spread).
It is well known that in most scattering environments antenna diversity is the
moss practical and effective technique for reducing the effect of multipath
fading.
The classical approach to antenna diversity is to use multiple antennas at the
receiver and perform combining (or selection) to improve the quality of the
received
signal.
The major problem with using the receiver diversity approach in current
wireless communication systems, such as IS-136 and GSM, is the cost, size and
1o power consumption constraints of the receivers. For obvious reasons, small
size,
weight and cost are paramount. The addition of multiple antennas and RF chains
(or selection and switching circuits) in receivers is presently not be
feasible. As a
result, diversity techniques have often been applied only to improve the up-
link
(receiver to base) transmission quality with multiple antennas (and receivers)
at the
15 base station. Since a base station often serves thousands of receivers, it
is more
economical to add equipment to base stations rather than the receivers
Recently, some interesting approaches for transmitter diversity have been
suggested. A delay diversity scheme was proposed by A. Wittneben in "Base
Station Modulation Diversity for Digital SIMULCAST," Proceeding of the 1991
2o IEEE Vehicular Technology Conference (VTC 41 st), PP. 848-853, May 1991,
and
in "A New Bandwidth Efficient Transmit Antenna Modulation Di~rersity Scheme
For Linear Digital Modulation," in Proceeding of the 1993 IEEE International
Conference on Communications (IICC '93), PP. 1630.1634, May 1993. The
proposal is for a base station to transmit a sequence of symbols through one
25 antenna, and the same sequence of symbols -but delayed - through another
antenna.
U.S. patent 5,479,448, issued to Nambirajan Seshadri on December 26,
1995, discloses a similar arrangement where a sequence of codes is transmitted
through two antennas. The sequenceof codes is routed through a cycling switch
that directs each code to the various antennas, in succession. Since copies of
the

CA 02509947 1998-08-31
same symbol are transmitted through multiple antennas at different times, both
space and time diversity are achieved. A maximum likelihood sequence estimator
(MLSE) or a minimum mean squared error (MMSE) equalizer is then used to
resolve multipath distortion and provide diversity gain. See also N. Seshadri,
J.H.
Winters, "Two Signaling Schemes for Improving the Error Performance of FDD
Transmission Systems Using Transmitter Antenna Diversity," Proceeding of the
1993 IEEE Vehicular Technology Conference (VTC 43rd), pp. 508-511, May 1993;
and J. H. Winters, "The Diversity Gain of Transmit Diversity in Wireless
Systems
with Rayleigh Fading," Proceeding oflhe 1994 ICClSUPERCOMM, New Orleans,
l0 Vol. 2, PP. 1121-1125, May 1994.
In still another interesting approach
symbols are encoded according to the antennas through which they are
simultaneously transmitted, and are decoded using a maximum likelihood
decoder.
More specifically, the process at the transmitter handles the information in
blocks of
M1 bits, where M1 is a multiple of M2, i.e., Ml=k*M2. It converts each
successive
group of M2 bits into information symbols (generating thereby k information
symbols), encodes each sequence of k information symbols into n channel codes
(developing thereby a group of n channel codes for each sequence of k
information
symbols), and applies each code of a group of codes to a different ~tenna.
Summary
The problems of prior art systems are overcome, and an advance in the art is
realised with a simple black coding arrangement where symbols are transmitted
over a plurality of transmit channels and the coding comprises only simple
arithmetic operations, such as negation and conjugation. The diversity created
by
the transmitter utilizes space diversity and either time diversity or
frequency
diversity. Space diversity is effected by redundantly h~ansmitting over a
plurality of

CA 02509947 1998-08-31
antennas; time diversity is effected by redundantly transmitting at different
times;
and frequency diversity is effected by redundantly transmitting at different
frequencies. Illustratively, using two transmit antennas and a single receive
antenna, one of the disclosed embodiments provides the same diversity gain as
the
maximal-ratio receiver combining (MRRC) scheme with one transmit antenna and
two receive antennas. The novel approach does not require any bandwidth
expansion or feedback from the receiver to the transmitter, and has the same
decoding complexity as the MRRC. The diversity improvement is equal to
applying
maximal-ratio receiver combining (M1ZRC) at the receiver with the same number
of
1 o antennas. The principles of this invention are applicable to arrangements
with more
than two antennas, and an illustrative embodiment is disclosed using the same
space
block code with two transmit and two receive antennas. This scheme provides
the
same diversity gain as four-branch MRRC.
~5 Brief Description of the Drawings
FIG. 1 is a block diagram of a first embodiment in accordance with the
principles of this invention;
FIG. 2 presents a block diagram of a second embodiment, where channel
estimates are not employed;
2o FIG. 3 shows a block diagram of a third embodiment, wheie channel
estimates are derived from recovered signals; and
FIG. 4 illustrates an embodiment where two transmitter antennas and two
receiver antennas are employed.
25 Detail Description
In accordance with the principles of this invention, effective communication
is achieved with encoding of symbols that comprises merely negations and
conjugations of symbols (which really is merely negation of the imaginary
part) in

CA 02509947 1998-08-31
S
combination with a transmitter created diversity. Space diversity and either
frequency diversity or time diversity are employed.
FIG. 1 presents a block diagram of an arrangement where the two
controllable aspects of the transmitter that are used are space and time. That
is, the
s FIG. 1 arrangement includes multiple transmitter antennas (providing space
diversity) and employs multiple time intervals. Specifically, transmitter 10
illustratively comprises antennas 11 and 12, and it handles incoming data in
blocks
n symbols, where n is the number of transmitter antennas, and in the
illustrative
embodiment of FIG. 1, it equals 2, and each block takes n symbol intervals to
transmit. Also illustratively, the FIG. 1 arrangement includes a receiver 20
that
comprises a single antenna 21.
At any given time, a signal sent by a transmitter antenna experiences
interference effects of the traversed channel, which consists of the transmit
chain,
the air-link, and the receive chain. The channel may be modeled by a complex
t 5 muldplicative distortion factor composed of a magnitude response and a
phase
response. In the exposition that follows therefore, the channel transfer
function
from transmit antenna 11 to receive antenna 21 is denoted by land from
transmit
antenna 12 to receive antenna 21 is denoted by h, , where:
ho=a e~'
0
h~ = a~e~' .
(1)
Noise fram interference and other sowces is added at the two received signals
and,
therefore, the resulting baseband signal received at any time and outputted by
reception and amplification section 25 is
r(t)=aoe~°sl+a~e~'sJ+n(t),
(2)
where s, and s~ are the signals being sent by transmit antenna 11 and 12,
respectively.

CA 02509947 1998-08-31
6
As indicated above, in the two-antenna embodiment of FIG. 1 each block
comprises two symbols and it takes two symbol intervals to transmit those two
symbols. More specifically, when symbols s; and s~ need to be transmitted, at
a first
time interval the transmitter applies signal s; to antenna 11 and signal s~ to
antenna
12, and at the next time interval the transmitter applies signal - s, * to
antenna 11
and signal so * to antenna 12. This is clearly a very simple encoding process
where
only negations and conjugations are employed. As demonstrated below, it is as
effective as it is simple. Corresponding to the above-described transmissions,
in the
first time interval the received signal is
!0 r(t)=hos,+h,sf+n(t),
(3)
and in the next time interval the received signal is
r(t+T)=-hose *+h,s; *+n(t+T).
(4)
~5 Table 1 illustrates the transmission pattern over the two antennas of the
FIG. 1
arrangement for a sequence of signals { so , s, , sz , s3 , s, , ss ,... } .
Table 1
Time: t t+T t+2T t+3T t+4T t+ST
Antenna so - sz - s3 s, - ss .-..-
11 s~ * *
*
Antenna s~ so s, s~ ss s~ .....
12 * * *
The received signal is applied to channel estimator 22, which provides
signals representing the channel characteristics or, rather, the best
estimates thereof.
2o Those signals are applied to combiner 23 and to maximum likelihood dctector
24.
The estimates developed by channel estimator 22 can be obtained by sending a
lwown training signal that channel estimator 22 recovers, and based on the
recovered signal the channel estimates are computed. This is a well known
approach.

CA 02509947 1998-08-31
7
Combiner 23 receives the signal in the first time interval, buffers it,
receives
the signal in the next time interval, and combines the two received signals to
develop signals
s, =ho *r(t)+h,r*(t+T)
s~ =h, *r(t)-hor*(t+T).
(5)
Substituting equation (1) into (S) yields
s; =(ao +a; )s,+ho*n(t)+h,n*(t+T)
s~ =(ao +a; )s~ -hon*(t+T)+h, *n(t),
to (6
)
where ao = hoho * and a; = h,h, * , demonstrating that the signals of equation
(6)
are, indeed, estimates of the transmitted signals (within a multiplicative
factor).
Accordingly, the signals of equation (6) are sent to maximum likelihood
detector 24.
~s In attempting to recover s,, two kind of signals are considered: the
signals
actually received at time t and t+T, and the signals that should have been
received if
s; were the signal that was sent. As demonstrated below, no assumption is made
regarding the value of s~ . That is, a decision is made that s, = sx for that
value of x
for which
2o dZ[r(t),(hos,~ +h,sj)]+d2[r(t+T),(-h,s~ *+hosr*)]
is less than
d2[r(t),(hosk +h,sl)]+dz[r(t+T),(-h,s~ *+hosk*)],
where d z (x, y) is the squared Euclidean distance between signals x and y,
i.e.,
is d'(x,y)=~x-y~ .

CA 02509947 1998-08-31
8
Recognizing that ha = ho +noise that is independent of the transmitted
symbol, and that h, = h, +noise that is independent of the transmitted symbol,
equation (7) can be rewritten to yield
x . z Z 2
(ao + ai ~s~ ~ - s~s~ - s. * sx ~ ~ao '~ a~ ~sx i - s,sx " sj * sx
s (8) ;
where ao = hobo * and a; = h,h, * ; or equivalently,
~ao+ai _l~s~~i+dz~sms~)<~ao+ai _l~sx~z+dz~smsx~.
(9)
In Phase Shift Keying modulation, all symbols carry the same energy, which
to means that Is=IZ = Isx IZ and, therefore, the decision rule of equation (9)
may be
simplified to
choose signal s, =si iff d2(s,,s=)<_d2(sj,sx).
Thus, maximum likelihood detector 24 develops the signals sx for all values of
k,
15 with the aid of ho and h, from estimator 22, develops the distances d ~
(sj, sx ~,
identifies x for which equation (10) holds and concludes that s, = s,~ . A
similar
process is applied for recovering si .
In the above-described embodiment each block of symbols is recovered as a
block with the aid of channel estimates ho and h, . However, other approaches
to
2o recovering the transmitted signals can also be employed. Indeed, an
embodiment
for recovering the transmitted symbols exists where the channel transfer
functions
need not be estimated at all, provided an initial pair of transmitted signals
is known
to the receiver (for example, when the initial pair of transmitted signals is
prearranged). Such an embodiment is shown in FIG. 2, where maximum likelihood
25 detector 27 is responsive solely to combiner 26. (Elements in FIG. 3 that
are

CA 02509947 1998-08-31
9
referenced by numbers that are the same as reference numbers in FIG. 1 are
like
elements.) Combiner 26 of receiver 30 develops the signals
ro =r(t)=hoso+h,s, +no
r, =r(t+T)=h,so *-hos, *+n,
r~=r(t+2T)=host+h,ss+n~
r3 =r(t+3T)=h,sZ *-hose *+n"
(I
1)
then develops intermediate signals A and B
to A = ror; * -r2r1
B=rzro *+r,r; *,
(12)
and finally develops signals
sz = As, * +Bso
~ s s3 = -Aso * +Bs, ,
(13)
where N3 and Ns are noise terms. It may be noted that signal rI is actually
rZ = host + h,s3 = host + h,s3 + n~, and similarly for signal r3 . Since the
makeup of
signals A and B makes them also equal to
2o A = (ao + a; )(sis, - s3so ) + N,
B=(ao +a; )(s~so *+s,s,*)+Nz,
(14)
where NI and N2 are noise terms, it follows that signals s2 and s3 are equal
to
s2 = (ao + a; )(~so ~2 + (s~ ~z )s~ + N3
25 s3 = (ao + a; )~so h + ~s, Iz )s~ + N~ .
(15)

CA 02509947 1998-08-31
When the power of all signals is constant (and normalized to 1) equation (15)
reduces to
si = (ao + a~ )s2 + N3
s; =(ao +a; )s3+N,.
5 (16)
Hence, signals s2 and s~ are, indeed, estimates of the signals s~ and s,
(within a
multiplicative factor). Equation (15) demonstrates the recursive aspect
of equation
(13), where signal estimates s~ and s3 are evaluated with the aid of recovered
signals so and s, that are fed back from the output of the maximum likelihood
10 detector.
Signals s2 and s3 are applied to maximum likelihood detector 24 where
recovery is effected with the metric expressed by equation (10) above. As
shown in
FIG. 2, once signals s2 and s3 are recovered, they are used together with
received
signals r~ , rj , r4 , and rs to recover signals s4 and s s , and the process
repeats.
~ 5 FIG. 3 depicts an embodiment that does not require the constellation of
the
transmitted signals to comprise symbols of equal power. (Elements in FIG. 3
that
are referenced by numbers that are the same as reference numbers in FIG. 1 are
like
elements.) In FIG. 3, channel estimator 43 of receiver 40 is responsive to the
output
signals of maximum likelihood detector 42. Having access to the recovered
signals
2o so and s, , channel estimator 43 forms the estimates
roso *-rs, so *no +s,n,
ho = ~ i ~. ~s~ (z y o + Iso ~Z + I's~ h
h - ros,'~-r,so +s, *no +son,
Isoh +ts,IZ =~, Isoi~ +IS~iZ
(1~
and applies those estimates to combiner 23 and to detectoi 42. Detector 24
recovers
25 signals sz and s3 by employing the approach used by detector 24 of F1G. 1,
except

CA 02509947 1998-08-31
11
that it does not employ the simplification of eQuation (9). The recovered
signals of
detector 42 are fed back to channel estimator 43, which updates the channel
estimates in preparation for the next cycle.
The FIGS.1-3 embodiments illustrate the principles of this invention for
arrangements having two transmit antennas and one receive antenna_ However,
those principles are broad enough to encompass a plurality of transmit
antennas and
a plurality of receive antennas. To illustrate, FIG. 4 presents an embodiment
where
two transmit antennas and two receive antennas are used; to wit, transmit
antennas
31 and 32, and receive antennas 51 and 52. The signal received by antenna 51
is
to applied to channel estimator 53 and to combiner 55, and the signal received
by
antenna 52 is applied to channel estimator 54 and to combiner 55. Estimates
ofthe
channel transfer functions ho and h, are applied by channel estimator 53 to
combiner SS and to maximum likelihood detector 56. Similarly, estimates of the
channel transfer functions h~ and h, are applied by channel estimator 54 to
I S combiner 55 and to maximum likelihood detector 56. Table 2 defines the
channels
between the transmit antennas and the receive antennas, and table 3 defines
the
notion for the received signals at the two receive antennas.
Table 2
Antenna Antenna 52
51
Antenna yb hi
31
Antenna h, hj
32
24 Table 3
Antenna Antenna
51 52
Time t
ro r~
Time t+T r~ r3
Based on the above, it can be shown that the received signals axe
ro = hoso + h,s~ + no
r, _ -hos, "+h,sa * +n,

CA 02509947 1998-08-31
12
rZ = hiso + has, + n2
r3 =-hzs, *+h;so *+n3
(18)
where no,n,,n2, and n3 are complex random variables representing receiver
thermal noise, interferences, etc.
In the FIG. 4 arrangement, combiner 55 develops the following two signals
that are sent to the maximum likel~ood detector:
so =ho *ro +h~r, *+h2 *r~ +h~r~
s~=h,*ro-hor,*+h3*rz-hZr;*.
to (19)
Substituting the appropriate equations results in
so = (ao + a; + a2 + aj )so + ho * no + h,n, * +hi * nz + h3nj
s, _ (ao + a; + aZ + a; )s, + h, * na - ho n, * +h, * n~ - h~ n, * ,
(~0)
which demonstrates that the signalsso and s, are indeed estimates of the
signals so
and s,. Accordingly, signals so and s', are sent to maximum likelihood decoder
56,
which uses the decision rule of equation (I O) to recover the signals so and
s,.
As disclosed above, the principles of this invention rely on the transmitter
to
force a diversity in the signals received by a receiver, and that diversity
can be
2o effected in a number of ways. The illustrated embodiments rely on space
diversity -
effected through a multiplicity of transmitter antennas, and time diversity -
effected
through use of two time intervals for transmitting the encoded symbols. It
should be
realized that two different transmission frequencies could be used instead of
two
time intervals. Such an embodiment would double the transmission speed, but it
would also increase the hardware in the receiver, because two different
frequencies
need to be received and processed simultaneously.

CA 02509947 1998-08-31
13
The above illustrated embodiments are, obviously, merely illustrative
implementations of the principles of the invention, and various modifications
and
enhancements can be introduced by artisans without departing from the spirit
and
scope of this invention, which is embodied in the following claims. For
example,
all of the disclosed embodiments are illustrated for a space-time diversity
choice,
but as explained above, one could choose the space-frequency pair. Such a
choice
would have a direct effect on the construction of the receivers.

Dessin représentatif
Une figure unique qui représente un dessin illustrant l'invention.
États administratifs

2024-08-01 : Dans le cadre de la transition vers les Brevets de nouvelle génération (BNG), la base de données sur les brevets canadiens (BDBC) contient désormais un Historique d'événement plus détaillé, qui reproduit le Journal des événements de notre nouvelle solution interne.

Veuillez noter que les événements débutant par « Inactive : » se réfèrent à des événements qui ne sont plus utilisés dans notre nouvelle solution interne.

Pour une meilleure compréhension de l'état de la demande ou brevet qui figure sur cette page, la rubrique Mise en garde , et les descriptions de Brevet , Historique d'événement , Taxes périodiques et Historique des paiements devraient être consultées.

Historique d'événement

Description Date
Inactive : CIB attribuée 2018-03-18
Inactive : CIB expirée 2018-01-01
Inactive : CIB désactivée 2017-09-16
Inactive : CIB expirée 2017-01-01
Inactive : CIB attribuée 2017-01-01
Inactive : CIB attribuée 2017-01-01
Inactive : CIB enlevée 2015-04-16
Inactive : CIB enlevée 2015-04-16
Inactive : CIB enlevée 2015-04-16
Inactive : CIB en 1re position 2015-04-16
Inactive : CIB attribuée 2015-04-16
Inactive : CIB expirée 2009-01-01
Inactive : CIB enlevée 2008-12-31
Demande non rétablie avant l'échéance 2007-03-15
Inactive : Morte - Aucune rép. dem. par.30(2) Règles 2007-03-15
Inactive : Supprimer l'abandon 2006-04-18
Inactive : Abandon. - Aucune rép dem par.30(2) Règles 2006-03-15
Inactive : CIB de MCD 2006-03-12
Inactive : CIB de MCD 2006-03-12
Inactive : Abandon. - Aucune rép. à lettre officielle 2006-02-03
Inactive : Renseignement demandé pour transfert 2005-11-03
Inactive : Dem. de l'examinateur par.30(2) Règles 2005-09-15
Inactive : Page couverture publiée 2005-08-25
Inactive : CIB attribuée 2005-08-16
Inactive : CIB attribuée 2005-08-16
Inactive : CIB en 1re position 2005-08-16
Inactive : CIB attribuée 2005-08-16
Inactive : CIB attribuée 2005-08-16
Inactive : CIB attribuée 2005-08-16
Demande reçue - nationale ordinaire 2005-07-26
Lettre envoyée 2005-07-26
Lettre envoyée 2005-07-26
Exigences applicables à une demande divisionnaire - jugée conforme 2005-07-26
Exigences relatives à une correction du demandeur - jugée conforme 2005-07-26
Demande reçue - divisionnaire 2005-07-13
Exigences pour une requête d'examen - jugée conforme 2005-07-13
Toutes les exigences pour l'examen - jugée conforme 2005-07-13
Demande publiée (accessible au public) 1999-03-25

Historique d'abandonnement

Il n'y a pas d'historique d'abandonnement

Taxes périodiques

Le dernier paiement a été reçu le 2006-08-21

Avis : Si le paiement en totalité n'a pas été reçu au plus tard à la date indiquée, une taxe supplémentaire peut être imposée, soit une des taxes suivantes :

  • taxe de rétablissement ;
  • taxe pour paiement en souffrance ; ou
  • taxe additionnelle pour le renversement d'une péremption réputée.

Veuillez vous référer à la page web des taxes sur les brevets de l'OPIC pour voir tous les montants actuels des taxes.

Historique des taxes

Type de taxes Anniversaire Échéance Date payée
Taxe pour le dépôt - générale 2005-07-13
TM (demande, 3e anniv.) - générale 03 2001-08-31 2005-07-13
Requête d'examen - générale 2005-07-13
TM (demande, 5e anniv.) - générale 05 2003-09-02 2005-07-13
TM (demande, 2e anniv.) - générale 02 2000-08-31 2005-07-13
TM (demande, 7e anniv.) - générale 07 2005-08-31 2005-07-13
Enregistrement d'un document 2005-07-13
TM (demande, 4e anniv.) - générale 04 2002-09-03 2005-07-13
TM (demande, 6e anniv.) - générale 06 2004-08-31 2005-07-13
TM (demande, 8e anniv.) - générale 08 2006-08-31 2006-08-21
Titulaires au dossier

Les titulaires actuels et antérieures au dossier sont affichés en ordre alphabétique.

Titulaires actuels au dossier
AT&T WIRELESS SERVICES, INC.
AT&T WIRELESS SERVICES, INC.
Titulaires antérieures au dossier
SIAVASH ALAMOUTI
VAHID TAROKH
Les propriétaires antérieurs qui ne figurent pas dans la liste des « Propriétaires au dossier » apparaîtront dans d'autres documents au dossier.
Documents

Pour visionner les fichiers sélectionnés, entrer le code reCAPTCHA :



Pour visualiser une image, cliquer sur un lien dans la colonne description du document. Pour télécharger l'image (les images), cliquer l'une ou plusieurs cases à cocher dans la première colonne et ensuite cliquer sur le bouton "Télécharger sélection en format PDF (archive Zip)" ou le bouton "Télécharger sélection (en un fichier PDF fusionné)".

Liste des documents de brevet publiés et non publiés sur la BDBC .

Si vous avez des difficultés à accéder au contenu, veuillez communiquer avec le Centre de services à la clientèle au 1-866-997-1936, ou envoyer un courriel au Centre de service à la clientèle de l'OPIC.


Description du
Document 
Date
(aaaa-mm-jj) 
Nombre de pages   Taille de l'image (Ko) 
Description 1998-08-31 13 444
Abrégé 1998-08-31 1 19
Revendications 1998-08-31 1 16
Dessins 1998-08-31 2 30
Dessin représentatif 2005-08-24 1 7
Page couverture 2005-08-25 1 46
Accusé de réception de la requête d'examen 2005-07-26 1 175
Courtoisie - Lettre d'abandon (R30(2)) 2006-05-24 1 166
Correspondance 2005-07-26 1 40
Correspondance 2005-11-03 1 15