US 2010.004O166A1 (19) United States (12) Patent Application .

1y ago
10 Views
2 Downloads
1.81 MB
30 Pages
Last View : 2d ago
Last Download : 3m ago
Upload by : Lucca Devoe
Transcription

US 2010.004O166A1 (19) United States (12) Patent Application Publication (10) Pub. No.: US 2010/0040166 A1 XN et al. (54) (43) Pub. Date: SYSTEMIS AND METHODS FORTRAINING SEQUENCE SELECTION, TRANSMISSION AND RECEPTION (75) Related U.S. Application Data (60) Provisional application No. 61/089,712, filed on Aug. 18, 2008. YAN XIN, Kanata (CA); HUAN WU, Kanata (CA); SHOUXING QU, Kanata (CA) Correspondence Address: Smart & Biggar Inventors: P.O.Box 2999, Station D, 900-55 Metcalfe Street Ottawa, ON K1P 5Y6 (CA) (73) Assignee: Feb. 18, 2010 RESEARCH IN MOTION LIMITED, WATERLOO (CA) (21) Appl. No.: 12/542,995 (22) Filed: Aug. 18, 2009 Publication Classification (51) Int. C. H04L 25/03 (2006.01) H04L 27/00 (2006.01) H04B 7/02 (2006.01) (52) U.S. Cl. . 375/267; 375/295; 375/296 ABSTRACT (57) Methods of training sequence selection are provided that involve optimization in terms of SNR degradation. Various sets of training sequences produced using the methods, and transmitters and receivers encoded with Such sequences are provided. Training Sequence Repository Speech/ Channel EnCOding Burst ASSembling QPSK modulation Burst ASSembling Rotation Amplifier

Patent Application Publication GSM Feb. 18, 2010 Sheet 1 of 14 900 US 2010/0040166 A1 1OO 935-96.0 MHz 124 Channels (200 kHz) 1-102 DOWnlink S SEAN 200 kHz Uplink - - - “. 1 bit 26 bits 1-106 4,615 mS GSM Time-slot (Normal Burst) 57 bits 1-104 Time GSM TDMA frame (8 slots) - 7 -. - 3 bits aelS 1 bit Time Slot 156.25 bits isis 1-108 57 bits 3 bits 825 bits 577 us F.G. 1

Patent Application Publication y -OO -O -O v- w w y w - -w y OO - - O. O. v.- v- w Feb. 18, 2010 Sheet 2 of 14 t- O O - O O - - - -O - O - O O. O. O. O. O. O. v.- v -y - - - w O v O. O -OO - -O - O O. O. O - - OO y O O O O. O. O. O. O - O. O. O. O. O. O. O. O. - -v O. O. O. O. - O -O -Y -v O. O - - O. O. O. O. v O. W. v O. O. O. t- O O O - - O - O. O. O. O. v.- O O. O. y - O O. v.- O O - O y- O v- O - O - O O. V. O. O. O. O. O. O O. O. v. -O -O v- w OO w - - - O. O. O. O. O - - - O O. O. -O -O v - - - O W. O. O. O. O O - - -O - - - v W. O. O. O. O. O. t- O O - O O - - O. O. v.- v Ov y v - O C. - O O. - O - O y- - - - - - - O y - - -OO - O. O. v.- y- y- - - - O. v.- O - O - y- v- O - O O. O. O. ' y ' ', O y O O -OO - - - - -O - O - - - O O. O. O. O - - y- O - w y - - O O - O O. v.- - O O O. O. O. - O O O - O O. O. O - O O - -OO - -O y y - O O. O. O - - US 2010/0040166 A1 t- O - O O O - - O. O. v.- v- O - O - OO v- w O. O. O. O. O. O - - O O. O. O. O. O. O. O. w - -O O - CN CO S. L. co N. O - CN CO S. L. co N. g

Patent Application Publication v Feb. 18, 2010 Sheet 3 of 14 US 2010/0040166 A1 - - O CO - - C C C O. O. -O -O - O -O OO -O O - -O v ve O OO - - S v O O. - - - - - - O O. y C C y - - - -O - - O O - -OO -O - C - - O OC O - CO - - - O C - C - C C C - O O - en cost Loco N Co O -C -O - -OO C O - - -C - O -O - -O - OC - -O -C y - O O. O. O. O. O. Ore C v. v. C. Over C - C - C C C C O - CO - O - O - C C - - O O. O. y - -O - -O O. O. O. O. O. O. O. O. N 2e-sesses & s

Patent Application Publication Feb. 18, 2010 Sheet 4 of 14 US 2010/0040166 A1 y - O - O - CO C C C -C C C C C v -C - - - - - - -O - C C - C - C. C. - - -OO -O C - O -OC C C C - - - - - CO - - -O -O -O O C - C - - C. C. - - OC C C C - O - OC -C - O - C -OO v. C. v. C. v O - in cd r - C ve - - - - - -O -O -O CC - C - - C O - OC C C C C CO - - C - O OO -O - - - C C C -C C - s C C - C C - C C - - -O -C -C C C C -C - 2e-sesses & 5 to do n od

