Wireless communications system

Abstract: A wireless communication system (10). The system comprises transmitter circuitry (BST1) comprising circuitry for transmitting a plurality of frames to a receiver in a first cell (Cell 1). Each of the plurality of frames comprises a bit group (22), and the bit group uniquely distinguishes the first cell from a second cell (Cell 2) adjacent the first cell. The transmitter circuitry further comprises circuitry (54) for inserting a bit sequence into the bit group. The bit sequence is selected from a plurality of bit sequences (S 1 -S K ) such that successive transmissions by the transmitter circuitry comprise a cycle of successive ones of the plurality of bit sequences.

Description: The present embodiments relate to wireless communications systems and are more particularly, but not exclusively, directed to distinguishing actual cell bit sequences from likely false cell bit sequences. Wireless communications have become very prevalent in business, personal, and other applications, and as a result the technology for such communications continues to advance in various areas. One such advancement includes the use of spread spectrum communications, including that of code division multiple access ("CDMA"). In such communications, a user station (e.g., a hand held cellular phone) communicates with a base station, where typically the base station corresponds to a "cell." More particularly, CDMA systems are characterized by simultaneous transmission of different data signals over a common channel by assigning each signal a unique code. This unique code is matched with a code of a selected user station within the cell to determine the proper recipient of a data signal. CDMA continues to advance along with corresponding standards that have brought forth a next generation wideband CDMA ("WCDMA"). WCDMA includes alternative methods of data transfer, one being frequency division duplex ("FDD") and another being time division duplex ("TDD"). The present embodiments have particular benefit in TDD and, thus, it is further introduced here. TDD data are transmitted as quadrature phase shift keyed ("QPSK") symbols in data packets of a predetermined duration or time slot. Within a data frame having 15 of these slots, bi-directional communications are permitted, that is, one or more of the slots may correspond to communications from a base station to a user station while other slots in the same frame may correspond to communications from a user station to a base station. Each TDD data packet includes a predetermined training sequence in the time slot, referred to in the art as a midamble, where this training sequence represents a known data pattern used for channel estimation. Specifically, the midamble includes information that is unique to a given cell and is selected from a pre-defined set of 128 different possible bit sequences; thus, the unique sequence is assigned to the given cell and that information is encoded within the midamble of data frames transmitted by stations within the corresponding cell. Conversely, data packets exchanged with respect to an adjacent cell have midambles with a different one of the bit sequence sets encoded therein and corresponding to the adjacent cell. Lastly, note that a base station in some instances may communicate with different cells (i.e., is "sectorized"); in this case, then a different and unique midamble is encoded within the data frames communicated with respect to that base station for each of the different cells. For the sake of simplicity in the remainder of this document, each base station is associated only with a single cell and, thus, in this respect, the cell's unique midamble also may be viewed as unique per the corresponding base station. In any event, the basic midamble code may be one of two lengths, where currently these lengths are described as a long basic midamble code with 456 bits and a short basic midamble code with 192 bits. While a basic midamble code consists of the same bit sequence used for communications between a base station and all user stations in the cell corresponding to that base station, each user station in the cell is distinguishable from the others because it is assigned a different time-shifted version of the basic midamble code. The assigned shifting is defined in terms of an offset in the basic midamble code, that is, each user station within the cell is assigned its own offset that represents the amount of time shift adjustment for the user station's basic midamble code. For example, with a short length midamble code thereby having a length of 192 bits, and with eight user stations communicating with one base station, the offsets for each of the eight user stations may be spaced 24 chips apart. Thus, the same basic sequence is used for all of these user stations except that for each,user station it is circularly shifted by a different multiple of 24 chips to correspond to the offset of the particular user station. After the circularly-shifted basic sequences are summed, a cyclic prefix is inserted to form a midamble of length 256 chips for a short basic midamble code and of length 512 chips for a long basic midamble code. Two related aspects arise in connection with midambles, as explained here according to the prior art and as further addressed later in connection with the preferred embodiments. The first aspect is channel estimation and the second aspect is delay profile estimation ("DPE"). Looking first to channel estimation, in the prior art signal paths are received by a receiver at different times, referred to as different chip positions. In response to each of these paths falling within a defined time period referred to as a channel estimation window, and more particularly in response to the midamble in each path in the channel estimation window, the receiver computes a corresponding channel estimate for each path. The channel estimates may be computed using a Fourier transform applied to the entire composite signal that exists in the channel estimation window, where the composite signal is therefore a function of the midambles of any paths occurring within the window. The result of the Fourier transform presents channel estimates at each of the chip positions within the window, and the computed channel estimates are stored with references to the chip position for each estimate. Given the channel estimates, the receiver also performs DPE by noncoherently averaging channel estimates derived from the midambles over many frames, which generally therefore sums the respective absolute channel estimate values for each bit position within the channel estimation window. The DPE therefore represents the average power at each bit position over many frames, thereby attempting to average over the fades and the noise. In response to the DPE, the channel estimates corresponding to those bit positions having an average power greater than some threshold are further used by the receiver for additional signal processing, such as for developing channel estimates using a maximal ratio combining ("MRC") process. To further appreciate the context of the preferred embodiments, an additional introduction is made with respect to receipt by a receiver of both actual paths and false paths. Specifically, recall that a midamble used in one cell is different from the midamble used in an adjacent cell. Nonetheless, a receiver may often receive paths from both a station in the cell in which the receiver is located and also paths from other stations in one or more adjacent cells. Thus, in each of the received paths, there is included either a midamble for the cell in which the receiver is located or a midamble from a different cell. Ideally, when the receiver is attempting to communicate only with other stations in the cell in which the receiver is located, then to properly determine its channel estimates it should make that determination only in response to the paths (and their corresponding midambles) from those other stations in the cell in which the receiver is located; thus, these paths are referred to as actual paths. Also in the ideal case, the receiver should disregard those paths received from transmitters of other cells, and those paths are referred to as false paths in that they represent information to the receiver that is not from the cell with which the receiver is attempting to communicate. While the preceding aspects of channel estimates and DPE have provided a certain level of receiver performance in the prior art, it has been determined in connection with the present inventive embodiments that such operations may be improved, thereby also increasing the performance of additional operations (e.g., MRC) that rely upon these preceding operations. Specifically, it now may be noted that by identifying the paths having a relatively high average power, the DPE is in effect attempting to identify only the actual paths received, while thereby assuming that the paths having a relatively low average power are false paths. However, the present inventors have recognized that while the DPE process will eliminate some false paths which occur due to noise or fading, the DPE process may not eliminate a considerable number of other false paths. Further, this failure of the DPE has been observed to arise due to the high cross-correlation between the different midamble sequences. In other words, for the 128 different possible sequences (of either 192 or 456 bits), there is a considerable cross-correlation between various pairs of these sequences. This cross-correlation will therefore cause false paths to appear, and it is not accommodated by the prior art DPE process. As a result, in the prior art some of these false paths are accepted as actual paths by the DPE process and, thus, the channel estimates corresponding to these false paths are then used for further processing by the receiver, where such uses thereby deplete resources that are better served for processing actual paths. Again by way of example, the channel estimates corresponding to these false paths may be assigned to different fingers in a rake receiver performing MRC analysis, where those fingers would be better suited for assignment to actual path channel estimates. Thus, in the prior art there is a considerable chance for communications from adjacent cells to diminish the ability of a user station to perform its channel estimation. International patent application publication number WO 98/07291 describes a signalling method and a digital radio system. The document relates to a method and system in a digital radio system for signalling between a base station and a subscriber terminal. The signals transmitted over the radio connection between the base station and the subscriber terminal comprise bursts consisting of symbols. The bursts comprise a known training sequence. According to the document, the training sequence is used for signalling. The document describes how it is possible to implement signalling related to the power control of the base station or the subscriber terminal, or in packet transfer, the number of bursts, packets or other data blocks. International patent application publication number WO 99/67916 having a priority date of 25 June 1998, an International filing date of 1 June 1999 (Rule 54(3) EPC) and a publication date of 29 December 1999 describes a method for decorrelating background interference in a time-synchronised mobile communications systems. The document discloses a method and system for decorrelating background interference signals in a time-synchronised cellular system, in which a mobile station inserts a different training sequence in each successive transmitted burst. The constantly varying background interference signal environment that results can be decorrelated at base station receivers, which enhances the reception of multiple independent mobile station transmissions, and thus increases the sensitivity and precision of time-synchronisation measurements, such as, for example, time-of-arrival or time-difference-of-arrival measurements made for mobile station positioning purposes. In view of the preceding, there is a need to improve the DPE in response to actual and false midamble basic sequences, and this need is addressed by the preferred embodiments as as disclosed by the independent claims 1, 12, 16, 28, 30, 31 and 32. Particular and preferred aspects of the present invention are set out in the appended independent and dependent claims. In one example, there is a wireless communication system. The system comprises transmitter circuitry comprising circuitry for transmitting a plurality of frames to a receiver in a first cell. Each of the plurality of frames comprises a bit group, and the bit group distinguishes the first cell from a second cell adjacent the first cell. Preferably, the bit group uniquely distinguishes the first cell from an adjacent second cell. The transmitter circuitry further comprises circuitry for inserting a bit sequence into the bit group. The bit sequence is selected from a plurality of bit sequences such that successive transmissions by the transmitter circuitry comprise a cycle of successive ones of the plurality of bit sequences. Other circuits, systems, and methods are also disclosed and claimed. Specific embodiments of the invention will now be described, by way of example only, and with reference to the accompanying drawings, in which: Figure 1 illustrates a diagram of a cellular communications system by way of a contemporary code division multiple access ("CDMA") example in which the preferred embodiments may be implemented. Figure 2 illustrates a TDD radio frame within which the preferred embodiments may be embedded. Figure 3 illustrates a time slot within the radio frame of Figure 2. Figure 4 illustrates a midamble structure for various users in the same cell wherein the basic sequence of the midamble is time shifted for different users. Figure 5 illustrates a conceptual drawing of a set of paths received by a receiver. Figure 6 illustrates a plot of the cumulative distribution of intercell rejection in response to midambles under the prior art. Figure 7 illustrates a block diagram of the circuitry of a base station as an example of a transmitter/receiver according to the preferred embodiment. Figure 8 illustrates a state diagram of a method for cycling midambles in cell transmissions according to the preferred embodiment. Figures 9a through 9d illustrate an example of a receiver's channel estimates by cycling over a sequence of four midambles. Figure 10 illustrates a plot of the cumulative distribution of intercell rejection in response to cycling midambles according to the preferred embodiment. Figure 11 presents an additional illustration contrasting the results of actual versus false path detection between the prior art and the preferred embodiments. Figure 1 illustrates a diagram of a cellular communications system 10 by way of a contemporary code division multiple access ("CDMA") or wideband CDMA ("WCDMA") example in which the preferred embodiments may be implemented. Within system 10 are shown two base stations BST1 and BST2. Each base station BST1 and BST2 includes a respective antenna AT1 and AT2 from which the station may transmit or receive CDMA signals. The general area of intended reach of each base station defines a corresponding cell; thus, base station BST1 is intended generally to communicate with cellular devices within Cell 1 while base station BST2 is intended generally to communicate with cellular devices within Cell 2. Of course, some overlap between the communication reach of Cells 1 and 2 exists by design to support continuous communications should a communication station move from one cell to the other. Indeed, further in this regard, system 10 also includes a user station UST, which is shown in connection with a vehicle V to demonstrate that user station UST is mobile. Thus, vehicle V and its corresponding user station UST may move freely in and between Cell 1 and Cell 2 (or other cells). In addition, by way of example user station UST includes a single antenna ATU for both transmitting and receiving cellular communications. In some respects, system 10 may operate according to known general techniques for various types of cellular or other spread spectrum communications, including CDMA communications. Such general techniques are known in the art and include the commencement of a call from user station UST and the handling of that call by either or both of base stations EST1 and BST2. Other techniques are ascertainable by one skilled in the art. One aspect of operation of system 10 which is further enhanced according to the preferred embodiments, and which in various respects is also reflected in the prior art, relates to a technique known as channel estimation. Channel estimation is used by a receiver, where such a receiver could be either in user station UST of base station BST, to estimate the effects that have been imposed on a signal communicated from a transmitter. For example with respect to Figure 1, since user station UST is located within Cell 1, then as user station UST receives data frames from base station BST1, these frames are said to have arrived along communication channels, and user station UST attempts to determine the effects those channels have on the communication. By estimating these effects, the received signal or later-received signals may be processed in view of the channel estimate in an effort to remove the channel effects, thereby properly recovering the actual data transmitted by base station BST1. In a similar respect, as base station BST1 receives data frames from user station UST, base station BST1 also attempts to determine the channel effects imposed on those data frames. In any event, as described in the introductory description section of this document, channel estimation is performed in response to a midamble encoded within each data frame received by a receiver; thus, the notion of frames and midambles, both in connection with the prior art and the preferred embodiments, are further explored below. Figure 2 illustrates a TDD radio frame FR within which the preferred embodiment midambles may be embedded, where the general timing associated with frame FR and its division into portions as described below are known in the art. Frame FR is 10 milliseconds long and is divided into 15 equal duration slots (i.e., therefore, each slot has a duration of 667 microseconds). For the sake of reference, such slots are shown in Figure 2 as SL 1 through SL 15 , and slot SL 1 is expanded by way of an example in Figure 3 to illustrate the following further details. Figure 3 illustrates the structure of a TDD time slot, where slot SL 1 from Figure 2 is shown by way of example. Generally, each slot, including therefore slot SL 1 , is divided into what is referred to in the CDMA art as "chips." Specifically, CDMA communications are modulated using a spreading code which consists of a series of binary pulses, and each piece of CDMA signal transmitted according to this code is said to be a "chip." One current CDMA transfer rate is 3.84 Mchips/second and, thus, the 10 millisecond frame FR includes 38,400 chips (i.e., 3.84 Mchips/second*10 milliseconds = 38,400). As a result, each of the 15 slots accommodates a total of 2,560 chips (i.e., 38,400 chips/15 slots = 2,560), and each of 160 CDMA symbols within a slot is modulated with 16 chips (i.e., 2,560 chips/slot ÷ 1 slot/160 symbols = 16). Looking to the further breakdown of information within a time slot as illustrated by the example of time slot SL 1 , it includes a first group of data symbols 20 having 1104 chips. First group 20 corresponds to 69 data symbols for an example spreading factor equal to 16. Following first group 20 in time slot SL 1 is a midamble 22 having 16 symbols for the example spreading factor equal to 16. As introduced earlier in this document, midamble 22 includes a predetermined training sequence, where this training sequence is used for purposes of channel estimation typically determined using a Fourier transform process. Thus, these midamble symbols are comparable in some respects to pilot symbols used in frequency division duplex ("FDD") systems. Following midamble 22 in time slot SL 1 is a second group of data symbols 24, also having 1104 chips. Note that the channel estimate derived from midamble 22 is preferably applied against both the first and second group of data symbols 20 and 24. Finally, second group 24 is followed in time slot SL 1 by a guard period 26. Guard period 26 has 96 chips. Figure 4 illustrates a diagram of an embodiment of the midamble pattern that is used for channel estimation and further demonstrates the use of that pattern for multiple user stations. Specifically, Figure 4 illustrates four midambles 30 1 through 30 4 corresponding to four respective user stations in a single cell, such as for Cell 1 in Figure 1. Each midamble includes a cyclic prefix where, for sake of reference, each cyclic prefix is identified by adding a "CP" subscript to the midamble identifier (e.g., cycle prefix 30 1CP for midamble 30 1 ). Each midamble also includes a circularly shifted basic sequence area which is identified by adding a "BSA" subscript to the midamble identifier (e.g., basic sequence area 30 1BSA for midamble 30 1 ). A physical gap is shown in Figure 4 between each cyclic prefix and its basic sequence area only for the sake of illustration, where in fact it should be noted that the information for a given midamble is contiguously presented starting with the cyclic prefix and followed by information in its circularly-shifted basic sequence area. Each of these components of the midamble is further discussed below. Each circularly shifted basic sequence area includes the cell's unique basic sequence but which is positioned in a shifted manner that is circular with respect to the basic sequence for each other user station in the same cell. To illustrate this aspect, Figure 4 depicts shading in each basic sequence area to denote the logical beginning of the sequence, where the non-shaded area is intended to illustrate the remainder of the basic sequence. For example with respect to midamble 30 1 , within its basic sequence area 30 1BSA is its basic sequence with its beginning logically positioned to the left in the area and followed by the remainder of the basic sequence bits; in contrast, midamble 30 2 includes the same basic sequence within area 30 2BSA , but its shaded portion demonstrates that the beginning of the basic sequence is shifted farther in time to the right relative to basic sequence area 30 1BSA of midamble 30 1 . The station, it is now noted further that such an alteration may be achieved by further including within block 50 a joint detector function. In this case, the joint detector provides a multi-user detection functionality which is preferred for a TDD system because the spreading factor is relatively small (e.g., 16) and so there is considerable interference from other users. Thus, the joint detector operates to cancel out interference from other users. Returning to block 50 in general, after the demodulated data are associated with their respective channels, symbol decode function 52 decodes the received symbols, for each channel and thus each conversation, into a bit stream suitable for communication to the network via physical layer interface 55 and network interface function 56. Figure 8 illustrates a state diagram of a preferred embodiment method for operating a transmitter (i.e., either in a base station EST1 or BST2 or user station UST) to cycle the midambles it includes in its transmissions. For the sake of focusing on a preferred aspect, the state diagram of Figure 8 is directed only to the insertion of midambles into frames (i.e., time slots thereof) by a transmitter, where such operations may occur via encode and modulate function 54 of Figure 7; however, one skilled in the art should appreciate that the transmitter (and its associated receiving circuitry) is also concurrently performing numerous other functions not illustrated with respect to Figure 8. Looking to the state diagram, the transmitter begins its operation in a first state S 1 . Next, the operation transitions from state S 1 to state S 2 , and this transition represents the formation of a first frame F 1 to be transmitted by the transmitter. Specifically, for each time slot in this first frame F 1 , a first midamble M 1 is inserted into the time slot for first frame F 1 (shown in Figure 8 as M 1 →F 1 ). Next, the operation transitions from state S 2 to state S 3 , and this transition represents the formation of a second frame F 2 to be transmitted by the transmitter. For each time slot in this second frame F 2 , a second midamble M 2 is inserted into the time slot for second frame F 2 (i.e., M 2 →F 2 ). Further, the operations just described through state S 3 repeat for each additional state transition in Figure 8, whereby a final state S K is shown representing the formation of a frame F K where for that frame the transmitter inserts a midamble M K into each time slot for that frame F K . Having described a first sequence of the states of Figure 8, attention is now directed to the next (and further successive) sequences of those states. First, after state S K is reached and frame F K is transmitted with midamble M K , it may be appreciated that the midambles corresponding to frames F 1 through F K have cycled through a respective sequence of midambles M 1 through M K . Following the transmission of frame F K and its midamble M K , the flow of Figure 8 returns to state S 1 . Thus, the next frame to be transmitted by the transmitter may be represented as F K +1 . For this frame, the cyclic sequence of midambles M 1 through M K is repeated, starting therefore with the first midamble in that sequence, M 1 ; thus, M 1 is now inserted by the transmitter into frame F K +1 . As each additional frame is created, then each additional state is encountered so that the cycling through the midamble sequence continues, whereby midamble M 2 is inserted into frame F K +2 , midamble M 3 is inserted into frame F K +3 , and so forth until midamble M K is inserted into frame F 2 K . Finally, the state diagram of Figure 8 may repeat numerous times, where each repetition of all states corresponds to a complete cycling through the midamble sequence for the base station. From the preceding, one skilled in the art should now appreciate that in the preferred embodiment a transmitter does not transmit only a single assigned midamble corresponding to the cell in which it is located as is the case in the prior art. Instead, in the preferred embodiment a cell is assigned a sequence of K midambles, and then a transmitter communicating within that cell cycles through these midambles one at a time. In the preferred embodiment, the cycling is such that a different midamble is used for each successive frame transmitted by the transmitter until all midambles in the cycle have been transmitted. Given this operation, various additional observations may be made in connection with particular implementations. As a first observation, the value of K in Figure 8 may be selected by one skilled in the art according to various considerations. For example, during the development of the preferred embodiment, a value of K on the order of 18 was explored, thereby providing a cyclic sequence of midambles having a total of 18 different midambles. More recently and as further detailed below, it has been observed as a preferred embodiment that operational improvements may be achieved over the prior art with K equal to a lesser number than 18, and indeed considerable benefit may be achieved with K equal to two or four. For an embodiment in which K =2, respective midambles may be selected in accordance with whether the frame number is odd or even. As a second observation, the mechanism for implementing the sequencing operation and its repetition may be selected by one skilled in the art. In one preferred embodiment approach, note that base station communications in a TDD system are synchronized to the extent that each frame includes a system frame number. Accordingly, the tracking of the change to each different midamble in the cyclic sequence of midambles may be associated with a change in the system frame number. For example, in a preferred embodiment where the cyclic sequence includes two different midambles (i.e., K =2), then a first midamble may be inserted into a frame and transmitted by a transmitter when the base station's system frame number is odd while a second midamble may be inserted into a frame and transmitted by a transmitter when the base station's system frame number is even. As another example, in a preferred embodiment where the cyclic sequence has more than two different midambles (i.e., K >2), then a modulo counter may be triggered by each increment in the base station's system frame number where each change in the counter causes a different and next successive one of the midambles in the cyclic sequence to be inserted into a frame and transmitted by a transmitter. Still other examples are ascertainable by one skilled in the art. Having described the transmission through a cycle of midambles for a cell according to the preferred embodiment, one skilled in the art should readily appreciate that comparable operations are to be performed by a receiver within a given cell as is now briefly explored. Generally, the receiver operation parallels that of the state diagram of Figure 8, where for each successive state transition the receiver measures channel estimates in response to the midamble for the current state. For example, since midamble M 1 is transmitted in frame F 1 and is selected from a cycle of midambles in response to the system frame number, then when that frame F 1 is received then the receiver uses the same system frame number to use the same midamble M 1 to measure channel estimates, that is, to evaluate the correlation between midamble M 1 and the midambles in the received paths. Similarly, therefore, this cycling operation at the receiver continues for successive frames, again as reflected by the system frame number. Thus, when the next frame, F 2 , is received by the receiver, it uses the system frame number to indicate to it that it is to use midamble M 2 to measure channel estimates. This process, therefore, continues in a circular fashion up to using midamble M K for measuring channel estimates with respect to frame F K , after which the process repeats with midamble M 1 and so forth. To further demonstrate the operation of a receiver in accordance with the preferred embodiment, Figures 9a through 9d depict an example of successive frames received for a system using a cycle of four midambles M 1 through M 4 (i.e., K =4), respectively. The general format of Figures 9a through 9d is comparable to Figure 5 in that each Figure illustrates a conceptual drawing of a number of paths detected by a receiver at the chip positions depicted, where it now be further understood with respect to the present Figures that they illustrate paths identified by the receiver performing channel estimates using the cycle of four midambles M 1 through M 4 . Thus, for Figure 9a, the receiver determines channel estimates using midamble M 1 and, in response, it identifies six paths P 10 through P 15 . Similarly, for Figure 9b, the receiver determines channel estimates using midamble M 2 and, in response, it identifies four paths P 20 through P 23 . Similar observations may be made with respect to Figure 9c where paths P 30 through P 36 are identified in response to a channel estimate based on midamble M 3 and with respect to Figure 9d where paths P 40 through P 45 are identified in response to a channel estimate based on midamble M 4 . Examining now Figures 9a through 9d as a whole, the results of the preferred embodiment of cycling midambles for signal transmission and receipt may be appreciated. More particularly, a receiver performing DPE in the preferred embodiment does so by evaluating channel estimates over successive frames using the different midambles in the cycle as described above, and then the receiver further enhances that process by identifying as actual paths those paths that appear at the same bit position for those successive frames. In other words, for each individual Figure 9a through 9d and according to the prior art, only the relative magnitude of each path provides a basis from which to attempt to distinguish an actual path from a false path. However, because the preferred embodiment uses a different midamble for successive frames, then only those paths that appear in the same bit positions over those successive frames are likely to be actual paths. To further appreciate this aspect, note in contrast that if the same midamble were used as in the prior art, then one skilled in the art would anticipate paths to exist at different positions as between Figures 9a and 9b due to the cross-correlations from one or more other midambles. However, because cycled midambles are used in the preferred embodiment, then it is much more likely that paths at the same bit position over successive frames are likely to be from strong autocorrelations for each different midamble in the cycle and, hence, such like-positioned paths are likely to reflect an actual path rather than a false path. By way of a specific example, comparing Figure 9a to Figure 9b, it may be seen that three paths occur at like chip positions, namely, paths P 12 and P 21 occur at position 14, paths P 13 and P 22 occur at position 16, and paths P 14 and P 23 occur at position 20. Various circuits may be used to identify these like-positioned paths, such as through use of a matched filter. In any event, with only the two midambles of Figures 9a and 9b, it could be predicted that each of the three paths having common bit positions are actual paths, while the remaining paths are false paths. However, by adding Figure 9c and its midamble M 3 to the analysis, it may be seen that no path is identified at position 20, while there are still two paths (i.e., paths P 33 and P 34 ) at position 14 and 16 for which there were paths for midambles M 1 and M 2 in Figures 9a and 9b, respectively. Indeed, finally looking to Figure 9d, once again it is seen that paths exist at positions 14 and 16 (i.e., paths P 42 and P 44 ). Accordingly, in the preferred embodiment the DPE of the receiver is aided by giving additional consideration to those paths at like positions and, thus, it may be concluded by the receiver after cycling through midambles M 1 through M 4 that the paths at positions 14 and 16 are actual paths (and, thus, are shaded by way of the convention of Figure 5), while the remaining paths indicated in Figures 9a through 9d are false paths (and, thus, are not shaded by way of the convention of Figure 5). Figure 10 illustrates a plot of the cumulative distribution of intercell rejection in response to cycling midambles according to the preferred embodiment. More particularly, Figure 10 illustrates the intercell rejection for an example where K =18, that is, the midambles are cycled in frame transmissions over a sequence of 18 different sequences before returning again to repeat that sequence. The plot of Figure 10 therefore may be contrasted to the prior art plot of Figure 6. In Figure 10, the minimum intercell rejection is 9 dB and the median rejection is 11 dB. Thus, in general the intercell rejection is greater than that in the prior art and, therefore, there is a greater tendency to reject false paths. As a result, this allows the DPE to more accurately determine actual paths, with the improved detection of those paths thereby improving additional receiver operations. Figure 11 presents an additional illustration contrasting the results between the prior art and the preferred embodiments as relating to actual versus false path detection. Specifically, Figure 11 illustrates a cumulative distribution of midambles, and for that distribution Figure 11 presents a plot 60 corresponding to the case of no midamble cycling, as well as a plot 62 corresponding to the case of cycling between two different midambles and a plot 64 corresponding to the case of cycling between four different midambles. The vertical axis in Figure 11 indicates the number of false paths having a value of greater than -10 dB, that is, paths below -10 dB are disregarded. Plot 60 demonstrates that if no midamble cycling is performed, then 50 percent of the time there are eight or more false paths that are -10 dB or stronger. In contrast, plot 62 demonstrates that if midamble cycling is performed per Figure 8 and using only two midambles (i.e., K =2), then far fewer number of false paths occur as compared to plot 60. Still further, plot 64 demonstrates that if midamble cycling is performed per Figure 8 and using four midambles (i.e., K =4), then more than 85 percent of the time there are no false paths detected. From the above, it may be appreciated that the above embodiments provide a transmitter for use in a wireless system and for cycling midambles to improve intercell rejection. In addition, still other changes may be made to the inventive teachings. For example, the transmitter of Figure 7 is only one of many transmitter embodiments which may cycle midambles according to the teachings of this document. As another example, while midambles have been shown to be cycled on a per frame basis, in an alternative embodiment they may be cycled according to some other grouping of data (e.g., per time slot, per multiple frames). As another example, while the preferred embodiment has been described in the context of a TDD CDMA implementation, other wireless systems such as time division multiple access ("TDMA") also may benefit from the present teachings. As yet another example, while a midamble has been shown as a preferred group of bits that may be cycled, other sets of bits that are unique to a cell may well be identified by one skilled in the art as having undesirable cross correlations so that as an improvement the bit sets may be cycled through a sequence of two or more alternative bit sets so as to reduce the cross correlations and any negative results arising from those cross correlations. From the above, therefore, one skilled in the art should further appreciate the inventive scope as defined by the following claims. In particular, with reference to the appended claims, features from dependent claims may be combined with those of the independent claims and features from respective independent claims may be combined in any appropriate manner and not merely in the specific combinations enumerated in the claims. Insofar as embodiments of the invention described above are implementable, at least in part, using a software-controlled programmable processing device such as a Digital Signal Processor, microprocessor or other processing device, it will be appreciated that a computer program for configuring the programmable device to implement the foregoing described methods is envisaged as an aspect of the present invention. The computer program may be embodied as source code and undergo compilation for implementation on a processing device, or may be embodied as object code. Suitably, the computer program is stored on a carrier medium in machine or device readable form, for example in solid-state memory or magnetic memory such as disc or tape and the processing device utilises the program or a part thereof to configure it for operation. The computer program may be supplied from a remote source embodied in a communications medium such as an electronic signal, radio frequency carrier wave or optical carrier wave. Such carrier media are also envisaged as aspects of the present invention.

