Senior Fitness - Exercise and Nutrition for Aging Men and Women
FREE Article Feed for your website.
Home Ownership Magazine
Party Planning Information
Article Marketing Resources
Bio-Medical Research Article Database
Informative Articles on Life, Love and Happiness
Tutorials on Business to Writing
Famous Quotes from Famous People
Song Lyric Information
New US Patent Information
Comprehensive List of Content by Category
Online Auctions and Shopping Related Articles
Article Search
Most Recent Articles
Title: Method and system for object level software testing
Patent Number: 7,334,219 Issued on 02/19/2008 to Cebula,   et al.

Title: Protective cover for a golf club
Patent Number: 6,874,627 Issued on 04/05/2005 to Maeng

Title: Dual beam FTIR methods and devices for use in analyte detection in samples of low transmissivity
Patent Number: 7,079,252 Issued on 07/18/2006 to Debreczeny,   et al.

Title: System and process for presenting search results in a histogram/cluster format
Patent Number: 7,334,195 Issued on 02/19/2008 to Gemmell,   et al.

Title: Object lifting and moving device
Patent Number: 6,854,751 Issued on 02/15/2005 to Halke

Title: Method and apparatus for maintaining IP connectivity with a radio network
Patent Number: 7,068,669 Issued on 06/27/2006 to Abrol,   et al.

Title: Method and apparatus for scalable handling of non-tree structures in parser tree reconstruction
Patent Number: 7,051,321 Issued on 05/23/2006 to Kong

Title: Electrical connector assembly
Patent Number: 6,854,987 Issued on 02/15/2005 to Wu

Title: Nonvolatile memory with independent access capability to associated buffer
Patent Number: 7,334,080 Issued on 02/19/2008 to Takase,   et al.

Title: Methods for identifying modulators of N-type ion channel inactivation
Patent Number: 7,049,083 Issued on 05/23/2006 to Young,   et al.

Title: Expansion ring for mass transfer column and method employing same
Patent Number: 7,055,810 Issued on 06/06/2006 to Gage

Title: High-pressure shaping system
Patent Number: 7,313,940 Issued on 01/01/2008 to Gomez

Title: Method and device for manufacturing coiled electrode group
Patent Number: 6,936,080 Issued on 08/30/2005 to Murata,   et al.

Title: Evanescent waveguide couplers
Patent Number: 7,333,690 Issued on 02/19/2008 to Peale,   et al.

Title: Method and apparatus for identifying one or more devices having faults in a communication loop
Patent Number: 7,007,191 Issued on 02/28/2006 to Riedl,   et al.

Title: Water pollution trap with clay collector
Patent Number: 6,936,163 Issued on 08/30/2005 to Use,   et al.

Title: Method and apparatus for health and disease management combining patient data monitoring with wireless internet connectivity
Patent Number: 6,936,007 Issued on 08/30/2005 to Quy

Title: Worm providing storage system
Patent Number: 7,334,079 Issued on 02/19/2008 to Yagawa

Title: Directionally cloned random cDNA expression vector libraries, compositions and methods of use
Patent Number: 6,808,906 Issued on 10/26/2004 to Shen,   et al.

Title: Highly available transaction processing
Patent Number: 7,058,853 Issued on 06/06/2006 to Kavanappillil,   et al.

Title: Light irradiation type thermal processing apparatus
Patent Number: 6,856,762 Issued on 02/15/2005 to Kusuda,   et al.

Title: Mobile data device and method of locating mobile data device
Patent Number: 6,868,074 Issued on 03/15/2005 to Hanson

Title: Photoelectric conversion device providing advantageous readout of two-dimensional array of transistors
Patent Number: 6,980,243 Issued on 12/27/2005 to Miyawaki,   et al.

Title: Capillary for wire bonding and method of wire bonding using it
Patent Number: 7,051,915 Issued on 05/30/2006 to Mutaguchi

Title: Nitride semiconductor device
Patent Number: 6,849,864 Issued on 02/01/2005 to Nagahama,   et al.

Title: Translator terminal for two or more wireless networks
Patent Number: 7,039,800 Issued on 05/02/2006 to Decker,   et al.

Title: Process for converting synthesis gas in reactors that are arranged in series
Patent Number: 6,921,778 Issued on 07/26/2005 to Minkkinen,   et al.

Title: Method for adjusting a phase angle of a phase modifier of a transmitting device
Patent Number: 7,020,216 Issued on 03/28/2006 to Lipp

Title: Articulating and locking mechanism for farm implement chassis
Patent Number: 7,021,394 Issued on 04/04/2006 to Marchesan

Title: Image display medium and image recording apparatus
Patent Number: 6,922,204 Issued on 07/26/2005 to Kanazawa,   et al.

Title: Vehicle stability enhancement control
Patent Number: 6,856,885 Issued on 02/15/2005 to Lin,   et al.

Title: Method and system for analyzing low-coherence interferometry signals for information about thin film structures
Patent Number: 7,321,431 Issued on 01/22/2008 to De Groot

Title: Method and apparatus for determining embedded runout correction values
Patent Number: 7,054,096 Issued on 05/30/2006 to Sun,   et al.

Title: Thermoplastic polyamide moulding compositions
Patent Number: 7,312,263 Issued on 12/25/2007 to Schmid,   et al.

Title: Power electronic system with passive cooling
Patent Number: 7,106,588 Issued on 09/12/2006 to Oberlin,   et al.

Title: Rotational stage with vertical axis adjustment
Patent Number: 6,917,420 Issued on 07/12/2005 to Traber

Title: Thermally energy efficient vehicle
Patent Number: 6,877,786 Issued on 04/12/2005 to Gielda

Title: Sulfur substituted sulfonylaminocarboxylic acid N-arylamides, their preparation, their use and pharmaceutical preparations comprising them
Patent Number: 6,881,735 Issued on 04/19/2005 to Schindler,   et al.

Title: Ejector device for direct injection fuel jet
Patent Number: 7,051,956 Issued on 05/30/2006 to Upatnieks

Title: Method for monitoring condition of bearings of a crusher, and a crusher
Patent Number: 6,877,682 Issued on 04/12/2005 to Nieminen,   et al.

Title: Cell builder for different layer stacks
Patent Number: 7,334,206 Issued on 02/19/2008 to Dinter,   et al.

Title: Pipe cutting machine
Patent Number: 6,981,437 Issued on 01/03/2006 to Ogawa

Title: Architecture for a sea of platforms
Patent Number: 7,058,906 Issued on 06/06/2006 to Hamlin

Title: IC device having a transistor switch for a power supply
Patent Number: 7,012,460 Issued on 03/14/2006 to Fujimori

Title: Self-contained insect repelling and killing apparatus
Patent Number: 7,320,439 Issued on 01/22/2008 to Davis,   et al.

Title: Status display for parallel activities
Patent Number: 7,334,055 Issued on 02/19/2008 to Babka,   et al.

Title: Method and apparatus for restraining connection request stream associated with high volume burst client in a distributed network
Patent Number: 6,799,276 Issued on 09/28/2004 to Belissent

Title: Storage system having a reader with a light sensing portion inclined with respect to an axis of a label of a storage medium
Patent Number: 7,333,293 Issued on 02/19/2008 to Reasoner,   et al.

Title: Method of operating a pulsejet
Patent Number: 7,051,510 Issued on 05/30/2006 to Ouellette

Title: System and method for commissioning addressable lighting systems
Patent Number: 7,307,542 Issued on 12/11/2007 to Chandler,   et al.

