A method is for communicating by tracking time varying channels in a multiple access packet based communication network. Each packet includes a preamble portion including a data symbol, and a data portion including data symbols. The method may include initializing a channel estimate reference from an initial channel estimate based upon the data symbol in a preamble portion of a received packet, and updating the channel estimate reference based upon a channel estimate of a current data symbol and a previously received data symbol from the data symbols in a data portion of the received packet. The method may also include repeating the updating upon receipt of a subsequent data symbol from the data symbols in the data portion of the received packet.

Patent
   RE48314
Priority
Jul 24 2003
Filed
Feb 24 2017
Issued
Nov 17 2020
Expiry
Jul 23 2024
Assg.orig
Entity
Large
1
89
EXPIRED
22. A method of communicating by tracking a plurality of time varying channels in a multiple access packet based communication network, each packet comprising a preamble portion included at least one data symbol, and a data portion including a plurality of data symbols, the method comprising:
initializing a channel estimate reference from an initial channel estimate based upon the at least one data symbol in a preamble portion of a received packet;
updating the channel estimate reference based upon a channel estimate of a current data symbol and at least one previously received data symbol from the plurality of data symbols in a data portion of the received packet, the updating comprising:
for each data symbol, demodulating the data symbol based upon the channel estimate,
decoding the data symbol,
generating training data by remodulating the decoded data symbol,
updating the a channel estimate database based upon the training data, and
generating the channel estimate for the data symbol based upon the updated channel estimate database;
repeating the updating upon receipt of at least one subsequent data symbol from the plurality of data symbols in the data portion of the received packet; and
storing the channel estimate reference in a the channel estimate database at a received device.
0. 24. A method of estimating one or more time varying channels in a multiple access packet based communication network, each packet comprising a preamble portion including at least one preamble symbol, and a data portion including a plurality of data symbols, the method comprising:
initializing an initial channel estimate based upon the at least one preamble symbol in a preamble portion of a received packet;
updating the initial channel estimate to form updated channel estimates for a current data symbol and at least one previously received data symbol from the plurality of data symbols in a data portion of the received packet, the updating comprising:
generating a first channel estimate for the current data symbol based upon the initial channel estimate,
decoding the current data symbol based upon the first channel estimate for the current data symbol to form decoder outcomes, and
generating a second channel estimate for a data symbol directly preceding the current data symbol based upon the decoder outcomes remodulated without re-encoding, the updated channel estimates including at least the second channel estimate;
repeating the updating upon receipt of at least one subsequent data symbol from the plurality of data symbols in the data portion of the received packet; and
for each subsequent received data symbol, pipelining the steps of demodulating and modulating during the updating.
0. 25. A wireless communications device for estimating one or more of time varying channels in a multiple access packet based communication network, each packet comprising a preamble portion including at least one preamble symbol, and a data portion including a plurality of data symbols, the wireless communications device comprising:
a baseband receiver processor; and
a wireless transceiver incorporating said baseband receiver processor and configured to perform:
initializing an initial channel estimate based upon the at least one preamble symbol in a preamble portion of a received packet,
updating the initial channel estimate to form updated channel estimates for a current data symbol and at least one previously received data symbol from the plurality of data symbols in a data portion of the received packet, the updating comprising:
generating a first channel estimate for the current data symbol based upon the initial channel estimate,
decoding the current data symbol based upon the first channel estimate for the current data symbol to form decoder outcomes,
generating a second channel estimate for a data symbol directly preceding the current data symbol based upon the decoder outcomes remodulated without re-encoding, the updated channel estimates including at least the second channel, and
repeating the updating upon receipt of at least one subsequent data symbol from the plurality of data symbols in the data portion of the received packet.
23. A wireless communications device for communicating by tracking a plurality of time varying channels in a multiple access packet based communication network, each packet comprising a preamble portion including at least one data symbol, and a data portion including a plurality of data symbols, the wireless communications device comprising:
a controller baseband receiver processor; and
a wireless transceiver cooperating with incorporating said controller for initializing baseband receiver processor, the wireless transceiver initiating a channel estimate reference from an initial channel estimate based upon the at least one data symbol in a preamble portion of a received packet,
updating the channel estimate reference based upon a channel estimate of a current data symbol and at least one previously received data symbol from the plurality of data symbols in a data portion of the received packet, the updating comprising:
for each data symbol, demodulating the data symbol based upon the channel estimate,
decoding the data symbol,
generating training data by remodulating the decoded data symbol,
updating the a channel estimate database based upon the training data, and
generating the channel estimate for the data symbol based upon the updated channel estimate database,
repeating the updating upon receipt of at least one subsequent data symbol from the plurality of data symbols in the data portion of the received packet, and
storing the channel estimate reference in a the channel estimate database at a receiver device.
1. A method of communicating by tracking a plurality of time varying channels in a multiple access packet based communication network, each packet comprising a preamble portion including at least one data symbol, and a data portion including a plurality of data symbols, the method comprising:
initializing a channel estimate reference from an initial channel estimate based upon the at least one data symbol in a preamble portion of a received packet;
updating the channel estimate reference based upon a channel estimate of a current data symbol and at least one previously received data symbol from the plurality of data symbols in a data portion of the received packet, the updating comprising:
generating the channel estimate for the current data symbol,
updating the channel estimate reference based upon the channel estimate for the current data symbol,
decoding the current symbol based upon the channel estimate for the current data symbol,
updating a channel estimate for a data symbol directly preceding the current data symbol based upon time smoothing data and the channel estimate for the current data symbol, and
re-decoding the data symbol directly preceding the current data symbol based upon the updated channel estimate therefor; and
repeating the updating upon receipt of at least one subsequent data symbol from the plurality of data symbols in the data portion of the received packet; and
for each subsequent received data symbol, pipelining the steps of demodulating and modulating during the updating.
11. A wireless communications device for communicating by tracking a plurality of time varying channels in a multiple access packet based communication network, each packet comprising a preamble portion including at least one data symbol, and a data portion including a plurality of data symbols, the wireless communications device comprising:
a controller baseband receiver processor; and
a wireless transceiver cooperating with incorporating said controller baseband receiver processor for:
initializing a channel estimate reference from an initial channel estimate based upon the at least one data symbol in a preamble portion of a received packet,
updating the channel estimate reference based upon a channel estimate of a current data symbol and at least one previously received data symbol from the plurality of data symbols in a data portion of the received packet, the updating comprising:
generating the channel estimate for the current data symbol,
updating the channel estimate reference based upon the channel estimate for the current data symbol,
decoding the current symbol based upon the channel estimate for the current data symbol,
updating a channel estimate for a data symbol directly preceding the current data symbol based upon time smoothing data and the channel estimate for the current data symbol, and
re-decoding the data symbol directly preceding the current data symbol based upon the updated channel estimate therefor, and
repeating the updating upon receipt of at least one subsequent data symbol from the plurality of data symbols in the data portion of the received packet.
2. The method according to claim 1 further comprising storing the channel estimate reference in a channel estimate database at a receiver device.
3. The method according to claim 1 further comprising transforming the channel estimate to a frequency domain prior to updating the channel estimate reference to provide a time smoothed channel estimate reference.
0. 4. The method according to claim 1 further comprising:
for each subsequent data symbol, during the updating, pipelining demodulating and modulating; and
updating the channel estimate reference by performing a forward error correction (FEC) decoding.
5. The method according to claim 1 wherein the multiple access packet based communication network comprises an orthogonal frequency-division multiplexing (OFDM) wireless network.
6. The method according to claim 5 wherein the updating of the channel estimate reference comprises calculations based upon at least one of a frequency domain statistic of a radio channel at an OFDM symbol rate, a time domain statistic of the radio channel across OFDM symbols, and outcomes of each decoded OFDM symbol.
7. The method according to claim 1 wherein the updating is performed on a data symbol-by-data symbol basis.
8. The method according to claim 1 wherein each previously received data symbol is decoded iteratively with each subsequent data symbol.
9. The method according to claim 1 wherein the updating based upon the current and the at least one previously received data symbols is performed in parallel.
10. The method according to claim 1 wherein the updating of the channel estimate reference is based upon the channel estimate of the current and all previously received data symbols.
12. The wireless communications device according to claim 11 wherein said controller and baseband receiver processor of the wireless transceiver are for storing stores the channel estimate reference in a channel estimate database at a receiver device.
13. The wireless communications device according to claim 11 wherein said controller and baseband receiver processor of the wireless transceiver are for transforming transforms the channel estimate to a frequency domain prior to updating the channel estimate reference to provide a time smoothed channel estimate reference.
14. The wireless communications device according to claim 11 wherein said controller and baseband receiver processor of the wireless transceiver, are for:
for each subsequent data symbol during the updating, pipelining demodulating and modulating; and updating, updates the channel estimate reference by performing a forward error correction (FEC) decoding.
15. The wireless communications device according to claim 11 wherein the multiple access packet based communication network comprises an orthogonal frequency-division multiplexing (OFDM) wireless network.
16. The wireless communications device according to claim 15 wherein the updating of the channel estimate reference comprises calculations based upon at least one of a frequency domain statistic of a radio channel at an OFDM symbol rate, a time domain statistic of the radio channel across OFDM symbols, and outcomes of each decoded OFDM symbol.
17. The wireless communications device according to claim 11 wherein the updating is performed on a data symbol-by-data symbol basis.
18. The wireless communications device according to claim 11 wherein each previously received data symbol is decoded iteratively with each subsequent data symbol.
19. The wireless communications device according to claim 11 wherein the updating based upon the current and the at least one previously received data symbols is performed in parallel.
20. The method according to claim 1 wherein updating the channel estimate reference comprises error control based decoding.
21. The wireless communications device according to claim 11 wherein updating the channel estimate reference comprises error control based decoding.
0. 26. The method according to claim 1 further comprising:
updating the channel estimate reference by performing a forward error correction (FEC) decoding.

This application is a divisional of pending U.S. application Ser. No. 12/195,492 filed Aug. 21, 2008, which is a divisional application of U.S. patent application Ser. No. 10/897,886, filed Jul. 23, 2004, which claims the benefit of Australian Patent Application No. 2003-903826 filed Jul. 24, 2003, PCT Application No. PCT/AU03/00502 filed Apr. 29, 2003, and Australian Patent Application No. PS 2053, the entire contents of these disclosures are hereby incorporated by reference in their entirety.

This application is a division of U.S. patent application Ser. No. 10/897,886 filed 23 Jul. 2004, which claims benefit of and is a continuation-in-part of co-pending international application No. PCT/AU03/00502 entitled “Filter Structure for Iterative Signal Processing”, filed 29 Apr. 2003, now WO 03/094037, which takes priority from Australian Provisional Patent Application No. PS2053, filed 2 May 2002, also entitled “Filter Structure for Iterative Signal Processing” and further claims benefit from Australian Provisional Patent Application No. 2003903826, filed 24 Jul. 2003, entitled “An OFDM Receiver Structure”. The specifications of and, International application (PCT) are Incorporated herein by reference in their entirety and for all purposes.

The present invention relates to the field of wireless communications. In particular, the present invention relates to improved multiple access communications. In one form, the invention relates to an improved signal processing method and apparatus for a multiple access communication system. It will be convenient to hereinafter describe the invention in relation to the use of an iterative method of determining the reception of a signal in a multi user packet based wireless OFDM (Orthogonal Frequency Division Multiplexing) communication system, however, it should be appreciated that the present invention may not be limited to that use, only. By way of further example, in other forms the present invention may relate to recursive filtering for joint iterative decoding in a variety of systems and functions such as linear multiple access channel decoders, iterative equalisation, iterative joint channel estimation and detection/decoding, iterative space-time processing, iterative multi user interference cancellation and iterative demodulation.

Throughout this specification the use of the word “inventor” in singular form may be taken as reference to one (singular) or more (plural) inventors of the present invention. The inventor has identified the following related art.