Patent Application Publication Feb. 18, 2010 Sheet 5 of 14 US 2010/0040166 A1 O - - O - - O O. C - C - C - -C s - - - d - - - t- - - O - O O. O. -O -O - -O - - O - -O - C OO - O - O O OO O - - - O CO CO - - O - - O COO - O ye v O. O. v. C. -O - - -O -O C O C - C C - - - - en cost to co N Co Nn d - - - - - OO OO C OOO - - - - - CO CO - O O - OOOOO - O - - O O. O. - O C O C - - O - C - on cost Loco No 1 C - O - OC - O ye OC v O. v. y - O - O - - O C - - - -O - C E O O. O. C. OOOOOOOO S. 2-sorces s S.

Patent Application Publication Feb. 18, 2010 Sheet 6 of 14 US 2010/0040166 A1

Patent Application Publication Feb. 18, 2010 Sheet 7 of 14 US 2010/0040166 A1 8"OIH

Patent Application Publication Feb. 18, 2010 Sheet 8 of 14 H I *5) V6 US 2010/0040166 A1

Patent Application Publication Feb. 18, 2010 Sheet 9 of 14 US 2010/0040166 A1 1OO Training Sequence Repository User A Speech. Channel EnCOding Speech. Channel data EnCOding Burst ASSembling QPSK Phase RF modulation ROtation Amplifier Burst ASSembling FIG. 10A

Patent Application Publication Feb. 18, 2010 Sheet 10 of 14 US 2010/0040166 A1 Training Sequence Repository Recovered t ataA Speech ESAT Assembling Demodulation e Channel Burst De- QPSK A. Equalizer DARP . Channel Timing Estimation Phase Derotation Training Sequence Repository ReCOWered USer B data Speech Channel Burst DeEnCOding Assembling QPSK Demodulation Equalizer DARP . Channel Timing Processing F.G. 10B Estimation Phase Der Otation

Patent Application Publication Feb. 18, 2010 Sheet 11 of 14 US 2010/0040166 A1 1OO Training Sequence Repository User A Speech Channel EnCOding Burst ASSembling GMSK Modulation RF Speech User B Channel data EnCOding Amplifier Burst Assembling GMSK Modulation Phase ROtation F.G. 11A

Patent Application Publication Feb. 18, 2010 Sheet 12 of 14 US 2010/0040166 A1 Training Sequence Repository ReCOYered User A data Speech/ Channel EnCOding Burst De- GMSK Assembling Demodulation Equalizer DARP Processing Timing Estimation Channel Training Sequence Repository ReCOYered User B data Speech/ Channel EnCOding Burst De- GMSK Assembling Demodulation Equalizer DARP Timing Channel Phase Processing E Derotation F.G. 11B

Patent Application Publication Feb. 18, 2010 Sheet 13 of 14 US 2010/0040166 A1 1OO Training Sequence Repository USer A Speech Channel EnCOding Burst GMSK RF Assembling Modulation Amplifier Speech Burst GMSK RF User B A. Assembling Modulation Amplifier data Training Sequence Repository 1OO FIG. 12A

Patent Application Publication Recovered User A data Speech Channel EnCOding Burst De- Feb. 18, 2010 Sheet 14 of 14 GMSK US 2010/0040166 A1 Joint Channel Assembling Demodulation Estimation I Detection Training Sequence Repository Recovered User B data Speech Channel BurSt De- GMSK Joint Channel EnCOding Assembling Demodulation Estimation I Detection F.G. 12B