Title: System and method for probabilistic quality of communication service determination
Patent Number: 6,810,422 Issued on 10/26/2004 to Cross

Title: Modular antenna assembly for automotive vehicles
Patent Number: 7,333,065 Issued on 02/19/2008 to Lindackers,   et al.

Title: Micro-electromechanical inductive switch
Patent Number: 6,831,542 Issued on 12/14/2004 to Volant,   et al.

Title: Defect detection apparatus and defect detection method
Patent Number: 7,061,840 Issued on 06/13/2006 to Honda

Title: Induction flush device
Patent Number: 7,308,907 Issued on 12/18/2007 to Ouyoung

Title: Shared memory with programmable size
Patent Number: 6,898,678 Issued on 05/24/2005 to Six,   et al.

Title: Device and process for liquid treatment of wafer-shaped articles
Patent Number: 7,007,702 Issued on 03/07/2006 to Langen

Title: Image capturing apparatus for adjusting a relative position between an image sensor and an optical axis
Patent Number: 7,333,146 Issued on 02/19/2008 to Etoh

Title: Method for electroplating of tantalum
Patent Number: 6,936,155 Issued on 08/30/2005 to Morimitsu,   et al.

Title: Cotton seed cleaner
Patent Number: 7,308,734 Issued on 12/18/2007 to Mizer, Sr.

Title: Arched hammock stand
Patent Number: 6,842,920 Issued on 01/18/2005 to Branch, III

Title: Memory device tester and method for testing reduced power states
Patent Number: 6,914,843 Issued on 07/05/2005 to Harrington,   et al.

Title: Systems and methods for overcoming stiction
Patent Number: 6,856,069 Issued on 02/15/2005 to Miller,   et al.

Title: Concept of zero network element mirroring and disaster restoration process
Patent Number: 7,058,847 Issued on 06/06/2006 to Guzman,   et al.

Title: Non-volatile memory architecture employing bipolar programmable resistance storage elements
Patent Number: 7,324,366 Issued on 01/29/2008 to Bednorz,   et al.

Title: Multimedia interface having a processor and reconfigurable logic
Patent Number: 6,810,434 Issued on 10/26/2004 to Muthujumaraswathy,   et al.

Title: Combination tracheal hook and scalpel device
Patent Number: 7,308,896 Issued on 12/18/2007 to Cruz

Title: Collapsible storage or shipping box
Patent Number: 6,913,161 Issued on 07/05/2005 to Schäfer

Title: Multi-purpose hand held sprayer having a vertical shut-off valve
Patent Number: 7,051,959 Issued on 05/30/2006 to Lim

Title: Personal injector for liquid medicine
Patent Number: 6,913,591 Issued on 07/05/2005 to Itoh,   et al.

Title: Fluid product dispensing pump
Patent Number: 6,811,060 Issued on 11/02/2004 to Petit

Title: Process for changing the syntax, resolution and bitrate of MPEG bitstreams, a system and a computer product therefor
Patent Number: 7,010,041 Issued on 03/07/2006 to Graziani,   et al.

Title: Electrophotographic process unit and image forming apparatus
Patent Number: 7,333,751 Issued on 02/19/2008 to Gumbe

Title: Method and apparatus for integrating distributed information
Patent Number: 7,333,989 Issued on 02/19/2008 to Sameshima,   et al.

Title: Auxiliary playpen speaker
Patent Number: 7,333,627 Issued on 02/19/2008 to Ventrola,   et al.

Method and apparatus for blind code detection Number:7,522,559 from the United States Patent and Trademark Office (PTO) owispatent

Home    Author Login    Submit Article    Article Search    Add Your Link    Edit Your Link    Contact Us    Advertising    Disclaimer

   

Google
 

Top Breaking News
     Media Rights Groups Call for Probe Into Shooting of VOA Reporter in Puntland by Alisha Ryu
     US Begins Talks on Iran Nuclear Proposal with International Partners by VOA News
     Climate Change, Political Experts Say Obama Made Progress on China Trip by Stephanie Ho

Title: Method and apparatus for blind code detection

Abstract: A receiver includes a blind code detection device for determining the identity of a plurality of channels over which information is to be transmitted when the identity of all channels is not known by the receiver. The blind code detection device generates a candidate channel list filled with the identity of selected channels out of the plurality of channels. A multi-user detection device, responsive to the blind code detection device, processes those channels in the candidate code list.

Patent Number: 7,522,559 Issued on 04/21/2009 to Haim,   et al.


Inventors: Haim; John W. (Baldwin, NY), Oh; Hyun-Seok (Incheon, KR), Kim; Younglok (Seoul, KR), Zeira; Ariela (Huntington, NY), DiFazio; Robert A. (Greenlawn, NY)
Assignee: InterDigital Technology Corporation (Wilmington, DE)
Appl. No.: 10/396,992
Filed: March 25, 2003


Related U.S. Patent Documents

Application NumberFiling DatePatent NumberIssue Date
60367384Mar., 2002

Current U.S. Class: 370/332 ; 370/335; 370/432; 375/148
Current International Class: H04W 4/00 (20090101)
Field of Search: 370/329,332,335,342,431,432,479,345,336,337 455/450-452.2,509-512,515-517 375/316,150,146-149,152,136 717/146,131,141,155


References Cited [Referenced By]

U.S. Patent Documents
6151502 November 2000 Padovani et al.
6205168 March 2001 Somayazulu
6445727 September 2002 Davis et al.
6483826 November 2002 Akerberg et al.
6498935 December 2002 Cannon et al.
6501788 December 2002 Wang et al.
6535554 March 2003 Webster et al.
6574270 June 2003 Madkour et al.
2001/0022807 September 2001 Yotsumoto
2003/0147455 August 2003 Simoni et al.
Foreign Patent Documents
2399078 Aug., 2001 CA
1 143 638 Oct., 2001 EP
10-065572 Mar., 1998 JP
10/145327 May., 1998 JP
10-145327 May., 1998 JP
2000-068979 Mar., 2000 JP
2000-261411 Sep., 2000 JP
2000-144636 May., 2001 JP
2002-044053 Feb., 2002 JP
20020008073 Jan., 2002 KR
476199 Feb., 2002 TW
01/97411 Dec., 2001 WO

Other References

Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 4), 3 GPP TS 25.221 V4.1.0 (Jun. 2001). cited by other .
Technical Specification Group Radio Access Network; Spreading and modulation (TDD)(Release 4), 3 GPP TS 25.223 V4.1.0 (Jun. 2001). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 1999), 3 GPP TS 25.221 V 3.9.0 (Dec. 2001). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 1999), 3 GPP TS 25.221 V 3.11.0 (Sep. 2002). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 4), 3 GPP TS 25.221 V 4.3.0 (Dec. 2001). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 4), 3 GPP TS 25.221 V 4.7.0 (Dec. 2002). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 5), 3 GPP TS 25.221 V 5.3.0 (Dec. 2002). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Spreading and modulation (TDD), (Release 1999), 3 GPP TS 25.223 V 3.7.0 (Sep. 2001). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Spreading and modulation (TDD), (Release 1999), 3 GPP TS 25.223 V 3.8.0 (Mar. 2002). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Spreading and modulation (TDD), (Release 4), 3 GPP TS 25.223 V 4.3.0 (Dec. 2001). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Spreading and modulation (TDD), (Release 4), 3 GPP TS 25.223 V 4.5.0 (Dec. 2002). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Spreading and modulation (TDD), (Release 5), 3 GPP TS 25.223 V 5.2.0 (Dec. 2002). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 4), 3 GPP TS 25.221 V 4.1.0 (Jun. 2001). cited by other .
Third Generation Partnership Project; Technical Specification Group Radio Access Network; Spreading and modulation (TDD), (Release 4), 3 GPP TS 25.223 V 4.1.0 (Jun. 2001). cited by other.