Most wireless communications systems are based on so-called multiple access techniques in which, information such as voice and data are communicated. This is a technology where many simultaneously active users share the same system resources in an organised manner. In most cases, sharing resources in a multiple access system means that if more than one user is active, then all active users interfere with each other. Traditionally, such interference has been considered to be part of the inevitable noise that corrupts transmissions.

Such interference increases with the number of active users and thus, the performance quality in terms of how many users (capacity) that can share the resources simultaneously becomes limited.

FIG. 1 shows an exemplary multiple access scenario that may occur in Wireless Networks. The radio terminals 102, 104 and 100b transmit signals that are received at network access point 100a. In general not all of these signals are intended for radio terminal 100a. They maybe signals from devices that belong to other networks, presumably in unlicensed radio spectrum. In any case there are ordinarily some users of interest that belong to the network to which 100a provides access. The Network aims to make arrangements for all of these signals to be effectively transmitted. Commonly the users may be required to share the radio resource by, for example, transmitting on different frequencies or at different times. Such techniques may be wasteful in terms of the expensive radio resource.

The radio terminal 102 may have an associated user 103 who generates and receives information (in the form of voice, video, data etc). Similarly, the radio terminal 102 is associated with a user. In the case of a vehicular user 105, the vehicle (such as bus, train, or car) may generate and receive data to be communicated over the network. This data may also be generated and received by the passengers and/or operators of the vehicle. The network access point 100b may also wish to communicate with radio terminal 100a as may be the case in wireless backhaul or multihop networks. In this respect, it is also possible that the other users' radio terminals 102, 104 may form part of any multihopping network.

One way to improve capacity is to introduce error control coding. Applying coding allows performance to be improved by only allowing a few of all possible combinations of code symbols to be transmitted. Another way is to exploit the information contained in the interference. This is known as joint multiuser detection. In systems where both these techniques are used, a decoding strategy may be applied which is termed iterative decoding. Here, a multiuser detector first provides an estimate of the transmitted symbols in terms of reliability information. This information is forwarded to decoders that also provide reliability information based on the input from the detector. Information is then exchanged in an iterative fashion until there are no further improvements. This decoding strategy may increase capacity significantly, getting very close to theoretical capacity limits at a complexity level within reach of practical implementation. However, an optimal multiuser detector is prohibitively complex for practical implementation, as the inherent complexity grows exponentially with the number of active users. Instead, linear multiuser detection based on linear filtering may be applied, where the corresponding complexity only grows linearly with the number of active users. The inventor has identified that for practical reasons related art linear filters for iterative joint multiuser decoding are based on the received signal and the most recent information from the decoders as input to the filter. These filters have been designed based on various optimality criteria.

Where multiple users share common communications resources, access to channel resources may be addressed by a multiple access scheme, commonly executed by a medium access control (MAC) protocol. Channel resources such as available bandwidth are typically strictly limited in a wireless environment. It is therefore desirable to use these resources as efficiently as possible. Allowing multiple users to share common resources creates a risk for disturbances and interference caused by colliding access attempts. Such disturbances are usually referred to as multiple access interference. In wireless local area network (WLAN) systems the MAC attempts to schedule transmissions from Stations in order to avoid collisions. Sometimes the MAC fails, and Stations access the channel resources simultaneously. An example of this situation is illustrated in FIG. 2, which shows the transmission of packets from a first transmitter station 1a second transmitter station 2 and, a representation of received packets at the access point shown on the lowermost line. Physical layer receivers may fail to recover such collided packets. As the traffic load on the network increases, this problem becomes a significant limiting factor in terms of network capacity and quality of service.

A different problem, leading to similar effects, is caused by the multipath nature of communication channels associated with, for example, a WLAN. The multipath channel causes several delayed replicas of the same signal to arrive at the receiver. This, in turn, creates self-interference similar in nature to multiple access interference discussed above. In this case, the problem becomes a limiting factor for the required power to achieve acceptable performance, which translates into limitations on the coverage of the WLAN. An example of a direct and a reflected version of the original signal arriving at the receiver is shown in FIG. 3, where the direct and reflected transmissions of the packet are illustrated on the top two lines as shown. The presence of self interference is indicated by shading in the received signal, represented by the access point on the lowermost line as shown. Transmission range may be affected by the interference mechanisms described above and also by the sophistication of the diversity signal processing at the Receiver. Physical Layer receiver designers therefore strive to ensure that effective use is made of all available time, frequency and space diversity (the latter may be provided through the use of multiple antennas).

The inventor has also identified that when synchronizing transmitted packets over wireless connections each packet ordinarily has a preamble of several repetitions of the same short signal. A received packet signal may be correlated with a delayed version of itself where commonly the delay equals the duration of the repeated signal component in the preamble. This correlation may be implemented repetitively over a given sample sequence. The output power of the resultant correlation may then be combined with the average power of the raw received signal to define a decision statistic. The point at which the decision statistic exceeds a given threshold is selected as the time of arrival of the packet. However, there are drawbacks with this technique in as much as signal distortions may be amplified or accentuated by the processing involved with the synchronization process producing uncertainties in the determination of packet timing.

Generally, in packet based communication systems it is important to reduce latency of a receiver or, in other words, provide as little delay as possible between arrival of signals and the decoding of the bits contained in those signals. Moreover, receiver processes are unable to determine the variation of a radio channel over the time of a packet length and the associated effect on the waveform of the transmitted signal. This may lead to lower than optimum data rates due to poorly tracked packets that are otherwise intact being discarded.

In OFDM packet based communication systems channel impairments may occur, which contribute to changing both the channel over which an OFDM signal travels and also the received signal itself. Collectively, these channel impairments comprise variations in the transmission channel due to multipath fading and, variations to OFDM symbols due to frequency and time offsets caused by receiver inaccuracies and phase offsets due to combined transmission and reception processes. These channel impairments may vary from OFDM symbol to OFDM symbol, in other words, they may not be invariant over the length of a packet. Traditionally, channel impairments are countered by estimates made using a packet preamble and maintained by pilot symbols throughout the received packet, which may assume invariance over the packet length. Other methods use data estimates to aid for example with channel estimation and these are implemented in the frequency domain and may result in power loss by discarding a cyclic prefix for each received symbol. Generally, there is no use made of all available received information to address channel impairments in such packet based communication systems.

With regard to space diversity, for multiple receiving antennae in wireless data packet communication systems related art schemes provide decisions on the synchronization of a received signal on the basis of per antenna and then a majority vote, otherwise the received measurements are added prior to the decision. These approaches do not address the variation of signal statistics across the number of antennae resulting in degraded synchronization accuracy and increased packet loss.

In EP 1387544 it is noted that time synchronisation of a receiver to the incoming signal is essential for effective decoding of that signal. In many packet based applications a special preamble is inserted by the transmitter at the start of every packet transmitted in order to assist the receiver with its timing estimation task. In OFDM systems the transmitter imparts a special structure on the signal called a cyclic prefix. This cyclic prefix is inserted for every OFDM symbol. A cyclic prefix is a replica of a small portion of the last section of a signal inserted at the start of the signal. There are many OFDM symbols transmitted sequentially in most forms of communication. In EP 1387544 the cyclic prefix, in the form of a guard interval as a cyclic continuation of the last part of the active symbol, is employed to time synchronise the receiver instead of a preamble. In EP 1387544 a two step time synchronisation approach is disclosed, namely a pre-FFT and post-FFT time synchronisation algorithm. These are complementary techniques and may be used together. The pre-FFT technique consists of a “delay and correlate” algorithm applied to find the cyclic prefix of the OFDM symbols. This is achieved by setting the delay in the “delay and correlate” algorithm to the distance between the cyclic prefix and the region from which it was copied. The output of the correlator is then filtered using an auto-regression filter comprising a recursive Infinite-Impulse Response (IIR) filter to determine an average of the correlation across OFDM symbols. A second filtering, by way of smoother 44 in FIG. 2 of EP 1387544, is then applied to discard samples outside of the maximum delay measurable, namely, the cyclic prefix duration. However, EP 1387544 relates to a system which makes use of a streaming signal and not readily adapted for the random arrival of packets. In the case of streaming signal, the signal is always there but the fine timing associated with the OFDM symbol boundaries must be determined.

In U.S. Pat. No. 6,327,314 (Cimini, Jr. et al) the problem of tracking the radio channel in a hostile propagation environment is addressed for wireless communications systems using OFDM and one or more antennae for reception. The solution disclosed by Cimini Jr. employs decoder and demodulator outcomes to generate a training or, reference signal, to drive the estimation of the channel for use in decoding the next symbol. The decoding, demodulation and channel estimation loops run according to the paradigm that the channel estimate may use all outcomes up to and including the symbol to be decoded. Each OFDM symbol is decoded once. The raw channel estimate is obtained by multiplying the received OFDM symbol with the training symbols. These training symbols may be from a decoding step. The raw channel estimate, corresponding to one OFDM symbol, is stored in a database. Each time a new OFDM symbol is to be processed all raw estimates in the database are employed to yield the channel estimate at the processing wavefront. In this disclosure the raw channel estimates are stored and a smoothing step is executed every time the data base is accessed, which entails a relative degree of complexity.

In U.S. Pat. No. 6,477,210 (Chuang et al) the problem of tracking the radio channel in a hostile propagation environment is also addressed for wireless communications systems using OFDM and one or more antennae for reception. The solution provided in this disclosure augments that disclosed in U.S. Pat. No. 6,327,314 by more clearly disclosing the processing flow and adding a backward recursion to the processing. The backward recursion includes the steps of demodulation, decoding and channel estimation, as in the forward recursion, but the processing commences from the end of the packet. Chuang et al is restricted to Maximum Likelihood decoding systems such as Viterbi decoders. There are many other types of FEC systems that do not employ ML decoding (e.g. Soft Output Decoders such as A-Posterior Probability techniques) and, moreover, for which Chuang is not adapted to operate within.

In a paper by Czylwik, A., entitled “Synchronization for systems with antenna diversity”, IEEE Vehicular Technology Conference, Vol. 2, 19-22 Sep. 1999, pp 728-732 the time and frequency synchronisation of a receiver is considered. In order to successfully decode a packet the receiver must determine the packet time of arrival. Errors in this estimate may result in signal power loss or failures in the synchronisation of high layer structures such as error control coding and FFT windows. Another parameter to be estimated is residual frequency offset. This parameter must be accurately estimated and its effect removed or countered if the packet is to be decoded. Errors in this estimate may result in demodulator failure and subsequent packet decode failure. When a receiver has two antennae there is a possibility to employ these two signals to improve estimation of time and frequency offsets. As disclosed in Czylwik, conventional techniques for single antenna exist involving the calculation and subsequent combination of two components. In this paper two main methods are proposed for time and frequency offset estimation. In the first, one antenna is selected, based on received power strength, and conventional techniques are applied to only that signal. In the second method disclosed by Czylwik, first and second conventional components are computed for each antenna. The two first components from each antenna are added. The two second components from each antenna are added. The resulting sums are then treated conventionally as a first and second component. The option of weighting each component prior to combining across antenna according to a signal strength measure for each corresponding antenna is also disclosed in Czylwik. This later option is shown to perform better than any of the other proposals in the paper. Filtering of the resulting metric for time synchronisation is also disclosed.

Any discussion of documents, devices, acts or knowledge in this specification is included to explain the context of the invention. It should not be taken as an admission that any of the material forms a part of the prior art base or the common general knowledge in the relevant art in Australia, the United States of America or elsewhere on or before the priority date of the disclosure and claims herein.

It is an object of the present invention to overcome or mitigate at least one of the disadvantages of related art systems.

In one form the present invention provides an iterative decoding circuit for a wireless multiuser communications receiver comprising:

a first signal processing means for receiving at least one received signal, said first signal processing means comprising at least two linear iterative filters such that:

the first linear iterative filter provides an estimate of a selected received signal to an estimated signal output and;

a second linear iterative filter provides estimates of at least one other received signal, delayed by one iteration cycle, to an input of said first linear iterative filter;