US 2010/0040166 A1 SYSTEMS AND METHODS FORTRAINING SEQUENCE SELECTION, TRANSMISSION AND RECEPTION RELATED APPLICATION 0001. This application claims the benefit of prior U.S. Provisional Application No. 61/089,712 filed Aug. 18, 2008 hereby incorporated by reference in its entirety. FIELD OF THE DISCLOSURE 0002 The disclosure relates to systems and methods for training sequence selection, transmission and reception. BACKGROUND 0003 Mobile communication systems employ signal pro cessing techniques against the impact of time variant and frequency selective mobile radio channels to improve the link performance. Equalization is used to minimize intersymbol interference (ISI) caused by multipath fading in frequency selective channels. Since the mobile radio channel is random and time varying, an equalizer needs to identify the time varying characteristics of the mobile channel adaptively through training and tracking. Time division multiplex access (TDMA) wireless systems such as Global System for Mobile communications (GSM) transmit data in fixed-length timeslots, and a training sequence is included in the timeslot (burst), which is designed to allow the receiver to detect timing information and to obtain channel coefficients through channel estimation for further channel equalization. 0004 GSM is a successful digital cellular technology being deployed worldwide. Currently, GSM networks pro vide both voice and data service for billions of subscribers and are still expanding. The access scheme of GSM is TDMA. As illustrated in FIG. 1, in the 900 MHz frequency band 100, the downlink 102 and uplink 104 are separated, and each has a 25 MHz bandwidth including 124 channels. Carrier sepa ration is 200 kHz. ATDMA frame 106 consists of 8 timeslots 108 corresponding to one carrier frequency. The duration of a timeslot is 577 us. For a normal burst, one GSM timeslot includes 114 data bits, 26 training sequence bits, 6 tail bits, 2 stealing bits, and 8.25 guard period bits. Currently, only one user's speech is transmitted in each timeslot. 0005 Eight training sequences for GSM normal bursts are defined in the 3GPP specification (see TS 45.002, “GERAN: Multiplexing and multiple access on the radio path”) and are widely used in practice for burst synchronization and channel estimation in current GSM/EDGE Radio Access Network (GERAN) systems. 0006 With the increase in the number of subscribers and Voice traffic, great pressure is added on GSM operators espe cially within countries with dense population. In addition, efficient use of hardware and spectrum resource is desired as Voice service prices drop. One approach to increasing Voice capacity is to multiplex more than one user on a single timeslot. 0007 Voice services over Adaptive Multi-user channels on One Slot (VAMOS) (see GP-08 1949, 3GPP Work Item Description (WID): Voice services over Adaptive Multi-user channels on One Slot) (note: Multi-User Reusing-One-Slot (MUROS) (see GP-072033, “WID: Multi-User Reusing One-Slot) is the corresponding study item)) is an ongoing work item in GERAN that seeks to increase voice capacity of the GERAN in the order of a factor of two per BTS transceiver Feb. 18, 2010 both in the uplink and the downlink by multiplexing at least two users simultaneously on the same physical radio resource, i.e., multiple users share the same carrier frequency and the same timeslot. Orthogonal Sub Channel (OSC) (see GP-070214, GP-071792, “Voice capacity evolution with orthogonal sub channel'), co-TCH (see GP-071738, “Speech capacity enhancements using DARP) and Adaptive Symbol Constellation (see GP-080114 Adaptive Symbol Constella tion for MUROS (Downlink)') are three MUROS candidate techniques. 0008. In the uplink of OSC, co-TCH, and Adaptive Sym bol Constellation two users sharing the same timeslot employ GMSK (Gaussian minimum shift keying) modulation with different training sequences. The base station uses signal processing techniques such as diversity and/or interference cancellation to separate two users’ data. Similar to the uplink, in the downlink of co-TCH, two different training sequences are used for DARP (Downlink Advanced Receiver Perfor mance) capable mobiles to separate two users. In the down link of OSC or Adaptive Symbol Constellation, two subchan nels are mapped to the I- and Q-subchannels of a QPSK-type or Adaptive QPSK (AQPSK-type) modulation in which the ratio of I-subchannel and Q-subchannel can be adaptively controlled. Two Subchannels use different training sequences as well. 0009 FIG. 2 lists eight GSM training sequence codes of 26 bits, each of which has a cyclic sequence structure, i.e., the reference sequence of 16 bits is in the middle and 10 guard bits (5 guard bits are in each side of the reference sequence). The most significant 5 bits and least significant 5 bits of the reference sequence are copied and arranged to append to and precede the reference sequence, respectively. The guard bits can cover the time of intersymbol interference and make the training sequence resistant to time synchronization errors. Each GSM training sequence has ideal periodic autocorrela tion properties for non-zero shifts within -5, 5 when the 16-bit reference sequence is considered only. (0010. In GP-070214, GP-071792, “Voice capacity evolu tion with orthogonal Sub channel', a new set of eight training sequences of length 26 bits was proposed for OSC, in which each of new training sequences is optimized in cross-corre lation properties with the corresponding legacy GSM training sequence. The new sequences are listed in FIG. 3. It can be observed that these new training sequences do not preserve the cyclic sequence structure as the legacy GSM training Sequences. BRIEF DESCRIPTION OF THE DRAWINGS 0011 Embodiments of the application will now be described with reference to the attached drawings in which: 0012 FIG. 1 is a schematic diagram of a bandwidth allo cation and TDMA frame definitions for GSM; 0013 FIG. 2 is a table listing the legacy GSM training Sequences: 0014 FIG. 3 is a table containing a set of training sequences with optimized cross-correlation properties com pared to the legacy GSM training sequences; 0015 FIG. 4A is a table containing a set of training Sequences: 0016 FIG. 4B is a schematic diagram of a computer read able medium containing the training sequences of FIG. 4A; 0017 FIG. 5A is a table containing a set of training Sequences:

US 2010/0040166 A1 0018 FIG. 5B is a schematic diagram of a computer read able medium containing the training sequences of FIG. 5A; 0019 FIG. 6A is a table containing a set of training Sequences: 0020 FIG. 6B is a schematic diagram of a computer read able medium containing the training sequences of FIG. 6A: 0021 FIG. 7 depicts several sets used to define a set of training sequences; 0022 FIG. 8 is a flowchart of a first method of determining training sequences; 0023 FIG.9A is a flowchart of a first method of assigning training sequences; 0024 FIG.9B is a flowchart of a second method of assign ing training sequences: 0025 FIG. 10A is a block diagram of a transmitter for OSC downlink transmission; 0026 FIG. 10B is a block diagram showing a pair of receivers of OSC subchannels; 0027 FIG. 11A is a block diagram of transmitter of co TCH for downlink transmission; 0028 FIG. 11B is a block diagram of a pair of receivers of co-TCH downlink transmission; Feb. 18, 2010 correlations between sequences of a first training sequence set and a target training sequence set to produce a second training sequence set, optimizing cross correlations among sequences of the second training sequence set to produce a third training sequence set, optimizing cross-correlations between sequences of the third training sequence set and corresponding sequences of the target training sequence setto produce a fourth training sequence set; outputting the fourth training sequence set for use in a multi-user transmission system. 0032. Another broad aspect of the disclosure provides a computer implemented method comprising: optimizing cross-correlations between sequences among a first training sequence set to produce a second training sequence set, opti mizing cross-correlations between sequences of the second training sequence set and a target training sequence set to produce a third training sequence set, optimizing cross-cor relations between sequences of the third training sequence set and corresponding sequences of the target training sequence set to produce a fourth training sequence set; and outputting the fourth training sequence set for use in a multi-user trans mission system. 0033. Another broad aspect of the disclosure provides a computer readable medium encoded with a data structure, the data structure comprising: at least one training sequence from a first set of training sequences consisting of: Training Sequence O 1 O 1 1 1 1 O 0029 FIG. 12A shows a pair of transmitters of OSC or co-TCH for uplink transmission; and 1 O O 1 1 1 O 1 and at least one training sequence from a second set of train ing sequences consisting of Training Sequence O O 1 1 1 1 O O 0030 FIG.12B is a block diagram of a receiving apparatus composed of two receivers for receiving respective transmis sions from the pair of transmitters of FIG. 12A. DETAILED DESCRIPTION 0031. A broad aspect of the disclosure provides a com puter implemented method comprising: optimizing cross O 1 1 1 O 1 1 1 O 1 1 0 O O 1 O O 1 0 1 1 O 0 O 1 1 1 0 O O O 1 O O 0 O O O O O O O O O O O 1 1 O O 1 1 O 1 O 1 1 1 O O O O 1 1 O O O O 1 O O 0 O 1 O O 1 1 O 1 1 1 O 1 0 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 O O 1 O 1 O 0034. Another broad aspect of the disclosure provides a transmitter comprising: a signal generator configured togen erate a signal using a carrier frequency and time slots, with at least some time slots containing content for multiple receiv ers, the content for each receiver and each slot comprising at least a respective training sequence; the transmitter encoded with at least one training sequence from a first set of training sequences consisting of:

US 2010/0040166 A1 Feb. 18, 2010 Training Sequence O O O O O O O O 1 1 1 O 1 1 O 1 1 O O 1 1 O O O O 1 O O 1 O 1 O O 1 O 1 0 O O O O 1 O 1 1 O O 1 1 1 O 0 O O O O O 0 1 1 O 1 O 1 O 1 O 1 1 O 1 1 O 0 1 1 1 O 1 1 1 O 1 0 1 1 0 O O 1 0 1 1 1 1 O O 1 O 1 0 0 0 1 1 0 O 1 1 1 O 1 O 1 1 O O 0 O 1 O 1 1 O O 1 O 1 1 1 1 1 1 0 1 1 1 0 0 1 1 O 1 1 1 1 1 1 1 1 0 0 1 1 1 1 0 1 1 O 0 1 1 0 1 1 1 1 1 O 0 1 1 1 1 O 0 O 1 0 1 O 0 1 1 O 1 O 1 O 1 O 1 O O O 1 1 0 O 1 1 O O O 1 1 1 1 1 1 1 1 0 1 1 1 0 0 1 1 O 1 1 1 1 1 1 1 1 0 0 1 1 1 1 0 1 1 O 0 1 1 0 1 1 1 1 1 O 0 1 1 1 1 O 0 O 1 0 1 O 0 1 1 O 1 O 1 O 1 O 1 O O O 1 1 0 O 1 1 1 1 1 0 1 1 1 0 0 1 1 O 1 1 1 1 1 1 1 1 0 0 1 1 1 1 0 1 1 O 0 1 1 0 1 1 1 1 1 O 0 1 1 1 1 O 0 O 1 0 1 O 0 1 1 O 1 O 1 O 1 O 1 O O O 1 1 0 O 1 1 O O O 1 1 1 O O O O O 1 1 1 O O O O O 1 O 1 1 O O 0 1 1 1 1 1 1 1 1 1 O 0035 Another broad aspect of the disclosure provides a method comprising: for a timeslot on a carrier frequency which is to contain a multi-user signal: generating a multi user signal by combining a respective training sequence for each receiver of at least two receivers and a respective pay load for each receiver, wherein the respective training sequence for at least one of the multiple receivers comprises a first training sequence from a first set of training sequences consisting of: Training Sequence O O O O O O O O 1 1 1 O 1 1 O 1 1 O O 1 1 O O O O 1 O O 1 O 1 O O 1 O 1 0 O O O O 1 O 1 1 O O 1 1 1 O 0 O O O O O 0 1 1 O 1 O 1 O 1 O 1 1 O 1 1 O 0 1 1 1 O 1 1 1 O 1 0 1 1 0 O O 1 0 1 1 1 1 O O 1 O 1 0 0 0 1 1 0 O 1 1 1 O 1 O 1 1 O O 0 O 1 O 1 1 O O 1 O 1 1 1 O O O 1 1 1: and transmitting the signal. 0036) Another broad aspect of the disclosure provides a receiver comprising: at least one antenna; wherein the receiver is encoded with at least one training sequence from a first set of training sequences consisting of: Training Sequence O O O O O O O O 1 1 1 O 1 1 O 1 1 O O 1 1 O O O O 1 O O 1 O 1 O O 1 O 1 0 O O O O 1 O 1 1 O O 1 1 1 O 0 O O O O O 0 1 1 O 1 O 1 O 1 O 1 1 O 1 1 O 0 1 1 1 O 1 1 1 O 1 0 1 1 0 O O 1 0 1 1 1 1 O O 1 O 1 0 0 0 1 1 0 O 1 1 1 O 1 O 1 1 O O 0 O 1 O 1 1 O O 1 O 1 0037 and the receiver is further encoded with at least one training sequence of a second set of training sequences con sisting of: Training Sequence O O O O O 1 1 1 O O O O O 1 O 1 1 O O 0 1 1 1 1 1 1 1 1 1 0 O 0 1 O 1 1 O 1 1 O 1 0 1 1 1 O O 0