Primary Examiner: Moore; Ian N
Attorney, Agent or Firm: Volpe and Koenig, PC

Parent Case Text



CROSS REFERENCE TO RELATED APPLICATION

This application claims priority from U.S. Provisional Application No. 60/367,384, filed on Mar. 25, 2002, the entirety of which is hereby incorporated by reference.
Claims



What is claimed is:

1. A method for receiving communications in time frames comprised of a plurality of time slots, said time slots having data signals for a plurality of channels, comprising; detecting midambles, by a blind code detector, to provide a set of channelization codes and associated midamble shifts for a candidate code list, wherein a beacon midamble is entered into the candidate code list with its associated channelization code, channel response offset and spread factor when the beacon midamble is detected, and a flag is set for a beacon code to prevent the beacon code from being rejected; identifying own-UE candidate codes and associated parameters; and identifying other-UE candidate codes and associated parameters; and comparing the identified own-UE and other-UE candidate codes with respective thresholds and rejecting own-UE candidate codes when an energy of the own-UE candidate code is less than a given threshold and accepting only those own-UE and other UE candidate codes that exceed their respective thresholds.

2. The method of claim 1 wherein, for either a default midamble or a common midamble case, the detecting midambles further comprises: entering only one beacon midamble and one beacon code into the candidate code list when the beacon midamble with more than one code and one midamble is detected.

3. The method of claim 2 further comprising: searching an own-UE allocation list identifying candidate codes found in the allocation list as an own-UE candidate; copying CCTrCH numbers of the candidates to the candidate code list; and associating a CCTrCH number of zero for those candidates not found in the own-UE allocation list, to indicate that codes in the candidate code list that are not own-UE candidate codes, are other-UE candidate codes.

4. The method of claim 3 further comprising: for a received transport format combination indicator (TFCI): preventing rejection by code decision of codes known to have been transmitted; and removing from the candidate code list codes which have not been transmitted.

5. The method of claim 3 further comprising: identifying candidate codes from the candidate list whose associated CCTrCH is zero as other-UE candidate codes.

6. The method of claim 1 wherein, for a default midamble case: the beacon midamble is entered into the candidate code list when a first beacon midamble is detected, and a flag for a first beacon code is set to prevent the first beacon code from being rejected.

7. The method of claim 6 further comprising: entering the beacon midamble into the candidate code list with its associated channelization code, channel response offset and spreading factor when a first beacon midamble is absent and a second beacon midamble is detected; and setting a flag for a second beacon code to prevent the second beacon code from being rejected.

8. The method of claim 1 wherein, for a default midamble case: a first beacon midamble is entered into the candidate code list when a first beacon midamble is detected; if midamble detection fails to report a first beacon midamble but reports a second beacon midamble, the second beacon midamble is entered into the candidate code list with its associated channelization code, channel response offset and spreading factor when the second beacon midamble is detected; and a flag is set to prevent the beacon code for the second beacon midamble from being rejected.

9. The method of claim 1 further comprising: copying identified codes into the candidate code list along with their associated midamble shifts, channel response offsets and spreading factors.

10. The method of claim 9 further comprising: searching an own-UE allocation list for each candidate code; and for each candidate code found in the own-UE allocation list, adding an associated coded composite transmission channel (CCTrCH) number associated with each own-UE candidate.

11. The method of claim 9 further comprising: setting a flag for own-UE transmitted codes which are known from the transport format combination indicator (TFCI) to prevent those codes from being rejected.

12. The method of claim 10 further comprising: setting a flag for own-UE transmitted codes which are known from the transport format combination indicator (TFCI) to prevent those codes from being rejected; and deleting from the candidate code list all non-transmitted codes.

13. The method of claim 1 wherein, for a common midamble case, detecting midambles further comprises: stop processing if a common midamble shift has not been detected; and entering into the candidate code list all remaining channelization codes along with a common midamble shift and a given spreading factor.

14. The method of claim 13 wherein for a non-beacon timeslot, stop processing if the common midamble shift has not been detected.
Description



BACKGROUND

The present invention relates generally to Code Division Multiple Access (CDMA) communication systems. More specifically, the present invention relates to a CDMA receiver.

CDMA systems use spread spectrum techniques and multi-code operation to provide higher network capacity in a given bandwidth than a single-code system. The increased capacity may be directed to a single user or shared among multiple users.

To implement a receiver, a CDMA system generally requires knowledge of the identity of the codes used to construct the transmitted signal. The receiver in a User Equipment (UE) may know the identity of all codes, a subset of codes or none of the codes used for any given transmission. Codes associated with signals directed to the desired UE will be referred to hereinafter as "own-UE codes"; and codes associated with signals directed to other receivers will be referred to hereinafter as "other-UE codes." Typically, a system includes a means in the receiver to know or learn the identity of own-UE codes via initial programming, signaling, acquisition methods or various other techniques that may include trial and error, which may be inefficient from a power or performance standpoint. Systems may or may not provide a means to learn the identity of other-UE codes. Specific codes used to transmit data can be static or can change from time-to-time.

Demodulation of data associated with any one code is subject to degraded bit error rates (BER) caused by interfering own-UE codes and/or other-UE codes. The receiver can benefit from knowledge of the identity of own-UE or other-UE codes by implementing improved methods that provide a lower BER at a given signal-to-noise ratio in a radio channel with a certain multipath characteristic.

Multi-user detection (MUD) is one example of a receiver method that simultaneously processes received signals associated with multiple codes in an attempt to minimize the impact of interference and provide a lower BER, or the same BER in less favorable signal-to-noise-ratio (SNR) or multipath. MUD operates optimally when it is configured for the exact set of transmitted codes. To achieve this, MUD requires knowledge of the identity of transmitted own-UE codes and transmitted other-UE codes. In addition, MUD generally requires an estimate of the transmission channel over which the signal was sent. The estimate of the transmission channel is called the "channel response" or "channel estimate." The transmission channel may be the same for all codes. If transmit diversity, antenna beam steering or other methods of signaling diversity are used at the transmitter, then different transmission channels may be associated with different codes.

One approach to implementing MUD is to configure the receiver for all codes that may or may not have been transmitted. There are two disadvantages that render this approach undesirable, and possibly impractical. First, the more codes a MUD device is configured to process, the greater the number of computations that are required to demodulate the transmitted data. Hence, configuring a receiver only for codes that have been transmitted requires less power and less processing time. Second, the BER is often degraded if the MUD is configured to process a relatively large number of codes. Hence, configuring a receiver only for codes that have been transmitted generally provides an improvement in BER.

In timeslotted CDMA systems that employ MUD, for example, in 3GPP TDD systems, one or more channelization codes in one or more timeslots are allocated to coded composite transport channels (CCTrCHs). In each timeslot, multiple CCTrCHs may be transmitted and may be directed to one or more UEs.

Each transmitted code is associated with a midamble code shift that may or may not be shared with other transmitted codes. The UE estimates the channel response by processing received midambles. The association between midamble code shift and transmitted codes is not explicit since detection of a particular midamble code shift does not guarantee that an associated code has been transmitted. However, in the specific case of Kcell=16 in TDD, the association is unique.