a second signal processing means for receiving the estimated signal output of the first linear iterative filter and providing a further received signal estimate to the input of the first signal processing means in a succeeding iteration cycle of the decoding circuit.

In another form the present invention provides a method, apparatus and system of communicating in a multiple access network by iteratively receiving multi user signals comprising:

determining a first set of signal estimates for the multi user signals based on linear channel constraints;

determining a second set of signal estimates based on non-linear channel constraints and the first set of signal estimates;

providing the second set of signal estimates as input to the step of determining the first set of signal estimates;

repeating the above steps at least once.

In a further form the present invention provides an iterative receiver for receiving multi user signals comprising:

a first signal processing component for determining a first set of signal estimates for the multi user signals based on linear channel constraints;

a second signal processing component for receiving the first set of signal estimates and determining a second set of signal estimates based on non-linear channel constraints;

wherein the signal processing components are operatively connected so as to provide the second set of signal estimates as input to the first signal processing component in a succeeding iteration cycle.

In yet another form the present invention provides an iterative signal processing arrangement having:

one or more pairs of first and second signal processing components, the pairs of components being in iterative configuration, each of the first signal processing components having as input one or more received signals dependent upon one or more transmitted signals, wherein for each said signal processing component pair the output of said first signal processing component is an estimate of a characteristic of a selected transmitted signal based on the current and one or more previous input signals received by said first signal processing component, which is input to said corresponding second signal processing component that provides a further estimate of said selected transmitted signal to the output of said second signal processing component, the outputs of all said second signal processing components of respective pairs are input to each said first signal processing components of all said pairs in a succeeding iteration cycle

In still another form the present invention provides a method, apparatus and system of communicating in a multiple access network by iteratively receiving OFDM packets comprising:

a) sample a receiver input signal;

b) add the input signal with one of a plurality of prior stored received packet sample estimates to determine a packet sample hypothesis;

c) determine an information bit estimate from the sample hypothesis for storage in an information bit estimates list;

d) determine an updated received packet sample estimate from the sample hypothesis for updating the plurality of prior stored estimates;

e) subtract the updated sample estimate from the sample hypothesis to determine a noise hypothesis and provide the noise hypothesis as the receiver input signal;

f) repeat steps a) to e) until at least one or more complete packets are accumulated in the information bit estimates list.

In yet another form the present invention provides a method, apparatus and system of communicating in a multiple access network by iteratively providing a sample estimates list in an OFDM receiver comprising:

a) sample a receiver input signal;

b) determine a packet sample estimate from the sampled receiver input signal;

c) store the packet sample estimate;

d) determine a packet sample hypothesis by adding the receiver input with a selected previously stored packet sample estimate;

e) determine an updated packet sample estimate by decoding and re-transmission modelling the packet sample hypothesis;

f) update the selected previously stored packet sample estimate with the updated packet sample estimate.

In still another form the present invention provides a method, apparatus and system of communicating in a multiple access network by iteratively providing a packet information bit estimates list in an OFDM receiver comprising:

a) determine a packet sample hypothesis by adding a receiver input with a selected previously stored packet sample estimate;

b) determine an information bit estimate by decoding the packet sample hypothesis with one or more of a hard decoding technique and a soft decoding technique

c) storing the information bit estimate with one or more previously determined information bit estimates;

d) repeating steps a) to c) until a complete packet is accumulated.

In yet another form the present invention provides a method, apparatus and system of communicating in a multiple access network including determining a hybrid OFDM received packet sample estimate comprising:

multiplexing a time domain channel application received sample estimate with a frequency domain channel application received sample estimate, such that the multiplexed time domain sample estimate is mapped to correspond to one or more of:

an OFDM signal cyclic prefix;

an OFDM tail portion, and;

an OFDM guard period,

and wherein the multiplexed frequency domain sample estimate is mapped to correspond to one or more of:

an OFDM signal preamble and;

an OFDM payload data symbol.

In another form the present invention provides a method, apparatus and system of communicating in an OFDM multiple access network comprising:

performing multi-user interference cancelling which comprises adapting a single pass OFDM receiver to iteratively receive signals at the sampling level so as to allow the receiver to differentiate a desired packet from an observation of an interference signal at the receiver input.

In yet another form the present invention provides a method, apparatus and system of communicating in a multiple access communication network by synchronizing packets arriving at a receiver comprising:

receiving a packet input signal;

determining a correlation signal corresponding to the packet input signal;

processing the input and correlation signals such that at least one of the input signal and the correlation signal are filtered;

determining a decision statistic by combining a power component of the processed correlation signal with a power component of the processed input signal;

nominate a point in time given by a predetermined threshold condition of the decision statistic as a received packet arrival time.

In yet another form the present invention provides a method, apparatus and system of communicating by tracking time varying channels in a multiple access packet based communication network comprising:

a) initializing a channel estimate reference based on an initial channel estimate in a received packet preamble;

b) updating the channel estimate reference based on a packet data symbol channel estimate in a coded portion of the current and all prior received data symbols;

c) repeating step b) at the arrival of subsequent packet data symbols.

In yet another form the present invention provides a method, apparatus and system of communicating by estimating time varying channel impairments in a multiple access packet based communication network, where channel impairments comprise channel variation, signal frequency offset and signal time offset, comprising:

a) initializing a set of channel impairment estimates based on initial pilot and preamble symbols included in a received packet;

b) performing a decoder operation which comprises processing the set of channel impairment estimates and the received packet to determine a set of transmit symbol estimates;

c) updating the set of channel impairment estimates with the determined set of symbol estimates and received packet;

d) repeating steps b) and c).

In still another form the present invention provides a method, apparatus and system of communicating in a multiple access network by time varying channel estimation in a receiver for receiving transmitted packets, comprising:

a) estimating a frequency offset based on information included in a received packet preamble;

b) correcting a received signal using the estimated frequency offset;

c) determining a channel estimate using information included in the received packet preamble;

d) transforming a sample sequence of the received signal into the frequency domain such that the sample sequence includes OFDM symbols and intervening cyclic prefixes;

e) performing a decoding operation which comprises processing the determined channel estimate and received packet;

f) generating a transmission sample sequence using the decoding results and information in the received packet preamble;

g) transforming the transmission sample sequence into the frequency domain;

h) updating the determined channel estimate by combining the received sample sequence and the transmission sample sequence in the frequency domain;

i) repeating steps e) to h).

In a preferred embodiment, the combining operation of step h), which updates the determined channel estimate, is performed by dividing the received sample sequence and the transmission sample sequence in the frequency domain.

In a further form the present invention provides a method, apparatus and system of communicating in a multiple access network by time varying channel estimation in a receiver for receiving transmitted packets, where the receiver retrieves OFDM symbols from a received signal and transforms the retrieved symbols to the frequency domain, comprising:

a) determine a matrix of training symbols comprised of symbol estimates derived from a decoder;

b) determine a matrix of frequency domain received OFDM symbols;

c) determine an intermediate channel estimate matrix by multiplying the OFDM symbol matrix by the conjugate of the training symbol matrix;

d) determine an intermediate matrix of training weights comprising the absolute value of the training symbol matrix;

e) perform a smoothing operation on both intermediate matrices comprising 2 dimensional filtering;

f) determine the channel estimate by dividing the smoothed channel estimate matrix with the smoothed training weight matrix.

In embodiments of the invention, the step d) determining an intermediate matrix of training weights may comprise other functions such as, for example, (absolute value of the training symbol matrix)2.

In still another form the present invention provides a method, apparatus and system of communicating in a multiple access network by estimating offsets in a receiver for receiving transmitted packets, comprising:

a) determine a matrix of received OFDM symbols;

b) determine a matrix of conjugated data symbols wherein the data symbols comprise one or more of preamble, training and estimated symbols;

c) determine a 2 dimensional Fourier transform matrix comprised of the received symbol matrix multiplied with the conjugated symbol matrix;

d) filter the Fourier transform matrix;

e) determine time and frequency offsets by locating peak power occurrences within the filtered Fourier transform.

In a particular embodiment, the above steps a) to e) for estimating offsets may be used effectively as a means of channel estimation. For example, in the above described form of the invention which provides communication by estimating time varying channel impairments, the step c) of updating the set of channel impairment estimates with the determined set of symbol estimates and received packet may comprise the above steps a) to e) for estimating offsets.

In a further embodiment, the above method may be used as the channel estimator as required herein, in as much as updating the set of channel estimates with the determined set of symbol estimates.

In yet a further form the present invention provides a method, apparatus and system of communicating in a multiple access packet communication network by synchronizing a received signal in a multi antenna receiver comprising:

correlating a received signal observation at each of a plurality of antennae with a known signal preamble to provide a received signal sequence;

determine a power signal of each received signal sequence;

combine the determined power signals in accordance with a time averaged weighting based on estimated antenna signal strength for each antenna;

determine a time of arrival for the received signal in accordance with a predetermined threshold condition.

In embodiments of the present invention there is provided a computer program product comprising:

a computer usable medium having computer readable program code and computer readable system code embodied on said medium for communicating in a multiple access communication network, said computer program product comprising:

computer readable code within said computer usable medium for performing the method steps as disclosed herein.

Other aspects and preferred aspects are disclosed in the specification and/or defined in the appended claims, forming a part of the description of the invention.

The present invention provides an improved or enhanced wireless link between two communicating devices, for example, an IEEE 802.11a Access Point to an IEEE 802.11a Station or between two nodes in a wireless mesh. The present invention leads to enhanced key performance indicators for point to point links, namely, range, power, data rate and reliability. This is achieved by advanced signal processing techniques in the following areas to improve performance

As would be understood by the person skilled in the art, in addition, techniques that exploit multiple antennas for transmission may be employed to provide electronically generated directional antennas in an adaptive manner. The following advantages stem from the present invention.

Spatial rejection of interference effectively ignores or rejects signals that are not emanating from the same location as the current or point of interest source. Rejecting these signals increases the probability that a signal may be received without errors thus increasing the reliability of the link and therefore the throughput to lower retransmissions and dropped packets. Interferers have a spatial signature as measured at the receive antenna that is substantially determined by their position. However, it is possible that transmitters that are not collocated could produce a similar spatial signature and it is also possible that collocated transmitters could produce different spatial signatures.

Significantly, increasing the receiver sensitivity means that the receiver may operate a lower SNR (Signal-to-Noise-Ratio) point which produces many benefits. Since the received power at which the signal may be successfully decoded has been reduced, the path loss may be increased by increasing the distance between the receiver and transmitter thereby increasing the range. Alternatively, the present invention allows the transmit power to be decreased and still a link may be maintained. Increasing the receiver sensitivity also means that less power is required per bit and accordingly, it may be possible to transmit a higher number of information bits per constellation symbol. This increases the data rate.

Robustness to fading provided by the inventive techniques disclosed herein may decrease the amount of packet errors due to extreme radio channel variations or fades. By increasing robustness, a more reliable link may be created ensuring a better user experience and increased throughput through less re-transmissions and fewer dropped packets.

The use of multiple antennas for transmit and receive functions allows the rejection of interference from outside the direction of interest. This functionality is adaptive so no hands-on antenna orientation is required at install-time or during the life of the installations.

By way of example, indicative performance measures of a sample communications link are given with and without the use of the Point-to-Point technology of the present invention.

Typical of Related Art Present Invention
Range 300 m 1 km
Required Tx Power 1.0 W 0.1 W
Maximum Data Rate 500 Kbps 5 Mbps

The present invention also provides improved channel tracking capabilities. Channel tracking technology refers to the adaptation of the receiver, when the channel changes rapidly over the duration of a single packet. Typically, the channel estimate that is used to decode a received packet is determined from known sequences at the start of a packet. This estimate may be used to decode the whole packet. However, if the relative speed between the transmitter and receiver is great enough, the channel experienced at the beginning of the packet is substantially different from that at the end of a packet rendering the channel estimate incorrect for the end of the packet resulting in decoding errors. There are other processes that manifest themselves as the radio channel changing over the packet. These include mismatches between the Transmit and Receive Radio processing resulting in residual frequency offsets and misalignments in the time and frequency synchronisation. It is difficult to build transmit and receive radio devices that match perfectly.