Claims: A wireless communication apparatus (BST1, BST2), comprising: circuitry for inserting a training sequence in each burst of a plurality of frames (FRI, FRI+1....), wherein the training sequences in successive frames are different and are selected according to a cyclic sequence; circuitry for transmitting said plurality of frames to a user station; circuitry for receiving a plurality of frames, each including a training sequence from said user station; circuitry for performing channel estimation on each received training sequence responsive to correlation between training sequences in a known cyclic sequence of training sequences inserted at said user station and the training sequences in said received plurality of frames; and characterised by circuitry for identifying paths in the received plurality of frames as actual paths in response to a comparison of path positions resulting from said successive correlations. The apparatus of claim 1, wherein each of the plurality of frames comprises a midamble (22) comprising the training sequence for that frame. The apparatus of claim 2, wherein the midambles's sequence of bits consists of two bits sequences. The apparatus of claim 2 or 3, wherein each of the plurality of frames has a corresponding system frame number; and wherein the sequence of bits is selected from a plurality of bit sequences in response to the system frame number. The apparatus of claim 4 wherein the sequence of bits is selected from the plurality of bit sequences in response to whether the system frame number is odd or even. The apparatus of claim 2, wherein the sequence bits consists of four bit sequences. The apparatus of any preceding claim, wherein each of the plurality of frames comprises a midamble comprising the bit group for that frame and wherein the circuitry for transmitting comprises CDMA transmitter circuitry. The apparatus of claim 6, wherein each of the plurality of frames has a corresponding system frame number; and wherein each sequence of bits is selected from the plurality of sequences in response to the system frame number. The apparatus of claim 8, wherein the circuitry for transmitting comprises CDMA transmitter circuitry. The apparatus of any one of claims 1 to 6 or 8, wherein the circuitry for transmitting comprises TDMA transmitter circuitry. The apparatus of claim 1, wherein the circuitry for identifying paths in the plurality of frames as actual paths identifies, as actual paths, in response to those paths in the plurality of frames having a like chip position in the successive correlations. A wireless communication system, comprising: receiver circuitry comprising circuitry for receiving a plurality of frames (FR1, FRI+1....) from a transmitter (UST) in a first cell (CELL1); wherein each of the plurality of frames comprises a plurality of slots (SL 1 , SL 2 ,....SL 15 ), a sequence of bits within each of said slots distinguishing the first cell from a second cell (CELL2) adjacent the first cell; wherein each of the sequence of bits further comprises a training sequence wherein the training sequences in successive frames are different and are selected according to cyclic sequence; and characterised by wherein each of the sequence of bits further comprises a training sequence wherein the training sequences in successive frames are different and are selected according to cyclic sequence; and wherein the receiver circuitry further comprises circuitry for comparing the training sequences in successive received frames to the known training sequences in the cyclic sequence to identify paths in the plurality of frames as actual paths. The system of claim 12, wherein the circuitry for identifying paths identifies paths as actual paths in response to paths in the plurality of frames having a like chip position. The system of claim 12 or 13, wherein each of the plurality of slots comprises a midamble comprising the training sequence for that frame. The system of claim 14, wherein the sequence of bits consists of two groupings of bits. A method of operating a wireless communication system, comprising the steps of: transmitting a plurality of frames (FRI, FRI+1...) by transmitter circuitry to a receiver (UST) in a first cell (CELL1); wherein each of the plurality of frames comprises plurality of slots (SL 1 , SL 2 ....SL 15 ), a sequence of bits within each of said slots distinguishing the first cell from a second cell (CELL2) adjacent the first cell; wherein the sequence of bits uniquely distinguishes the first cell from a second cell adjacent the first cell; and characterised by wherein the transmitting step comprises inserting a training sequence in the sequence of bits wherein the training sequences in successive frames are different and are selected according to a cyclic sequence; such that a received can compare the training sequences in successive receiver frames to the known training sequences in the cyclic sequence to identify paths in the plurality of frames as actual paths. The method of claim 16, wherein each of the plurality of frames comprises a midamble (22) comprising the training sequence for that frame. The method of claim 17, wherein the midamble's sequence of bits consists of two bit sequences. The method of any one of claims 16 to 18, wherein each of the plurality of frames has a corresponding system frame number; and wherein the sequence of bits is selected from a plurality of bit sequences in response to the system frame number. The method of claim 19, wherein the sequence of bits is selected from the plurality of bit sequences in response to whether the system frame number is odd or even. The method of claim 16 or 17, wherein the sequence of bits consist of four bit sequences. The method of any one of claims 16 to 21, wherein each of the plurality of frames comprises a midamble comprising the training sequence for that frame and wherein the transmitter circuitry comprises CDMA transmitter circuitry. The method of claim 21, wherein each of the plurality of frames has a corresponding system frame number; and wherein each sequence of bits is selected from the plurality of bit sequences in response to the system frame number. The method of claim 23, wherein the transmitter circuitry comprises CDMA transmitter circuitry. The method of any one of claims 16 to 21 or 23, wherein the transmitter circuitry comprises TDMA transmitter circuitry. The method of any one of claims 16 to 25, further comprising the steps of: receiving the plurality of frames at a receiver station in the first cell; and identifying paths in the plurality of frames as actual paths in response to a comparison of path positions resulting from successive measures between successive ones of the plurality of training sequences in the cyclic sequence and the training sequence in each of the plurality of frames. The method of claim 26, further comprising applying channel estimates corresponding to the actual paths to a maximal ratio combiner circuit. A method of operating a wireless communication system, comprising the steps of: receiving a plurality of frames (FRI, FRI+1....) from a transmitter (UST) in a first cell (CELL1); wherein each of the plurality of frames comprises plurality of slots (SL 1 , SL 2 ....SL 15 ), a sequence of bits within each of said slots distinguishing the first cell from a second cell (CELL2) adjacent the first cell; wherein the sequence of bits distinguishes the first cell from a second cell adjacent the first cell; wherein the sequence of bits comprises a training sequence wherein the training sequences in successive frames are different and are selected according to a cyclic sequence; and characterised by comparing the training sequences in successive received frames to the known training sequences in the cyclic sequence to identify paths in the plurality of frames as actual paths. The method of claim 28, wherein the identifying step comprises identifying paths as actual paths in response to paths in the plurality of frames have a like chip position. A computer program in machine or device readable form for configuring a programmable device to implement a method of operating a wireless communication system, comprising the steps of: transmitting a plurality of frames (FRI, FRI+1...) by transmitter circuitry to a receiver (UST) in a first cell (CELL1); wherein each of the plurality of frames comprises plurality of slots (SL 1 , SL 2 ....SL 15 ), a sequence of bits within each of said slots distinguishing the first cell from a second cell (CELL2) adjacent the first cell; wherein the sequence of bits uniquely distinguishes the first cell from a second cell adjacent the first cell; and characterised by wherein the transmitting step comprises inserting a training sequence in the sequence of bits wherein the training sequences in successive frames are different and are selected according to a cyclic sequence, such that a receiver can compare the training sequences in successive received frames to the known training sequences in the cyclic sequence to identify paths in the plurality of frames as actual paths. A computer program in machine or device readable form and convertible for configuring a programmable device to implement a method of operating a wireless communication system, comprising the steps of: receiving a plurality of frames (FRI, FRI+1...) from a transmitter (UST) in a first cell (CELL1); wherein each of the plurality of frames comprises plurality of slots (SL 1 , SL 2 ....SL 15 ), a sequence of bits within each of said slots distinguishing the first cell from a second cell (CELL2) adjacent the first cell; wherein the sequence of bits distinguishes the first cell from a second cell adjacent the first cell and further wherein the sequence of bits comprises a training sequence wherein the training sequences in successive frames are different and are selected according to a cyclic sequence; and characterised by comparing the training sequences in successive frames to the known training sequences in the cyclic sequence to identify paths in the plurality of frames as actual paths. A carrier medium carrying a computer program according to claim 30 or 31.

Inventors: DABAK ANAND G, GATHERER ALAN, SCHMIDL TIMOTHY M, DABAK, ANAND G., GATHERER, ALAN, SCHMIDL, TIMOTHY M.
Applicants: TEXAS INSTRUMENTS INC, TEXAS INSTRUMENTS INCORPORATED
Application year: 2000
Main classification: H04Q7
IPC codes: H04B7, H04B1, H04W28