As one example, during call set-up, a CCTrCH is provided with an allocation of channelization codes and timeslots and these are signaled to the UE. Therefore, the UE has a list of allocated codes. However, since not all allocated codes are used in every transmission, the UE has partial information, (i.e. the information regarding own-UE codes). The list of other-UE codes is not available, except in certain cases where some hint as to the total number of codes is indicated through physical layer signaling.

Each transmitted code is a combination of a channelization code, a channelization code specific multiplier and a scrambling code. The scrambling code is signaled to the UE and the code specific multipliers are associated with channelization codes, so the identity of the channelization code itself is the only one of the three that needs to be determined.

If a code allocated to a CCTrCH is not transmitted, then the CCTrCH is in discontinuous transmission (DTX). A CCTrCH is said to be in "partial DTX" if not all of the allocated codes are transmitted in a given timeslot. It is said to be in "full DTX" if none of the allocated codes are transmitted in a frame.

The identity of the transmitted codes for an entire frame can be derived from the Transport Format Combination Index (TFCI) that is signaled to the UE and is multiplexed with the data signal. The TFCI is transmitted in the first timeslot allocated to a CCTrCH, and optionally in subsequent timeslots in the same frame. Each UE can process the received TFCI to determine the transmitted own-UE codes in each timeslot of the frame. However, this requires demodulating received data symbols and executing various other processes to decode and interpret the TFCI information. In certain receiver implementations, the inherent latency of these processes could result in the identity of transmitted own-codes not being available when received data in the first timeslot (and possibly some subsequent timeslots) in the frame are processed in a MUD-device.

Accordingly, there exists a need for an improved receiver which has the ability to more effectively identify the incoming channels.

SUMMARY

The present invention is directed to a receiver for receiving communication signals in time frames divided into a plurality of timeslots, wherein the timeslots include data signals for a plurality of channels. The receiver includes: 1) a data estimation device for decoding the data signals of the timeslot, which comprises a blind code detection device for determining the identity of the plurality of channels when the identity of all channels is not known by the receiver and generating a candidate channel list filled with the identity of selected channels out of the plurality of channels; and 2) a MUD-device, responsive to the blind code detection device, for processing those channels in the candidate code list.

BRIEF DESCRIPTION OF THE DRAWING(S)

FIG. 1 is a block diagram of a receiver in accordance with the preferred embodiment of the present invention.

FIG. 2 is a block diagram of a blind code detection block diagram in accordance with the preferred embodiment of the present invention.

FIG. 3 is a procedure for generation of the candidate code list in the default midamble case in accordance with the preferred embodiment of the invention.

FIG. 4 is a procedure for generation of the candidate code in the common midamble case in accordance with the preferred embodiment of the invention.

FIG. 5 is a procedure for generation of the candidate code list in the UE specific case in accordance with the preferred embodiment of the invention.

FIG. 6 is a procedure for search allocation (searchAlloc) function in accordance with the preferred embodiment of the invention.

FIG. 7 is a procedure for the useTFCI function in accordance with the preferred embodiment of the invention.

FIG. 8 is a diagram illustrating the construction of the system matrix, A.sub.i, in accordance with the preferred embodiment of the present invention.

FIG. 9 is a procedure for the own-UE code detect function in accordance with the preferred embodiment of the present invention.

FIGS. 10A an 10B, taken together, show a procedure for the other-UE code detect function in accordance with the preferred embodiment of the present invention.

FIG. 10 shows the manner in which FIGS. 10A and 10B are arranged relative to one another.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

Referring to FIG. 1, a receiver 19, preferably at a user equipment (UE), (mobile or fixed), comprises an antenna 5, an isolator or switch 6, a demodulator 8, a channel estimation device 7 and a data estimation device 2. After the data estimation device 2, the signals are forwarded to a demultiplexer/decoder 4 to be processed in accordance with well known methods. The data estimation device 2, coupled to the demodulator 8 and the channel estimation device 7, comprises a blind code detection (BCD) device 15, a multi-user detection (MUD) device 16 and a TFCI decoder 17. The MUD device 16 decodes the received data using the channel impulse responses from the channel estimation device and a set of channelization codes, spreading codes and channel response offsets from the BCD device 15. The MUD device 16 may utilize any current MUD method to estimate the data symbols of the received communication, such as a minimum mean squared error block linear equalizer (MMSE-BLE), a zero-forcing block linear equalizer (ZF-BLE) or a plurality of joint detectors, each for detecting one of the pluralities of receivable CCTrCHs associated with the UE. Although the BCD device 15 is illustrated as a separate device, the BCD device 15 may be incorporated as a part of the MUD device 16. If desired, the code energy measurement part of BCD may be part of the MUD, i.e. a front end component of the MUD (the matched filter) is the same as the BCD code energy measurement function, which measures code energy of a set of codes, the BCD output is fed back to the MUD such that the remaining MUD functions operate on only a subset of the codes originally measured by the front end.

The BCD device 15 is coupled to demodulator 8, channel estimation device 7, TFCI decoder and MUD 16. Channel estimation output of device 7 is an input to the code energy measurement function of the BCD device 15. The BCD device 15 provides the set of the channelization codes, spreading factors and channel response offsets to the MUD (or single user detection, i.e., SUD) devices 10 for use in the current timeslot. The BCD 15 executes for every timeslot in a frame for which the UE has a downlink allocation.

The Blind Code Detection function provides to the MUD or the SUD the set of the channelization codes, spreading factors and channel response offsets to be used in the current timeslot. It also indicates to the TPC function those channelization codes that are to be used for the SIR measurement.

In the MUD configuration, BCD 15 measures code energies and makes decisions about which own-UE and other-UE codes to include or not include in the output Detected Code list. Detected code list is defined herein as that list of codes which remain when all of the codes in the candidate list have been examined and those not meeting all of the aforesaid criteria are removed from the candidate code list. Basically, the BCD fills the candidate code list based on the code allocation and midamble allocation method, then deletes some of the codes from the list based on energy measurement or TFCI, which is what is output to the MUD. In CELL_DCH state, the P--CCPCH and up to four DCH CCTrCHs allocated to own-UE may be present, along with codes for other UEs. In CELL_FACH state, the P--CCPCH and one common channel CCTrCH designated for own-UE may be present, along with codes for other UEs. A common channel code is treated the same as an own-UE DCH code, except that a common channel code transmitted as a beacon is considered as detected if its respective midamble was detected by the Midamble Detection function, regardless of its code energy. The P--CCPCH is treated as its own unique CCTrCH: it has no TFCI and thus is not subject to the TFCI tests in the Code Detect function, but since it is always transmitted as a beacon, its detection decision is only based on its midamble detection, otherwise it is treated as any other common channel. The identities of transmitted and non-transmitted codes signaled by a TFCI and made available by the fast-TFCI function one or two timeslots after receipt of the TFCI are exploited, when available.

In the single user detection (SUD) configuration, all allocated own-UE codes are included in, and any other-UE codes are excluded from, the output Detected Code list. Because the MUD configuration will be selected for timeslots containing common channels, the SUD configuration does not contain any special logic for the P--CCPCH. BCD uses the following sub functions as illustrated in FIG. 2.

Referring to FIG. 2, the blind code detection (BCD) device 15 comprises: a candidate code list generator 30; a code energy measurement unit 32; and a code detection unit 34. The inputs and outputs of these units are also shown in FIG. 2.

Candidate Code List Generation (30)

Depending on the timeslot midamble allocation scheme, beacon indicator and possibly the detected midamble shifts and received TFCI, candidate channelization codes for both own-UE and other UEs (for MUD configuration only) are selected.