The advanced signal processing techniques of the present invention allows a receiver circuit to build a progressive Channel Estimate that tracks the changes in the channel over the duration of a packet. The benefit of applying such Channel Tracking technology is the ability to communicate under high mobility conditions and under larger mismatches between the transmit and receive radio processing. By way of example, typical performance measures of a sample communications link are given with and without the use of the Channel Tracking technology.

Typical of Related Art Present Invention
Maximum Mobility 40 km/hr 400 km/hr

The present invention also provides interference cancelling allowing the removal of same standard interference from a signal. The term “same standard” refers to transmissions of similar packet structures from other users in a multiuser system, or multipath transmissions (reflections) from the same transmitter, or multiple transmit antenna in the case of a device equipped with multiple transmit antenna. In all wireless communications systems, multiple active transmitters share the wireless medium. This sharing may be done in a coordinated attempt in infrastructure networks by dividing the wireless medium into time and frequency slots or in an uncoordinated attempt in an-hoc networks by all active transmitters contesting for the right to use the medium. Both schemes limit the use of the medium to a well defined frequency and time where only one user may transmit. Packet collisions occur when two transmitters inadvertently choose to use the same frequency at the same time. The Interference Cancelling technology includes advance signal processing techniques that benefit the following areas

Further benefits of the Interference Cancellation technologies of the present invention resolve collisions between two or more transmitters from the same standard transmitting at the same time on the same frequency. This has numerous advantages. Firstly, when collisions occur, all transmitted packets are received correctly increasing throughput and reliability by decreasing retransmissions and dropping packets. Secondly, by removing the requirement that only one transmitter may use a given frequency at a given time the amount of traffic that can be carried on the medium may be increased. Moreover, this may give greater flexibility in infrastructure design such as frequency planning and in the case of co-located competing networks such as two IEEE 802.11 networks from separate companies in adjoining offices.

In the case where the desired user and interfering users transmit according to different standards, the interference cancellation structure may employ a receiver and re-transmitter for all relevant standards. The receiver is then able to create hypotheses of the interfering signals thereby enabling interference cancellation.

Collisions may be resolved in the Physical Layer in accordance with embodiments of the present invention. The resulting reduction in network signaling overhead multiplies the benefits over and above the resolution of the two colliding packets. Typical quantitative measures are a doubling of network throughput and several orders of magnitude reduction in packet loss rate as follows:

Typical of Related Art Present Invention
Throughput 10 Mbps 20 Mbps

The multi-hop technology of embodiments of the present invention allows selected (and possibly all) wireless devices to act as routers, forwarding packets from one device to another in a communication network. This means that though two devices may not receive each others signals, if there is a set of intermediate devices that may be linked to form a radio path between them, then they may communicate to each other by passing their message through that intermediate set.

Depending on the particular network dynamics, the multi-hop technology may employ dynamic route determination techniques to build and maintain the required routing tables. Multi-hop networks provide many benefits in terms of flexibility, reliability and cost of infrastructure.

Flexibility is achieved through a self forming network that requires minimal planning. The only requirement is that no device may be isolated, in a radio range sense, from the core network. All configurations meeting this criterion may be possible.

If multiple paths between devices exist in the network, dynamic route determination may select a new route when the current route is blocked or congestion is best avoided. Therefore if a device was to go offline, the network may rearrange its routing tables to exclude that device from all routes and find a new path through the network thus creating a robust, self healing (and therefore more reliable network). Dynamic route determination continuously adapts to network configuration changes allowing for mobile network nodes.

Multi-hop networks in accordance with embodiments of the present invention offer a simple solution to provide a high bandwidth link over a wide area. Due to easy flexible installations, low infrastructure costs and a high rate, reliable link, multi-hop networks generally offer excellent return on investment.

Four areas of application in the communications field which best utilize the benefits of the technologies of embodiments of the present invention have been identified by the inventor as

The following describes each of the above identified applications in turn. Other applications may also benefit from these technologies of embodiments of the present invention.

Firstly, a Mobile Multi-hop Radio Network requires effective real-time communication to networks of moving entities. This concept provides cost-effective bi-directional high bandwidth communication both between the mobile entities and between fixed networks and the mobile entities. Wireless Routers are placed where service is required with regular connections to a wideband backbone network. A fixed network may be used to connect to other networks such as the internet or other private networks. Other than access to power and a physical mounting point no other infrastructure is required for each wireless router. The wireless routers may be fixed or mobile. The routers adapt to their environment in terms of link quality using, for example, data communications methods as would be understood by the person skilled in the art. Embodiments of the present invention provide a competitive advantage relative to other Multi-hop Radio Networks in that the improved mobility and range, as noted above, leading to a more efficient network is provided. Relative to related art Private Communications Networks, embodiments of the present invention provide significant improvements in Data Rate, Range, Mobility and cost of Network as noted above.

Secondly, a Fixed Multi-hop Radio Networks is provided by installing Wireless Routers at fixed user locations with links available to one or more wideband backbone connections. The only requirement is that all routers must be able to form a link (direct or hopped) back to a backbone connection. There is no need for expensive base station configurations and ultimate range is not limited by signal strength. The Fixed Multi-hop radio Network forms a flexible, low infrastructure cost solution in providing a high bandwidth connection to a Wide Area Network that is reliable, easily managed and self healing.

Furthermore, the present invention enables all decoder outcomes to be employed (decoder outcomes are stored across all iterations and able to be combined) in the receiver filter structure providing improved estimate determination. The number of users that may be supported is greatly increased. Particularly advantageous, for example, in OFDM systems the present invention does not require prohibitively large matrices to be inverted in forming estimates. Receiver performance is superior to that of the related art due to the quality of the feedback symbol provided by including decoding in the iteration loop. Embodiments of the present invention are based on interference cancellation where previous estimates of the multi user received signals are subtracted from the received signal to cancel the interference they cause. Accordingly, these embodiments do not suffer the disadvantages and complexities of using tree search methodologies for multiuser signals which would necessitate exploring many paths through a given tree. The present invention advantageously enables decoding of each user's signal according to their Forward Error Correction encoding. This use of strong error control code structure provides for significantly improved symbol estimates, resulting in superior interference estimates. This in turn allows support for significantly higher numbers of users. Embodiments of the present invention do not require synchronised users to enable improved multi user reception. Embodiments of the present invention advantageously use decoder outcomes as training symbols rather than only using demodulator outcomes. Advantageously, receiver coefficients for beamforming may be determined without transmitter interaction. Also the use of decoder outcomes to improve channel estimates allows accurate estimation of the required beamforming coefficients. In accordance with embodiments of the present invention, smoothing of channel estimate taps is performed in the frequency domain as well as the time domain. Further to this, embodiments of the present invention allow decoding of symbols more than once as a channel estimate corresponding to its interval is improved resulting in increased receiver sensitivity.

Further scope of applicability of the present invention will become apparent from the detailed description given hereinafter. However, it should be understood that the detailed description and specific examples, while indicating preferred embodiments of the invention, are given by way of illustration only, since various changes and modifications within the spirit and scope of the invention will become apparent to those skilled in the art from this detailed description.

Further disclosure, improvements, advantages, features and aspects of the present invention may be better understood by those skilled in the relevant art by reference to the following description of preferred embodiments taken in conjunction with the accompanying drawings, which are given by way of illustration only, and thus are not limiting to the scope of the present invention, and in which:

FIG. 1 illustrates a related art multiple access wireless communication system;

FIG. 2 illustrates an example of a MAC failure in a related wireless communication system involving an access collision;

FIG. 3 depicts self interference in WLAN network of a related art wireless communication system;

FIG. 4 depicts a generic iterative receiver structure in accordance with a first embodiment;

FIG. 5 depicts the transmission system model for coded CDMA;

FIG. 6 depicts a canonical iterative multiuser decoder;

FIG. 7 depicts an iterative multiuser decoder with linear multiuser estimation in accordance with a first embodiment;

FIG. 8 depicts the recursive filter Λk(n) in accordance with a first embodiment for n=1 the input signal is r while for n≥ the input signal is {circumflex over (x)}k(n−1); and

FIG. 9 depicts Bit Error Rate versus users after 10 iterations, N=8, Eb/N0=5 dB in accordance with a first embodiment;

FIG. 10 shows a typical related art single pass OFDM receiver high level structure;

FIG. 11 illustrates an adaptation of the single pass OFDM receiver high level structure of FIG. 10 in accordance with a second embodiment to facilitate iterative receiver technologies;

FIG. 12 shows a OFDM Soft/Hard Decode and Re-transmit structure for use in Iterative Receive structure in accordance with a second embodiment;

FIG. 13 shows a Hybrid Re-transmit in accordance with a second embodiment;

FIG. 14 shows a Hard Decode and Re-Modulate for OFDM Soft/Hard Decode and Re-transmit structure in accordance with a second embodiment;

FIG. 15 shows a Soft Decode and Re-Modulate for OFDM Soft/Hard Decode and Re-transmit structure in accordance with a second embodiment;

FIG. 16 shows a structure for time domain channel application process in accordance with a second embodiment;

FIG. 17 shows a structure for frequency domain channel application process in accordance with a second embodiment; and

FIG. 18 shows an Example of a Typical OFDM Packet Physical layer Format and an associated Multiplexer mapping;

FIGS. 19a and 19b show a wireless modem incorporating a baseband receiver processor in accordance with preferred embodiments of the present invention;

FIG. 20 illustrates a packet structure in accordance with related art;

FIG. 21 illustrates an example related art time synchronisation decision;

FIG. 22 shows triangle filter coefficients for a receiver filter in accordance with a third embodiment of the invention;

FIG. 23 shows an example of a filtered decision statistic in accordance with a third embodiment of the invention;

FIG. 24 represents an actual frequency domain of a related art radio channel;

FIG. 25 represents the frequency domain of FIG. 24 after receiver phase and frequency offset correction;

FIG. 26 represents an error pattern for a related art processing of a receiver;

FIG. 27 represents a radio channel estimate after smoothing across OFDM symbols in accordance with a fourth embodiment of the invention;

FIG. 28 represents an error pattern for a fourth embodiment of the invention using perfect training symbols;

FIG. 29 represents a raw radio channel estimate or channel estimate database in accordance with a fourth embodiment of the invention;

FIG. 30 is an example of a WLAN packet format in accordance with related art;

FIG. 31 is an OFDM symbol sub-carrier matrix structure in accordance with a fifth embodiment of the invention;

FIG. 32 is a representation of channel power (amplitude) over a sub-carrier and OFDM symbol resulting from application of a fifth embodiment of the invention;

FIG. 33 is a representation of channel phase corresponding to the waveform represented in FIG. 32;

FIG. 34 is a representation of a synchronisation metric of a sub-carrier and OFDM symbol in accordance with a fifth embodiment of the inventiona processor which may be

where S[i]=(si[i], s2[i], . . . , sk[i]), is a N×K matrix with the spreading sequence for user k as column k. The symbol □ represents the set of complex numbers. The vector x[i]εQK has elements xk[i] and the vector n[i]ε□N is a sampled circularly symmetric i.i.d. Gaussian noise process, with covn[i]=σ2I. The symbol Q represents the set of possible modulated symbols, e.g. QPSK.

Henceforth, it is not required to identify specific symbol intervals and these indices will be omitted. For later use, we define Sk=(s1, s2, . . . , sk−1, sk+1, . . . , sK) and xk=(x1, x2, . . . , xk−1, xk+1, . . . , xK)t to indicate deletion of user k from S or x.

Recursive Filter from Multiuser Estimation

Application of the turbo-principle to the coded linear multiple-access system, where for each user, we treat the error control code as one constraint and the multiuser channel (2) as the other constraint, results in the canonical receiver structure of FIG. 6[1].