US 2010/0040166 A1 Feb. 18, 2010 -continued Training Sequence O O O 1 1 1 O 1 O 1 O O O 1 1 O 1 O O 0 O 1 1 O 1 1 0 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 O 0 1 0 1 O 1 1 1 0 O 1 0 1 1 1 0 O 0 1 O 1 1 O O O 0 O O O 1 O O O O O O O O 1 1 1 O 1 O 1 O O O 1 1 O 1 O O 0 O 1 1 O 1 1 0 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 O O 1 O 1 O 1 1 1 1 1 0 1 1 1 0 0 1 1 O 1 1 1 1 1 1 1 1 0 0 1 1 1 1 0 1 1 O 0 1 1 0 1 1 1 1 1 O 0 1 1 1 1 O 0 O 1 0 1 O 0 1 1 O 1 O 1 O 1 O 1 O O O 1 1 0 O 1 1 O O O 1 1 1 O O O O O O 1 1 O O 1 1 O 1 O 1 1 1 O O O O 1 1 O O O O 1 O O 0 O 1 O O 1 1 O 1 1 1 O 1 0 1 1 1 O 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 O 0038 and further wherein the receiver is configured to operate using a training sequence selected from one of the at least one training sequence from the first set of training sequences and the at least one training sequence from the second set of training sequences. 0039. Another broad aspect of the disclosure provides a method for a mobile device comprising: the mobile device having at least one training sequence from a first set of train ing sequences consisting of: Training Sequence O O O O O O O O 1 1 1 O 1 1 O 1 1 O O 1 1 O O O O 1 O O 1 O 1 O O 1 O 1 0 O O O O 1 O 1 1 O O 1 1 1 O 0 O O O O O 0 1 1 O 1 O 1 O 1 O 1 1 O 1 1 O 0 1 1 1 O 1 1 1 O 1 0 1 1 0 O O 1 0 1 1 1 1 O O 1 O 1 0 0 0 1 1 0 O 1 1 1 O 1 O 1 1 O O 0 O 1 O 1 1 O O 1 O 1 0040 the mobile device further having at least one training sequence of a second set of training sequences consisting of Training Sequence O O O O O O 1 1 O O 1 1 O 1 O 1 1 1 O O O O 1 1 O O O O 1 O O 0 O 1 O O 1 1 O 1 1 1 O 1 0 1 1 1 O 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 O 1 1 0 0 1 0 1 O O 0 1 1 1 1 0 O O 1 1 1 0 1 1 1 O 1 1 0 O 0 1 O O 1 0 1 1 O O O 1 1 1 0 O O O 1 O O 0 O O O O O 1 1 O O 1 O 1 O: and operating using a training sequence selected from one of the at least one training sequence from the first set of training sequences and the at least one training sequence from the second set of training sequences. 0041 Another broad aspect of the disclosure provides use of a training sequence from a set of training sequences con sisting of: Training Sequence O 1 1 O O O 1 O O O 1 O O 1 O O 1 1 1 1 0 1 0 1 1 O 1 O 1 1 1 1 0 1 0 O 1 1 0 1 1 1 0 1 1 1 O O O O 1 1 O 1 O O O O O 1 O 1 1 0 O O 1 1 1 0 1 1 1 0 1 1 O O

