GB2261347A - Detection of data bits in a slow frequency hopping communication system - Google Patents
Detection of data bits in a slow frequency hopping communication system Download PDFInfo
- Publication number
- GB2261347A GB2261347A GB9222170A GB9222170A GB2261347A GB 2261347 A GB2261347 A GB 2261347A GB 9222170 A GB9222170 A GB 9222170A GB 9222170 A GB9222170 A GB 9222170A GB 2261347 A GB2261347 A GB 2261347A
- Authority
- GB
- United Kingdom
- Prior art keywords
- hop
- data samples
- frequency hopping
- slow frequency
- power ratio
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/715—Interference-related aspects
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/715—Interference-related aspects
- H04B2001/7152—Interference-related aspects with means for suppressing interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
- H04B7/0802—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using antenna selection
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
In the detecting process, the carrier to interference (C/I) power ratio of the hop of a slow frequency hopping spread spectrum signal (112), is estimated (124) by using the data samples (120) of the hop. Subsequently, a data bit (130) is detected by using the estimated C/I power ratio (126). The detection process (128) may include utilizing maximum likelihood decoding techniques to derive a data bit (130) from decision metrics and the estimated C/I power ratio (126). The decision metrics correspond to a measurement of the distance of data samples (120) from constellation points within a constellation space representing data samples (120) previously used to generate decision metrics. The detection process (128) also may include utilizing the estimated C/I power ratio (126) in combining data samples (120) of the hop as received from two or more diversity receiver branches. <IMAGE>
Description
METHOD AND APPARATUS FOR IMPROVING DETECTION OF
DATA BITS IN A SLOW FREQUENCY HOPPING
COMMUNICATION SYSTEM
Field of the Invention
The present invention relates to communication systems which employ spread-spectrum signals and, more particularly, to a method and apparatus for improving a soft decision algorithm in a slow frequency hopping spread spectrum communication system.
Background of the Invention
Communication systems take many forms. In general, the purpose of a communication system is to transmit information-bearing signals from a source, located at one point, to a user destination, located at another point some distance away. A communication system generally consists of three basic components: transmitter, channel, and receiver. The transmitter has the function of processing the message signal into a form suitable for transmission over the channel. This processing of the message signal is typically referred to as modulation. The function of the channel is to provide a physical connection between the transmitter output and the receiver input.
The function of the receiver is to process the received signal so as to produce an estimate of the original message signal. This processing of the received signal is referred to as demodulation.
Two types of two-way communication channels exist, namely, pointto point channels and point-to-multipoint channels. Examples of point-topoint channels include wirelines (e.g., local telephone transmission), microwave links, and optical fibers. In contrast, point-to-multipoint channels provide a capability where many receiving stations may be reached simuitaneously from a single transmitter (e.g. cellular radio telephone communication systems). These point-to-multipoint systems are also termed Multiple Access Systems (MAS).
Analog and digital transmission methods are used to transmit a message signal over a communication channel. The use of digital methods offers several operational advantages over analog methods, including but not limited to: increased immunity to channel noise and interference, flexible operation of the system, common format for the transmission of different kinds of message signals, improved security of communication through the use of encryption, and increased capacity.
These advantages are attained at the cost of increased system complexity. However, through the use of very large-scale integration (VLSI) technology, a cost-effective way of building the hardware has been developed.
To transmit a message signal (either analog or digital) over a bandpass communication channel, the message signal must be manipulated into a form suitable for efficient transmission over the channel. Modification of the message signal is achieved by means of a process termed modulation.
This process involves varying some parameter of a carrier wave in accordance with the message signal in such a way that the spectrum of the modulated wave matches the assigned channel bandwidth.
Correspondingly, the receiver is required to recreate the original message signal from a degraded version of the transmitted signal after propagation through the channel. The re-creation is accomplished by using a process known as demodulation, which is the inverse of the modulation process used in the transmitter.
In addition to providing efficient transmission, there are other reasons for performing modulation. In particular, the use of modulation permits multiplexing, that is, the simultaneous transmission of signals from several message sources over a common channel. Also, modulation may be used to convert the message signal into a form less susceptible to noise and interference.
For multiplexed communication systems, the system typically consists of many remote units (i.e. subscriber units) which require active service over a communication channel for a short or discrete portion of the communication channel resource rather than continuous use of the resources on a communication channel. Therefore, communication systems have been designed to incorporate the characteristic of communicating with many remote units for brief intervals on the same communication channel. These systems are termed multiple access communication systems.
One type of communication system which can be a multiple access system is a spread spectrum system. In a spread spectrum system, a modulation technique is utilized in which a transmitted signal is spread over a wide frequency band within the communication channel. The frequency band is much wider than the minimum bandwidth required to transmit the information being sent. A voice signal, for example, can be sent with amplitude modulation (AM) in a bandwidth only twice that of the information itself. Other forms of modulation, such as low deviation frequency modulation (FM ) or single sideband AM, also permit information to be transmitted in a bandwidth comparable to the bandwidth of the information itself.However, in a spread spectrum system, the modulation of a signal to be transmitted often includes taking a baseband signal (e.g., a voice channel) with a bandwidth of only a few kilohertz, and distributing the signal to be transmitted over a frequency band that may be many megahertz wide. This is accomplished by modulating the signal to be transmitted with the information to be sent and with a wideband encoding signal.
Three general types of spread spectrum communication techniques exist, including:
Direct Seauence
The modulation of a carrier by a digital code sequence whose bit rate
is much higher than the information signal bandwidth. Such systems
are referred to as "direct sequence" modulated systems.
Hopping Carrier frequency shifting in discrete increments in a pattern dictated
by a code sequence. These systems are called "frequency
hoppers." The transmitter jumps from frequency to frequency within
some predetermined set; the order of frequency usage is determined
by a code sequence. Similarly "time hopping" and "time-frequency hopping" have times of transmission which are regulated by a code
sequence.
ChirD
Pulse-FM or "chirp" modulation in which a carrier is swept over a wide
band during a given pulse interval.
Information (i.e. the message signal) can be embedded in the spread spectrum signal by several methods. One method is to add the information to the spreading code before it is used for spreading modulation. This technique can be used in direct sequence and frequency hopping systems.
It will be noted that the information being sent must be in a digital form prior to adding it to the spreading code, because the combination of the spreading code and the information typically a binary code involves module2 addition. Altematively, the information or message signal may be used to modulate a carrier before spreading it.
Thus, a spread spectrum system must have two properties: (1) the transmitted bandwidth should be much greater than the bandwidth or rate of the information being sent and (2) some function other than the information being sent is employed to determine the resulting modulated channel bandwidth.
Spread spectrum communication systems can be implemented as multiple access systems in a number of different ways. One type of multiple access spread spectrum system is a code division multiple access (CDMA) system. CDMA spread spectrum systems may use direct sequence (DS-CDMA) or frequency hopping (FH-CDMA) spectrum spreading techniques. FH-CDMA systems can further be divided into slow frequency hopping (SFH-CDMA) and fast frequency hopping (FFH
CDMA) systems. In SFH-CDMA systems several data symbols, representing a sequence of data bits which are to be transmitted, modulate the carrier wave within a single hop. Whereas, in FFH-CDMA systems the carrier wave hops several times per data symbol.
In a SFH-CDMA system, multiple communication channels are accommodated by the assignment of portions of a broad frequency and or time band to each particular channel. For example, communication between two communication units in a particular communication channel is accomplished by using a frequency synthesizer to generate a carrier wave in a particular portion of a predetermined broad frequency band for a brief period of time. The frequency synthesizer uses an input spreading code to determine the particular frequency from within the set of frequencies in the broad frequency band at which to generate the carrier wave. Spreading codes are input to the frequency synthesizer by a spreading code generator.The spreading code generator is periodically clocked or stepped through different transitions which causes different or shifted spreading codes to be output to the frequency synthesizer. Therefore, as the spreading code generator is periodically clocked, then so too is the carrier wave frequency hopped or reassigned to different portions of the frequency band. In addition to hopping, the carrier wave is modulated by data symbols representing a sequence of data bits which are to be transmitted. A common type of carrier wave modulation used in SFH-CDMA systems is
M-ary frequency shift keying (MFSK), where k = log2M data symbols are used to determined which one of the M frequencies is to be transmitted.
Multiple communication channels are allocated by using a plurality of spreading codes to assign portions of the frequency band to different channels during the same time period. As a result, transmitted signals are in the same broad frequency band of the communication channel, but within unique portions of the broad frequency band assigned by the unique spreading codes. These unique spreading codes preferably are orthogonal to one another such that the crosscorrelation between the spreading codes is approximately zero. Particular transmitted signals can be retrieved from the communication channel by despreading a signal representative of the sum of signals in the communication channel with a spreading code related to the particular transmitted signal which is to be retrieved from the communication channel.Further, when the spreading codes are orthogonal to one another, the received signal can be correlated with a particular spreading code such that only the desired signal related to the particular spreading code is enhanced while the other signals are not enhanced.
It will be appreciated by those skilled in the art that several different spreading codes exist which can be used to separate data signals from one another in a CDMA communication system. These spreading codes include but are not limited to pseudonoise (PN) codes and Walsh codes. A Walsh code corresponds to a single row or column of the Hadamard matrix. For example, in a 64 channel CDMA spread spectrum system, particular mutually orthogonal Walsh codes can be selected from the set of 64 Walsh codes within a 64 by 64 Hadamard matrix.
Further it will be appreciated by those skilled in the art that the data signals are typically channel coded to improve performance of the communication system by enabling transmitted signals to better withstand the effects of various channel impairments, such as noise, fading, and jamming. Typically, channel coding reduces the probability of bit error, and/or reduces the required signal to noise ratio usually expressed as bit energy per noise density (No), to recover the signal at the cost of expending more bandwidth than would otherwise be necessary to transmit the data signal.
A typical spread spectrum transmission involves expanding the bandwidth of an information signal, transmitting the expanded signal and recovering the desired information signal by remapping the received spread spectrum into the original information signals bandwidth. This series of bandwidth trades used in spread spectrum signalling techniques allows a communication system to deliver a relatively error4ree information signal in a noisy environment or communication channel. The quality of recovery of the transmitted information signal from the communication channel is measured by the error rate (i.e., the number of errors in the recovery of the transmitted signal over a particular time span or received bit span) for some EdNo. As the error rate increases the quality of the signal received by the receiving party decreases.As a result, communication systems typically are designed to limit the error rate to an upper bound or maximum so that the degradation in the quality of the received signal is limited. In CDMA spread spectrum communication systems, the error rate is related to the noise interference level in the communication channel which is directly related to number of simultaneous but code divided users within the communication channel.
Thus, in order to limit the maximum error rate, the number of simultaneous code divided users in the communication channel is limited. However, the error rate can be reduced by using channel coding schemes. The error rate can also be reduced by using diversity combining. Therefore, by using channel coding and/or diversity combining schemes the number of simultaneous users in a communication channel can be increased while still maintaining the same maximum error rate limit.
As discussed in Diaital Communications: Fundamentals and
Applications by Bernard Sklar, published by Prentice Hall, Englewood
Cliffs, New Jersey in 1988, especially chapters 5 and 6 entitled "Channel
Coding" found on pages 245-380, several of these channel coding and decoding schemes have been developed for use in communication systems. Among the decoding schemes discussed is using a maximumlikelihood (ML) decoding algorithm. In addition to the discussion found in Sklars book above-mentioned, Gottfried Ungerboeck described in general
MLSE decoding algorithms in "Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems", IEEE Transactions on
Communications, vol. com-22, no. 5, May 1974, p.p. 624-636.However, a need exists for ML decoding schemes to be specifically optimized for use in frequency hopping spread spectrum communication systems. In optimizing the communication system with respect to the ML decoding algorithm, one starting point is analyzing the implementation of the ML decoding algorithm to the particular environment to which it is to be used. For the purposes of this discussion, the environment will include convolutional encoders and ML decoding algorithms similar to the Viterbi decoding algorithm. It will be appreciated by those skilled in the art that these principles can be applied to other encoding techniques such as block encoding and ML decoding algorithms other than Viterbi-like algorithms.
Through the use of these optimized decoding schemes, the number of simultaneous users in a communication system can be increased over the number of simultaneous users in a communication system using nonoptimized decoding algorithms while maintaining the same maximum error rate limit.
Several of diversity combining schemes have been developed for use in communication systems. Among the diversity combining schemes is the diversity reception technique described in U.S. Pat. No. 5,031,193 entitled "Method and Apparatus for Diversity Reception of Time-Dispersed
Signals". This patent describes diversity combining stages which perform either bit by bit selection of or maximal ratio combining of signals received from several receiver branches. The diversity combined signal may optionally be subsequently used in estimating the received sequence.
Another diversity reception scheme is described in U. S. Pat. No.
4,271,525 entitled "Adaptive Diversity Receiver For Digital
Communications". This patent describes an adaptive diversity receiver using an adaptive transversal filter for each receiver branch, followed by a decision feedback equalizer. The tap gains of the transversal filters are updated via feedback from the output of the equalizer, and other points in the receiver. However, a need exists for diversity combining schemes to be specifically optimized for use in frequency hopping spread spectrum communication systems. In optimizing the communication system with respect to diversity combining, one starting point is analyzing the implementation of diversity combining to the particular environment to which it is to be used.For the purposes of this discussion, the environment will include at least two receiver branches and a signal combining technique of either bit by bit selection or maximal ratio combining. It will be appreciated by those skilled in the art that these principles can be applied to other diversity combining techniques. Through the use of these optimized diversity combining schemes, the number of simultaneous users in a communication system can be increased over the number of simultaneous users in a communication system using non-optimized diversity combining techniques while maintaining the same maximum error rate limit.
Summary of the Invention
A method and apparatus is provided for improving detection of data bits in data samples of a hop of a slow frequency hopping spread spectrum signal. In the detecting process, the canier to interference (C/I) power ratio of the hop is estimated by using the data samples of the hop. Subsequently, a data bit is detected by using the estimated C/I power ratio. The detection process may include utilizing maximum likelihood decoding techniques to derive a data bit from decision metrics and the estimated C/I power ratio.
The decision metrics correspond to a measurement of the distance of data samples from constellation points within a constellation space representing data samples previously used to generate decision metrics. The detection process also may include utilizing the estimated C/I power ratio in combining data samples of the hop as received from two or more diversity receiver branches.
Brief Description of the Drawings
FIG. 1 is a block diagram showing a preferred embodiment slow frequency hopping communication system.
FIG. 2 is a block diagram showing a preferred embodiment data bit detection portion which utilize maximum likelihood decoding techniques.
FIG. 3 is a block diagram showing preferred embodiment receiving and data bit detection portions which utilize diversity combining techniques.
Detailed Description
Referring now to FIG. 1, a preferred embodiment slow frequency hopping (SFH) communication system is shown. In optimizing the communication system, one starting point is analyzing the implementation of the ML decoding algorithm and diversity combining techniques to the particular environment to which it is to be used. For the purposes of this discussion, the environment will include convolutional encoding of data bits prior to transmission and slow frequency hopping signaling. It will be appreciated by those skilled in the art that these principles can be applied to other encoding techniques such as block encoding as well as other signalling techniques having properties similar to slow frequency hopping signalling such as time hopping signalling.
In order to design either a convolutional decoder to perform optimal
ML decoding or a diversity combiner to perform optimal diversity combining, obtaining knowledge about the received carrier signal power to interference signal power ratio (i.e., C/I power ratio) is desirable.
Measurement of the actual C/I power ratio in SFH communication systems can be difficult since the carrier signal hops at discrete time intervals over a broad frequency band. The C/I power ratio may change with each hop, since the interference in different portions of the broad frequency band may vary by the frequency. This variance of the interference at different frequencies may be due to signals other than the desired signal being transmitted at or near the same frequency as the desired frequency as well as from spurious noise bursts from electrical power generators and transmission lines, solar flares, atmospheric disturbances and the like.
Therefore, since actual measurement is difficult, an approximation of the C/I power ratio in SFH communication systems is desirable.
In accordance with a preferred embodiment of the present invention one such approximation of the the C/I power ratio is proposed. In this preferred embodiment an assumption concerning the communication channel conditions has been made. This assumption is that the C/I power ratio remains constant overthe duration of a single hop. Such an assumption is valid so long as the duration of the hop is short enough to be able to reasonably assume that the magnitude of the power interference sources in the communication channel would be constant over the hop. The preferred embodiment approximation or estimate of the C/I power ratio of a hop of a
SFH spread spectrum signal is measured according to the following equation for:
In the equation (eq. 1), z represents the phase modulation cancelled forms of the data samples of a hop of the SFH signal.The data samples are samples of the complex envelope of the hop where the hop has been modulated by nth phase shift keying. Cancellation of nth phase shift keying modulation of the hop of the slow frequency hopping spread spectrum signal can be accomplished by raising the complex envelope of the hop to the nth power. As a result, z represents the phase modulation cancelled forms of the data samples which comprise samples of the complex envelope of the hop raised to the nth power for the nth phase shift keying modulated hop of the slow frequency hopping spread spectrum signal. For example, a complex envelope of a bi-phase shift key modulated (BPSK) hop of a SFH signal is raised to the second power (i.e., squared) in order to generate a phase modulation cancelled form of the hop. Similarly, a complex envelope of a quadrature phase shift key modulated (QPSK) hop of a SFH signal is raised to the fourth power in order to generate a phase modulation cancelled form of the hop.
In addition, in the equation (eq. 1), Ave2(Re(z)) is the square of the average of the real portion of z over the hop. More precisely, zk represents a single phase modulation cancelled data sample where the data sample is represented as a complex number having a real and an imaginary portion.
In addition, N is the number of data samples of the complex envelope of the hop. Thus, Ave2(Re(z)) may be computed by squaring the result of the following equation:
in which the real portions of each data sample zj of the hop are summed together and subsequently divided by the number of data samples of the hop.
In addition, in the equation (eq. 1), Ave(lzjq is the average of the square of the magnitude of the complex valued z (i.e. where z has a real and imaginary portion) over the hop. More precisely, as noted above, zk represents a single phase modulation cancelled data sample where the data sample is represented as a complex number having a real and an imaginary portion. In addition, N is the number of data samples of the complex envelope of the hop. Thus, Ave(1z12) may be computed according to the following equation:
in which the square of the absolute value of each data sample zk is summed together and subsequently divided by the number of data samples of the hop.
It will be appreciated by those skilled in the art that any monotonically related form of the estimate of the C/I power ratio (v) may be used without departing from the scope of the present invention. For example, an estimate maybe formed using v in which v is raised to a power greater or less than one, v is multiplied or divided by a constant value or variable, and/or v is added to or subtracted from a constant value or variable. Further, it will be appreciated by those skilled in the art that this preferred embodiment C/I power ratio estimate (v) has several advantages.These advantages include the ease of calculation of the estimate (g) due to simple arithmetic operations being performed on digital values which represent data samples. Another advantage is the lack of need for measurements other than those already being done in the data bit detecting process. The sampling of the complex envelope of the hop is already being done in conjunction with the data bit detecting process. Further, measurement of the actual C/I power ratio would involve the additional steps of measuring the power of the carrier and interference signals over the hop. Yet another advantage is that this estimate (v) does not require any prior knowledge conceming the data bits being transmitted within of the hop of the SFH signal.
This estimate of the C/I ratio ) of a hop is a monotonous function of the actual C/I power ratio. A derivation of a proof this statement follows.
Each data sample (xk) of the complex envelope of the received hop of the
SFH signal is described by the following equation: xk= P + nr+jni (eq. 4) where P is the average amplitude of the received data sample and nr ,n are the real and imaginary components of the interference. Both nr,ni are independent, zero mean normal variables, with equal variance on2 (i.e. they can be modeled as white, Gaussian noise). However, these following derivations can be easily extended by one skilled in the art to non-Gaussian noise.The actual C/I power ratio can be described as:
When a BPSK modulated SFH signal is used in the communication system, the derivation of the proof that the estimated C/I power ratio (v) of (eq. 1) is a monotonous function of the actual C/I power ratio continues as follows.
zk = xk2 = (P + nr + jni)2 = (P + nr)2 - ni2 + j2(P + nr)ni (eq. 6)
where Zk represents a single phase modulation cancelled data sample where the data sample (xk) is represented as a complex number having a real and an imaginary portion and (eq. 4) was substituted into (eq.
6) for xk.
In addition, in the equation (eq. 1), Ave(Re(z)) is the average of the real portion of z over the hop. More precisely,
Ave{Re{z}} = (P + nr)2 - ni2
= p2 + 2Pnr + nr2 - nj2 = P2 + 0 + #n2 - #n2 = P2 (eq. 7) where the real portion of Zk as defined in (eq. 6) was substituted in (eq. 7) and, in accordance with the definition of Gaussian noise model given above and the definition of the nth central moment of a Gaussian random variable, the average of nr and ni (i.e., nr and ni) ) each go to zero over the hop and average of nr2 and ni2 (i.e., nr2 and ni2) each go to #n2.
In addition, in the equation (eq. 1), |zk|2 is the square of the absolute value of zk. More precisely, 2
|zk|2 = [(P + nr )2 - ni2]2 + [2(P + nr )nij = (P + nr)4 - 2(P + nr)2ni2 + ni4 + 4(P + nr)2ni2
= (P + nr )4 + 2(P + nr)2ni2 + nj4 = (P4 + 4P3nr + 6P2nr2 + 4Pnr3 + nr4)
+ (2P2n12 + 2Pnrnj2 + 2nr 2ni2 + nj4 (eq. 8) where the definition of zk from (eq. 6) was substituted in (eq. 8).
In addition1 in the equation (eq. 1), Ave{|z|2} is the average of the square of the magnitude of the real and imaginary portions of z over the hop.
More precisely,
Ave{|z|2} = P4 + 4P3nr + 6P2nr2 + 4Pnr3 + nr4
+ 2P2ni2 + 2Pnrni2 + 2nr2ni2 + nj4 = P4 + 0 + 6P2#n2 + 0 + 3#n4 + 2P2#n2 + 0 + 2#n4 + 3#n4 = P4 + 8P2#n2 + 8#n4 (eq. 9) where the square of the absolute value of Zk as defined in (eq. 8) was substituted in (eq. 9). In addition, in accordance with the definition of
Gaussian noise model given above and the definition of the nth central moment of a Gaussian random variable, the average of an odd power of nr and ni (i.e., nr and ni ) each go to zero over the hop and average of an even power n of nr and ni (i.e., nr and ni) each go to a factor defined as: nrn = nin = 1.3.5.(n-1).#nn (eq. 10) such that nr2 = ni2 = #n2 and nr4 = ni4 = 3#n4.
Thus, (eq. 5), (eq. 7) and (eq. 9) can be substituted into (eq. 1) as follows to derive an expression of the estimate of the power ratio (#) in terms of actual C/I power ratio:
P4 P4
= P4 + 8P2#n2 + 8#n4 - P4 = 8P2#n2 + 8P2#n2+8#n4 (C/I)2 = 8(C/1) + 8 (eq. 11) which is a monotonic function of C/I since the derivative of the estimate ('P) with respect to the actual C/I is greater than zero for all real and positive values of C/I.More precisely, ## # (C/l)2 8(C/l)2 + 16(C/l) > 0 (eq.12) #(C/l) = #(C/l) 8(C/l) + 8 [8(C/l) + 8]2
Thus, for a BPSK modulated SFH signal the estimated C/l power ratio (#) of (eq. 1) is a monotonous function of the actual C/I power ratio.
When a QPSK modulated SFH signal is used in the communication system, the derivation of the proof that the estimated C/I power ratio (v) of (eq. 1) is a monotonous function of the actual C/I power ratio continues as follows.
Zk = xk4 = (P + nr + jnj)4 =(P + nr)4 - 6(P + nr)2ni2 + ni4 + j4(P + nr)ni[(P + nr)2 - ni2] (eq. 13)
where Zi represents a single phase modulation cancelled data sample where the data sample (xk) is represented as a complex number having a real and an imaginary portion and (eq. 4) was substituted into (eq. 13) for xk.
In addition, in the equation (eq. 1), Ave(Re(z)) is the average of the real portion of z over the hop. More precisely,
Ave(Re(z)) = (P + nr)4 - 6(P + nr)2ni2 + nj4
= (P4 + 4P3nr + 6P2nr2 + 4Pnr3 + nr4
(6P2ni2 + 12nrni2 + 6nr2ni2) + ni4 = P4 + 0 + 6P2#n2) + 0 + 3#n2 - 6P2#n2 - 0 - 6#n4 + 3#n4 = P4 (eq. 14) where the real portion of zk as defined in (eq. 13) was substituted in (eq. 14) and, in accordance with the definition of Gaussian noise model given above and the definition of the nth central moment of a Gaussian random variable, the average of an odd power of nr and ni (i.e., nr and ni) ) each go to zero over the hop and average of an even power n of nr and ni (i.e., nr and ni) each go to a factor defined in (eq. 10) such that nr2 = nj2 = one and nt4 = =3#n4.
In addition, in the equation (eq. 1), |zk|2 is the square of the absolute value of Zk. More precisely,
|zk|2 = [(P + nr)4 - 6(P + nr)2ni2 + ni4]2
+ [4(P + nr)ni[(P + nr)2 - ni2I] = (P + nr)8 - 1 2(P + nr)6ni2 + 38(P + nr)4ni4 - 1 2(P + nr)2nj6 + ni8 + 16(P + nr)2ni2[(P + nr)4 - 2(P + nr)2nj2 + ni4]
= (P + nr)8 - 1 2(P + nr)6ni2 + 38(P + nr)4ni4 - 12(P + nr)2ni6 +
+ 1 6(P + nr)6ni2 - 32(P + nr)4ni4 + 1 6(P + nr)2ni6
= (P + nr)8 + 4(P + nr)6ni2 + 6(P + nr)4ni4 + 4(P + nr)2ni6 + ni8
= (P8 + 8P7nr + 28P6nr2 + 56P5nr3 + 70P4nr4 + 56P3nr5
+ 28P2nr6 + 8Pnr7 + nr8)
+ 4(P6 + 6P5nr + 15P4nr2 + 20P3nr3 + 15P2nr4
+ 6Pnr5 + nr6)ni2
+ 6(P4 + 4P3nr + 6P2nr2 + 4Pnr3 + nr4)ni4
+ 4(P2 + 2Pnr + nr2)ni6 + ni8 (eq. 15) where the definition of zk from (eq. 13) was substituted in (eq. 15).
In addition, in the equation (eq. 1), Ave{|z|2} is the average of the square of the magnitude of the real and imaginary portions of z over the hop.
More precisely,
Ave{|z|2} = (P8 + 8P7nr + 28P6nr2 + 56P5nr3 + 70P4nr4
+ 56P3n + 28P2nr6 + 8Pnr7 + nr8)
+ [4(P6 + 6P5nr + 15P4nr2 + 20P3nr3 + 15P2nr4
+ 6Pnr5 + nr6) ni2]
+(6(P4 + 4P3nr + 6P2nr2 + 4Pnr3 + nr4)ni4)
+ (4(P2 + 2Pnr + nr2)ni6) + ni8
The above expression can be simplified by eliminating the terms which go to zero (i.e. those terms having nr or ni raised to an odd power) results in the following expression::
=(P8 + 28P6nr2 + 70P4nr4 + 28P2nr6 + nr8 )
+ [ 4(P6 + 15P4nr2 + 15P2nr4 + nr6)ni2 ] + (6(P4 + 6P2nr2 + nr4)np
+ ( 4(P2 + nr2)ni6 ) + ni8
= ( P8 + 28P6nr2 + 70P4nr4 + 28P2nr6 + nr8 )
+ ( 4P6ni2 + 60P4nr2ni2 + 60P2nr4ni2 + 4nr6ni2 )
+ ( 6P4ni4 + 36P2nr2ni4 + 6nr4ni4 )
+ ( 4P2ni6 + 4nr2ni6 ) + ni8 = p8 + 28P6nr2 + 70P4nr4 + 28P2nr6 + flr8 + 4P6ni2 + 60P4nr2ni2 + 60P2nr4ni2 + 4nr6ni2
+ 6P4nj4 + 36P2nr2ni4 +
+ 4P2ni6 + 4nr2ni6 +
=P8 + 28P6#n2 + 210P4#n4 + 420P2#n6 + 105#n8 + 4P6#n2 + 60P4#n4 + 180P2#n6 + 60#n8 + 18P4#n4 +108P2#n6 +54#n8 + 60P2#n6 +60#n8 + 105#n8 =P8 + 32P6#n2 + 288P4#n4 + 768P2#n6 + 384#n8 (eq. 16) where the square of the absolute value of Zk as defined in (eq. 8) was substituted in (eq. 9).In addition,, in accordance with the definition of
Gaussian noise model given above and the definition of the nth central moment of a Gaussian random variable, the average of an odd power of nr and ni (i.e., nrn and nin ) each go to zero over the hop and average of an even power n of nor and ni (i.e., nrn and nin ) each go to a factor defined in (eq. 10) such that nr2 = ni2 = #n2, nr4 = ni4 = 3#n4, nr6 = ni6 = 15#n6, and nr8 = ni8 = 105#n8.
Thus, (eq. 5), (eq. 14) and (eq. 16) can be substituted into (eq. 1) as follows to derive an expression of the estimate of the power ratio (v) in terms of actual C/I power ratio:
P8 p8 + 32P8a2 + 288P4#n4 + 768P2on6 + 384#n8- p8 p8 =32P6#n2 + 288P4#n4 + 768P2#n6 + 384#n8 (C/1)4
32(C/1)3 + 288(C/1)2 + 768(C/I) + 384 (eq. 17) which is a monotonic function of C/I since the derivative of the estimate (#) with respect to the actual C/I is greater than zero for all real and positive values of C/I.More precisely, ## # (C/1)4 #(C/l) = #(C/l) 32(C/l)3 + 288(C/l)2 + 768(C/l) + 384
= 288(C/l)5 + 1536(C/l)4 + 1152(C/l)3 > 0 (eq. 18) (32(C/l)3 + 288(C/l)2 + 768 (C/l) + 384)
Thus, for a QPSK modulated SFH signal the estimated C/I power ratio (#) of (eq. 1) is a monotonous function of the actual C/I power ratio.
It will be appreciated by those skilled in the art that the above derivations can be extended to any nth phase shift keying modulated SFH signal to prove that the estimated C/I power ratio (?) of (eq. 1) is a monotonous function of the actual C/I power ratio for any nth phase shift keying modulated SFH signal.
Since this estimate of each hop's C/I power ratio (g) of (eq. 1) is a monotonous function of the actual C/I power ratio, this estimate of each hop's
C/I power ratio (#) may preferably be used to determine a level of confidence that a particular hop was detected properly by a receiving station.
The number of levels of confidence which may be determined can be varied depending on the particular use for the level of confidence. For example, two levels of confidence may be determined for use in a hard decision environment. The two levels of confidence include: (1) full confidence which corresponds to the estimated C/I power ratio being at or above a particular threshold and (2) no confidence which corresponds to the estimated C/I power ratio being below the particular threshold. In another example, several levels of confidence may be determined for use in a soft decision environment. These several levels of confidence correspond to increasing confidence as the estimated C/I power ratio increases in value.
A description of a preferred embodiment communication system, shown in FIG. 1, which incorporates the above mentioned optimizing principles for a data bit detection in a SFH signal follows. In the encoding portion 102 of the communication system, traffic channel data bits 100 are input to an encoder 102 at a particular bit rate. The input traffic channel data bits can include either voice converted to data by a vocoder, pure data, or a combination of the two types of data. Encoder 102 preferrably encodes the input data bits 100 into data symbols 104 at a fixed encoding rate with an encoding algorithm which facilitates subsequent maximum likelihood decoding of the data symbols into data bits (e.g. convolutional or block coding algorithms).
The data symbols 104 may optionally then be interleaved by the encoding portion 102. Typically, interleaving increases the output distance between the consecutively input non-interleaved data symbols. This interleaving of data symbols causes burst of errors to be spread out in time and thus to be handled by the data bit detector as if they were random errors. This interleaving thereby allows random-error-correcting coding (e.g.
convolutional coding) to be useful in a bursty noise communication channel (e.g. radio frequency communication channels). The interleaving preferably is limited to a predetermined size of the block of data symbols. The block size preferably is derived from the maximum number of data symbols, representing input data bits 100, which can be transmitted at a predetermined chip rate within a predetermined length transmission block.
Subsequently, the interleaved data symbols 104 are output from the encoding portion 102. It will be appreciated by those skilled in the art that several different variations of interleaving could be implemented without departing from the scope of the present invention. For example, several different techniques can be used to interleave the data symbols (e.g., convolutional or block interleaving). In addition, the size of the interleaving block could be altered to accommodate different transmission lengths or rates. Also, the dimensions of the matrix could be altered to increase or decrease the interleaved distance between consecutively input groups of data symbols.
The interleaved data symbols 104 are then input to a transmitting portion 106 of the communication system. It will be appreciated by those skilled in the art that additional coding of the data symbols 104 may be done in the transmitting portion 106 to enable multiple access by several users to the same communication channel. Such encoding may include coding which ensures orthogonality of an individual users encoded traffic channel bits from other users encoded traffic channel bits. However, this additional coding typically depends upon the specific implementation of the SFH communication system.Further, this additional coding typically will not interfere with the implementation of the teachings of the present invention as described herein as long as the additional encoding is done after the initial encoding and the additional decoding is done prior to the preferred embodiment data bit detection process. The interleaved data symbols 104 are prepared for transmission over a communication channel as a SFH signal by a modulator 106. Subsequently, the modulated sequence is provided to an antenna 110 for transmission overthe communication channel 112.
A receiving portion 114 of the communication system receives the transmitted SFH spread spectrum signal from over the communication channel 112 through antenna 116. Each hop of the received SFH signal preferably is sampled into data samples 120 by demodulator 118.
Subsequently, the data samples 120 are output to the detector 122 of the communication system.
If the encoder 102 of the communication has interleaved the data symbols, then the detector 122 deinterleaves the data samples by using a technique which is substantially inverse to the interleaving technique used in the encoder 102. After, if necessary, such deinterleaving, the detector 122 of the communication system inputs the data samples 120 into a an estimator 124 which preferrably generates an estimate of the C/I power ratio (w) 126 for each hop in accordance with the algorithm described above as (eq. 1) and reproduced below:
The symbol z preferrably represents the phase modulation cancelled forms of the data samples of a hop of the SFH signal. The data samples preferrably are samples of the complex envelope of the hop where the hop has been modulated by nth phase shift keying.Cancellation of nth phase shift keying modulation of the hop of the slow frequency hopping spread spectrum signal preferrably is accomplished by raising the complex envelope of the hop to the nth power. As a result, z represents the phase modulation cancelled forms of the data samples which comprise samples of the complex envelope of the hop raised to the nth power for the nth phase shift keying modulated hop of the slow frequency hopping spread spectrum signal. It will be appreciated by those skilled in the art that any monotonically related form of the estimate of the C/I power ratio (v) may be used without departing from the scope of the present invention.
The detector 122 of the communication system also inputs the data samples 120 into the detecting portion 128 which detects data bits 130 in the data samples 128 of each particular hop by using the estimated C/I power ratio 126 for that particular hop which was generated by the estimator 124.
The preferred embodiment described in reference to FIG. 1 may be further extended into a more specific use in the detection process of the C/I power ratio estimate 126 to the decoding process as shown in FIG. 2. In
FIG. 2, the detector 122 input the data samples 120 associated with each hop into a decision metric generator 132 of the detecting portion 128. The decision metric generator 132 uses the input data samples 120 to generate decision metrics 134 associated with each hop which correspond to a distance of an input data sample from a constellation point within a constellation space representing previously input data samples 120. These decision metrics 134 correspond to possible transitions within a maximum likelihood decoding trellis which decoder 140 will subsequently be determining.
The estimator 124 inputs the estimate of the C/I power ratio (v) 126 associated with each hop into the detecting portion 128. The detecting portion 128 provides the C/I power ratio estimates (?) 126 to a confidence measure generator 136. The confidence measure generator 136 also receives the decision metrics 134 associated with each hop from the decision metric generator. The confidence measure generator 136 uses the
C/I power ratio estimate ('P) 126 associated with a particular hop to determine a level of confidence 138 in the accuracy of the decision metrics 134 associated with the particular hop (i.e., accurately or actually relate to the transmitted encoded data bits 100).For example, if the C/I power ratio estimate (g) 126 for the hop is below a predetermined threshold, then the probability that the data samples 120 of that hop actually represent the transmitted encoded data bits 100 is low. As a result the decision metrics 134 are probably not actually related to the transmitted encoded data bits 100, because the data samples 120 of the hop probably do not correspond to the transmitted encoded data bits 100.
The number of different levels of confidence 138 which may be determined for a particular hop can be varied depending on the particular use for the level of confidence 138. For example, two levels of confidence in the decision metrics 134 of each hop may be determined for use in a hard decision environment. The two levels of confidence include: (1) full confidence which corresponds to the estimated C/I power ratio being at or above a particular threshold and (2) no confidence which corresponds to the estimated C/I power ratio being below the particular threshold. In response to a full confidence measure 138, the associated decision metrics 134 for the hop would be used by the decoder 140. However, in response to a no confidence measure 138, the associated decision metrics 134 for the hop would not be used by the decoder 140.In another example, several levels of confidence in the decision metrics 134 of each hop may be determined for use in a soft decision environment. These several levels of confidence correspond to increasing confidence as the estimated C/I power ratio 138 increases in value. In response to the increasing level of confidence measure 138, the associated decision metrics 134 for the hop would be given greater weight by decoder 140. Such a weighting system of the decision metrics 134 by a decoder 140 is often termed using side information about the decision metrics 134.
The decoder 140 preferably generates estimated data bits 130 by utilizing maximum likelihood decoding techniques to derive the estimated traffic channel data bits 130 from the decision metrics 134 of each hop and the associated confidence measures 138 which are input to the decoder 140. When the traffic channel data bits 100 have been convolutionally encoded, the maximum likelihood decoding techniques which are used may based upon the Viterbi decoding algorithm.
The preferred embodiment described in reference to FIG. 1 may be further extended into a more specific use in the detection process of the C/I power ratio estimate 126 to the diversity combining process as shown in
FIG. 3. In FIG. 3, the receiving portion 114 of the communication system.
receives the transmitted SFH spread spectrum signal from over the communication channel 112 through antenna structure 116. The antenna structure 116 preferrably includes at least a first receiving antenna 142 and a second receiving antenna 144. The first receiving antenna 142 is preferrably geographically displaced from the second receiving antenna 144 such that a diversity antenna structure is formed. Each hop of the SFH signal as received by the first and second antennae 142 and 144 is preferrably input to the demodulator 118. Demodulator 118 includes a first and second receiver branch 146 and 148, respectively. The first receiver branch 146 is coupled to the first antenna 142 in order to demodulate and sample each hop of the SFH signal 122 received by the first antenna 142 into a first data sample set 150.Similarly, the second receiver branch 148 is coupled to the second antenna 144 in order to demodulate and sample each hop of the
SFH signal 122 received by the second antenna 144 into a second data sample set 152. Subsequently, the sets of data samples 150 and 152 (collectively described as data samples 120) are output to the detector 122 of the communication system. The data samples 120 may preferrably be coupled to detector 122 on a data bus having each of the data sample sets 150 and 152 thereon or by a set of individual data signal couplers for each data samples set 150 and 152.
The detector 122 of the communication system inputs the sets of data samples 120 into an estimator 124 which preferrably generates a first and a second estimate of the C/I power ratio (g) 158 and 160 (collectively described as C/I power ratio estimate 126) for each hop corresponding to the first and second set of data samples 150 and 152, respectively, in accordance with the algorithm described above as (eq. 1). These C/I power ratio estimates 126 are output to the detecting portion 128.
Similarly, the detector 122 of the communication system inputs the sets of data samples 120 (i.e. first and second sets 150 and 152, respectively) into the detecting portion 128. The detecting portion provides the first and second data sample sets 150 and 152 to a diversity combiner 154. The diversity combiner 154 combines the first and second sets of data samples 150 and 152, respectively, into a single combined set of data samples 156. The diversity combining is accomplished by using weighting coefficients for the first and second sets of input data samples 150 and 152 of each hop which are derived from the associated first and second C/I power ratio estimate 158 and 160 input.
The diversity combiner 154 uses the first and second C/I power ratio estimate (?) 158 and 160, respectively, associated with a particular hop to determine a level of confidence in the accuracy of the reception of the first and second set of data samples 150 and 152, respectively associated with the particular hop by the receiving portion 114. For example, if the first C/I power ratio estimate (v) 158 for the hop is below a predetermined threshold, then the probability that the first set of data samples 150 of that hop actually represent the transmitted encoded data bits 100 is nominal.
The number of different levels of confidence in the accuracy of reception which may be determined for a particular hop can be varied depending on the particular use for the level of confidence. For example, two levels of confidence of each hop may be determined for use in a hard decision environment. The two levels of confidence include: (1) full confidence which corresponds to the estimated C/I power ratio being at or above a particular threshold and (2) no confidence which corresponds to the estimated C/I power ratio being below the particular threshold. In response to a full confidence measure, the associated set of data samples for the hop would be used by the diversity combiner 154 in generating the single combined set of data samples 156 for the hop.However, in response to a no confidence measure, the associated set of data samples for the hop would not be used by the diversity combiner 154 in generating the single combined set of data samples 156 for the hop. In another example, several levels of confidence in the accuracy of reception of each hop may be determined for use in a soft decision environment. These several levels of confidence correspond to increasing confidence as the estimated C/I power ratio 126 increases in value. In response to the increasing level of confidence, the associated set of data samples for the hop would be assigned greater weighting coefficients by the diversity combiner 154. It will be appreciated by those skilled in the art that these diversity combining techniques can be extended to combining a plurality of sets of data samples received on a corresponding plurality of receiver branches.
Subsequently, single combined set of data samples 156 preferrably is used by the detecting portion 128 to detect data bits 130 in the data samples. Such detection may be accomplished by using a decoding technique similar to the one described above in reference to FIG. 2.
However, other types of detection of data bits in the combined set of data samples 156 could be used without departing from the spirit and scope of preferred embodiment diversity combining invention as claimed.
Although the invention has been described and illustrated with a certain degree of particularity, it is understood that the present disclosure of embodiments has been made by way of example only and that numerous changes in the arrangement and combination of parts as well as steps may be resorted to by those skilled in the art without departing from the spirit and scope of the invention as claimed. For example, the modulator, antennas and demodulator portions of the preferred embodiment communication system as described were directed to CDMA spread spectrum signals transmitted over a radio communication channel. However, as will be understood by those skilled in the art, the communication channel could alternatively be an electronic data bus, wireline, optical fiber link, or any other type of communication channel.
Claims (10)
- ClaimsWhat is claimed is: 1. An apparatus comprising a detector, the detector having detecting means for detecting data bits in input data samples of a hop of a slow frequency hopping spead spectrum signal, the improvement is characterized by: (a) the detector having estimator means, operatively coupled to the detector means, for estimating the carrier to interference power ratio of the hop of the slow frequency hopping signal by using the input data samples of the hop; and (b) the detecting means using the estimated carrier to interference power ratio to detect data bits in the input data samples of the hop of the slow frequency hopping signal.
- 2. The apparatus of claim 1 wherein the detector estimator means comprises means for computing the estimated carrier to interference power ratio with a metric at least comprising a monotonically related function (r) defined as follows:where, z = phase cancelled forms of the input data samples wherein the input data samples represent the complex envelope of an nth phase shift keying modulated hop of the slow frequency hopping spread spectrum signal Avee(Re(z)) = the square of the average of the real portion of z over the hop Ave{lzl2} = the average of the square of the magnitude of the complex valued z over the hop.
- 3. The apparatus of claim 2 wherein cancellation of nth phase shift keying modulation of the hop of the slow frequency hopping spread spectrum signal includes raising the complex envelope of the hop to the nth power whereby z represents the phase cancelled forms of the input data samples which comprise data samples of the complex envelope of the hop raised to the nth power for the nth phase shift keying modulated hop of the slow frequency hopping spread spectrum signal.
- 4. The apparatus of claim 1 wherein the detector detecting means comprises: (a) means for generating decision metrics from the input data samples of the hop, each decision metric corresponding to a distance of an input data sample from a constellation point within a constellation space representing previously input data samples; (b) means for generating a measure of confidence of the accuracy of the decision metrics based upon the estimated carrier to interference power ratio of the hop; and (c) decoding means for generating an estimated data bit by utilizing maximum likelihood decoding techniques to derive a data bit from the decision metrics and the accuracy measure of confidence of the decision metrics.
- 5. The apparatus of claim 1 wherein: (a) the input data samples of the hop of the slow frequency hopping spread spectrum signal comprise a plurality of sets of input data samples of the hop, each set corresponding to input data samples of the hop as received from one of a plurality of diversity receiver branches;; (b) the estimator means comprises means for estimating a carrier to interference power ratio of the hop of the slow frequency hopping signal associated with each particular set of input data samples by using the particular set of input data samples of the hop, and (c) the detector detecting means comprises diversity combining means for combining the plurality of sets of input data samples into a set of input data samples in accordance with weighting coefficients for each particular set of input data samples derived from the estimated carrier to interference power ratio associated with the particular set of input data samples.
- 6. The apparatus of claim 1 further comprising: (a) receiving means for receiving a slow frequency hopping spread spectrum signal from over a communication channel; and (b) sampling means, operatively coupled to the receiving means and the detector, for sampling a hop of the received slow frequency hopping spread spectrum signal into data samples and inputting the data samples of the hop of the received slow frequency hopping spread spectrum signal to the detector.
- 7. The apparatus of claim 1 further comprising: (a) encoding means for encoding input data bits into data symbols with an encoding algorithm which facilitates subsequent detection of data bits in samples of the data symbols; (b) a transmitting means, operatively coupled to the encoding means, for transmitting the data symbols over a communication channel as a slow frequency hopping spread spectrum signal; (c) receiving means for receiving the slow frequency hopping spread spectrum signal from over the communication channel; and (d) sampling means, operatively coupled to the receiving means and the detector, for sampling a hop of the received slow frequency hopping spread spectrum signal into data samples and inputting the data samples of the hop of the received slow frequency hopping spread spectrum signal to the detector.
- 8. A method of communicating with slow frequency hopping spread spectrum signals including recovering data bits from data samples of a hop of a slow frequency hopping spread spectrum signal, the recovering steps comprising detecting data bits in the data samples of the hop of the slow frequency hopping signal, the improvement is characterized by: (a) estimating the carrier to interference power ratio of the hop of the slow frequency hopping signal by using the data samples of the hop; and (b) the detecting step using the estimated carrier to interference power ratio to detect data bits in the data samples of the hop of the slow frequency hopping signal.
- 9. The method of claim 8 wherein the recovering step of estimating comprises computing the estimated canier to interference power ratio with a metric at least comprising a monotonically related function (ivy) defined as follows:where, z = phase cancelled forms of the input data samples wherein the phase cancelled forms of the input data samples are derived by raising the complex envelope of the hop to the nth power whereby z represents the phase cancelled forms of the input data samples which comprise data samples of the complex envelope of the hop raised to the nth power for the nth phase shift keying modulated hop of the slow frequency hopping spread spectrum signal Ave2(Re(z)) = the square of the average of the real portion of z over the hop Ave(izl2) = the average of the square of the magnitude of the complex valued z over the hop.
- 10. The method of claim 8 wherein: (a) the data samples of the hop of the slow frequency hopping spread spectrum signal comprise a plurality of sets of data samples of the hop, each set corresponding to data samples of the hop as received from one of a plurality of diversity receiver branches; (b) the recovering step of estimating comprises estimating a carrier to interference power ratio of the hop of the slow frequency hopping signal associated with each particular set of data samples by using the particular set of data samples of the hop; and (c) the recovering step of detecting comprises diversity combining the plurality of sets of data samples into a set of data samples in accordance with weighting coefficients for each particular set of data samples derived from the estimated carrier to interference power ratio associated with the particular set of data samples.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IL10002991A IL100029A (en) | 1991-11-11 | 1991-11-11 | Method and apparatus for improving detection of data bits in a slow frequency hopping communication system |
US07794104 US5193102B1 (en) | 1991-11-11 | 1991-11-18 | Method and apparatus for improving detection of data bits in a slow frequency hopping communication system |
Publications (3)
Publication Number | Publication Date |
---|---|
GB9222170D0 GB9222170D0 (en) | 1992-12-02 |
GB2261347A true GB2261347A (en) | 1993-05-12 |
GB2261347B GB2261347B (en) | 1994-05-04 |
Family
ID=26322353
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB9222170A Expired - Lifetime GB2261347B (en) | 1991-11-11 | 1992-10-22 | Method and apparatus for improving detection of data bits in an hopping communication system |
Country Status (4)
Country | Link |
---|---|
AU (1) | AU651298B2 (en) |
GB (1) | GB2261347B (en) |
HK (1) | HK1000230A1 (en) |
MX (1) | MX9206485A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9107000B2 (en) | 2001-12-21 | 2015-08-11 | One-E-Way, Inc. | Wireless digital audio music system |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2185367A (en) * | 1985-12-11 | 1987-07-15 | Nippon Telegraph & Telephone | Method for decoding error correcting block codes |
GB2191912A (en) * | 1985-04-29 | 1987-12-23 | Signal Processors Ltd | Data decoding |
-
1992
- 1992-10-16 AU AU27107/92A patent/AU651298B2/en not_active Expired
- 1992-10-22 GB GB9222170A patent/GB2261347B/en not_active Expired - Lifetime
- 1992-11-11 MX MX9206485A patent/MX9206485A/en not_active Application Discontinuation
-
1997
- 1997-09-10 HK HK97101755A patent/HK1000230A1/en not_active IP Right Cessation
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2191912A (en) * | 1985-04-29 | 1987-12-23 | Signal Processors Ltd | Data decoding |
GB2185367A (en) * | 1985-12-11 | 1987-07-15 | Nippon Telegraph & Telephone | Method for decoding error correcting block codes |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9107000B2 (en) | 2001-12-21 | 2015-08-11 | One-E-Way, Inc. | Wireless digital audio music system |
Also Published As
Publication number | Publication date |
---|---|
GB2261347B (en) | 1994-05-04 |
GB9222170D0 (en) | 1992-12-02 |
AU2710792A (en) | 1993-05-13 |
MX9206485A (en) | 1993-07-01 |
AU651298B2 (en) | 1994-07-14 |
HK1000230A1 (en) | 1998-02-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5193102A (en) | Method and apparatus for improving detection of data bits in a slow frequency hopping communication system | |
US5204874A (en) | Method and apparatus for using orthogonal coding in a communication system | |
US5159608A (en) | Method and apparatus for using orthogonal coding in a communication system | |
US6731668B2 (en) | Method and system for increased bandwidth efficiency in multiple input—multiple output channels | |
US7035316B2 (en) | Method and apparatus for adaptive linear equalization for Walsh covered modulation | |
US5224122A (en) | Method and apparatus for canceling spread-spectrum noise | |
JP4307553B2 (en) | High data rate CDMA wireless communication system | |
CN1080959C (en) | Method and apparatus for power estimation in a communication system | |
JP3464002B2 (en) | Coherent communication method and apparatus in spread spectrum communication system | |
US5862190A (en) | Method and apparatus for decoding an encoded signal | |
US20080219211A1 (en) | Frequency Domain Direct Sequence Spread Spectrum with Flexible Time Frequency Code | |
US6587517B1 (en) | Multi-stage receiver | |
JP2007524267A (en) | Parallel spread spectrum communication system and method | |
KR19990023557A (en) | Communication method, transceiver, cellular wireless communication system | |
US20090262700A1 (en) | Frequency domain direct sequence spread spectrum with flexible time frequency code | |
AU651298B2 (en) | Method and apparatus for improving detection of data bits in a slow frequency hopping communication system | |
Prashanth | Analysis of FHSS-CDMA with QAM-64 over AWGN and Fading Channels | |
Jayasanthi et al. | Frequency Hop Spread Spectrum employing Frequency and Quadrature Amplitude Modulation | |
IL104640A (en) | Method and apparatus for using orthogonal coding in a communication system | |
CN118233888A (en) | Wireless physical layer key generation method and system based on deep learning in 5G environment | |
Wittke et al. | The performance of coded hopped multilevel DPSK on a fading mobile satellite channel with interference |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
732E | Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977) |
Free format text: REGISTERED BETWEEN 20110120 AND 20110126 |
|
PE20 | Patent expired after termination of 20 years |
Expiry date: 20121021 |