An iteration n1, the multiuser APP takes an input r and the set of extrinsic probabilities qk(n−1) from user k=1, 2, . . . , K calculated in the previous iteration n−1. qk(n−1)[i]εP|Q| is the extrinsic probability distribution on the transmitted symbols xk[i]εQ of user k. The set Q is the set of all possible modulated symbols at the transmitter. The multiuser APP calculates the updated extrinsic probability vector pk(n)[i] for user k. After appropriate de-interleaving, the extrinsics pk(n) are used as priors for independent APP decoding of the code C by each user, producing (after interleaving) the extrinsics qk(n) which serve as priors for the subsequent iteration. The marginalisation in the multiuser APP requires summation over |Q|K−1 terms. Many lower-complexity alternatives have been proposed while retaining the same basic architecture.

Consider the receiver structure shown in FIG. 7. There is a bank of linear filters Λk(n), one for each user. The coefficients of these filter may be re-computed every iteration. For the first iteration, n=1, the input to Λk(1) is just r. For subsequent iterations n=2, 3, . . . , the input to the filter for user k is r and a set of signal estimates for all the other users from previous iterations, {{circumflex over (x)}K′(m):k′≠k,mεM}, where M{1, 2, . . . , n−1} is a set defining the memory order of the iteration. Typically in the literature, M={n−1}, although recently M={n−1,n−2} has been considered [2].

The output of the filter Λk(n) is an updated sequence of estimates {circumflex over (x)}k(n) of the corresponding code symbol for user k. These estimates are mapped from the signal space onto the probability vector space using a symbol-wise mapping T:□→P|Q|. The resulting sequence of probability vectors pk(n) are used as priors for individual APP decoding of the code C. These APP decoders can output either posterior or extrinsic probabilities qk(n) (both approaches have been investigated in the literature). The sequence of probability vectors qk(n) is in turn mapped back onto the signal space by a symbol-wise function U:P|Q|→□. Typically, T calculates the vectors pk(n) assuming that {circumflex over (x)}k(n) is Gaussian distributed with known mean and variance, {circumflex over (x)}k(n): N({tilde over (μ)}k(n),custom characterk(n)). Likewise, a common choice for U is the conditional mean.

The following easily proved lemma provides a useful general framework for the derivation of filters Λk(n).

Lemma 1

Suppose that for a parameter x we have the vector observation c=(atbt)t, the concatenation of two vector observations a and b. The LSE estimate of x given c is
{tilde over (x)}=custom characterx,acustom charactercustom charactera,acustom character−1a+m(b−custom characterb,acustom charactercustom charactera,acustom character−1a)  (3)

where
m=(<x,b>−<x,a><a,a>−1<a,b>)(<b,b>−<b,a><a,a>−1<a,b>)−1

We see that (3) can be written as {tilde over (x)}=ga+m(Fa−b), where
m=(<x,b>−<x,a><a,a>−1<a,b>)(<b,b>−<b,a><a,a>−1<a,b>)−1  (4)
F=<b,a><a,a>−1  (5)
g=<x,a><a,a>−1  (6)

So far in the literature, linear filters Λk(n) for multiuser estimation in iterative decoding have been designed based on the received signal r and the most current code symbol estimates of the interfering users {circumflex over (x)}k(n). After n iterations, we have however a sequence of such estimates available, namely {{circumflex over (x)}k(1), {tilde over (x)}k(2), . . . {tilde over (x)}k(n)} together with r. It has been observed that the estimates are not strongly correlated during the initial iterations [2].

Consider the following recursively defined version of observables as input to the filter Λk(n),

c k ( n ) = { r n = 1 ( c k ( n - 1 ) x ^ k ( n - 1 ) ) n = 2 , 3 , ( 7 )

Direct application of the LMMSE criterion results in Λk(n)=<xk,ck(n)><ck(n),ck(n)>−1. It is clear however that Λk(n) grows in dimension with n which is impractical.

Inspired by recursive Bayesian estimation (RBE) [3], we can prove the following theorem that solves this dimensionality problem by giving a recursive form from Λk(n) (subject to certain constraints on the input signal).

Theorem 1

Make the following assumptions,

A1: The received signal r=Sx+n, is described according to (2) where n is circularly symmetric complex Gaussian with covn=σ2I, and σ2 and s are known.

A2: The interleaved code symbol estimates of the interfering users {circumflex over (x)}k(n) coming out of the single user APP decoders can be written as {circumflex over (x)}k(n)=xk(n)+{circumflex over (v)}k(n) where {circumflex over (v)}k(n) is uncorrelated with x and also uncorrelated over time and iterations, but not over users at a given iteration, i.e. <x,{circumflex over (v)}k(n)>=0, <{circumflex over (v)}k(n),{circumflex over (v)}k(m)>=0 for n≠m and <{circumflex over (v)}k(n),{circumflex over (v)}j(n)>=qkj.

Define Qk(n)=<{circumflex over (v)}k(n), {circumflex over (v)}k(n)>, with elements determined as shown above.

Let ck(n) be according to (7). Under A1 and A2 the LMMSE estimate of xk given ck(n) is given by the output {tilde over (x)}k(n) of the recursive filter shown in FIG. 8.

The update for the estimate is
{tilde over (x)}k(n)={tilde over (x)}k(n−1)+mk(n)({circumflex over (x)}k(n−1)−{tilde over (x)}k(n−1))

The filters in the figure are defined as follows:
mk(n)=−wk(n)(I+Qk(n−1)−Wk(n))−1
Mk(n)=(I−Wk(n))(I+Qk(n−1)−Wk(n))−1

with the recursive update equations for n=3, 4, . . .
wk(n)=wk(n−1)[I−(Hk(n−1))−1(I−Wk(n−1))]−1
Wk(n)=Wk(n−1)+(I−Wk(n−1))(Hk(n−1))−1(I−Wk(n−1))
Hk(n−1)−I+Qk(n−2)−Wk(n−1)

The initial conditions with {tilde over (x)}k(0)=0 and xk(0)=0 are mk(1)=skt(SSt2I)−1, Mk(1)=Skt(SSt2I)−1 for n=1 and wk(2)=skt(SSt+I)−1Sk, Wk(2)=Skt(SSt2I)−1Sk for n=2.

Computer simulations have been used to evaluate the proposed technique. For the purposes of simulation, each user used the maximum free distance 4 state convolutional code naturally mapped onto QPSK. Each user is therefore transmitting 1 bit per channel use. Binary spreading sequences with N=8 were generated i.i.d. at each symbol for each user. Transmission is chip synchronous and all users are received at the same power level.

Indicative simulation results are shown in FIG. 9. Three curves are shown. PIC is the parallel interference cancellation method of [4]. IPIC is the improved parallel interference cancellation of [2]. RBE is the proposed recursive Bayesian estimation technique. Each of the curves begins for small numbers of users at the single-user BER near 10−4. As each receiver fails to converge, its curve deviates from single-user. For PIC, this occurs at K/N=1.125. For IPIC, the limit is 1.625 and for RBE 1.875. The performance benefit of IPIC over PIC is reported in [2]. The recursive Bayesian technique supports even higher loads. In fact, further numerical investigations (for smaller systems) have shown that RBE supports almost the same load as using the multiuser APP.

Described herein is a computationally efficient recursive filter for use in iterative multiuser decoding. This filter uses the entire history of outputs from the single user decoders in order to accelerate convergence and to support greater loads.

With reference to FIGS. 10 to 18 a second embodiment is described where there are a number of specific solutions offered which fall out from the general solution of (or realization that) adapting related art single pass OFDM receivers to iteratively receive signals at the sampling level allows the receiver to differentiate a desired packet from an observation of an interference (collision) signal at the receiver input. These solutions are as follows:

    • An overall system solution—Iterative Receiver Structure itself.
    • Additional solution aspect—Samples Estimates list.
    • Additional solution aspect—Information Bit Estimates list.
    • Additional solution aspect—Multiplexing of Time/Frequency Domain Channel Application Sample Estimates.

In one aspect, the second embodiment provides a system and method of receiving OFDM packets comprising the following:

a) sample a receiver input signal consisting of signals from one or more antenna;

b) add the input signal with one of a plurality of prior stored received packet sample estimates to determine a packet sample hypothesis;

c) determine an information bit estimate from the sample hypothesis for storage in an information bit estimates list;

d) determine an updated received packet sample estimate from the sample hypothesis for updating the plurality of prior stored estimates;

e) subtract the updated sample estimate from the sample hypothesis to determine a noise hypothesis and provide the noise hypothesis as the receiver input signal;

f) repeat steps a) to e) until at least one or more complete packets are accumulated in the information bit estimates list.

In another aspect, the second embodiment provides a system and method of providing a sample estimates list in an OFDM receiver comprising the following:

a) sample a receiver input signal;

b) determine a packet sample estimate from the sampled receiver input signal;

c) store the packet sample estimate;

d) determine a packet sample hypothesis by adding the receiver input with a selected previously stored packet sample estimate;

e) determine an updated packet sample estimate by decoding and re-transmission modelling the packet sample hypothesis;

f) update the selected previously stored packet sample estimate with the updated packet sample estimate.

In yet another aspect the second embodiment provides a system and method of providing a packet information bit estimates list in an OFDM receiver comprising the following:

a) determine a packet sample hypothesis by adding a receiver input with a selected previously stored packet sample estimate;

b) determine an information bit estimate by decoding the packet sample hypothesis with one or more of a hard decoding technique and a soft decoding technique

c) storing the information bit estimate with one or more previously determined information bit estimates;

d) repeating steps a) to c) until a complete packet is accumulated.

In still another aspect, the second embodiment provides a system and method of determining a hybrid OFDM received packet sample estimate comprising the step of:

multiplexing a time domain channel application received sample estimate with a frequency domain channel application received sample estimate, such that the multiplexed time domain sample estimate is mapped to correspond to one or more of;

an OFDM signal cyclic prefix;

an OFDM tail portion, and;

an OFDM guard period,

wherein the multiplexed frequency domain sample estimate is mapped to correspond to one or more of;

an OFDM signal preamble and;

an OFDM payload data symbol.

In another aspect the second embodiment provides an iterative sample estimation method for OFDM packet based network communication comprising the following steps:

a) selecting either the windowed matched received samples or the noise hypothesis as the input signal;

b) adding an empty packet estimate to a samples estimate list containing packet sample estimates;

c) selecting one of said list entries;

d) adding said packet samples estimate to said input signal to create a packet received samples hypothesis;

e) decoding and re-transmission modelling of said packet received samples hypothesis to create a new packet received samples estimate and new information bit estimates;

f) updating said information bit estimate list with new information bit estimates;

g) subtracting said new packet samples estimate from said packet received samples hypothesis to create a noise hypothesis; and

h) updating said samples estimate list entry with said new packet samples estimate;

all said steps being iterated at least once for each packet.

In a further aspect the second embodiment provides an iterative sample estimation method according to the previous paragraph wherein step e) further comprises:

i) soft decoding said selected packet sample estimate to create soft encoded bits and new packet information bit estimates for reinsertion into said information bit estimates list;

j) soft modulating said soft encoded bits to create a transmitted symbol estimate;

k) constructing the time domain channel estimate from said packet received samples hypothesis and said transmitted symbol estimates;

l) constructing the packet transmit sample estimate from said transmitted symbol estimate;

m) convolving said time packet transmit sample estimate with said time domain channel estimate to create the time domain channel applied received samples estimate; and in parallel with steps k) and m);

n) constructing the frequency domain channel estimate from said packet received samples hypothesis and said transmitted symbol estimates;

o) multiplying said frequency domain channel estimate with said transmitted symbol estimates to create packet received symbol estimates; then

p) constructing the frequency domain channel applied received samples estimate from the packet received symbol estimates; and