US 2010/0040166 A1 Feb. 18, 2010 -continued Training Sequence 1 1 O 1 1 as a training sequence in cellular radio telephony. 0042. The degradation of signal-to-noise ratio (SNR) (see B. Steiner and P. Jung, "Optimum and suboptimum channel estimation for the uplink CDMA mobile radio systems with joint detection’, European Transactions on Telecommunica tions, Vol. 5, January-February, 1994, pp.39-50, and M. Puk kila and P. Ranta, “Channel estimator for multiple co-channel demodulation in TADM mobile systems'. Proc. of the 2nd EPMC, Germany) is used herein to evaluate the correlation properties of training sequences and/or to design new training sequences. In MUROS/VAMOS, the interference comes from the other subchannel of the same MUROS/VAMOS pair in the same cell and also from co-channel signals of other cells. 1 1 1 O O 1 O 1 1 O O 1 1 1 1 1 1 1 1 O O 1 O O 1 (4) l N-L-l 4ii if is L. L is 2L or 2. S1,n L-is?.n 2L-is S S, S is a (N-L 1)x2L matrix and S. (m 1,2) is defined Sn Sn, L Sm. LF1 . SmN Sn.2 Sm3 Sm.1 Sn.2 (1) Sn,N-L 2 Sm.N-L 1 which is correspondent to the training sequence (S1, S2, . . . Six) (note that S, and S can be constructed with two different training sequences, respectively, either from the same training sequence set or from different training sequence sets). 0044 The least-squared error estimate of the channel is: h (S,S) 'St. (2) 0045. The SNR degradation of training sequences is defined as: dsx -10-logo(1 tr(SS))) (dB) (3) where trX) is the trace of matrix X and Q-q22, SS is a correlation matrix including the autocorrelations of S and S. and cross-correlation between S and S with calculation of entries as: is L. L is 2L N-L-l X. S2n 2L-is2n 2L-i, if L is 2L, L i s2L. l 0046 Based on definitions (1)–(3), the pairwise SNR deg radation values between GSM training sequences are calcu lated and listed in Table 1. TABLE 1 Pairwise SNR degradation values of existing GSM training sequences (in dB co-channel or MUROS/VAMOS signals with L-tap indepen as below O O 1 1 1 X. S1,n-L-isin-L-j, if is L, is L. 0043. The degradation in SNR can be determined as fol h). Let the received signal samples at the receiver be: y–Sh' n where the noise vector is n (n, n.,., n-) and O 1 1 O O N-L-l lows. Let a training sequence of length N be S {s1, s2, ., S}, Se-1, 1}, n 1, . . . , N. Consider two synchronous dent complex channel impulse responses h (h, he . . . h), m 1, 2. The joint channel impulse response is h (h, O 1 O 1 O TSCH TSCH O 1 2 3 4 5 6 7 O 1 2 3 4 S 6 7 6.91 3.24 3O8 4.75 4.87 4.85 3.88 6.91 3.24 3.08 3.08 2.72 6.91 4.06 4.99 4.79 6.91 4.75 SO3 SS7 4.06 4.87 4.70 3.97 4.99 11.46 4.85 4.70 S.12 4.79 S.87 3.73 3.88 3.67 7.16 6.91 6.11 SO3 S.72 3.08 2.72 SO3 4.7O 4.70 3.67 6.91 SS7 3.97 S.1 2 7.16 11.46 S.87 6.11 3.73 S.O3 S.72 0047. The average, minimum and maximum pairwise SNR degradation values between different GSM training sequences equal 5.10 dB, 2.72 dB and 11.46 dB, respectively. Table 1 demonstrates that some GSM training sequence pairs result in reasonable SNR degradation values while some GSM training sequence pairs are strongly correlated. It seems not to be suitable to apply all existing GSM training sequences to MUROS/VAMOS. It would be desirable to have new training sequences for MUROS/VAMOS, each having very good autocorrelation properties and very good cross correlation properties with the corresponding GSM training sequence. It would also be desirable to reduce the effects of co-channel interference, cross-correlation properties for any pairs of new training sequences and cross-correlation prop erties for any pairs of new training sequences and legacy GSM training sequences through further optimization. 0048 Tables 2 and 3 present the pairwise SNR degrada tion performance of the sequences of FIG. 3 between any pairs of these sequences and GSM training sequences, and between any pairs of these sequences themselves.

US 2010/0040166 A1 Feb. 18, 2010 indicated at 120 in a data structure 122 stored on a computer readable medium 124. The search was conducted as follows: TABLE 2 Pairwise SNR degradation values between any pairs of sequences of FIG. 3 and GSM training sequences (in dB). TSCH TSCH O 1 2 3 4 5 6 7 O 1 2 3 4 5 6 7 2.14 4.87 3.20 2.59 2.71 2.33 2.78 2.50 3.38 2.13 3.03 3.30 2.55 2.77 2.68 3.93 3.2O 2.59 2.14 4.87 240 2.74 2.69 2.79 3.03 3.30 3.38 2.13 2.78 2.86 2.70 2.41 2.43 2.58 2.26 2.48 2.05 2.21 2.26 2.21 2.31 2.36 2.34 2.31 2.38 2.11 2.93 2.31 2.25 2.26 2.51 2.53 2.24 2.41 2.06 2.20 2.71 2.79 2.38 2.29 2.41 2.38 2.28 2.12 0054 1) start with first GSM training sequence; 0055 2) exhaustively search through set of all candidate sequences for the sequence with the lowest SNR degradation, and add the sequence found to the new set, and remove the sequence found from the candidate set; 0056 3) repeat steps 1 and 2 for sequences that are best paired with each of the second through eighth GSM training Sequences. 0057. Shown in FIG. 4B is a computer readable medium generally indicated at 128 upon which is stored a data struc ture 125. The data structure 125 includes the set of standard TABLE 3 GSM training sequences 126, and includes the training sequence set A 127. There is a one to one correspondence between the GSM training sequences 126 and the training sequence set A 127. Pairwise SNR degradation values between any pairs of Sequences of FIG. 3 (in dB). TABLE 4 Pairwise SNR degradation values between sequences in TSCH FIG. 4A and GSMTSCs (in dB). TSCH O 1 2 3 4 5 6 7 2.37 2.35 2.52 2.52 2.74 2.37 3.23 3.23 3.41 3.10 2.80 3.49 2.69 3.71 3.66 2.32 2.93 2.86 6.89 3.71 3.33 3.64 2.60 3.17 2.71 3.79 3.93 3.32 TSCH O 1 2 3 4 5 6 7 2.37 2.35 2.52 3.23 2.80 2.32 3.64 2.52 2.74 3.23 3.49 2.93 2.60 2.37 3.41 2.69 2.86 3.17 3.10 3.71 6.89 2.71 3.66 3.71 3.79 3.33 3.93 3.32 0049. In Table 2, the pairwise SNR degradation values in the diagonal of the table are the results of a sequence of FIG. 3 and a corresponding GSM training sequences. In this docu ment, the corresponding sequences are defined as two sequences with the same training sequence number in two separate sequence tables. The average of the diagonal values in Table 2 equals 2.11 dB. The average, minimum and maxi mum SNR degradation values between any pairs of sequences of FIG.3 and GSMTSCs are 2.63 dB, 2.05 dB and 4.87 dB, respectively. 0050 Table 3 shows that the average, minimum and maxi mum SNR degradation values between any pairs of different sequences of FIG. 3 are 3.19 dB, 2.32 dB and 6.89 dB, respectively. 0051. Both Tables 2 and 3 demonstrate that the average pairwise SNR degradation performance between any pairs of sequences of Table 2 and GSM training sequences, and any pairs of different sequences of Table 2 is good. However, the peak pairwise SNR degradation values shown in Table 2 and 3 may affect co-channel interference cancellation with the TSCH O 1 2 3 4 5 6 7 O 1 2 3 4 S 6 7 2.09 2.60 4.10 2.67 2.47 21S 2.38 2.SS 3.05 2.09 3.08 3.18 2.53 21S 230 2.72 4.10 2.67 2.09 2.60 2.27 2.64 2.48 2.32 3.08 3.18 3.05 2.09 2.69 2.53 2.50 2.25 2.88 2.56 2.36 2.62 2.04 2.18 2.28 2.37 2.52 2.44 2.80 2.37 2.34 2.07 2.42 2.51 2.49 2.57 2.57 2.66 226 2.42 2.05 2.19 2.64 2.67 2.35 2.19 2.27 2.22 2.24 2.07 0058. The average, minimum and maximum SNR degra dation values between any pairs of sequences in FIG. 4A and GSM training sequences are 2.52 dB, 2.04 dB and 4.10 dB. respectively. The average of the diagonal values in Table 4 equals 2.07 dB. Based on results shown in Table 4, the new training sequences of FIG. 4A are well-designed to be paired with the corresponding GSM training sequences. 0059 Table 5 demonstrates SNR degradation values between sequences listed in FIG. 4A. The average, minimum and maximum pairwise SNR degradation values between sequences best-paired with GSM training sequences are 3.04 dB, 2.52 dB and 4.11 dB, respectively. TABLE 5 Pairwise SNR degradation values between sequences in FIG. 4A (in dB). TSCH introduction of MUROS/VAMOS. New Training Sequences for MUROS/VAMOS 0052 A. Training Sequences Best-Paired with the Corre sponding GSMTSCs 0053. In an embodiment of the disclosure, a set of eight sequences of length 26 are obtained, through computer search, which are best-paired with the corresponding GSM training sequences, respectively, in terms of SNR degradation calculated with (1)–(3). FIG. 4A shows these best-paired sequences, referred to as Training Sequence Set A, generally TSCH O O 1 2 3 4 S 6 7 2.73 2.93 2.52 2.52 2.85 2.56 4.11 1 2 3 4 5 6 7 2.73 2.93 2.52 2.52 2.90 2.73 2.52 3.29 3.76 2.58 2.85 3.15 2.92 3.17 2.69 2.56 2.87 3.58 2.80 3.73 3.64 4.11 2.76 3.09 2.95 4.11 2.70 2.89 - 2.52 2.90 3.29 3.15 2.87 2.76 2.73 3.76 2.92 3.58 3.09 2.58 3.17 2.80 2.95 2.69 3.73 4.11 3.64 2.7O 2.89