Code Energy Measurement (32)

For the MUD configuration, the energy of each of the candidate codes is measured based on the soft symbols of the candidate codes at the output of a matched filter.

Code Detect (34)

Code detect does the following: Own-UE Code Detect (for MUD configuration only) Candidate codes of each CCTrCH are kept in or rejected from the candidate list depending on their code energy, Full DTX status, status of the received TFCI and relative timeslot within the frame. Other-UE Code Detect (for MUD configuration only) Once own-UE codes have been detected, other-UE codes are detected depending on their code energy with a threshold based on the energies of own-UE codes and whether or not it is known that at least one own-UE code was definitely transmitted. Reject certain weak codes if too many codes remain as accepted after the above threshold tests Format output for MUD or SUD

Inputs

Data Data received at Code Energy Measurement (CEM) 32: oddRxData, odd received data (after midamble cancellation). evenRxData, even received data (after midamble cancellation) at 32 oddChResp {right arrow over (h)}.sub.o.sup.(k), k=1,2, . . . , K odd channel response. evenChResp {right arrow over (h)}.sub.e.sup.(k), k=1,2, . . . , K even channel response. The list of midamble shifts detected by channel estimation function 7, are provided to Candidate Code List Generator (CCLG) 30 and include: detMidList(16), the shift number (k value) of detected midambles, 0=no valid entry. detMidOffset(16), the channel response offset of detected midambles. nDetMid, the number of valid items in detMidList and detMidOffset. The full discontinuous transmission (DTX) indicator, is set if CCTrCH is in full DTX and is provided to Code Detect (CD) 34. The tfcCodeList(4,224), the list of transmitted codes in the frame, as indicated by the received TFCI, per CCTrCH, 16 codes.times.14 timeslots, is provided to CCLG 32. tfcCodeListValid(4), is set if the received TFCI has been decoded by the fast-TFCI process and tfcCodeList contains valid data, per CCTrCH and is provided to CCLG 30.

Control KCELL, the maximum number of midamble shifts, this timeslot is provided to CCLG 30 and CEM 32. burstType, burst type, this timeslot is provided to CCLG 30. beaconTSI, Beacon timeslot indicator is provided to CEM 32. allocMode, midamble allocation mode (Default, Common or UE Specific), this timeslot is provided to CCLG 30. MUD_SUDindicator, indicates MUD or SUD active in this timeslot and is provided to CCLG 30, CEM 32 and CD 34. The list of parameters of PhCHs allocated to own UE, are of the form: allocCode(phy chan), the channelization codes of allocated PhCHs is provided to CCLG 30. allocTimeslot(phy chan), the timeslots of allocated PhCHs is provided to CCLG 30. allocSprFactor(phy chan), the spreading factors of allocated PhCHs is provided to CCLG 30. allocMidShift(phy chan), the midamble shifts of allocated PhCHs is provided to CCLG 30. allocCCTrCH(phy chan), the CCTrCH numbers of allocated PhCHs {1-4=own-UE or common channel CCTrCH, 5=P--CCPCH } is provided to CCLG 30.

Outputs

Data The detected code list, are provided by CD 34 and are of the form: chanCode(16), the channelization codes of detected codes, 0=no valid entry. sprFactor(16), the spreading factors of detected codes. midOffset(16), the channel response offsets of detected codes. chanCCTrCH(16), the CCTrCH number of detected code {0=other UE code, 1-4=own-UE or common channel CCTrCH5=P--CCPCH } chanTFCIflag(16), set if code carries the TFCI in its CCTrCH. numCodes, the number of valid items in chanCode, sprFactor and midOffset.

Control timeslotAbort, set if no own-UE codes or P--CCPCH to demodulate and thus further processing of the timeslot is required.

The blind code detection procedure operates every DL timeslot.

Parameters ownUEthresholdFactor, set to 0.1 and is provided to CD 34. otherUEthresholdFactor, set to 0.7 and is provided to CD 34. maxMudCodes, the largest number of channelization codes the MUD can support, default set to 14, is provided to CD 34. numSymbols, the number of symbols for estimating code energy, default set to 30, could be as large as 61 (entire first data field), is provided to CEM 32. Midamble/Code association, default midamble case (see Table 1), is provided to CCLG 30. Beacon code(s) (always code number=1 (and 2, if SCTD is applied), SF=16). Beacon shift (always k=1). Midamble k=1 is used for the first antenna and k=2 is used for the diversity antenna if SCTD is applied for the beacon channel. Orthogonal variable spreading factor (OVSF) Codes, SF=16 only (see Table 1) is provided to CEM 32. L.sub.r, channel response lengths (see Table 1) are provided to CEM 32.

Implementation Requirements

As one example, the fixed-point requirements for the blind code detection block are shown in Table 1 (however, the number of bits used may be changed, if desired).

TABLE-US-00001 TABLE 1 Fixed point configuration for blind code detection block RxChip Q 5 Word size 6 RxChresp Q 5 Word size 6 A Q 5 Word size 10 AHr Q 5 Word size 10 midDetMidambleEnergy Q 5 Word size 7 MidDetThresh Q 5 Word size 6 ChannelEnergy Q 10 Word size 13 CodeEnergy Q 2 Word size 11 cclEnergyForCodeEngBlockOutput Q 2 Word size 9 cclEnergyForCodeDetBlockInput Q 2 Word size 9 codeDetSumAvgEnergy Q 2 Word size 15 codeDetAveEnergy Q 2 Word size 11 codeDetThreshFactor Q 5 Word size 6 CodeDetThresh Q 3 Word size 11 scaledChanEnergy Q 6 Word size 11 SymbEnergy Q 4 Word size 13 Accum Word size 16 Word size 15 Code Detect Threshold Q 5 Word size 15

Candidate Code List Generation (CCLG) 30

Functional Description

The candidate code list is the list of the channelization codes and associated parameters which may have been received in the timeslot and which are later subject to the threshold tests of the code detect (CD) function 34. The list is determined based upon the midamble allocation scheme of the timeslot, the detected midamble shifts, and information about the known number of transmitted codes derived from the received TFCI, if available from the fast-TFCI process. In beacon timeslots, codes of detected beacon midambles are tagged to prevent rejection by the Code Detect (CD) function 34.

Beacons transmitted with SCTD require special handling in generation of the candidate code list (ccl). If only one of the two beacon midambles is detected, either only one was transmitted, or both were transmitted but only one received. In this case, the one detected beacon is entered into the candidate code list as code 1 or code 2, depending if k=1 or k=2 is detected. If both beacon midambles are detected, and SCTD is not known to be OFF, the two beacon codes are in essence collapsed into each other in the A matrix, and thereafter treated as one code. In this case, only one code, code 1 & k=1, should be entered into the candidate code list. The k=2 beacon is not transmitted by itself.

Default Midamble Allocation Scheme

In the default midamble allocation scheme, each detected midamble explicitly indicates a set of channelization codes which may have been transmitted and should be included in the candidate code list. In beacon timeslots, the first and the second beacon code are included in the candidate code list if their respective midamble was detected; the beacon codes are flagged as not to be rejected by the Code Detect function 34. Once the candidate codes and their associated midamble shifts have been entered into the candidate code list, the list of parameters of PhCHs allocated to own UE is searched to identify own-UE candidate codes and their parameters. For own-UE codes, if the transmitted codes are known from the fast TFCI, the candidate code list is adjusted accordingly.