q) multiplexing the time domain channel applied received samples estimate with the frequency domain channel applied received samples estimate for reinsertion into said samples estimate list, wherein steps n) to p) are repeated for each OFDM symbol in a packet.

In still another aspect, the second embodiment provides an iterative sample estimation method according to the paragraph previous to the preceding paragraph wherein step e) further comprises:

r) hard decoding said selected packet sample estimate to create hard encoded bits and new packet information bit estimates for reinsertion into said information bit estimates list;

s) hard modulating said hard encoded bits to create a transmitted symbol estimate;

t) constructing the time domain channel estimate from said packet received samples hypothesis and said transmitted symbol estimates;

u) constructing the packet transmit sample estimate from said transmitted symbol estimate;

v) convolving said time packet transmit sample estimate with said time domain channel estimate to create the time domain channel applied received samples estimate; and in parallel with steps t) and u);

w) constructing the frequency domain channel estimate from said packet received samples hypothesis and said transmitted symbol estimates;

x) multiplying said frequency domain channel estimate with said transmitted symbol estimates to create packet received symbol estimates; then

y) constructing the frequency domain channel applied received samples estimate from the packet received symbol estimates; and

z) multiplexing the time domain channel applied received samples estimate for reinsertion into said list.

With reference to FIGS. 10 to 18, the following blocks are used for receiver signal processing techniques in accordance with the second embodiment;

    • OFDM Soft Output Decode 288
    • OFDM Hard Output Decode 222
    • Encode 224
    • Soft Modulate 230
    • Hard Modulate 226
    • Acquisition 204
    • Matched Filter 202
    • Sum 208
    • Subtract 212
    • Convolve 236
    • Multiply 240
    • Time to Frequency Conversion (dependant on system standard) 234
    • Time Domain Channel Estimator 232
    • Frequency Domain Channel Estimator 238
    • Time, Frequency Domain Multiplex 220
    • Samples Estimate List (including associated Controller) 206
    • Information Bit Estimates List (including associated Controller) 213

Table 1 and Table 2 provide a key for the number signals and process in each figure and the reference numbers in the text.

TABLE 1
Signals
1002 Received Samples
1004 Windowed Matched Received Samples
1006 Empty Sample Estimates
 108 Previous Packet Received Samples Estimate
 110 Packet Received Samples Hypotheses
 112 New Packet Information Bit Estimates
 114 New Packet Received Samples Estimate
 116 Noise Hypothesis
 118 Completed Packet Information Bit Estimates
 119 Packet Transmit Symbol Estimates
 120 Time Domain Channel Applied Received Samples Estimate
 122 Frequency Domain Channel Applied Received Samples Estimate
 126 Hard Encoded Information Bits
 128 Soft Encoded Information Bits
 130 Time Domain Channel Estimate
 132 Packet Transmit Samples Estimate
 134 Frequency Domain Channel Estimate
 136 Packet Received Symbol Estimates

TABLE 2
Functional Blocks
202 Bandwidth Limiting Filter-Matched Filter-p(t)
204 Acquisition
206 Samples Estimate List
208 Σ-Add
210 OFDM Soft/Hard Decode and Re-transmit
212 Σ(−vc)-Subtract
213 Information Bit Estimates List
214 OFDM Soft/Hard Decode and Re-modulate
215 Hybrid Re-transmit
216 TDCA—Time Domain Channel Application
218 FDCA—Frequency Domain Channel Application
220 MDX—Time, Frequency Domain Multiplex
222 OFDM Hard Output Decode
224 Encode
226 Hard Modulate
228 OFDM Soft Output Decode
230 Soft Modulate
232 Time Domain Channel Estimator
234 F → T - 802.11a Frequency to Time Domain Conversion
236 Convolve - Linear Convolution
238 Frequency Domain Channel Estimator
240 Multiply

The second embodiment of the invention is adapted for a Packet based OFDM WLAN system (eg. IEEE 802.11a, IEEE 802.11g). A typical receiver for such a system performs processing tasks in accordance with FIG. 10. The input into the system is a complex, oversampled baseband received signal 1002 for each attached antenna. The signal received on each antenna is passed through a band limiting filter 202 which is then followed by a packet detection and synchronisation (Acquisition) processing block 204. This Acquisition block uses one or more of the matched filter antenna signals 1004. Once a packet is acquired it is decoded using either hard or soft decoding techniques and passed on to a higher processing layer (eg. MAC). The typical receiver structure FIG. 10 may be modified to an iterative structure that provides interference cancelling at the sample level.

Iterative Receiver Structure & Function

The input to the receiver is the oversampled digital I/O baseband samples from each antenna connected to the receiver called the Received Samples 1002. The Received Samples 1002 are windowed over time and passed through a filter 202 matched to the pulse shape in order to produce windowed matched received samples 1004. This constitutes the Noise Hypothesis 116 for the first iteration (n=1). For all proceeding iterations (n>1), the Noise Hypothesis 116 is provided by the feedback of the interference signal. This is depicted in FIG. 11 by the n conditioned switch SWn.

An iteration of the receiver is a single execution of each of the following processes:

    • Attempt to acquire a new Packet in the Noise Hypothesis 116 using the Acquisition 204 process.
    • If a new packet is found, add empty entries 1006 to the Samples Estimate List 206 and Information Bit Estimates List 213. Each entry in the Samples Estimates List 206 has a corresponding entry in the Information Bit Estimate List 213.
    • Determine, from the evolution of both Samples and Information Bit estimates list, Completed Packets {y1 . . . ym}, in the Information Bit Estimates List 206.
    • Release to higher layer (MAC) then Remove Completed Packets {y1 . . . ym} from the Information Bit Estimates List 213.
    • Remove Completed Packets {y1 . . . ym} from the Samples Estimate List 206.
    • Select a Packet k in the Samples Estimate List 206 to Process.
    • Add 208 the Previous Packet Received Samples Estimate 208 of selected packet k from the Samples Estimate List 206 to the Noise Hypothesis 116 to produce the Packet Received Samples Hypothesis 110.
    • Generate new Packet Received Samples Estimate 114 and new information bit estimates 112 for the selected packet k from the Packet Received Samples Hypothesis 110 using OFDM Soft/Hard Decode and Re-transmit process 210.
    • Update the selected packets' k previous information bit estimates in the Information Bit Estimates List 213 with the New Information Bit Estimates 112.
    • Update the selected packets' k previous Samples Estimate in the Samples Estimate List 206 with the New Packet Received Samples Estimate 114.
    • Subtract 212 the New Packet Received Samples Estimate 114 from the Packet Received Samples Hypothesis 110 to produce the Noise Hypothesis 116.

Iterations are continually performed until all packets have been released from the Information Bit Estimates List 213. Once this state has been reached, the lists 206, 213 are cleared, the time window is updated and the entire process repeated.

Iterative Interference Cancelling

Interference cancelling at the sample level requires the generation of New Packet Received Samples Estimate 114 for each antenna using the OFDM Soft/Hard Decode and Re-transmit 210 process for every Packet found by the Acquisition 204 process. Each packet's New Packet Received Samples Estimate 114 are stored in the Samples Estimate List 206. The interference cancelling structure requires that each packet Adds 208 its Previous Packet Received Samples Estimate 108 to the Noise Hypothesis 116 before the Soft/Hard Decode and Re-transmit 210 process to produce the Packet Received Sample Hypothesis 110 for each antenna. The New Packet Received Samples Estimate 114 produced by the Soft/Hard Decode and Re-transmit 210 process are then Subtracted 212 from the Packet Received Sample Hypothesis 110 to generate an updated Noise Hypothesis 116. The New Packet Received Samples Estimate 114 are also used to update the Samples Estimate List 206. The Noise Hypothesis 116 is then fed back through the system (minus the latest estimated contribution of the previously processed packet) providing Iterative Interference Cancelling. FIG. 11 provides a graphical reference for this process.

Samples Estimate List

The Samples Estimate List 206 contains the New Packet Received Samples Estimate 114 as generated by the OFDM Soft/Hard Decode and Re-transmit process 210 for each receive antenna for each Packet found by the Acquisition 204 process.

For each iteration, a packet to iterate (k) is selected from the Samples Estimate List 204. The selection k can be based on numerous metrics e.g., sorted signal power, the minimum number of processing cycles performed, order of arrival. This selection is depicted by the k controlled switch SWk in FIG. 11, where k is the current selected packet.

Information Bit Estimates List

The Information Bit Estimates List 213 contains the latest New Packet Information Bit Estimates 112 as generated by the OFDM Soft/Hard Decode and Re-transmit 215 process for each Packet found by the Acquisition 204 process.

Each iteration provides an opportunity to release Completed Information Bit Estimates 118 to higher layers (e.g. MAC). The choice of which packets are complete is made by evaluating a metric for each packet in the Samples Estimate List 206. For example, this metric may be based on indicators such as signal power, the number of iterations performed and number of completed packets. These metrics are then compared to a target value. All packets that meet their target are marked for release from the Information Bit Estimates List 213.

For each packet acquired there is an entry in both the Samples Estimate List 206 and the Information Bit Estimates List 213. The selection of completed packets is depicted by the {y1 . . . ym} controlled switch SWy in FIG. 11, where {y1 . . . ym} is the list of Completed Packet Information Bit Estimates. A feature of the iterative receiver structure is that the packet's Packet Received Samples Estimate 114 remain subtracted from the Noise Hypothesis 116 even after it is released and its corresponding entries in both lists removed.

Hybrid Re-Transmission

The Hybrid Re-transmission 215 process is depicted in FIG. 12 and FIG. 13. It uses both Time Domain Channel Application 216 and Frequency Domain Channel Application 218 processes to generate a New Packet Received Samples Estimate 114. Both processes use the Packet Received Samples Hypothesis 110 for each antenna and Packet Transmit Symbol Estimates 119 to create Channel Applied Received Samples Estimate 120, 122 for each receive antenna. The Time Domain Channel Application 216 process produces a Time Domain Channel Applied Received Samples Estimate 120. The Frequency Domain Channel Application 218 process produces a Frequency Domain Channel Applied Received Samples Estimate 122. The Channel Applied Received Samples Estimate 120, 122 are then multiplexed 220 together to form the New Packet Received Samples Estimate 113 for each antenna. Each of these processes is described in further detail below.

Time Domain Channel Application (TDCA)

The Time Domain Channel Application 216 process is further expanded in FIG. 16. The Time Domain Channel Estimator 232 produces a Time Domain Channel Estimate 130 for each receive antenna using the Packet Transmit Symbol Estimates 119 from the OFDM Soft/Hard Decode and Re-modulate 214 process (see FIG. 14 and FIG. 15) and the Packet Received Sample Hypothesis 110 for each antenna. The Frequency to Time Conversion 234 then produces a Packet Transmit Samples Estimate 132 using the Packet Transmit Symbol Estimates 119. The Packet Transmit Samples Estimate 132 and Time Domain Channel Estimate 130 for each antenna are then linearly convolved via the Convolve 236 process to produce the Time Domain Applied Received Samples Estimates 120 for each antenna.

Frequency Domain Channel Application (FDCA)

The Frequency Domain Channel Application 218 process is further expanded in FIG. 17. The Frequency Domain Channel Estimator 238 produces a Frequency Domain Channel Estimate 134 for each antenna using the Packet Transmit Symbol Estimates 119 from the OFDM Soft/Hard Decode and Re-modulate 214 process and the Packet Received Sample Hypothesis 110 for each antenna. The Packet Transmit Symbol Estimates 119 are then multiplied, one OFDM symbol at a time, by the Frequency Domain Channel Estimate 134 via the Multiply 240 process to produce the Packet Received Symbol Estimates 136. The Packet Received Symbol Estimates 136 are then converted into the Frequency Domain Channel Applied Received Samples Estimate 122 using the Frequency-To-Time process 234.

Time, Frequency Domain Channel Application Multiplexing (MUX)