US 2010/004016

GSM 1OO 900 935-96. MHz 124 Channels (200 kHz) 1-102 DOWnlink S SEAN aelS 200 kHz 7 Uplink 1-104 - -. Time - GSM TDMA frame (8 slots) - 1-106 - ". 4,615 mS - GSM Time-slot (Normal Burst) isis 1-108 3 bits 57 bits 1 bit 26 bits 1 bit 57 bits 3 bits 825 bits F.G. 1 577 us Time Slot 156.25 bits

Related Documents:

8 University of Wisconsin, USA (BT) 1 2010 9 University of Texas, Arlington, USA (BT) 1 2010 10 I.I.T. (ChE) 8 2010 11 N.I.T. (ChE) 1 2010 12 Jadavpur University, Kolkata (ChE) 1 2010 13 University of Calcutta (ChE) 2 2010 14 University of Calabria, Italy (ChE) 1 2010 15 University of Uim, Germany (ChE) 1 2010 16 LeHigh University, USA (ChE) 1 2010

8 2007 – 2010 Camry (Sport Pedal) 07/02/2010 7/16/2010 9 2005 – 2010 Tacoma, 2009 – 2010 Venza 07/16/2010 Late July 2010 10 2003 – 2009 4Runner 02/24/2011 Early April, 2011 11 2006 – 2010 Rav4 Early April 2011 Mid-April 2011