The procedure is as follows and as shown in the flowchart in FIG. 3. The steps are: Clear the candidate code list (S1). Initialize at (S2), setting cclRow=1, index=0 In the presence of beacon timeslots (S3), At S4, if Midamble Detection has reported the first beacon midamble, S4A, at S5, enter the first beacon midamble into the candidate code list along with its channelization code, channel response offset and spreading factor, and set cclAccept flag for the beacon code such that it cannot be rejected by the Code Detect function. if Midamble Detection has not reported the first beacon midamble, S4A, but has reported the second beacon midamble, S6A, at S7, do the same for the second midamble. Find the codes for each (remaining, if this is a beacon timeslot) detected midamble in Table 1, at S8. S8 loops to examine all midambles. At S10 and S11, copy the found codes into the candidate code list, at S12, along with their associated midamble shifts, channel response offsets and spreading factors. S10 loops until all n Codes are examined. S11 loops for all of the rows (16). After all codes have been entered into the candidate code list, search own-UE allocation list for each candidate code. The search Alloc routine (S12) is shown in greater detail in FIG. 6. For candidate codes found in the own-UE allocation list, add to the candidate code list their CCTrCH number. Candidate codes not found in the own-UE allocation list will retain the cleared CCTrCH number of zero, which will indicate that the code is not allocated to own-UE. For own-UE codes, for each CCTrCH, if the transmitted codes in this timeslot are known from the Fast TFCI, at S13: For transmitted codes, set the cclAccept flag such that they cannot be rejected by the Code Detect function. For non-transmitted codes, delete them from the candidate code list.

The use TFCI routine is shown in greater detail in FIG. 7.

Common Midamble Allocation Scheme

In the common midamble allocation scheme, in non-beacon timeslots, only one (the "common") midamble shift is transmitted. It indicates a set containing the number of channelization codes transmitted in the timeslot. In beacon timeslots, one or two beacon midamble shifts plus the common midamble shift, which indicates the number of channelization codes in the timeslot are transmitted. The beacon codes and their midamble shifts are included in the candidate code list if their respective midamble shifts were detected and those codes are flagged as not to be rejected by the Code Detect function. The number of channelization codes indicated by the common midamble shift is not used. If the common midamble shift is not detected, there are no codes, other than possibly beacon codes, to insert into the candidate code list. In beacon timeslots, the candidate code list is filled with all 14 remaining SF=16 channelization codes, each associated with the detected common midamble shift. In non-beacon timeslots, there can be either one SF=1 code or up to 16 SF=16 codes in the timeslot; the SF of one code in this timeslot in the own-UE allocation list is checked and used to decide to fill the candidate code list with one SF=1 code or 16 SF=16 codes, each associated with the detected common midamble shift.

Once the candidate codes and their associated midamble shifts have been entered into the candidate code list (ccl), the list of parameters of PhCHs allocated to own-UE is searched to identify own-UE candidate codes and their parameters. The P--CCPCH cannot be in a common midamble timeslot. For own-UE codes, if the transmitted codes are known from the fast TFCI, the candidate code list is adjusted accordingly.

The procedure is as follows, as shown in the following flowcharts: Making reference to FIG. 4; at S1, clear the candidate code list and initialize at S2. In beacon timeslots, S3A, if Midamble Detection has reported the first beacon midamble, at S4A, enter the first beacon midamble into the candidate code list along with its channelization code, channel response offset and spreading factor, and set cclAccept flag for the beacon code such that it cannot be rejected by the Code Detect function, at S5. if Midamble Detection has not reported the first beacon midamble, at S4B, but has reported the second beacon midamble S6A, do the same for the second midamble, at S7. stop if the common midamble shift (2<k<=Kcell) was not detected, at S8A. enter into the candidate code list all remaining channelization codes, along with the common midamble shift and SF=16. In non-beacon timeslots, at S3B: stop if the common midamble shift, as specified below, was not detected, at S9A All but Kcell=4: 0<k<=Kcell Kcell=4: k=1, 3, 5 or 7 determine from the own-UE allocation list if this is an SF=16 or SF=1 timeslot, at S11. Enter into the candidate code list all spreading factors (SF), where SF=16, at S12, and S13, or one SF=1, at S16, channelization code(s), along with the common midamble shift and the SF. After all codes have been entered into the candidate code list, search own-UE allocation list for each candidate code, at S14. For candidate codes found in the own-UE allocation list, add to the candidate code list their CCTrCH number. Candidate codes not found in the own-UE allocation list will retain the cleared CCTrCH number of zero, which will indicate that the code is not allocated to own-UE. For own-UE codes, for each CCTrCH, if the transmitted codes in this timeslot is known from the Fast TFCI, S15: For transmitted codes, set the cclAccept flag such that they cannot be rejected by the Code Detect function. For non-transmitted codes, delete them from the candidate code list.

UE Specific Midamble Allocation Scheme

In all midamble allocation schemes, the UE has a priori knowledge of midamble shifts allocated to own-UE codes. In the Default and Common midamble allocation schemes, the UE knows the midamble -to-code associations for codes possibly allocated to other UEs. However, in the UE Specific midamble allocation scheme, the UE has no knowledge of midamble-to-code associations for codes possibly allocated to other UEs. Because the UE has no knowledge of other-UE midamble shift and channelization code associations, it is impractical to detect other-UE channelization codes. Thus, for every detected midamble shift, the UE simply searches its allocation list and adds to the candidate code list those codes associated with it; no other-UE channelization codes are added to the candidate code list. In beacon timeslots, if the first or second beacon midambles were detected, their respective codes are flagged as not to be rejected by the Code Detect function. The P--CCPCH cannot be in a UE Specific timeslot. For all CCTrCHs, if the transmitted codes are known from the fast TFCI, the candidate code list is adjusted accordingly.

The procedure is as follows and as shown in the flowchart in FIG. 5: at Si, clear the candidate code list and initialize at S2. In beacon timeslots, S3A, if Midamble Detection has reported the first beacon midamble, S4A enter the first beacon midamble into the candidate code list along with its channelization code, channel response offset and spreading factor, and set cclAccept flag for the beacon code such that it cannot be rejected by the Code Detect function, at S5; if Midamble Detection has not reported the first beacon midamble, S4B, but has reported the second beacon midamble, S6A, do the same for the second midamble, at S7. For each detected midamble shift, search own-UE allocation list for channelization codes associated with that midamble shift in this timeslot. Copy the found codes into the candidate code list, along with their associated midamble shifts, channel response offsets, spreading factors and CCTrCH. For own-UE codes (the only codes in the candidate list in this case), for each CCTrCH, if the transmitted codes in this timeslot are known from the Fast TFCI, at S14: For transmitted codes, set the cclAccept flag such that they cannot be rejected by the Code Detect function. For non-transmitted codes, delete them from the candidate code list.

Search Allocated Code List

The SearchAlloc function, shown in FIG. 6, is used for the Common and Default midamble allocation schemes after all candidate codes have been entered into the candidate code list. The own-UE allocation list is searched; any candidate codes found in the allocation list are, by definition, allocated to own-UE. The CCTrCH numbers of found candidate codes are copied to the candidate code list. Candidate codes not found in the own-UE allocation list will retain the cleared CCTrCH number of zero, which will indicate that the code is not allocated to own UE.

For the single-user detection (SUD) configuration (S11), codes belonging to other UEs are deleted from the candidate code list (S14).

Use TFCI Function

This function, useTFCI, shown in FIG. 7 prevents rejection by Code Decision of codes which are known to have been transmitted, and removes from the candidate code list codes known to have not been transmitted (S12, S13). It is used for those CCTrCHs that the TFCI has been decoded by the fast-TFCI process and information about transmitted codes is thus available.