Referring now to FIG. 13, the Multiplexing 220 process takes the Time Domain Channel Applied Received Samples Estimate 120 and the Frequency Domain Channel Applied Received Samples Estimate 122 and multiplexes them together to produce a hybrid New Packet Received Samples Estimate 114.

OFDM modulation scheme such as those used in this second embodiment, commonly employ a cyclic prefix to combat multi-path interference. Also, due to time dispersion characteristics of both the radio channel and band limiting filters, there are tails at the beginning and end of the New Packet Received Samples Estimate 114. New Packet Received Samples Estimate 114 corresponding to the OFDM portion of the signal are taken from the Frequency Domain Channel Applied Received Samples Estimate 122. The remaining samples in the New Packet Received Samples Estimate 114 are taken from the Time Domain Channel Applied Received Samples Estimate 120. In this embodiment those samples comprise the cyclic prefix and tail portions of the New Packet Received Samples Estimate 114.

An example of multiplexer mapping is shown in FIG. 18.

Preferred Area of Application

The preferred areas of application for the second embodiment of the present invention are OFDM receivers that may be used with IEEE 802.11a, IEEE 802.11g, IEEE 802.16 and HiperLAN Wireless Local Area Network (WLAN) standards. However, the invention disclosed is useable in any packed based OFDM communications system as would be understood by the person skilled in the art.

With reference to FIGS. 19 to 23 a third embodiment is described which stems from the realization that reducing the distortions in one or more of the raw signals arriving at a receiver used to provide a decision statistic leads to an overall improvement in the decision statistic itself. Furthermore, appropriate selection of the means of reducing these distortions leads to a more reliable determination of packet arrival time.

In one aspect the third embodiment provides a method and apparatus for communicating in a multiple access communication network by synchronizing packets arriving at a receiver comprising:

receiving a packet input signal;

determining a correlation signal corresponding to the packet input signal;

processing the input and correlation signals such that at least one of the input signal and the correlation signal are filtered;

determining a decision statistic by combining a power component of the processed correlation signal with a power component of the processed input signal;

nominate a point in time given by a predetermined threshold condition of the decision statistic as a received packet arrival time.

The processing of at least one of the input and correlation signals is performed by one of a centre weighted filter having a triangular impulse response, a root raised cosine filter, a Hanning window filter, a Hamming window filter, or a combined Hanning/Hamming window filter. The predetermined threshold condition may be one of the decision statistic crossing the predetermined threshold or a maximum of the decision statistic occurring above the predetermined threshold. The determination of the correlation signal may be performed every Kth sample of a sampled packet input signal, where K is an integer greater than or equal to 1. The third embodiment of the present invention is described in more detail below.

Power Averaging Mask for FFT Window Synchronisation

Synchronisation of packets transmitted, especially over wireless media, is ordinarily achieved by employing a preamble comprised of several repetitions of the same signal and correlating the received signal with a delayed version of itself. The delay may be chosen to equal the duration of the repeated signal component defining the preamble. The output power of this correlation process is then usually normalised against the average power in the received signal. The point at which the normalised correlator output exceeds a threshold is selected as the packet arrival time. This technique has a number of deficiencies. For example, it does not optimally exploit the statistics of the correlator outputs and thus may introduce larger error margins in the determination of data packet timing. In this third embodiment, a method is disclosed which permits a more accurate determination of arrival time of a data packet. Thus synchronisation errors may be reduced and, consequently, packet loss rates are reduced. Specifically, the method uses a linear filtering approach to interpret the correlator outputs prior to powers being calculated, thereby improving the quality of the statistic used for packet synchronisation. This is achieved primarily due to the noise suppression properties of the filter. The shape of the linear filter may be optimally designed against the characteristics of the preamble and the radio channel. An example would be a root raised cosine filter, or a Hanning/Hamming window filter. One preferred embodiment of the invention is the use of a centre weighted average filter with a triangular impulse response for application to the correlator outputs. This filter enables more accurate location of the time of the packet arrival than is achievable otherwise and has an efficient implementation. It is also proposed to use the maximum correlation power, once a threshold is exceeded, as the decision point rather than the time at which the correlation power first crosses a threshold. Those practiced in the art will recognise that this method has potential application to any communication system that uses a repetitive preamble for packet synchronisation. The inventor has recognised that filters are widely used in general applications and that the synchronisation of packets may be treated as a filtering problem. Accordingly, the inventor proposes to use raw correlator outputs as a preferred filter input. The use of a centre weighted (or other) filter on the correlator outputs prior to power calculation is used as a measure of the arrival timing of a packet. Threshold testing of the normalised power of the received signal correlated with a delayed version of itself is also contemplated. The delay is equal to the repetition size of the preamble. The normalisation is achieved by dividing by the sliding window averaged power of the received signal. In this third embodiment it is particularly advantageous to provide a receiver with the following functions:

Filtering of raw correlator outputs;

Centre weighted averaged filter, preferably a triangular filter which has an efficient implementation;

The above allows for basing a decision point on the maximum of correlator output power rather than a first level crossing leading to better characterisation of packet timing to avoid packet transmission loss/inefficiency. The third embodiment may comprise a receiver technology for packet data transmissions where a repetitive preamble is deployed to determine packet data timing and allowing for adaptive design of filter form against the statistics of the radio channel.

Field of Application

The third embodiment technology applies to a point to point communications link where transmissions are made using a waveform structure that has a preamble of a particular type. Specifically the preamble may be formed by one or more repetitions of a base signal. The functional device embodying the technology preferably resides in the baseband receiver processor

where, similar to the ‘.*’ operator, the ‘./’ operator corresponds to an element-wise division of the vector elements. In data aided techniques the decoder outcome, {circumflex over (d)}i is used instead of the actual transmitted data. This estimate is subject to errors. The fifth embodiment involves a technique that accounts for this uncertainty in the “training” symbols. The method may be employed for time varying or invariant radio channels and takes a slightly different form depending of the channel variation. The following is a description of the estimator for time varying radio channels.

Assume the following is provided:

1. an entire packets worth of received OFDM Symbols R, and

2. an entire packets worth of soft training symbols D (some may be “hard” pilot symbols).

It is possible to structure these two objects as matrices as shown in FIG. 31 for M sub-carriers and N OFDM Symbols, where the rows are sub-carriers (tones or frequency bins) and the columns are OFDM Symbols (time).

Firstly, multiply the received OFDM Symbol matrix by the conjugate (denoted X*) of the Soft Training symbols to get an intermediate raw channel estimate V=R.*D*. Note that the conventional step (as described above) would prescribe a division, not a multiplication. Then compute a further intermediate matrix of training weights T=|D| or other functions such as absolution value squared. Then apply smoothing to both of these matrices using a two dimensional filter (f) matched to the channel coherence time and frequency. This filter outcome may be approximated by implementing smoothing independently in the time and frequency domains (rows then columns or vice versa) to save complexity. The estimate of the time varying channel is then derived as
Ĥi=f(V)./f(T)=f(R.*D*)./f(|D|)

The uncertainty in the decoder outcomes is accounted for in the step where the absolute value of the training symbols was obtained. Small training symbols result from uncertain soft output from the FEC decoder step. A soft output FEC decoder will output a zero when a reliable estimate cannot be determined. Multiplication (in the R.*D* step) by a zero effectively excludes that symbol estimate from the channel estimation process. Note that in the next iteration the symbol estimate may have firmed up, due to improved statistics driving the FEC decoder, increasing its reliability and therefore it may now be included in the channel estimation process. In the ideal case the decoder will output correct, hard decisions and all data symbols will be used as perfect training to yield a very accurate channel estimate.

In the case that the channel is assumed time invariant across the packet the filtering function simply adds up the column and resulting in a column that is assume to apply over the entire packet.

In some cases, an approach whereby the two dimensional filter f applied to the raw channel estimate and training weight is different may be warranted. In these cases the time varying channel estimate would be
Ĥi=f1(V)./f2(T)=f1(R.*D*)./f2(|D|)

where f1 and f2 implement different filters.

Joint Time and Frequency Offset Estimation using 2D FFT

In this aspect of the fifth embodiment we remove the effect of the data on the phase difference between adjacent symbols in the OFDM received matrix as shown in FIG. 31 and then apply a 2 Dimensional FFT. This removal may be achieved by multiplying the observed OFDM Symbol matrix with a corresponding matrix of conjugated data symbols be they preamble, training or estimated. The FFT output is then filtered to suppress noise, and a search for the peak power across the resulting 2 Dimensional space of metrics is executed. The filtering will have an impact on the maximum offsets that may be measured and it is therefore recommended that only very weak filtering be employed. The location of the peak, in terms of relative position in the rectangle of FIG. 31, determines the time and frequency offsets.

The granularity and range of the estimation is limited as follows. If there are M Sub Carriers and N OFDM Symbols then the range and resolution available from this technique is as shown in the following

Resolution Value
Frequency OFDM Symbol OFDM Symbol
Offset Frequency/N Frequency
Time Offset OFDM Symbol OFDM Symbol
Duration/M Duration

An example for the system parameterised by is now given.

Parameter Value
Number Of Tones 256
Number Of Symbols 20
Coherence Tones 40
Coherence Symbols 50
Actual Freq Offset 0.05
Actual Time Offset 0.20

With the actual channel amplitude and phase shown in FIG. 32 and FIG. 33 we get the metric shown in FIG. 34 for peak detection. Note that the peak is in the expected relative position, i.e. a fraction of 0.05 along the OFDM Symbol dimension and a fraction of 0.2 along the sub-carrier dimension. These estimates match the actual time and frequency offsets as shown in the above table of parameter values in the model.

By accurately estimating the channel, the performance of the FEC decoder stage is significantly improved, typically in excess of 1 dB increase in receiver sensitivity. This is true even for time-invariant channels and is realized by exploiting data symbols for training purposes. In the case where mobility exists the ability of the receiver to track the channel in time allows the receiver to operate effectively where related art systems may fail. At the same time, the benefits of iterative estimation of the data symbols are realized.

In a sixth embodiment the present invention provides a solution predicated on the use of firstly correlating the received signal at each antenna of a multiple access communication network with a known signal preamble and then statistically combining the correlated signal sequence of each antenna based on estimated antenna signal strength. It should be noted that in order to determine the coefficients for combining an initial timing estimate must be determined. The calculation of these coefficients will require, in practice, initial coarse timing and frequency offset estimation by other means. The quality of the initial timing estimate may be worse than that desired ultimately. The inventor considers further processing on the combined signal will lead to a timing estimate of high quality.

In a first aspect the sixth embodiment provides a system and method of communicating in a multiple access packet network by synchronizing a received signal in a multi antenna receiver comprising:

correlating a received signal observation at each of a plurality of antennae with a known signal preamble to provide a received signal sequence;

determine a power signal of each received signal sequence;

combine the determined power signals in accordance with a time averaged weighting based on estimated antenna signal strength for each antenna;

determine a time of arrival for the received signal in accordance with a predetermined threshold condition.

An preferred aspect of the sixth embodiment of the invention comprises:

determining an estimate of the relative phase and amplitude coefficients of a receiving channel for each antenna;

combining a received signal with the estimated coefficients to provide a composite signal;

determining a time of arrival of the received signal by correlating the composite signal with a delayed version of itself.

In related art, metrics used for synchronisation are based on outputs of correlators for the preamble of a packet. In the case of multiple receive antennae, a method for either combining or deriving a new method of metric generation for synchronisation is desirable. Related art schemes propose making decisions per antenna and then majority voting or adding the metrics prior to decision. Neither of these approaches addresses sufficiently the variation of the signal statistics across antennae. The net result of this is degraded synchronisation accuracy and increased packet loss rates. A further issue relates to the effective use of multiple antennae for data carriage but poor use of multiple antennae for synchronisation. In this case packets that could otherwise be decoded may be missed by the synchronisation module.