Action as Outlined) Models: 2007-2009 Buick Lacrosse, Allure (Canada Only) 2007-2010 Buick Enclave 2010 Buick Lacrosse 2007-2010 Cadillac CTS Sedan, CTS Sport Wagon, SRX, STS 2008-2010 Chevrolet Equinox, Malibu 2009-2010 Chevrolet Traverse 2010 Chevrolet Camaro 2007-2010 GMC Acadia 2007-2010 Pontiac G6 2008-2009 Pontiac G8, Torrent

CMA CGM Musset 6,500 March 12, 2010 CMA CGM Nerval 6,500 May 17, 2010 YM Mandate 6,500 May 19, 2010 Hanjin Buenos Aires 3,400 May 27, 2010 CMA CGM Rabelais 6,500 July 2, 2010 Hanjin Santos 3,400 July 6, 2010 CMA CGM Racine 6,500 August 16, 2010 YM Maturity 6,500 August 18, 2010

Ashley Harris 2010 Blake Hartsook 2010 Denira Hasanovic 2010 Ella Heinicke 2010 Amber Heller 2010 Shelby Hellmer 2010 Keith Hernandez 2010 Dylan Hiatt 2010

Plants that produce dermatitis, photosensitivity and liver damage Bryan L. Stegelmeier. ADVS 5860. PPRL 2010. PPRL 2010. Festuca arundinacea. Neotyphodium coenophialum. PPRL 2010. PPRL 2010. PPRL 2010. PPRL 2010. PPRL 2010 Primary Plant-Induced Skin Lesions. PPRL 2010 Contact Dermatitis: Toxicodendron diversilobum

PACIFIC COAST HIGHWAY P.8 United States THE ETERNAL WEST P.14 United States ROUTE 66 P.22 United States THE BLUES HIGHWAY P.24 United States THE KEYS: FLORIDA FROM ISLAND TO ISLAND P.26 United States ROUTE 550: THE MILLION DOLLAR HIGHWAY P.34 United States HAWAII: THE ROAD TO HANA P.42 United States OTHER

The packet includes problems from different areas of the 2nd grade curriculum. It is expected that the students are entering into 3rd grade having mastered these areas. Particular areas of strength and growth are noted in your child’s report card. If your child completes the packet in June and doesn’t solve any math problems for the