Inputs

Data The list of midamble shifts detected by channel estimation function, of the form: detMidList(16), the shift number (k value) of detected midambles, 0=no valid entry, however, any other number may be used (99, for example) to indicate an invalid entry. detMidOffset(16), the channel response offset of detected midambles. nDetMid, the number of valid items in detMidList and detMidOffset. tfcCodeList(4,224), the list of transmitted codes in the frame, as indicated by the received TFCI, per CCTrCH, 16 codes.times.14 timeslots. tfcCodeListValid(4), set if the received TFCI has been decoded by the fast-TFCI process and tfcCodeList contains valid data, per CCTrCH.

Control KCELL, the maximum number of midamble shifts, this timeslot. burstType, burst type, this timeslot. beaconTSI, Beacon timeslot indicator. allocMode, midamble allocation mode (Default, Common or UE Specific), this timeslot. MUD_SUDindicator, indicates MUD or SUD active in this timeslot. The list of parameters of PhCHs allocated to own UE, of the form: allocCode(phy chan), the channelization codes of allocated PhCHs. allocTimeslot(phy chan), the timeslots of allocated PhCHs. allocSprFactor(phy chan), the spreading factors of allocated PhCHs. allocMidShift(phy chan), the midamble shifts of allocated PhCHs. allocCCTrCH(phy chan), the CCTrCH numbers of allocated PhCHs {1-4=own-UE or common channel CCTrCH, 5=P--CCPCH}.

Outputs

Data The candidate code list, of the form cclCode(16), the OVSF channelization code numbers of candidate codes. cclMid(16), the midamble shifts of candidate codes. cclOffset(16), the channel response offset of the candidate codes. cclSprFactor(16), the spreading factors of the candidate codes. cclAccept(16), the accept flags of the candidate codes. chanCCTrCH(16), the CCTrCH number of detected code {0=other UE code, 1-4=own-UE or common channel CCTrCH, 5=P--CCPCH} cclTFCIflag(16), set if code carries the TFCI in its CCTrCH.

Control None

Frequency of Operation

This function operates every DL timeslot.

Parameters Midamble/Code association, default midamble case (see Table 2), B=beacon timeslot, NB=non-beacon timeslot.

TABLE-US-00002 TABLE 2 Midamble/Code association, default midamble case Burst Type = 1 K.sub.CELL = 16 K.sub.CELL = 8 Burst Type = 2 k NB B NB B K.sub.CELL = 4 K.sub.CELL = 6 K.sub.CELL = 3 1 1 1,2 1 1,2,3,4 1,2 1,2,3,4 2 3 2 3,4 2 9,10 9,10,11,12, 13,14,15,16 3 5 5,6 5,6,7,8 5,6,7,8 5,6,7,8 4 11 11,12 13,14,15,16 5 9 9,10 9,10,11,12 3,4 6 7 7,8 11,12 7 13 13,14 13,14,15,16 8 15 15,16 9 2 10 4 11 6 12 12 13 10 14 8 15 14 16 16

For example, if the detected midamble k=5 and KCELL=8, Burst Type=1, the candidtate codes are 9 and 10.

TABLE-US-00003 TABLE 3 Channel Response Lengths K.sub.CELL L.sub.r 3 64 4 64 6 32 8 57 16 29

Code Energy Measurement

Functional Description

This function is performed only in the MUD configuration. The code energy measurement function measures the energy of the candidate channelization codes by matched filtering the received data with the system matrix to form soft symbols and then measuring the energy of the soft symbols from each of the candidate codes. To reduce processing, only a limited number of symbols are determined. The matched filter is

.fwdarw..times..fwdarw..times..fwdarw. ##EQU00001## The procedure is as follows: For each of the cclNumCodes candidate codes, determine two vectors, b.sub.i, as {right arrow over (b)}.sub.i.sup.(n)={right arrow over (c)}.sup.(cclCode[n]){circle around (.times.)}{right arrow over (h)}.sub.i.sup.(k), where n is the order of a candidate code within the candidate code list, {right arrow over (c)}.sup.(cclCode[n]) is the spreading code sequence (OVSF code sequence multiplied by scrambling code sequence) of the nth candidate code, from Table 4, {right arrow over (h)}.sub.i.sup.(k) is the channel response of the midamble shift k associated with the nth code in the candidate code list, where i=1,2 represent the odd or even channel response, respectively. Channel response length output from Channel Estimation is 114, but only the first 64 are used. The length of {right arrow over (c)}.sup.(cclCode[n]) is always 16 and the length of {right arrow over (h)}.sub.i.sup.(k) is a function of K.sub.CELL, the maximum number of midamble shifts, this timeslot, given as L.sub.r in Table 3. Form two (odd and even) matrices or blocks of column vectors of vectors {right arrow over (b)}.sub.i.sup.(n), n=1, . . . , cclNumCodes as shown in FIG. 8. For each of the two system matrices, repeat each of the above described blocks numSymbols times in the descending order as shown in FIG. 8, forming A.sub.i, where i={odd, even}. In beacon timeslots, if midamble shifts k=1 and k=2 were detected (SCTD is on and detected), add together the first two columns of each A.sub.i, eliminate the second column and reduce cclNum Codes by one. Compute the Hermitians of the two system matrices A.sub.i, where i={odd, even}, forming A.sub.i.sup.H, where i={odd, even}. Determine {right arrow over (r)}.sub.i, where i={odd, even}, as the first 16*numSymbols chips of data field D1 in the even and odd received data sequences. Determine the numSymbols symbols for all candidate codes as

.fwdarw..times..fwdarw..times..fwdarw. ##EQU00002## where {right arrow over (s)} is of the form {right arrow over (s)}=[s.sup.(1)s.sup.(2) . . . s.sup.(cclNumCodes)].sup.T, where s.sup.(i)=[s.sup.(i)(0)s.sup.(i)(1) . . . s.sup.(i)(numSymbol-1)].sup.T. Compute the energy of each of the cclNumCodes candidate channelization codes, which for non-beacons is:

.times..times..function..times..times..function..times. ##EQU00003## where {right arrow over (h)}.sub.i.sup.(k) the channel response of the midamble shift k=cclMidList(n) associated with the nth code in the candidate code list and i=1,2 represent the odd or even channel response, respectively. In beacon timeslots, if midamble shifts k=1 and k=2 were detected (SCTD detected), compute the energy of the beacon as:

.function..times..function..times..times..function..times..times..function- . ##EQU00004##