In this sixth embodiment, we disclose a method for determining per antenna metrics and for subsequent combining across antennae in order to generate a metric for time of arrival estimation. The method involves essentially two steps. The per antenna metrics are derived by correlating the received signal with a known preamble in a first step. The power of the sequences for each antenna is determined and added across antenna according to the time averaged weight based on estimated antenna signal strength. A threshold is then applied in order to determine the time of arrival.

A further aspect of the sixth embodiment relates to obtaining a rapid estimate of the relative phase and amplitude of the channel on each antenna and then to combine the received signal according to the conjugate of these coefficients. The processing would then proceed as in the related art with correlation of this composite signal with a delay version of itself. Application of this aspect of the sixth embodiment is in the synchronisation of wireless communication links involving the simultaneous use of multiple receive antennae where the multiple antennae are used to increase the robustness of the communications link primarily through increased diversity.

In a further aspect, the signals from each antenna are combined according to Minimum Mean Square Error criteria where the combining coefficients are dependent on a background noise measure on each antenna as well as the received signal energy. The processing would then proceed as in the related art with correlation of this composite signal with a delay version of itself.

It is particularly advantageous that the sixth embodiment provides for: a combining method for the metrics over antennae; currently does not require OFDM specific characteristics, and; a version with OFDM specificity may be defined for clarity.

It will be appreciated by those skilled in the art, that the invention is not restricted in its use to this particular application described, neither is the present invention restricted to its preferred embodiment with regards to the particular elements and/or features described or depicted herein. It will be appreciated that various modifications can be made without departing from the principles of the invention. Therefore, the invention should be understood to include all such modifications within its scope.

While this invention has been described in connection with specific embodiments thereof, it will be understood that it is capable of further modification(s). This application is intended to cover any variations uses or adaptations of the invention following in general, the principles of the invention and comprising such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains and as may be applied to the essential features hereinbefore set forth.

As the present invention may be embodied in several forms without departing from the spirit of the essential characteristics of the invention, it should be understood that the above described embodiments are not to limit the present invention unless otherwise specified, but rather should be construed broadly within the spirit and scope of the invention as defined in the appended claims. Various modifications and equivalent arrangements are intended to be included within the spirit and scope of the invention and appended claims. Therefore, the specific embodiments are to be understood to be illustrative of the many ways in which the principles of the present invention may be practiced. In the following claims, means-plus-function clauses are intended to cover structures as performing the defined function and not only structural equivalents, but also equivalent structures. For example, although a nail and a screw may not be structural equivalents in that a nail employs a cylindrical surface to secure wooden parts together, whereas a screw employs a helical surface to secure wooden parts together, in the environment of fastening wooden parts, a nail and a screw are equivalent structures.

“Comprises/comprising” when used in this specification is taken to specify the presence of stated features, integers, steps or components but does not preclude the presence or addition of one or more other features, integers, steps, components or groups thereof.”

  • [1] M. C. Reed, C. B. Schlegel, P. D. Alexander, and J. Asenstorfer, “Iterative multiuser detection for CDMA with FEC: Near-single-user performance,” IEEE Trans. Commun., pp. 1693-1699, December 1998.
  • [2] S. Marinkovic, B. S. Vucetic, and J. Evans, “Improved iterative Parallel interference cancellation for coded CDMA systems,” in the Proc. IEEE Int. Symp. Info. Theory, (Washington D.C.), p. 34, July 2001.
  • [3] D. E. Catlin, Estimation, Control, and the Discrete Kalman Filter, Springer Verlag, 1989.
  • [4] P. D. Alexander, A. J. Grant, and M. C. Reed, “Iterative detection on code-division multiple-access with error control coding,” European Transactions on Telecommunications, vol. 9, pp. 419-426, September-October 1998.

Grant, Alexander James, Alexander, Paul Dean, Jakas, Stephen Peter, Rasmussen, Lars Kildehoj

Patent Priority Assignee Title
11075716, Mar 16 2017 Integrated Silicon Solution, (Cayman) Inc. Repetition scheme for flexible bandwidth utilization
Patent Priority Assignee Title
5127051, Jun 13 1988 ITT Corporation Adaptive modem for varying communication channel
5136612, Dec 31 1990 AT&T Bell Laboratories Method and apparatus for reducing effects of multiple access interference in a radio receiver in a code division multiple access communication system
5282155, Nov 19 1992 Telcordia Technologies, Inc Adaptive digital filter architecture for parallel output/update computations
5559839, Nov 30 1993 Nederlandse Organisatie Voor Toegepast-Natuurwetenschappelijk Onderzoek System for the generation of a time variant signal for suppression of a primary signal with minimization of a prediction error
5764646, Apr 02 1996 Ericsson Inc Packet data transmission with clash subtraction
5909466, Sep 15 1995 France Telecom Adaptive equalizer for digital communications systems
5966262, Mar 31 1997 Regents of the University of Minnesota Method and apparatus for high data rate detection for three dimensional 110 channels
6047020, Mar 19 1996 Nokia Telecommunications Oy Receiving method and a receiver
6161209, Mar 28 1997 Her Majesty the Queen in right of Canada, as represented by the Minister Joint detector for multiple coded digital signals
6178196, Oct 06 1997 AT&T Corp Combined interference cancellation and maximum likelihood decoding of space-time block codes
6327314, Apr 01 1998 AT&T Corp. Method and apparatus for channel estimation for multicarrier systems
6359935, May 24 1999 Unwired Planet, LLC Method for iterative demodulation and decoding for a system with coding and differential demodulation
6459728, Apr 30 1998 AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LIMITED Iterative channel estimation
6460160, Feb 14 2000 Motorola, Inc. Chase iteration processing for decoding input data
6477210, Feb 07 2000 AT&T Corp System for near optimal joint channel estimation and data detection for COFDM systems
6483821, Apr 22 1998 Texas Instruments Incorporated CDMA mobile communications system and method with improved channel estimation and pilot symbol transmission
6539067, Apr 30 1998 Lucent Technologies, INC Channel estimation using soft-decision feedback
6549585, Oct 06 1997 AT&T Corp Combined interference cancellation and maximum likelihood decoding of space-time block codes
6614857, Apr 23 1999 WSOU Investments, LLC Iterative channel estimation and compensation based thereon
6618452, Jun 08 1998 Telefonaktiebolaget LM Ericsson Burst carrier frequency synchronization and iterative frequency-domain frame synchronization for OFDM
6650714, Nov 30 2000 Intel Corporation Spatial processing and timing estimation using a training sequence in a radio communications system
6671338, Nov 12 1998 U S BANK NATIONAL ASSOCIATION Combined interference cancellation with FEC decoding for high spectral efficiency satellite communications
6687492, Mar 01 2002 IPR LICENSING INC System and method for antenna diversity using joint maximal ratio combining
6700919, Nov 30 1999 Texas Instruments Incorporated Channel estimation for communication system using weighted estimates based on pilot data and information data
6704376, Jan 23 2002 COLLISION COMMUNICATIONS, INC Power and confidence ordered low complexity soft turbomud with voting system
6765969, Sep 01 1999 MOTOROLA SOLUTIONS, INC Method and device for multi-user channel estimation
6768713, Sep 13 1999 France Telecom Orthogonal frequency division multiplexing receiver with iterative channel estimation and a corresponding method
6907084, Oct 06 2000 Texas Instruments Incorporated Method and apparatus for processing modulation symbols for soft input decoders
6940914, Jun 11 2001 HUAWEI TECHNOLOGIES, COMPANY, LTD Turbo channel estimation for OFDM systems
6956815, Aug 16 2001 GOOGLE LLC Method and apparatus using pseudo-inverses of linear transformations in multi-carrier modulation receivers and transceivers
6993070, May 16 2000 France Telecom Method and system of iteratively detecting and decoding received symbols coupled with re-estimation of the coefficients of the transmission channel
6996194, Dec 15 1999 Nokia Technologies Oy Method and arrangement for iteratively improving a channel estimate
7023935, Nov 27 2001 Mitsubishi Electric Research Laboratories, Inc. Trellis based maximum likelihood signal estimation method and apparatus for blind joint channel estimation and signal detection
7058002, Apr 22 1999 Nippon Telegraph and Telephone Corporation OFDM packet communication receiver
7092436, Jan 25 2002 Trustees of Princeton University Expectation-maximization-based channel estimation and signal detection for wireless communications systems
7139336, Apr 05 2002 Nokia Siemens Networks Oy Method and system for channel estimation using iterative estimation and detection
7139339, Apr 02 2002 AVAGO TECHNOLOGIES GENERAL IP SINGAPORE PTE LTD Iterative data-aided carrier frequency offset estimation for code division multiple access systems
7154936, Dec 03 2001 Qualcomm Incorporated Iterative detection and decoding for a MIMO-OFDM system
7161896, Aug 12 2002 Cisco Technology, Inc Channel estimation in a multicarrier radio receiver
7170948, Feb 21 2001 France Telecom Method and system of iterative coding/decoding of digital data streams coded by spatio-temporal combinations, in multiple transmission and reception
7181177, Jul 30 2001 Telefonaktiebolaget LM Ericsson (publ) Channel estimation in a multi carrier transmit diversity system
7203255, Feb 14 2002 Qualcomm Incorporated Method and system to implement non-linear filtering and crossover detection for pilot carrier signal phase tracking
7227887, Sep 08 2000 Samsung Electronics Co., Ltd.; SAMSUNG ELECTRONICS CO , LTD Apparatus and method for moving PN hypothesis in high speed searcher
7251274, Nov 25 1999 France Telecom; GROUPE DES ECOLES DES TELECOMMUNICATIONS ENST BRETAGNE Multichannel adaptive equaliser
7256737, Mar 18 2002 Method and apparatus for geolocating a wireless communications device
7292833, Apr 28 2000 France Telecom SA Reception system for multisensor antenna
7298801, Sep 01 2000 Thales Method and device for demodulating signals from multiple users
7313400, May 10 2002 GOOGLE LLC Radio communication device and method thereof
7324437, Nov 27 1999 Deutsche Telekom AG Method for co-channel interference cancellation in a multicarrier communication system
7324585, Oct 01 2002 Texas Instruments Incorporated System and method for performing symbol boundary-aligned search of direct sequence spread spectrum signals
7453793, Apr 10 2003 Qualcomm Incorporated Channel estimation for OFDM communication systems including IEEE 802.11A and extended rate systems
7474688, Oct 01 2002 Texas Instruments Incorporated System and method for detecting multiple direct sequence spread spectrum signals using a multi-mode searcher
20010017903,
20010053143,
20020031170,
20020067782,
20020101840,
20020168017,
20020181509,
20030021332,
20030031278,
20030095590,
20030103584,
20030112825,
20030128656,
20030152021,
20030156534,
20030161415,
20030185284,
20030236081,
20040001564,
20040004997,
20040005010,
20040008614,
20040047435,
20040062297,
20040062299,
20040081074,
20040081205,
20070064775,
20070092015,
AU200038414,
EP1387544,
JP2002232389,
WO158105,
WO223781,
WO239597,
WO3094037,
WO2004006525,
/
Executed onAssignorAssigneeConveyanceFrameReelDoc
Feb 24 2017Cohda Wireless Pty. Ltd(assignment on the face of the patent)
Date Maintenance Fee Events
Oct 17 2022REM: Maintenance Fee Reminder Mailed.
Apr 03 2023EXP: Patent Expired for Failure to Pay Maintenance Fees.


Date Maintenance Schedule
Nov 17 20234 years fee payment window open
May 17 20246 months grace period start (w surcharge)
Nov 17 2024patent expiry (for year 4)
Nov 17 20262 years to revive unintentionally abandoned end. (for year 4)
Nov 17 20278 years fee payment window open
May 17 20286 months grace period start (w surcharge)
Nov 17 2028patent expiry (for year 8)
Nov 17 20302 years to revive unintentionally abandoned end. (for year 8)
Nov 17 203112 years fee payment window open
May 17 20326 months grace period start (w surcharge)
Nov 17 2032patent expiry (for year 12)
Nov 17 20342 years to revive unintentionally abandoned end. (for year 12)