TABLE-US-00004 TABLE 4 OVSF Code Sequences, SF = 16 OVSF Code Number OVSF Code Sequences, SF = 16 1 +1 +1 +1 +1 +1 +1 +1 +1 +1 +1 +1 +1 +1 +1 +1 +1 2 +1 +1 +1 +1 +1 +1 +1 +1 -1 -1 -1 -1 -1 -1 -1 -1 3 +1 +1 +1 +1 -1 -1 -1 -1 +1 +1 +1 +1 -1 -1 -1 -1 4 +1 +1 +1 +1 -1 -1 -1 -1 -1 -1 -1 -1 +1 +1 +1 +1 5 +1 +1 -1 -1 +1 +1 -1 -1 +1 +1 -1 -1 +1 +1 -1 -1 6 +1 +1 -1 -1 +1 +1 -1 -1 -1 -1 +1 +1 -1 -1 +1 +1 7 +1 +1 -1 -1 -1 -1 +1 +1 +1 +1 -1 -1 -1 -1 +1 +1 8 +1 +1 -1 -1 -1 -1 +1 +1 -1 -1 +1 +1 +1 +1 -1 -1 9 +1 -1 +1 -1 +1 -1 +1 -1 +1 -1 +1 -1 +1 -1 +1 -1 10 +1 -1 +1 -1 +1 -1 +1 -1 -1 +1 -1 +1 -1 +1 -1 +1 11 +1 -1 +1 -1 -1 +1 -1 +1 +1 -1 +1 -1 -1 +1 -1 +1 12 +1 -1 +1 -1 -1 +1 -1 +1 -1 +1 -1 +1 +1 -1 +1 -1 13 +1 -1 -1 +1 +1 -1 -1 +1 +1 -1 -1 +1 +1 -1 -1 +1 14 +1 -1 -1 +1 +1 -1 -1 +1 -1 +1 +1 -1 -1 +1 +1 -1 15 +1 -1 -1 +1 -1 +1 +1 -1 +1 -1 -1 +1 -1 +1 +1 -1 16 +1 -1 -1 +1 -1 +1 +1 -1 -1 +1 +1 -1 +1 -1 -1 +1

Inputs

Data oddRxData, odd received data (after midamble cancellation). evenRxData, even received data (after midamble cancellation). oddChResp {right arrow over (h)}.sub.o.sup.(k), k=1,2, . . . , K, odd channel response. evenChResp {right arrow over (h)}.sub.e.sup.(k), k=1,2, . . . , K, even channel responses. cclCode(16), the OVSF channelization code numbers of candidate codes. The list of midamble shifts detected by channel estimation function, of the form: detMidList(16), the shift number (k value) of detected midambles, 0=no valid entry. detMidOffset(16), the channel response offset of detected midambles. nDetMid, the number of valid items in detMidList and detMidOffset. cclSprFactor(16), the spreading factors of the candidate codes. cclAccept(16), the accept flags of the candidate codes.

Control K.sub.CELL, the maximum number of midamble shifts, this timeslot. burstType, burst type, this time slot. MUD_SUDindicator, indicates MUD or SUD active in this timeslot. beaconTSI, Beacon timeslot indicator

Outputs

Data cclEnergy(16), the energies of the candidate codes. Frequency of Operation

This function operates every DL timeslot.

Parameters numSymbols, the number of symbols for estimating code energy, set to 30. OVSF Codes, SF=16 only (see Table 4). L.sub.r, channel response lengths (see Table 3)

Code Detect

Functional Description

This function, shown in FIG. 9, is performed primarily for the MUD configuration. In the SUD configuration, this function simply formats the output for the SUD.

Own-UE Code Detect is followed by Other-UE Code Detect. Own-UE codes and other-UE codes are "rejected" by removing them from the candidate code list. After running Own-UE code detection and other-UE code detection and eliminating excess codes, codes remaining in the candidate code list are output in the Detected Code List. If there are no remaining own-UE codes (or P-CCPCH), an abort signal (S10) is output.

Own-UE Code Detect

Own-UE Code Detect function is shown in FIG. 9.

Step 1 of Own-UE Code Detection is run for each CCTrCH in the candidate code list; some own-UE codes may be rejected.

Step S10 of Own-UE code detect outputs an abort signal, indicating that no further processing of the timeslot is required, if there are no remaining own-UE codes or P--CCPCH in the candidate code list.

Other-UE Code Detect

The Other-UE Code Detect is shown in FIGS. 10A and 10B, the arrangement of FIGS. 10A and 10B being shown in FIG. 10.

Initially, other-UE Code Detection is run (in the MUD configuration only) after own-UE code detection; other-UE codes are detected with a threshold based on the energies of own-UE codes and attributes of the own-UE CCTrCHs (S7 and S8) as shown in FIG. 10A.

Thereafter, other-UE Code Detect rejects other-UE codes if there are more than maxMudCodes codes in the candidate code list. The number of codes is reduced to maxMudCodes by eliminating weaker other-UE codes, at S20.

It should be noted that: Ma (S3), Mb (S10) and Mc (S12) are local variables that contain the minimum energies computed per the flow chart. Fa (S4), Fb (S9) and Fc (S13) are local flags that indicate that Ma, Mb and/or Mc, respectively, were computed and contain valid data. If all three of the above flags are FALSE (S14), which means that there is no firm knowledge that any of the own-UE codes are actually present, the maximum-energy own-UE code is chosen as the reference ("T") for the threshold (S16). Otherwise, the minimum of the minimum energies previously computed (which could be one, two or all three minimums, i.e. Ma and/or Mb and/or Mc) is used as the reference ("T") (S15). Recall that Fx indicates if Mx was computed, where x={a,b,c}.

Inputs

Data cclCode(16), the OVSF channelization code numbers of candidate codes. cclMid(16), the midamble shifts of candidate codes. cclOffset(16), the channel response offset of the candidate codes. cclSprFactor(16), the spreading factors of the candidate codes. cclEnergy(16), the energies of the candidate codes. cclCCTrCH(16), the CCTrCH number of detected code {0=other UE code, 1-4=own-UE or common channel CCTrCH, 5=P-CCPCH } cclTFCIflag(16), set if code carries the TFCI in its CCTrCH. tfcCodeListValid(4), set if the received TFCI has been decoded by the fast-TFCI process and tfcCodeList contains valid data, per CCTrCH. fullDTXindicator(4), set if CCTrCH is in full DTX.

Control MUD_SUDindicator, indicates MUD or SUD active in this timeslot.

Outputs

Data The detected code list, of the form: chanCode(16), the channelization codes of detected codes, 0=no valid entry. sprFactor(16), the spreading factors of detected codes. midOffset(16), the channel response offsets of detected codes. chanCCTrCH(16), the CCTrCH number of detected code {0=other UE code, 1-4=own-UE or common channel CCTrCH, 5 P--CCPCH} chanTFClflag(16), set if code carries the TFCI in its CCTrCH. numCodes, the number of valid items in chanCode, sprFactor, chanCCTrCH, chanTFClflag and midOffset.

Control TimeslotAbort, set if no own-UE codes or P-CCPCH to demodulate and thus further processing of the timeslot is required.

This function operates during every DL timeslot.

Parameters

Two thresholds are set

In one example: ownUEthresholdFactor was set to 0.1. otherUEthresholdFactor was set to 0.7. maxMudCodes, the largest number of channelization codes the MUD can support, set to 14. Other thresholds may be chosen, if desired.

*


Free Web Sudoku Puzzles.
Solve with your browser.
      1 8   7 9  
6     7     4   2
  7 9       3    
        9     7  
      6   7      
  4     1        
    6       9 3  
1   7     5     4
  5 4   3 2      
What is it?



Add Your Site · Terms Of Service · Privacy Policy


DISCLAIMER
Linkgrinder is a free service that searches the Internet and indexes all files found so that you may search quickly and easily for shared files. These files are created and made available individually by users whose identity we are not aware of and who we have no control over. In essence we function like a search engine tool; these files ARE NOT STORED OR SERVED BY OUR NETWORK. We are not responsible for any materials obtained by using our service. We do not monitor any of the contents of these files. These files may contain viruses, illegal materials, materials inappropriate for minors, offensive files and the like. BY USING OUR SERVICE, YOU ASSUME FULL RESPONSIBILITY FOR DOWNLOADING THESE MATERIALS AND WILL INDEMNIFY US FOR ANY DAMAGES THAT MAY BE INCURRED.

For More Specific Information VIEW OUR TERMS OF SERVICE.

Thank you and Enjoy!