Multi-mode transmitter for highly-spectrally-efficient communications

Description

INCORPORATION BY REFERENCE

This patent application also makes reference to:

U.S. Pat. No. 8,582,637, titled “Low-Complexity, Highly-Spectrally-Efficient Communications,” and filed on Jan. 31, 2013; and
U.S. patent application Ser. No. 13/756,010, titled “Multi-Mode Receiver for Highly-Spectrally-Efficient Communications,” and filed on Jan. 31, 2013.

Each of the above stated applications is hereby incorporated herein by reference in its entirety.

TECHNICAL FIELD

Aspects of the present application relate to electronic communications.

BACKGROUND

Existing communications methods and systems are overly power hungry and/or spectrally inefficient. Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such approaches with some aspects of the present method and system set forth in the remainder of this disclosure with reference to the drawings.

BRIEF SUMMARY

Methods and systems are provided for low-complexity, highly-spectrally efficient communications, substantially as illustrated by and/or described in connection with at least one of the figures, as set forth more completely in the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is a block diagram depicting an example system configured for low-complexity, highly-spectrally-efficient communications.

FIG. 1B is a block diagram illustrating a multi-mode transmitter operable to support low-complexity, highly-spectrally-efficient communications.

FIG. 1C is a block diagram illustrating a multi-mode receiver operable to support low-complexity, highly-spectrally-efficient communications.

FIG. 2 is a block diagram depicting an example equalization and sequence estimation circuit for use in a system configured for low-complexity, highly-spectrally-efficient communications.

FIG. 3 is a block diagram depicting an example sequence estimation circuit for use in a system configured for low-complexity, highly-spectrally-efficient communications.

FIG. 4 is a block diagram depicting an example metric calculation circuit for use in a system configured for low-complexity, highly-spectrally-efficient communications.

FIGS. 5A-5D depict portions of an example sequence estimation process performed by a system configured for low-complexity, highly-spectrally-efficient communications.

FIGS. 6A and 6B depict an example survivor selection process that is an alternative to the process depicted in FIG. 5D.

FIG. 7 is a diagram illustrating initialization of the sequence estimation process.

FIG. 8A depicts an example implementation of the phase buffer shown in FIG. 3.

FIG. 8B depicts an example implementation of the symbol buffer shown in FIG. 3.

FIG. 8C depicts contents of an example symbol buffer over a plurality of iterations of a sequence estimation process.

FIG. 8D depicts generated signals corresponding to the symbol buffer contents shown in FIG. 8C.

FIG. 9 is a flowchart illustrating dynamic configuration of a multi-mode transmitter.

FIG. 10 compares between Symbol Error Rate (SER) vs. SNR of the receiver configured into mode 1 of table 2 and configured into mode 2 of table 2.

DETAILED DESCRIPTION

As utilized herein the terms “circuits” and “circuitry” refer to physical electronic components (i.e. hardware) and any software and/or firmware (“code”) which may configure the hardware, be executed by the hardware, and or otherwise be associated with the hardware. As used herein, for example, a particular processor and memory may comprise a first “circuit” when executing a first one or more lines of code and may comprise a second “circuit” when executing a second one or more lines of code. As utilized herein, “and/or” means any one or more of the items in the list joined by “and/or”. As an example, “x and/or y” means any element of the three-element set {(x), (y), (x, y)}. As another example, “x, y, and/or z” means any element of the seven-element set {(x), (y), (z), (x, y), (x, z), (y, z), (x, y, z)}. As utilized herein, the term “exemplary” means serving as a non-limiting example, instance, or illustration. As utilized herein, the terms “e.g.,” and “for example” set off lists of one or more non-limiting examples, instances, or illustrations. As utilized herein, circuitry is “operable” to perform a function whenever the circuitry comprises the necessary hardware and code (if any is necessary) to perform the function, regardless of whether performance of the function is disabled, or not enabled, by some user-configurable setting.

FIG. 1A is a block diagram depicting an example system configured for low-complexity, highly-spectrally-efficient communications. The system 100 comprises a mapper circuit 102, a pulse shaping filter circuit 104, a timing pilot insertion circuit 105, a transmitter front-end circuit 106, a channel 107, a receiver front-end 108, a filter circuit 109, a timing pilot removal circuit 110, an equalization and sequence estimation circuit 112, and a de-mapping circuit 114. The components 102, 104, 105, and 106 may be part of a transmitter (e.g., a base station or access point, a router, a gateway, a mobile device, a server, a computer, a computer peripheral device, a table, a modem, a set-top box, etc.), the components 108, 109, 110, 112, and 114 may be part of a receiver (e.g., a base station or access point, a router, a gateway, a mobile device, a server, a computer, a computer peripheral device, a table, a modem, a set-top box, etc.), and the transmitter and receiver may communicate via the channel 107.

The mapper 102 may be operable to map bits of the Tx_bitstream to be transmitted to symbols according to a selected modulation scheme. The symbols may be output via signal 103. For example, for an quadrature amplitude modulation scheme having a symbol alphabet of N (N-QAM), the mapper may map each Log₂(N) bits of the Tx_bitstream to single symbol represented as a complex number and/or as in-phase (I) and quadrature-phase (Q) components. Although N-QAM is used for illustration in this disclosure, aspects of this disclosure are applicable to any modulation scheme (e.g., amplitude shift keying (ASK), phase shift keying (PSK), frequency shift keying (FSK), etc.). Additionally, points of the N-QAM constellation may be regularly spaced (“on-grid”) or irregularly spaced (“off-grid”). Furthermore, the symbol constellation used by the mapper may be optimized for best bit-error rate performance that is related to log-likelihood ratio (LLR) and to optimizing mean mutual information bit (MMIB). The Tx_bitstream may, for example, be the result of bits of data passing through a forward error correction (FEC) encoder and/or an interleaver. Additionally, or alternatively, the symbols out of the mapper 102 may pass through an interleaver.

The pulse shaper 104 may be operable to adjust the waveform of the signal 103 such that the waveform of the resulting signal 113 complies with the spectral requirements of the channel over which the signal 113 is to be transmitted. The spectral requirements may be referred to as the “spectral mask” and may be established by a regulatory body (e.g., the Federal Communications Commission in the United States or the European Telecommunications Standards Institute) and/or a standards body (e.g., Third Generation Partnership Project) that governs the communication channel(s) and/or standard(s) in use. The pulse shaper 104 may comprise, for example, an infinite impulse response (IIR) and/or a finite impulse response (FIR) filter. The number of taps, or “length,” of the pulse shaper 104 is denoted herein as LTx, which is an integer. The impulse response of the pulse shaper 104 is denoted herein as hTx. The pulse shaper 104 may be configured such that its output signal 113 intentionally has a substantial amount of inter-symbol interference (ISI). Accordingly, the pulse shaper 104 may be referred to as a partial response pulse shaping filter, and the signal 113 may be referred to as a partial response signal or as residing in the partial response domain, whereas the signal 103 may be referred to as residing in the symbol domain. The number of taps and/or the values of the tap coefficients of the pulse shaper 104 may be designed such that the pulse shaper 104 is intentionally non-optimal for additive white Gaussian noise (AWGN) in order to improve tolerance of non-linearity in the signal path. In this regard, the pulse shaper 104 may offer superior performance in the presence of non-linearity as compared to, for example, a conventional near zero positive ISI pulse shaping filter (e.g., root raised cosine (RRC) pulse shaping filter). The pulse shaper 104 may be designed as described in one or more of: the United States patent application titled “Design and Optimization of Partial Response Pulse Shape Filter,” the United States patent application titled “Constellation Map Optimization For Highly Spectrally Efficient Communications,” and the United States patent application titled “Dynamic Filter Adjustment For Highly-Spectrally-Efficient Communications,” each of which is incorporated herein by reference, as set forth above.

It should be noted that a partial response signal (or signals in the “partial response domain”) is just one example of a type of signal for which there is correlation among symbols of the signal (referred to herein as “inter-symbol-correlated (ISC) signals”). Such ISC signals are in contrast to zero (or near-zero) ISI signals generated by, for example, raised-cosine (RC) or root-raised-cosine (RRC) filtering. For simplicity of illustration, this disclosure focuses on partial response signals generated via partial response filtering. Nevertheless, aspects of this disclosure are applicable to other ISC signals such as, for example, signals generated via matrix multiplication (e.g., lattice coding), and signals generated via decimation below the Nyquist frequency.

The timing pilot insertion circuit 105 may insert a pilot signal which may be utilized by the receiver for timing synchronization. The output signal 115 of the timing pilot insertion circuit 105 may thus comprise the signal 113 plus an inserted pilot signal (e.g., a sine wave at ¼×fbaud, where fbaud is the symbol rate). An example implementation of the pilot insertion circuit 105 is described in the United States patent application titled “Timing Synchronization for Reception of Highly-Spectrally-Efficient Communications,” which is incorporated herein by reference, as set forth above.

The transmitter front-end 106 may be operable to amplify and/or upconvert the signal 115 to generate the signal 116. Thus, the transmitter front-end 106 may comprise, for example, a power amplifier and/or a mixer. The front-end may introduce non-linear distortion and/or phase noise (and/or other non-idealities) to the signal 116. The non-linearity of the circuit 106 may be represented as FnlTx which may be, for example, a polynomial, or an exponential (e.g., Rapp model). The non-linearity may incorporate memory (e.g., Voltera series).

The channel 107 may comprise a wired, wireless, and/or optical communication medium. The signal 116 may propagate through the channel 107 and arrive at the receive front-end 108 as signal 118. Signal 118 may be noisier than signal 116 (e.g., as a result of thermal noise in the channel) and may have higher or different ISI than signal 116 (e.g., as a result of multi-path).

The receiver front-end 108 may be operable to amplify and/or downconvert the signal 118 to generate the signal 119. Thus, the receiver front-end may comprise, for example, a low-noise amplifier and/or a mixer. The receiver front-end may introduce non-linear distortion and/or phase noise to the signal 119. The non-linearity of the circuit 108 may be represented as FnlRx which may be, for example, a polynomial, or an exponential (e.g., Rapp model). The non-linearity may incorporate memory (e.g., Voltera series).

The timing pilot recovery and removal circuit 110 may be operable to lock to the timing pilot signal inserted by the pilot insertion circuit 105 in order to recover the symbol timing of the received signal. The output 122 may thus comprise the signal 120 minus (i.e., without) the timing pilot signal. An example implementation of the timing pilot recovery and removal circuit 110 is described in the United States patent application titled “Timing Synchronization for Reception of Highly-Spectrally-Efficient Communications,” which is incorporated herein by reference, as set forth above.

The input filter 109 may be operable to adjust the waveform of the partial response signal 119 to generate partial response signal 120. The input filter 109 may comprise, for example, an infinite impulse response (IIR) and/or a finite impulse response (FIR) filter. The number of taps, or “length,” of the input filter 109 is denoted herein as LRx, an integer. The impulse response of the input filter 109 is denoted herein as hRx. The number of taps, and/or tap coefficients of the input filter 109 may be configured based on: a non-linearity model, custom character , signal-to-noise ratio (SNR) of signal 120, the number of taps and/or tap coefficients of the Tx partial response filter 104, and/or other parameters. The number of taps and/or the values of the tap coefficients of the input filter 109 may be configured such that noise rejection is intentionally compromised (relative to a perfect match filter) in order to improve performance in the presence of non-linearity. As a result, the input filter 109 may offer superior performance in the presence of non-linearity as compared to, for example, a conventional near zero positive ISI matching filter (e.g., root raised cosine (RRC) matched filter). The input filter 109 may be designed as described in one or more of: the United States patent application titled “Design and Optimization of Partial Response Pulse Shape Filter,” the United States patent application titled “Constellation Map Optimization For Highly Spectrally Efficient Communications,” and the United States patent application titled “Dynamic Filter Adjustment For Highly-Spectrally-Efficient Communications,” each of which is incorporated herein by reference, as set forth above.

As utilized herein, the “total partial response (h)” may be equal to the convolution of hTx and hRx, and, thus, the “total partial response length (L)” may be equal to LTx+LRx−1. L may, however, be chosen to be less than LTx+LRx−1 where, for example, one or more taps of the Tx pulse shaper 104 and/or the Rx input filter 109 are below a determined level. Reducing L may reduce decoding complexity of the sequence estimation. This tradeoff may be optimized during the design of the system 100.

The equalizer and sequence estimator 112 may be operable to perform an equalization process and a sequence estimation process. Details of an example implementation of the equalizer and sequence estimator 112 are described below with respect to FIG. 2. The output signal 132 of the equalizer and sequence estimator 112 may be in the symbol domain and may carry estimated values of corresponding transmitted symbols (and/or estimated values of the corresponding transmitted information bits of the Tx_bitstream) of signal 103. Although not depicted, the signal 132 may pass through an interleaver en route to the de-mapper 114. The estimated values may comprise soft-decision estimates, hard-decision estimates, or both.

The de-mapper 114 may be operable to map symbols to bit sequences according to a selected modulation scheme. For example, for an N-QAM modulation scheme, the mapper may map each symbol to Log₂(N) bits of the Rx_bitstream. The Rx_bitstream may, for example, be output to a de-interleaver and/or an FEC decoder. Alternatively, or additionally, the de-mapper 114 may generate a soft output for each bit, referred as LLR (Log-Likelihood Ratio). The soft output bits may be used by a soft-decoding forward error corrector (e.g. a low-density parity check (LDPC) dedecoder). The soft output bits may be generated using, for example, a Soft Output Viterbi Algorithm (SOVA) or similar. Such algorithms may use additional information of the sequence decoding process including metrics levels of dropped paths and/or estimated bit probabilities for generating the LLR, where

$LLR (b) = \log (\frac{P_{b}}{1 - P_{b}}),$

where P_bis the probability that bit b=1.

In an example implementation, components of the system upstream of the pulse shaper 104 in the transmitter and downstream of the equalizer and sequence estimator 112 in the receiver may be as found in a conventional N-QAM system. Thus, through modification of the transmit side physical layer and the receive side physical layer, aspects of the invention may be implemented in an otherwise conventional N-QAM system in order to improve performance of the system in the presence of non-linearity as compared, for example, to use of RRC filters and an N-QAM slicer.

FIG. 1B is a block diagram illustrating a multi-mode transmitter operable to support low-complexity, highly-spectrally-efficient communications. Shown in FIG. 1B, are a forward error correction (FEC) encoder 156, the mapper 102, an inter-symbol correlation (ISC) generation circuit 158, the timing pilot insertion circuit 105, the transmitter front-end circuit 106, a clock signal generation circuit 152, and a control circuit 154.

The clock signal generation circuit 152 may comprise, for example, one or more oscillators (e.g., a crystal oscillator) and one or more phase locked loops (PLLs) for generating a clock signal 156 whose frequency determines the rate at which symbols are generated and transmitted by the transmitter (the “symbol rate” or “baud rate”). The frequency of the clock signal 156 may be based on the mode of operation of the transmitter (e.g., as indicated by control signal 158).

The control circuit 154 may comprise, for example, an application specific integrated circuit (ASIC), a programmable interrupt controller (PIC), an ARM-based processor, an x86-based processor, and/or any other suitable circuitry operable to control a configuration of the transmitter based on one or more parameters. The parameters on which the configuration of the transmitter may be based may include, for example, input from a user of, and/or software application running on, a device (e.g., a mobile phone, laptop, base station, or the like) in which the transmitter resides. The parameters on which the configuration of the transmitter may be based may include performance indicators measured by circuitry of the transmitter such as, for example, measured noise levels, temperature, battery charge level, etc. The parameters on which the configuration of the transmitter may be based may include, for example, characteristics of data to be transmitted. Such characteristics may include, for example, quality of service parameters (e.g., latency and/or throughput requirements) and/or a model of non-linear distortion that the data will experience en route to a receiver. The parameters on which the configuration of the transmitter may be based may include performance indicators measured by and fed back from a receiver. Such performance indicators may include, for example, symbol error rate (SER), bit error rate (BER), signal-to-noise ratio (SNR), metrics calculated by a sequence estimation circuit, a phase error measured by the receiver, a measurement indicative of multipath present in the channel, and/or any other relevant performance indicator. The control circuit 154 may indicate a mode of operation of the transmitter and/or control configuration of the various components of the transmitter via the control signal 158.

The control circuit 154 may also be operable to generate control messages that indicate a configuration of the transmitter. Such control messages may be, for example, inserted into the transmitted datastream and/or transmitted on a control channel of beacon signal, to inform the receiver of the configuration of the receiver. Such control messages may be used by a multi-mode receiver for configuration of its circuitry.

The FEC encoder 156 may be perform FEC encoding according to one or more algorithms such as Reed-Solomon, or low-density parity check (LDPC) algorithms. The FEC code rate and/or the encoding algorithm used may be determined based on the mode of operation of the transmitter (e.g., as indicated by control signal 158). For example, FEC type (e.g., LDPC, RS, etc.) may be switched to match the modulation type and FEC rate may be optimized to increase capacity based on the mode of operation of the transmitter. In some cases of iterative FEC codes (e.g., LDPC, turbo), the code structure may vary to utilize the statistical characteristics of the partial response signal errors. FEC decoding performance may be improved through dynamic selection of the appropriate error model.

The mapper 102 may be as described above with reference to FIG. 1A, for example. A symbol constellation in use by the mapper 102 may be determined based on the mode of operation of the transmitter (e.g., as indicated by control signal 158). The rate at which bits are mapped to symbols may be determined based on the clock signal 156. In an example embodiment of the disclosure, the mapper 102 may be operable to insert one or more pilot symbols (e.g., a particular pattern of pilot symbols) into a generated symbol sequence. In an example embodiment, the pilot symbol(s) may be inserted in a deterministic manner (e.g., periodically and/or on an event-driven basis) such that a receiver of the signal may know, or be able to autonomously determine, that the symbols are pilot symbols and not information symbols (information symbols being symbols generated from data bits input to the mapper 102). In an example implementation, a common symbol constellation may be used for both the pilot symbols and the information symbols. In another example implementation, a first symbol constellation (e.g., a 32QAM-based PR10 constellation) may be used for information symbols and a second symbol constellation (e.g., a BPSK or QPSK constellation) may be used for pilot symbols.

The pilot overhead (POH) (i.e., the percentage of all transmitted symbols that are pilot symbols) and pattern of pilot symbols may be adapted dynamically (e.g., at or near real-time, based on recent measurements and/or feedback and/or user input) according to one or more performance indicators (e.g., SNR, SER, metrics levels calculated by module 204, amount of multipath, etc.) of the channel 108. When the transmitter is configured for near zero positive ISI, pilot symbols may be spread in time such that a single pilot is inserted for every N information symbols. In this manner, the pilot symbols may support the carrier recovery loop in the presence of phase noise and may prevent cycle slips by providing side information on the phase error present at the time of transmission of the pilot symbol. However, when the transmitter is configured in a mode that generates ISC signals whose values are, at any given time, based on a plurality of symbols, it may be advantageous to use several adjacent (or closely distributed) pilot symbols in order to provide efficient side information for the phase. Thus, symbol pilots when the transmitter is in a ISC mode, may be use a pattern of inserting group of M pilot symbols for every N information symbols, where the M symbols may be perfectly cascaded (i.e., no information symbol in between pilots) or, information symbol(s) may be inserted between some of the pilot symbols consisting the group of M. For example, the transmitter may insert 1 pilot symbol between every N information symbols when configured in a first mode of operation, and insert 2 or more consecutive pilot symbols between every N information symbols when configured in a second mode of operation.

A configuration of the ISC generation circuit 158 may be determined based on the mode of operation of the transmitter (e.g., as indicated by control signal 158). In a first configuration, the ISC generation circuit 158 may be configured to generate ISC signals. For example, in a first configuration the ISC generation circuit 158 may correspond to, and operate as, the pulse shaper 104 described herein with reference to FIGS. 1A and 2-8D. In a second configuration, the ISC generation circuit 158 may be configured as a near zero positive ISI pulse shaping filter (e.g., may be configured based on, or to approximate, a root raised cosine (RRC) pulse shaping filter). The first configuration may correspond to a first number of filter taps and/or a first set of tap coefficients. The second configuration may correspond to a second number of filter taps and/or a second set of tap coefficients. As another example, the first configuration of the ISC generation circuit 158 may be one in which it perform decimation below the Nyquist frequency such that aliasing results in an ISC signal. As another example, the first configuration of the IS C generation circuit 158 may be one in which it performs lattice coding resulting in an ISC signal.

The timing pilot insertion circuit 105 may be as described above with reference to FIG. 1A, for example. In an example implementation, the sub-harmonic of the symbol frequency at which the pilot is inserted may be determined based on the mode of operation of the transmitter (e.g., as indicated by control signal 158). That is, if the timing pilot is inserted at F_baud/D, the value of D may be controlled based on the mode of operation of the transmitter (e.g., as indicated by control signal 158). Additionally, the power of the inserted pilot signal may be controlled based on the mode of operation of the transmitter (e.g., as indicated by control signal 158). Relatedly, the timing pilot insert circuit 105 may be enabled and disabled based on the mode of operation of the transmitter (e.g., as indicated by control signal 158).

The Tx front-end 106 may be as described above with reference to FIG. 1A. Different configurations of the front-end 106 may correspond, for example, to different power back-off settings of an amplifier of the front-end 106. A larger power back-off may correspond to an operating point further away from a reference point (e.g., 1-dB compression point) than an operating point corresponding to a smaller power back-off. Consequently, a larger power back-off setting may correspond to increased linearity at the expense of decreased transmitted power and energy efficiency.

In operation, the transmitter may support a plurality of modes, with each of the modes corresponding to a particular configuration of each of the mapper 102, ISC generation circuit 158, timing pilot insert circuit 105, Tx Front-End circuit 106, and clock 152. The transmitter may be configured dynamically (e.g., at or near real-time, based on recent measurements and/or feedback and/or user input). In an example implementation, the transmitter may support the two modes characterized by the parameters shown in table 1,

TABLE 1

Mapper
ISC generation
Clock
Pilot insert
Front-end

Mode
102
circuit 158
152
105
106

1
N-QAM
RRC, BW1
F_b1
F_b1/D
P₁> PBO1 > P₂

2
M-QAM
PR, BW2
F_b2
F_b2/D
P₁> PBO2 > P₃

where N and M are integers; D is a real number; F_b1is baud rate in mode 1; F_b2is the baud rate in mode 2; PBO1 is the power back-off setting of an amplifier of the front-end 106 in mode 1; PBO2 is the power back-off setting of the amplifier of the front-end 106 in mode 2; and P₁, P₂and P₃are three back-off limits where P₁>P₂>P₃such that P₁corresponds to an operating point that is further from a reference point than an operating point corresponding to P₂, and P₂corresponds to an operating point that is further from the reference point than an operating point corresponding to P₃(i.e., P₃results in higher transmitted power and more non-linear distortion than P₂, and P₂results in higher transmitted power and more non-linear distortion than P₁). In such an implementation, the mapper 102, ISC generation circuit 158, clock 152, pilot insert circuit 105, and front-end 106 may be configured such that the two modes in table 1 achieve the same throughput in the same bandwidth (i.e., same spectral efficiency) but with different symbol constellations. That is, mode 1 may achieve a particular throughput using an N-QAM constellation, RRC pulse shape filtering with an effective bandwidth of BW1, a first baud rate F_b1, and an amplifier setting with lower non-linear distortion, whereas mode 2 may achieve the throughput using a M-QAM symbol constellation (N>M), partial response (PR) pulse shape filtering with effective bandwidth of BW2=BW1, a second baud rate F_b2=log 2(N)/log 2(M)×F_b1, and an amplifier setting with higher non-linear distortion.

In an example implementation, M=N (i.e., the two modes use the same constellation), BW2=BW1/X, F_b1=F_b2(i.e., the two modes use the same baud rate), and PBO1=PBO2 (i.e., the two modes use the same power back-off setting of an amplifier), and mode 2 achieves the same throughput as mode 1, but using a factor of X less bandwidth, as a result of the increased spectral efficiency of mode 2.

FIG. 1C is a block diagram illustrating a multi-mode receiver operable to support low-complexity, highly-spectrally-efficient communications. Shown in FIG. 1C, are the Rx Front-end 108, the Rx filter 109, the timing pilot removal circuit 110, the equalization and sequence estimation circuit 112, a control circuit 174, and an FEC decoder circuit 176.

The control circuit 174 may comprise, for example, an application specific integrated circuit (ASIC), a programmable interrupt controller (PIC), an ARM-based processor, an x86-based processor, and/or any other suitable circuitry operable to control a configuration of the receiver based on one or more parameters. The parameters on which the configuration of the receiver may be based may include, for example, input from a user of, and/or software application running on, a device (e.g., a mobile phone, laptop, base station, or the like) in which the receiver resides. The parameters on which the configuration of the receiver may be based may include performance indicators measured by circuitry of the receiver such as, for example, measured noise levels, temperature, battery charge level, symbol error rate (SER), bit error rate (BER), signal-to-noise ratio (SNR), metrics calculated by a sequence estimation circuit, a non-linear model in use by the receiver, a phase error measured by the receiver, a measurement indicative of an amount of multipath in the channel, and/or any other relevant performance indicator. The parameters on which the configuration of the receiver may be based may include characteristics of data to be received. Such characteristics may include, for example, quality of service parameters (e.g., latency and/or throughput requirements) and/or a model of non-linear distortion experienced by the data during transmission, propagation over the channel, and/or reception by the receiver. The parameters on which the configuration of the receiver may be parameters communicated (e.g., in a beacon signal) by a transmitter from which the receiver desires to receive communications. Such parameters may include, for example, power back-off (and/or other indications of non-linearity) symbol constellation in use, type of pulse shape filtering in use, baud rate, etc. The parameters on which the configuration of the receiver may be based may include a mode of operation of a transmitter from which the receiver desires to receive communications. Such mode of operation may, for example, be communicated to the receiver in a control message (e.g., in a beacon signal) and relayed to the control circuit 174.

The control circuit 174 may also be operable to generate control messages that indicate a configuration of the receiver. Such control messages may be, for example, inserted into the transmitted datastream and/or transmitted on a control channel of beacon signal, to provide feedback to a transmitter. Such control messages may be used by a multi-mode transmitter for configuration of its circuitry.

The timing pilot removal circuit 110 may be as described above and may, for example, comprise one or more phase locked loops (PLLs) for recovering the symbol timing of received signals and outputting a clock signal determined by the recovered symbol timing.

The Rx front-end 108 may be as described above with reference to FIG. 1A, for example. Different configurations of the front-end 108 may correspond, for example, to different combination of power back-off settings of amplifiers and/or attenuators of the front-end 108. A larger power back-off may correspond to an operating point further away from a reference point (e.g., 1-dB compression point) than an operating point corresponding to a smaller power back-off. Consequently, a larger power back-off setting may correspond to increased linearity at the expense of decreased energy efficiency and/or increased noise figure.

A configuration of the Rx filter 109 may be determined based on the mode of operation of the receiver (e.g., as indicated by the control signal 178). In a first configuration, the Rx filter 109 may operate as described herein with reference to FIGS. 1A and 2-8D. That is, in a first configuration, the Rx filter 109 may be configured to achieve a desired total partial response. In a second configuration, however, the Rx filter 109 may be configured as a near zero positive ISI pulse shaping filter (e.g., root raised cosine (RRC) pulse shaping filter). The first configuration may correspond to a first number of filter taps and/or a first set of tap coefficients. The second configuration may correspond to a second number of filter taps and/or a second set of tap coefficients.

A configuration of the equalization and sequence estimation circuit 112 may be determined based on the mode of operation of the receiver (e.g., as indicated by the control signal 178). In a first configuration, the equalization and sequence estimation circuit 112 may operate as described herein with reference to FIGS. 1A and 2-8D, for example. That is, in a first configuration, the equalization and sequence estimation circuit 112 may detect/estimate sequences of ISC symbols. In a second configuration, however, the equalization and sequence estimation circuit 112 may detect/estimate individual symbols (i.e., sequences only one symbol in length). Accordingly, in the second configuration, the equalization and sequence estimation circuit 112 may perform slicing and each estimate/decision (hard or soft) may depend only on the current symbol. Thus, configuration of the equalization and sequence estimation circuit 112 may be based, for example, on an indication of inter symbol correlation in a received signal. In case of severe channel multipath and/or phase noise that create a correlation between received symbols, circuit 112 may be configured for decoding symbols by sequence estimation method to improve decoding performance comparing to symbol-by-symbol slicing/decision.

The FEC decoder 176 may be perform FEC decoding according to one or more algorithms such as Reed-Solomon, or low-density parity check (LDPC) algorithms. The FEC code rate and/or the decoding algorithm used may be determined based on the mode of operation of the transmitter (e.g., as indicated by control signal 178). For example, FEC type (e.g., LDPC, RS, etc.) may be switched to match the modulation type and FEC rate may be optimized to increase capacity based on the mode of operation of the transmitter. In some cases of iterative FEC codes (e.g., LDPC, turbo), the code structure may vary to utilize the statistical characteristics of the partial response signal errors. FEC decoding performance may be improved through dynamic selection of the appropriate error model.

In operation, the receiver may support a plurality of modes, with each of the modes corresponding to a particular configuration of each of the Rx Front-end 108, the Rx filter 109, the timing pilot removal circuit 110, the equalization and sequence estimation circuit 112, and a control circuit 174. The receiver may be configured dynamically (e.g., at or near real-time, based on recent measurements and/or feedback). In an example implementation, the receiver may support the two modes characterized by the parameters shown in table 2,

TABLE 2

Rx Filter
Clock
Front-end
EQ & Seq

Mode
109
152
108
Est. 112

1
RRC, BW1
F_b1
P₄> PBO3 > P₅
Slice

2
PR, BW2
2 × F_b1
P₄> PBO4 > P₆
Seq. est.

where F_b1is the baud rate for mode 1; PBO3 is the power back-off setting of an amplifier of the front-end 108 in mode 1; PBO4 is the power back-off setting of an amplifier of the front-end 108 in mode 2; and P₄, P₅and P₆are three back-off limits where P₄>P₅>P₆such that P₄corresponds to an operating point that is further from a reference point than an operating point corresponding to P₅, and P₅corresponds to an operating point that is further from the reference point than an operating point corresponding to P₆(i.e., P₆results in more non-linear distortion than P₅, and P₅results in more non-linear distortion than P₄). In the receiver, there is a tradeoff between linearity and noise figure performance. Allowing high non-linear distortion may enable improving the overall noise figure which, in turn, may improve demodulator sensitivity. Thus, a receiver capable of tolerating severe non-linear distortion may permit configuring that receiver for optimal noise figure.

In such an implementation, the Rx front-end 108, Rx filter 109, and equalization and sequence estimation circuit 112 may be configured such that mode 2 provides better reception (e.g., lower SER) around the operating SNR (e.g., 30 dB SNR) than mode 1 for the same throughput and same spectral efficiency. For a given received signal level (RSL), the system at mode 2 may improve SNR comparing to mode 1 due to the ability to tolerate larger non-linear distortion originating at the receiver front-end and consequently decrease the noise figure which increase observed SNR. FIG. 10 depicts SER vs. SNR for modes 1 and 2 under example constraints.

FIG. 2 is a block diagram depicting an example equalization and sequence estimation circuit for use in a system configured for low-complexity, highly-spectrally-efficient communications. Shown are an equalizer circuit 202, a signal combiner circuit 204, a phase adjust circuit 206, a sequence estimation circuit 210, and non-linearity modeling circuits 236a and 236b.

The equalizer 202 may be operable to process the signal 122 to reduce ISI caused by the channel 107. The output 222 of the equalizer 202 is a partial response domain signal. The ISI of the signal 222 is primarily the result of the pulse shaper 104 and the input filter 109 (there may be some residual ISI from multipath, for example, due to use of the least means square (LMS) approach in the equalizer 202). The error signal, 201, fed back to the equalizer 202 is also in the partial response domain. The signal 201 is the difference, calculated by combiner 204, between 222 and a partial response signal 203 that is output by non-linearity modeling circuit 236a. An example implementation of the equalizer is described in the United States patent application titled “Feed Forward Equalization for Highly-Spectrally-Efficient Communications,” which is incorporated herein by reference, as set forth above.

The carrier recovery circuit 208 may be operable to generate a signal 228 based on a phase difference between the signal 222 and a partial response signal 207 output by the non-linearity modeling circuit 236b. The carrier recovery circuit 208 may be as described in the United States patent application titled “Coarse Phase Estimation for Highly-Spectrally-Efficient Communications,” which is incorporated herein by reference, as set forth above.

The phase adjust circuit 206 may be operable to adjust the phase of the signal 222 to generate the signal 226. The amount and direction of the phase adjustment may be determined by the signal 228 output by the carrier recovery circuit 208. The signal 226 is a partial response signal that approximates (up to an equalization error caused by finite length of the equalizer 202, a residual phase error not corrected by the phase adjust circuit 206, non-linearities, and/or other non-idealities) the total partial response signal resulting from corresponding symbols of signal 103 passing through pulse shaper 104 and input filter 109.

The buffer 212 buffers samples of the signal 226 and outputs a plurality of samples of the signal 226 via signal 232. The signal 232 is denoted PR1, where the underlining indicates that it is a vector (in this case each element of the vector corresponds to a sample of a partial response signal). In an example implementation, the length of the vector PR1 may be Q samples.

Input to the sequence estimation circuit 210 are the signal 232, the signal 228, and a response ĥ. Response ĥ is based on h (the total partial response, discussed above). For example, response ĥ may represent a compromise between h (described above) and a filter response that compensates for channel non-idealities such as multi-path. The response ĥ may be conveyed and/or stored in the form of LTx+LRx−1 tap coefficients resulting from convolution of the LTx tap coefficients of the pulse shaper 104 and the LRx tap coefficients of the input filter 109. Alternatively, response h may be conveyed and/or stored in the form of fewer than LTx+LRx−1 tap coefficients—for example, where one or more taps of the LTx and LRx is ignored due to being below a determined threshold. The sequence estimation circuit 210 may output partial response feedback signals 205 and 209, a signal 234 that corresponds to the finely determined phase error of the signal 120, and signal 132 (which carries hard and/or soft estimates of transmitted symbols and/or transmitted bits). An example implementation of the sequence estimation circuit 210 is described below with reference to FIG. 3.

The non-linear modeling circuit 236a may apply a non-linearity function custom character (a model of the non-linearity seen by the received signal en route to the circuit 210) to the signal 205 resulting in the signal 203. Similarly, the non-linear modeling circuit 236b may apply the non-linearity function to the signal 209 resulting in the signal 207. custom character may be, for example, a third-order or fifth-order polynomial. Increased accuracy resulting from the use of a higher-order polynomial for may tradeoff with increased complexity of implementing a higher-order polynomial. Where FnlTx is the dominant non-linearity of the communication system 100, custom character modeling only FnlTx may be sufficient. Where degradation in receiver performance is above a threshold due to other non-linearities in the system (e.g., non-linearity of the receiver front-end 108) the model may take into account such other non-linearities

FIG. 3 is a block diagram depicting an example sequence estimation circuit for use in a system configured for low-complexity, highly-spectrally-efficient communications. Shown are a candidate generation circuit 302, a metrics calculation circuit 304, a candidate selection circuit 306, a combiner circuit 308, a buffer circuit 310, a buffer circuit 312, a phase adjust circuit 314, and convolution circuits 316a and 316b. The sequence estimation process described with respect to FIG. 3 is an example only. Many variations of the sequence estimation process are also possible. For example, although the implementation described here uses one phase survivor per symbol survivor, another implementation may have PSu (e.g., PSu<Su) phase survivors that will be used commonly for each symbol survivor.

For each symbol candidate at time n, the metrics calculation circuit 304 may be operable to generate a metric vector D_n¹. . . D_n^M×Su×Pbased on the partial response signal PR1, the signal 303a conveying the phase candidate vectors PC_n¹. . . PC_n^M×Su×Pand the signal 303b conveying the symbol candidate vectors SC_n¹. . . SC_n^M×Su×Pwhere underlining indicates a vector, subscript n indicates that it is the candidate vectors for time n, M is an integer equal to the size of the symbol alphabet (e.g., for N-QAM, M is equal to N), Su is an integer equal to the number of symbol survivor vectors retained for each iteration of the sequence estimation process, and P is an integer equal to the size of the phase alphabet. In an example implementation, the size of phase alphabet is three, with each of the three symbols corresponding to one of: a positive shift, a negative phase shift, or zero phase shift, as further described below with respect to FIGS. 5A-5D and in the United States patent application titled “Fine Phase Estimation for Highly Spectrally Efficient Communications,” which is incorporated herein by reference, as set forth above. In an example implementation, each phase candidate vector may comprise Q phase values and each symbol candidate vector may comprise Q symbols. An example implementation of the metrics calculation block is described below with reference to FIG. 4.

The candidate selection circuit 306 may be operable to select Su of the symbol candidates SC_n¹. . . SC_n^M×Su×Pand Su of the phase candidates PC_n¹. . . PC_n^M×Su×Pbased on the metrics D_n¹. . . D_n^M×Su×P. The selected phase candidates are referred to as the phase survivors PS_n¹. . . PS_n^Su. Each element of each phase survivors PS_n¹. . . PS_n^Sumay correspond to an estimate of residual phase error in the signal 232. That is, the phase error remaining in the signal after coarse phase error correction via the phase adjust circuit 206. The best phase survivor PS_n¹is conveyed via signal 307a. The Su phase survivors are retained for the next iteration of the sequence estimation process (at which time they are conveyed via signal 301b). The selected symbol candidates are referred to SS_n¹. . . SS_n^Suas the symbol survivors SS_n¹. . . SS_n^Su. Each element of each symbol survivors may comprise a soft-decision estimate and/or a hard-decision estimate of a symbol of the signal 232. The best symbol survivor SS_n¹is conveyed to symbol buffer 310 via the signal 307b. The Su symbol survivors are retained for the next iteration of the sequence estimation process (at which time they are conveyed via signal 301a). Although, the example implementation described selects the same number, Su, of phase survivors and symbol survivors, such is not necessarily the case. Operation of example candidate selection circuits 306 are described below with reference to FIGS. 5D and 6A-6B.

The candidate generation circuit 302 may be operable to generate phase candidates PC_n¹. . . PC_n^M×Su×Pand symbol candidates SC_n¹. . . SC_n^M×Su×Pfrom phase survivors PS_n−1¹. . . PS_n−1^Suand symbol survivors SS_n−1¹. . . SS_n−1^Su, wherein the index n−1 indicates that they are survivors from time n−1 are used for generating the candidates for time n. In an example implementation, generation of the phase and/or symbol candidates may be as, for example, described below with reference to FIGS. 5A and 5B and/or in the United States patent application titled “Joint Sequence Estimation of Symbol and Phase with High Tolerance of Nonlinearity,” which is incorporated herein by reference, as set forth above.

The symbol buffer circuit 310 may comprise a plurality of memory elements operable to store one or more symbol survivor elements of one or more symbol survivor vectors. The phase buffer circuit 312 may comprise a plurality of memory elements operable to store one or more phase survivor vectors. Example implementations of the buffers 310 and 312 are described below with reference to FIGS. 8A and 8B, respectively.

The combiner circuit 308 may be operable to combine the best phase survivor, PS_n¹, conveyed via signal 307a, with the signal 228 generated by the carrier recovery circuit 208 (FIG. 2) to generate fine phase error vector FPE_n¹, conveyed via signal 309, which corresponds to the finely estimated phase error of the signal 222 (FIG. 2). At each time n, fine phase error vector FPE_n−1¹stored in phase buffer 312 may be overwritten by FPE_n¹.

The phase adjust circuit 314 may be operable to adjust the phase of the signal 315a by an amount determined by the signal 234 output by phase buffer 312, to generate the signal 205.

The circuit 316a, which performs a convolution, may comprise a FIR filter or IIR filter, for example. The circuit 316a may be operable to convolve the signal 132 with response h, resulting in the partial response signal 315a. Similarly, the convolution circuit 316b may be operable to convolve the signal 317 with response ĥ, resulting in the partial response signal 209. As noted above, response ĥ may be stored by, and/or conveyed to, the sequence estimation circuit 210 in the form of one or more tap coefficients, which may be determined based on the tap coefficients of the pulse shaper 104 and/or input filter 109 and/or based on an adaptation algorithm of a decision feedback equalizer (DFE). Response ĥ may thus represent a compromise between attempting to perfectly reconstruct the total partial response signal (103 as modified by pulse shaper 104 and input filter 109) on the one hand, and compensating for multipath and/or other non-idealities of the channel 107 on the other hand. In this regard, the system 100 may comprise one or more DFEs as described in one or more of: the United States patent application titled “Decision Feedback Equalizer for Highly-Spectrally-Efficient Communications,” the United States patent application titled “Decision Feedback Equalizer with Multiple Cores for Highly-Spectrally-Efficient Communications,” and the United States patent application titled “Decision Feedback Equalizer Utilizing Symbol Error Rate Biased Adaptation Function for Highly-Spectrally-Efficient Communications,” each of which is incorporated herein by reference, as set forth above.

Thus, signal 203 is generated by taking a first estimate of transmitted symbols, (an element of symbol survivor SS_n¹), converting the first estimate of transmitted symbols to the partial response domain via circuit 316a, and then compensating for non-linearity in the communication system 100 via circuit 236a (FIG. 2). Similarly, signal 207 is generated from a second estimate of transmitted symbols (an element of symbol survivor SS_n¹) that is converted to the partial response domain by circuit 316b to generate signal 209, and then applying a non-linear model to the signal 209b to compensate for non-linearity in the signal path.

FIG. 4 is a block diagram depicting an example metric calculation circuit for use in a system configured for low-complexity, highly-spectrally-efficient communications. Shown is a phase adjust circuit 402, a convolution circuit 404, and a cost function calculation circuit 406. The phase adjust circuit 402 may phase shift one or more elements of the vector PR1 (conveyed via signal 232) by a corresponding one or more values of the phase candidate vectors PC_n¹. . . PC_n^M×Su×PThe signal 403 output by the phase adjust circuit 402 thus conveys a plurality of partial response vectors PR2_n¹. . . PR2_n^M×Su×P, each of which comprises a plurality of phase-adjusted versions of PR1.

The circuit 404, which performs a convolution, may comprise a FIR filter or IIR filter, for example. The circuit 404 may be operable to convolve the symbol candidate vectors SC_n¹. . . SC_n^M×Su×Pwith ĥ. The signal 405 output by the circuit 404 thus conveys vectors SCPR_n¹. . . SCPR_n^M×Su×Peach of which is a candidate partial response vector.

The cost function circuit 406 may be operable to generate metrics indicating the similarity between one or more of the partial response vectors PR2_n¹. . . PR2_n^M×Su×Pand one or more of the vectors SCPR_n¹. . . SCPR_n^M×Su×Pto generate error metrics D_n¹. . . D_n^M×Su×P. In an example implementation, the error metrics may be Euclidean distances calculated as shown below in equation 1.

D_nⁱ=|(SCPR_nⁱ)−(PR2_nⁱ)|² EQ. 1

for 1≦i≦M×Su×P.

FIGS. 5A-5D depict portions of an example sequence estimation process performed by a system configured for low-complexity, highly-spectrally-efficient communications. In FIGS. 5A-5D it is assumed, for purposes of illustration, that M=4 (a symbol alphabet of α, β, χ, δ), Su=3 (three symbol survivors are selected each iteration), Psu=Su (three phase survivors are selected each iteration), P=3 (a phase alphabet of plus, minus, and zero), and that Q (vector length) is 4.

Referring to FIG. 5A, there is shown phase and symbol survivors from time n−1 on the left side of the figure. The first step in generating symbol candidates and phase candidates from the survivors is to duplicate the survivors and shift the contents to free up an element in each of the resulting vectors called out as 502 on the right side of FIG. 5A. In the example implementation depicted, the survivors are duplicated M*P−1 times and shifted one element.

Referring to FIG. 5B, the next step in generating the candidates is inserting symbols in the vacant elements of the symbol vectors and phase values in the vacant elements of the phase vectors, resulting in the symbol candidates and phase candidate for time n (called out as 504 in FIG. 5B). In the example implementation depicted, each of the M possible symbol values is inserted into Su*P symbol candidates, and each of the P phase values may be inserted into M*Su candidates. In the example implementation depicted, θ5 is a reference phase value calculated based on phase survivor PS_n−1¹. For example, θ5 may be the average (or a weighted average) of the last two or more elements of the phase survivor PS_n−1¹(in the example shown, the average over the last two elements would be (θ5+0)/2). In the example implementation depicted, θ4=θ5−Δθ, and θ6=θ5+Δθ, where Δθ is based on: the amount of phase noise in signal 226, slope (derivative) of the phase noise in signal 226, signal-to-noise ratio (SNR) of signal 226, and/or capacity of the channel 107. Similarly, in the example implementation shown, θθ is a reference phase value calculated based on phase survivor PS_n−1ⁿ, θ7=θ8−Δθ, θ9=θ8+Δθ, θ11 is a reference phase value calculated based on phase survivor PS_n−1³, θ10=θ11−Δθ, and θ12==θ11+Δθ.

Referring to FIG. 5C, as described above with reference to FIG. 4, the symbol candidates are transformed to the partial response domain via a convolution, the reference signal PR1 is phase adjusted, and then the metrics D_n¹. . . D_n^M×Su×Pare calculated based on the partial response signals PR2_n¹. . . PR2_n^M×Su×Pand SCPR_n¹. . . SCPR_n^M×Su×P.

Referring to FIG. 5D, the metrics calculated in FIG. 5C are used to select which of the candidates generated in FIG. 5B are selected to be the survivors for the next iteration of the sequence estimation process. FIG. 5D depicts an example implementation in which the survivors are selected in a single step by simply selecting Su candidates corresponding to the Su best metrics. In the example implementation depicted, it is assumed that metric D_n⁴is the best metric, that D_n¹⁶is the second best metric, and that D_n³⁰is the third-best metric. Accordingly, symbol candidate SC_n¹⁴is selected as the best symbol survivor, PC_n¹⁴is selected as the best phase survivor, symbol candidate SC_n¹⁶is selected as the second-best symbol survivor, PC_n¹⁶is selected as the second-best phase survivor, symbol candidate SC_n³⁰is selected as the third-best symbol survivor, and PC_n³⁰is selected as the third-best phase survivor. The survivor selection process of FIG. 5D may result in selecting identical symbol candidates which may be undesirable. A survivor selection process that prevents redundant symbol survivors is described below with reference to FIGS. 6A and 6B.

FIGS. 6A and 6B depict an example survivor selection process that is an alternative to the process depicted in FIG. 5D. In FIG. 6A, the candidates generated in FIG. 5B and the metrics calculated in FIG. 5C are used to select the best phase candidate for each symbol candidate (selected candidates are called out by reference designator 602). In FIG. 6B, the best Su of the candidates selected in FIG. 6A are selected as the survivors for the next iteration of the sequence estimation process. In the example implementation depicted, it is assumed that metric D_n⁶is the best metric, that D_n⁵, is the second-best metric, and that D_n²⁵is the third-best metric. Accordingly, symbol candidate SC_n⁶is selected as the best symbol survivor, PC_n⁶is selected as the best phase survivor, symbol candidate SC_n⁵, is selected as the second-best symbol survivor, PC_n⁵is selected as the second-best phase survivor, symbol candidate SC_n²⁵is selected as the third-best symbol survivor, and PC_n²⁵is selected as the third-best phase survivor.

Although the implementations described with reference to FIGS. 5A-6B use one phase survivor per symbol survivor. Other example implementations may use PSu (e.g., PSu<Su) phase survivors that are used commonly for each symbol survivor. In such an implementation, each of the phase survivors PS_n−1¹. . . PS_n−1^PSumay be duplicated P times to generate phase successors, and then duplicated M*Su times to be associated with corresponding symbols successors. The number of symbol candidates in such an implementation would be M*Su*PSu*P.

FIG. 7 is a diagram illustrating initialization of the sequence estimation process. In FIG. 7 it is again assumed, for illustration, that M=4 (a symbol alphabet of α, β, χ, δ), Su=3 (three symbol survivors are selected each iteration), Psu=Su (three phase survivors are selected each iteration), P=3 (a phase alphabet of plus, minus, and zero), and that Q (vector length) is 4. On the far left of FIG. 7 is shown symbol survivors 702 after receipt of a preamble sequence. Because the preamble is a deterministic sequence, all symbol survivors are forced to the same values. From the survivors 702 are generated the candidates 704 and metrics 706 are calculated based on the candidates 704. In the example implementation shown, since the survivors were all the same, there are only four unique symbol candidates. The metrics for the four candidates are, respectively, D1, D2, D3, and D4. Accordingly, if the three candidates corresponding to the best three metrics were chosen, then the three candidates corresponding to D1 would all be chosen and the survivors for the next iteration would again all be identical. Accordingly, the three best, non-redundant symbol candidates are selected (as indicated by the heavy lines). Consequently, one of the candidates having the metric value D1 is selected, one of the candidates having the metric value D2 is selected, and one of the candidates having metric value D3 is selected, such that three non-redundant survivors are used for the next iteration.

FIG. 8A depicts an example implementation of the phase buffer shown in FIG. 3. In the example implementation depicted, the depth of the phase buffer 312 is Q and the phase value stored at element q is represented as Z_q, for q from 1 to Q. In the example implementation depicted, the value stored in element q3 is output as the signal 234. For each iteration of the sequence estimation process, Q elements of the phase buffer 312 storing Q values of PS_n−1¹may be overwritten with Q values of PS_n¹.

FIG. 8B depicts an example implementation of the symbol buffer shown in FIG. 3. In the example implementation depicted, the value(s) stored in one or more elements starting with index q1 (e.g., values stored in elements q1 through q1+L) is/are output as the signal 317 and the value(s) stored in one or more elements starting with index q2 (e.g., values stored in elements q2 through q2+L) is/are output as the signal 132. Because the value(s) output as the signal 317 start from a lower-indexed element of the symbol buffer, the delay between receiving a signal sample and outputting the corresponding value of signal 317 is shorter than the delay between receiving a signal sample and outputting the corresponding value of the signal 132. Because the value(s) output as the signal 132 start from a higher-indexed element, however, it/they is/are likely to be less error-prone. These concepts are further illustrated with reference to in FIGS. 8C and 8D. In an example implementation, q2 is equal to q3.

FIG. 8C depicts contents of an example symbol buffer over a plurality of iterations of a sequence estimation process. In the example implementation shown in FIG. 8C, the symbol buffer 310 comprises four elements with the signal 317 corresponding to the contents of the first element (for simplicity of illustration, in FIGS. 8C and 8D, it is assumed only one element is output as signal 317 on each iteration) and the signal 132 corresponding to the fourth element (for simplicity of illustration, in FIGS. 8C and 8D, it is assumed only one element is output as signal 132 on each iteration). In the example implementation depicted, during each iteration of the sequence estimation process, candidates are generated by duplicating the survivors from the previous iteration, shifting the values by one element, and the appending a new value into the vacated element. Accordingly, ideally each survivor would differ from the previous survivor only in the lowest-indexed element (corresponding to the most-recent symbol). Where other elements of the most-recent survivor differ from corresponding elements of the previous survivor, such difference indicates that there is an error in those elements (either in the most-recent survivor or in the previous survivor). Given the convolutional nature of the partial response signal, symbols at higher indexes in the buffer are more reliable. Thus the symbol values will tend to converge as they move toward the right in FIG. 8C.

Shown are the contents of example symbol buffer 310 at times n−3, n−2, n−1, and n. At time n−3, a symbol survivor having values α, β, χ, δ is stored in the symbol buffer 310. Accordingly, as shown in FIG. 8D, the value of signal 317 at time n−3 is ‘α’ and the value of signal 132 is ‘δ.’ At time n−2, a new symbol survivor having values δ, β, β, χ is stored in the symbol buffer 310. Accordingly, as shown in FIG. 8D, the value of signal 317 at time n−2 is ‘δ’ and the value of signal 132 is ‘χ.’ At time n−1, a new symbol survivor having values χ, δ, β, β is stored in the symbol buffer 310. Accordingly, as shown in FIG. 8D, the value of signal 317 at time n−1 is ‘χ’ and the value of signal 132 is ‘β.’ At time n, a new symbol survivor having values β, χ, δ, β is stored in the symbol buffer 310. Accordingly, as shown in FIG. 8D, the value of signal 317 at time n is ‘β’ and the value of signal 132 is ‘β.’ Thus, in the example scenario depicted in FIG. 8C, the value in the first element of the symbol buffer 310 at time n−3 was erroneous and the symbol did not converge until it reached the second element (q=2) of the buffer 310. That is, at time n−2 the symbol changed from α to β and then remained β at times n−1 and n. This illustrates the consequence of taking signal 317 from the first element of the symbol buffer 310 and taking the signal 132 from the fourth element of the symbol buffer 312. Namely, the signal 317 has less delay than the signal 132 but is also more error prone than the signal 132.

In FIG. 8D, the values of the signals are shown for times n−3 to time n+3. The dashed lines illustrate the delay between the signal 317 and the signal 132.

FIG. 9 is a flowchart illustrating dynamic configuration of a multi-mode transmitter. In block 902, the transmitter powers up. In block 904 a user and/or application layer of a device (e.g., mobile phone) in which the transmitter resides issues a command for the transmitter to be configured into a first mode of operation. Such a command may be, for example, in response to a need or desire to communicate with a first receiver that supports a first physical layer protocol/standard. Additionally or alternatively, such a command may be in response to a request sent on behalf of the first receiver (e.g., from a transmitter residing in the first device along with the first receiver). In block 906, the transmitter is configured into the first mode of operation (e.g., mode 1 of table 1, above). The first mode of operation may use, for example, RRC pulse shaping. In block 908, information is transmitted, intended for the first receiver, by the transmitter configured in the first mode. The first receiver may receive the transmission and process it to recover the transmitted information.

In block 910, a user and/or application layer of a device (e.g., mobile phone) in which the transmitter resides issues a command for the transmitter to be configured into a second mode of operation. Such a command may be, for example, in response to a need or desire to communicate with a second receiver that supports a second physical layer protocol/standard. Additionally or alternatively, such a command may be in response to a request sent on behalf of the second receiver (e.g., from a transmitter residing in a second device along with a second receiver). In an example implementation, the transmitter may, for example, acknowledge the request using mode 1 communications prior to switching to mode 2. The transmitter may, for example, be operable to switch between modes on a frame-by-frame basis. In block 906, the transmitter is configured into the first mode of operation (e.g., mode 1 In block 912, the transmitter is configured into the second mode of operation (e.g., mode 2 of table 1, above). The second mode of operation may use, for example, partial response pulse shaping. In block 914, information is transmitted, intended for the second receiver, by the transmitter configured in the second mode. In block 916, the transmitter powers down.

FIG. 10 compares between Symbol Error Rate (SER) vs. SNR of the receiver configured into mode 1 of table 2 and configured into mode 2 of table 2. For purpose of FIG. 10, gross spectral efficiency has been set to 10 bits/sec/Hz. Line 1002 represents ideal performance of mode 1 (QAM1024 at F_b1) and line 1004 represents ideal performance of mode 2 (PR10, which uses a QAM32 constellation, at 2×F_b1) without phase noise nor non-linear distortion. Line 1006 represents performance of mode 1, and line 1008 represents performance of mode 2 with SSB phase noise of −90 dBc/Hz at frequency offset of 100 KHz. The phase noise model has a fixed slope of −20 dB/dec. Line 1010 represents performance of mode 1, and Line 1012 represents performance of mode 2, under combined phase noise and non-linear distortion. The non-linear distortion model is saturated 3^rdorder, without memory, where φ was selected to be 30° to create the polynomial saddle point, which is the clipping (saturation) point:

$y = {\begin{matrix} x \cdot (1 - r \cdot ⅇ^{j φ} \cdot {\langle x \rangle}^{2}), & x < x_{sat} \\ y_{sat,} & x \geq x_{sat} \end{matrix} y_{sat} = x_{sat} \cdot (1 - r \cdot ⅇ^{j φ} \cdot {\langle x_{sat} \rangle}^{2})$

and r is set according to the desired distortion level (backoff).

In ideal conditions, mode 2 as shown performs 3.5 dB better than mode 1 as shown around SER of 3×10-2, which is a practical reference for BER of 10-6 with FEC rate around 0.95. Both mode 2 and mode 1 as shown are using symbols Pilot Over Head (POH) of 5%. Mode 2 as shown is estimating phase noise using the HPSE but the mode 1 shown is using perfect decisions for carrier recovery loop (for all other demodulating purposes it uses the symbol pilots and tentative decisions). The phase noise degrades the mode 1 by 1 dB but mode 2 by only 0.4 dB. The transmitted power of mode 2 shown is higher by 4.5 dB than for the mode 1 shown. Nevertheless, the combined phase noise and non-linear distortion degrades mode 1 shown by 2.2 dB while it affects mode 2 shown by only 0.6 dB. The overall SER improvement of mode 2 shown is around 5.3 dB but mode 2 shown has error correlation due to the nature of partial response (memory) hence, the FEC gain for mode 2 shown is 1 dB below the FEC gain of mode 1 shown. Therefore the practical sensitivity benefit is limited to 4.3 dB. Tx power benefit of mode 2 shown relative to mode 1 shown is 4.5 dB, thus the total contribution to the system gain by using mode 2 shown instead of mode 1 shown is 8.8 dB. But due to spectral mask limitations the Tx power must be below P1 dB-4.5 dB so that the spectral re-growth will not exceed the applicable spectral mask, therefore the practical benefit in Tx power of mode 2 shown vs. mode 1 shown is 3 dB and the overall system gain benefit of using mode 2 instead of mode 1 shown is 7.3 dB. With the use of crest factor reduction (CFR) and pre-distortion methods the Tx power for mode 2 shown may increase without violating the applicable spectral mask and the system gain benefit resulting from use of mode 2 shown instead of mode 1 shown may approach 8.8 dB.

The present method and/or system may be realized in hardware, software, or a combination of hardware and software. The present method and/or system may be realized in a centralized fashion in at least one computing system, or in a distributed fashion where different elements are spread across several interconnected computing systems. Any kind of computing system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computing system with a program or other code that, when being loaded and executed, controls the computing system such that it carries out the methods described herein. Another typical implementation may comprise an application specific integrated circuit or chip.

The present method and/or system may also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.

While the present method and/or system has been described with reference to certain implementations, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the present method and/or system. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present disclosure without departing from its scope. Therefore, it is intended that the present method and/or system not be limited to the particular implementations disclosed, but that the present method and/or system will include all implementations falling within the scope of the appended claims.

Claims

1. A system comprising: a transmitter configurable to operate in at least two modes, wherein: which of said modes said transmitter is configured into is controlled based on: feedback or request from a receiver, a measured performance indicator, and/or a command from an application running on a device in which said transmitter is installed;while said transmitter is configured into a first of said modes, said transmitter is configured to use a pulse shaping filter configured as a near zero positive ISI filter;while said transmitter is configured into a second of said modes, said transmitter is configured to generate an inter-symbol correlated (ISC) signal;a symbol constellation used by said transmitter while said transmitter is configured into said first of said modes is the same as a symbol constellation used while said transmitter is configured into said second of said modes;said transmitter comprises an amplifier;while said transmitter is configured into said first of said modes, a first amount of power back-off is used by said amplifier; andwhile said transmitter is configured into said second of said modes, a second amount of power back-off is used by said amplifier.
2. The system of claim 1, wherein a maximum throughput achievable while said transmitter is configured into said first of said modes is equal to a maximum throughput achievable while said transmitter is configured into said second of said modes.
3. The system of claim 1, wherein said symbol constellation is an N-QAM constellation, N being an integer.
4. The system of claim 1, wherein while said transmitter is configured into the second of said modes, said transmitter is configured to process signals to be transmitted via a partial response pulse shaping filter.
5. The system of claim 1, wherein a bandwidth used by said transmitter while said transmitter is configured into said first of said modes is greater than a bandwidth used by said transmitter while said transmitter is configured into said second of said modes.
6. A method comprising: performing in a transmitter configurable to operate in at least two modes: controlling into which of said modes said transmitter is configured based on: feedback or request from a receiver, a measured performance indicator, and/or a command from an application running on a device in which said transmitter is installed;while said transmitter is configured into a first of said modes, mapping bits to symbols using a particular symbol constellation and transmitting said symbols onto a channel using a pulse shaping filter configured as a near zero positive ISI filter;while said transmitter is configured into a second of said modes, mapping bits to symbols using said particular symbol constellation and transmitting said symbols onto said channel using a pulse shaping filter configured to generate an inter-symbol correlated (ISC) signal;while said transmitter is configured into said first of said modes, amplifying an output of said pulse shaping filter configured as a near zero positive ISI filter using a first amount of power back-off; andwhile said transmitter is configured into said second of said modes, amplifying said ISC signal using a second amount of power back-off.
7. The system of claim 6, wherein a maximum throughput achievable while said transmitter is configured into said first of said modes is equal to a maximum throughput achievable while said transmitter is configured into said second of said modes.
8. The system of claim 6, wherein said particular symbol constellation is an N-QAM constellation, N being an integer.
9. The system of claim 6, wherein while said transmitter is configured into the second of said modes, said pulse shaping filter is configured as a partial response pulse shaping filter.
10. The system of claim 6, wherein a bandwidth used by said transmitter while said transmitter is configured into said first of said modes is greater than a bandwidth used by said transmitter while said transmitter is configured into said second of said modes.
11. A system comprising: a transmitter configurable to operate in at least two modes, wherein: which of said modes said transmitter is configured into is controlled based on: feedback or request from a receiver; a measured performance indicator, and/or an application running on a device in which said transmitter is installed;while said transmitter is configured into a first of said modes, said transmitter is configured to use a pulse shaping filter configured as a near zero positive ISI filter;while said transmitter is configured into a second of said modes, said transmitter is configured to generate an inter-symbol correlated (ISC) signal;a symbol constellation used by said transmitter while said transmitter is configured into said first of said modes is the same as a symbol constellation used while said transmitter is configured into said second of said modes; anda maximum throughput achievable while said transmitter is configured into said first of said modes is equal to a maximum throughput achievable while said transmitter is configured into said second of said modes.
12. The system of claim 11, wherein said symbol constellation is an N-QAM constellation, N being an integer.
13. The system of claim 11, wherein while said transmitter is configured into the second of said modes, said transmitter is configured to process signals to be transmitted via a partial response pulse shaping filter.
14. The system of claim 11, wherein a bandwidth used by said transmitter while said transmitter is configured into said first of said modes is greater than a bandwidth used by said transmitter while said transmitter is configured into said second of said modes.
15. A system comprising: a transmitter configurable to operate in at least two modes, wherein: which of said modes said transmitter is configured into is controlled based on: feedback or request from a receiver; a measured performance indicator, and/or an application running on a device in which said transmitter is installed:while said transmitter is configured into a first of said modes, said transmitter is configured to use a pulse shaping filter configured as a near zero positive ISI filter;while said transmitter is configured into a second of said modes, said transmitter is configured to generate an inter-symbol correlated (ISC) signal;a symbol constellation used by said transmitter while said transmitter is configured into said first of said modes is the same as a symbol constellation used while said transmitter is configured into said second of said modes; anda bandwidth used by said transmitter while said transmitter is configured into said first of said modes is greater than a bandwidth used by said transmitter while said transmitter is configured into said second of said modes.
16. The system of claim 15, wherein said symbol constellation is an N-QAM constellation, N being an integer.
17. The system of claim 15, wherein while said transmitter is configured into the second of said modes, said transmitter is configured to process signals to be transmitted via a partial response pulse shaping filter.
18. A method comprising: performing in a transmitter configurable to operate in at least two modes: controlling into which of said modes said transmitter is configured based on: feedback or request from a receiver, a measured performance indicator, and/or a command from an application running on a device in which said transmitter is installed;while said transmitter is configured into a first of said modes, mapping bits to symbols using a particular symbol constellation and transmitting said symbols onto a channel using a pulse shaping filter configured as a near zero positive ISI filter;while said transmitter is configured into a second of said modes, mapping bits to symbols using said particular symbol constellation and transmitting said symbols onto said channel using a pulse shaping filter configured to generate an inter-symbol correlated (ISC) signal; andwherein a maximum throughput achievable while said transmitter is configured into said first of said modes is equal to a maximum throughput achievable while said transmitter is configured into said second of said modes.
19. The system of claim 18, wherein said particular symbol constellation is an N-QAM constellation, N being an integer.
20. The system of claim 18, wherein while said transmitter is configured into the second of said modes, said pulse shaping filter is configured as a partial response pulse shaping filter.
21. The system of claim 18, wherein a bandwidth used by said transmitter while said transmitter is configured into said first of said modes is greater than a bandwidth used by said transmitter while said transmitter is configured into said second of said modes.
22. A method comprising: performing in a transmitter configurable to operate in at least two modes: controlling into which of said modes said transmitter is configured based on: feedback or request from a receiver, a measured performance indicator, and/or a command from an application running on a device in which said transmitter is installed;while said transmitter is configured into a first of said modes, mapping bits to symbols using a particular symbol constellation and transmitting said symbols onto a channel using a pulse shaping filter configured as a near zero positive ISI filter; andwhile said transmitter is configured into a second of said modes, mapping bits to symbols using said particular symbol constellation and transmitting said symbols onto said channel using a pulse shaping filter configured to generate an inter-symbol correlated (ISC) signal; andwherein a bandwidth used by said transmitter while said transmitter is configured into said first of said modes is greater than a bandwidth used by said transmitter while said transmitter is configured into said second of said modes.
23. The system of claim 22, wherein said particular symbol constellation is an N-QAM constellation, N being an integer.

CLAIM OF PRIORITY

This patent application is a continuation of U.S. patent application Ser. No. 13/755,972 filed Jun. 19, 2013 now U.S. Pat. No. 8,744,003, which makes reference to, claims priority to and claims benefit from: U.S. Provisional Patent Application Ser. No. 61/662,085 entitled “Apparatus and Method for Efficient Utilization of Bandwidth” and filed on Jun. 20, 2012, now expired;U.S. Provisional Patent Application Ser. No. 61/726,099 entitled “Modulation Scheme Based on Partial Response” and filed on Nov. 14, 2012, now expired;U.S. Provisional Patent Application Ser. No. 61/729,774 entitled “Modulation Scheme Based on Partial Response” and filed on Nov. 26, 2012, now expired; andU.S. Provisional Patent Application Ser. No. 61/747,132 entitled “Modulation Scheme Based on Partial Response” and filed on Dec. 28, 2012, now expired. Each of the above-identified applications is hereby incorporated herein by reference in its entirety.

US Referenced Citations (209)

Number	Name	Date	Kind
4109101	Mitani	Aug 1978	A
4135057	Bayless, Sr. et al.	Jan 1979	A
4797925	Lin	Jan 1989	A
5111484	Karabinis	May 1992	A
5131011	Bergmans et al.	Jul 1992	A
5202903	Okanoue	Apr 1993	A
5249200	Chen et al.	Sep 1993	A
5283813	Shalvi et al.	Feb 1994	A
5291516	Dixon et al.	Mar 1994	A
5394439	Hemmati	Feb 1995	A
5432822	Kaewell	Jul 1995	A
5459762	Wang et al.	Oct 1995	A
5590121	Geigel et al.	Dec 1996	A
5602507	Suzuki	Feb 1997	A
5757855	Strolle et al.	May 1998	A
5784415	Chevillat et al.	Jul 1998	A
5818653	Park et al.	Oct 1998	A
5886748	Lee	Mar 1999	A
5889823	Agazzi et al.	Mar 1999	A
5915213	Iwatsuki et al.	Jun 1999	A
5930309	Knutson et al.	Jul 1999	A
6009120	Nobakht	Dec 1999	A
6167079	Kinnunen et al.	Dec 2000	A
6233709	Zhang et al.	May 2001	B1
6272173	Hatamian	Aug 2001	B1
6335954	Bottomley et al.	Jan 2002	B1
6356586	Krishnamoorthy	Mar 2002	B1
6516437	Van Stralen et al.	Feb 2003	B1
6532256	Miller	Mar 2003	B2
6535549	Scott et al.	Mar 2003	B1
6697441	Bottomley et al.	Feb 2004	B1
6785342	Isaksen et al.	Aug 2004	B1
6871208	Guo et al.	Mar 2005	B1
6968021	White et al.	Nov 2005	B1
6985709	Perets	Jan 2006	B2
7158324	Stein et al.	Jan 2007	B2
7190288	Robinson et al.	Mar 2007	B2
7190721	Garrett	Mar 2007	B2
7205798	Agarwal et al.	Apr 2007	B1
7206363	Hegde et al.	Apr 2007	B2
7215716	Smith	May 2007	B1
7269205	Wang	Sep 2007	B2
7467338	Saul	Dec 2008	B2
7830854	Sarkar et al.	Nov 2010	B1
7974230	Talley et al.	Jul 2011	B1
8005170	Lee et al.	Aug 2011	B2
8059737	Yang	Nov 2011	B2
8175186	Wiss et al.	May 2012	B1
8199804	Cheong	Jun 2012	B1
8248975	Fujita et al.	Aug 2012	B2
8351536	Mazet et al.	Jan 2013	B2
8422589	Golitschek Edler Von Elbwart et al.	Apr 2013	B2
8526523	Eliaz	Sep 2013	B1
8548072	Eliaz	Oct 2013	B1
8548089	Agazzi et al.	Oct 2013	B2
8548097	Eliaz	Oct 2013	B1
8553821	Eliaz	Oct 2013	B1
8559494	Eliaz	Oct 2013	B1
8559496	Eliaz	Oct 2013	B1
8559498	Eliaz	Oct 2013	B1
8565363	Eliaz	Oct 2013	B1
8566687	Eliaz	Oct 2013	B1
8571131	Eliaz	Oct 2013	B1
8571146	Eliaz	Oct 2013	B1
8572458	Eliaz	Oct 2013	B1
8582637	Eliaz	Nov 2013	B1
8599914	Eliaz	Dec 2013	B1
8605832	Eliaz	Dec 2013	B1
8665941	Eliaz	Mar 2014	B1
8665992	Eliaz	Mar 2014	B1
8666000	Eliaz	Mar 2014	B2
8675769	Eliaz	Mar 2014	B1
8675782	Eliaz	Mar 2014	B2
8681889	Eliaz	Mar 2014	B2
8731413	Dave et al.	May 2014	B1
8737458	Eliaz	May 2014	B2
8744003	Eliaz	Jun 2014	B2
8781008	Eliaz	Jul 2014	B2
8804879	Eliaz	Aug 2014	B1
8811548	Eliaz	Aug 2014	B2
8824572	Eliaz	Sep 2014	B2
8824599	Eliaz	Sep 2014	B1
8824611	Eliaz	Sep 2014	B2
8831124	Eliaz	Sep 2014	B2
8842778	Eliaz	Sep 2014	B2
8873612	Eliaz	Oct 2014	B1
8885698	Eliaz	Nov 2014	B2
8885786	Eliaz	Nov 2014	B2
8891701	Eliaz	Nov 2014	B1
8897387	Eliaz	Nov 2014	B1
8897405	Eliaz	Nov 2014	B2
20010008542	Wiebke et al.	Jul 2001	A1
20020016938	Starr	Feb 2002	A1
20020123318	Lagarrigue	Sep 2002	A1
20020150065	Ponnekanti	Oct 2002	A1
20020150184	Hafeez et al.	Oct 2002	A1
20020172297	Ouchi et al.	Nov 2002	A1
20030016741	Sasson et al.	Jan 2003	A1
20030135809	Kim	Jul 2003	A1
20030210352	Fitzsimmons et al.	Nov 2003	A1
20040037374	Gonikberg	Feb 2004	A1
20040120409	Yasotharan et al.	Jun 2004	A1
20040142666	Creigh et al.	Jul 2004	A1
20040170228	Vadde	Sep 2004	A1
20040174937	Ungerboeck	Sep 2004	A1
20040203458	Nigra	Oct 2004	A1
20040227570	Jackson et al.	Nov 2004	A1
20040240578	Thesling	Dec 2004	A1
20050047517	Georgios et al.	Mar 2005	A1
20050135472	Higashino	Jun 2005	A1
20050163252	McCallister	Jul 2005	A1
20050220218	Jensen et al.	Oct 2005	A1
20050265470	Kishigami et al.	Dec 2005	A1
20050276317	Jeong et al.	Dec 2005	A1
20060067396	Christensen	Mar 2006	A1
20060109780	Fechtel	May 2006	A1
20060171489	Ghosh et al.	Aug 2006	A1
20060239339	Brown et al.	Oct 2006	A1
20060245765	Elahmadi et al.	Nov 2006	A1
20060280113	Huo	Dec 2006	A1
20070092017	Abedi	Apr 2007	A1
20070098059	Ives	May 2007	A1
20070098090	Ma et al.	May 2007	A1
20070098116	Kim et al.	May 2007	A1
20070110177	Molander et al.	May 2007	A1
20070110191	Kim et al.	May 2007	A1
20070127608	Scheim et al.	Jun 2007	A1
20070140330	Allpress et al.	Jun 2007	A1
20070189404	Baum et al.	Aug 2007	A1
20070213087	Laroia et al.	Sep 2007	A1
20070230593	Eliaz et al.	Oct 2007	A1
20070258517	Rollings et al.	Nov 2007	A1
20070291719	Demirhan et al.	Dec 2007	A1
20080002789	Jao et al.	Jan 2008	A1
20080049598	Ma et al.	Feb 2008	A1
20080080644	Batruni	Apr 2008	A1
20080130716	Cho et al.	Jun 2008	A1
20080130788	Copeland	Jun 2008	A1
20080159377	Allpress et al.	Jul 2008	A1
20080207143	Skarby et al.	Aug 2008	A1
20080260985	Shirai et al.	Oct 2008	A1
20080266450	Elias et al.	Oct 2008	A1
20090003425	Shen et al.	Jan 2009	A1
20090028234	Zhu	Jan 2009	A1
20090075590	Sahinoglu et al.	Mar 2009	A1
20090086808	Liu et al.	Apr 2009	A1
20090122854	Zhu et al.	May 2009	A1
20090185612	McKown	Jul 2009	A1
20090213908	Bottomley	Aug 2009	A1
20090245226	Robinson	Oct 2009	A1
20090290620	Tzannes et al.	Nov 2009	A1
20090323841	Clerckx et al.	Dec 2009	A1
20100002692	Bims	Jan 2010	A1
20100034253	Cohen	Feb 2010	A1
20100039100	Sun et al.	Feb 2010	A1
20100062705	Rajkotia et al.	Mar 2010	A1
20100074349	Hyllander et al.	Mar 2010	A1
20100166050	Aue	Jul 2010	A1
20100172309	Forenza et al.	Jul 2010	A1
20100202505	Yu et al.	Aug 2010	A1
20100202507	Allpress et al.	Aug 2010	A1
20100203854	Yu et al.	Aug 2010	A1
20100208774	Guess et al.	Aug 2010	A1
20100215107	Yang	Aug 2010	A1
20100220825	Dubuc et al.	Sep 2010	A1
20100278288	Panicker et al.	Nov 2010	A1
20100284481	Murakami et al.	Nov 2010	A1
20100309796	Khayrallah	Dec 2010	A1
20100329325	Mobin et al.	Dec 2010	A1
20110051864	Chalia et al.	Mar 2011	A1
20110064171	Huang et al.	Mar 2011	A1
20110074500	Bouillet et al.	Mar 2011	A1
20110074506	Kleider et al.	Mar 2011	A1
20110075745	Kleider	Mar 2011	A1
20110090986	Kwon et al.	Apr 2011	A1
20110134899	Jones, IV et al.	Jun 2011	A1
20110150064	Kim et al.	Jun 2011	A1
20110164492	Ma et al.	Jul 2011	A1
20110170630	Silverman	Jul 2011	A1
20110188550	Wajcer et al.	Aug 2011	A1
20110228869	Barsoum et al.	Sep 2011	A1
20110243266	Roh	Oct 2011	A1
20110275338	Seshadri et al.	Nov 2011	A1
20110310823	Nam et al.	Dec 2011	A1
20110310978	Wu et al.	Dec 2011	A1
20120051464	Kamuf et al.	Mar 2012	A1
20120106617	Jao et al.	May 2012	A1
20120163489	Ramakrishnan	Jun 2012	A1
20120177138	Chrabieh	Jul 2012	A1
20120207248	Ahmed et al.	Aug 2012	A1
20130028299	Tsai	Jan 2013	A1
20130044877	Liu et al.	Feb 2013	A1
20130121257	He et al.	May 2013	A1
20130343480	Eliaz	Dec 2013	A1
20130343487	Eliaz	Dec 2013	A1
20140036986	Eliaz	Feb 2014	A1
20140098907	Eliaz	Apr 2014	A1
20140098915	Eliaz	Apr 2014	A1
20140105267	Eliaz	Apr 2014	A1
20140105268	Eliaz	Apr 2014	A1
20140105332	Eliaz	Apr 2014	A1
20140105334	Eliaz	Apr 2014	A1
20140108892	Eliaz	Apr 2014	A1
20140133540	Eliaz	May 2014	A1
20140140388	Eliaz	May 2014	A1
20140140446	Eliaz	May 2014	A1
20140146911	Eliaz	May 2014	A1
20140161158	Eliaz	Jun 2014	A1
20140161170	Eliaz	Jun 2014	A1

Foreign Referenced Citations (1)

Number	Date	Country
2013030815	Mar 2013	WO

Non-Patent Literature Citations (37)

Entry
Al-Dhahir, Naofal et al., “MMSE Decision-Feedback Equalizers: Finite-Length Results” IEEE Transactions on Information Theory, vol. 41, No. 4, Jul. 1995.
Cioffi, John M. et al., “MMSE Decision-Feedback Equalizers and Coding—Park I: Equalization Results” IEEE Transactions onCommunications, vol. 43, No. 10, Oct. 1995.
Eyuboglu, M. Vedat et al., “Reduced-State Sequence Estimation with Set Partitioning and Decision Feedback” IEEE Transactions onCommunications, vol. 36, No. 1, Jan. 1988.
Equalization: The Correction and Analysis of Degraded Signals, White Paper, Agilent Technologies, Ransom Stephens V1.0, Aug. 15, 2005 (12 pages).
Modulation and Coding for Linear Gaussian Channels, G. David Forney, Jr., and Gottfried Ungerboeck, IEEE Transactions of Information Theory, vol. 44, No. 6, Oct. 1998 pp. 2384-2415 (32 pages).
Intuitive Guide to Principles of Communications, www.counplextoreal.com, Inter Symbol Interference (ISI) and Root raised Cosine (RRC) filtering, (2002), pp. 1-23 (23 pages).
Chan, N., “Partial Response Signaling with a Maximum Likelihood Sequence Estimation Receiver” (1980). Open Access Dissertations and Theses. Paper 2855, (123 pages).
The Viterbi Algorithm, Ryan, M.S. and Nudd, G.R., Department of Computer Science, Univ. of Warwick, Coventry, (1993) (17 pages).
R. A. Gibby and J. W. Smith, “Some extensions of Nyquist's telegraph transmission theory,” Bell Syst. Tech. J., vol. 44, pp. 1487-1510, Sep. 1965.
J. E. Mazo and H. J. Landau, “On the minimum distance problem for faster-than-Nyquist signaling,” IEEE Trans. Inform. Theory, vol. 34, pp. 1420-1427, Nov. 1988.
D. Hajela, “On computing the minimum distance for faster than Nyquist signaling,” IEEE Trans. Inform. Theory, vol. 36, pp. 289-295, Mar. 1990.
G. Ungerboeck, “Adaptive maximum-likelihood receiver for carrier modulated data-transmission systems,” IEEE Trans. Commun., vol. 22, No. 5, pp. 624-636, May 1974.
G. D. Forney, Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. 18, No. 2, pp. 363-378, May 1972.
A. Duel-Hallen and C. Heegard, “Delayed decision-feedback sequence estimation,” IEEE Trans. Commun., vol. 37, pp. 428-436, May 1989.
M. V. Eyubog •Iu and S. U. Qureshi, “Reduced-state sequence estimation with set partitioning and decision feedback,” IEEE Trans. Commun., vol. 36, pp. 13-20, Jan. 1988.
W. H. Gerstacker, F. Obernosterer, R. Meyer, and J. B. Huber, “An efficient method for prefilter computation for reduced-state equalization,” Proc. of the 11th IEEE Int. Symp. Personal, Indoor and Mobile Radio Commun. PIMRC, vol. 1, pp. 604-609, London, UK, Sep. 18-21, 2000.
W. H. Gerstacker, F. Obernosterer, R. Meyer, and J. B. Huber, “On prefilter computation for reduced-state equalization,” IEEE Trans. Wireless Commun., vol. 1, No. 4, pp. 793-800, Oct. 2002.
Joachim Hagenauer and Peter Hoeher, “A Viterbi algorithm with soft-decision outputs and its applications,” in Proc. IEEE Global Telecommunications Conference 1989, Dallas, Texas, pp. 1680-1686,Nov. 1989.
S. Mita, M. M Izumita, N. Doi, and Y. Eto, “Automatic equalizer for digital magnetic recording systems” IEEE Trans. Magn., vol. 25, pp. 3672-3674,1987.
E. Biglieri, E. Chiaberto, G. P. Maccone, and E. Viterbo, “Compensation of nonlinearities in high-density magnetic recording channels,” IEEE Trans. Magn., vol. 30, pp. 5079-5086, Nov. 1994.
W. E. Ryan and A. Gutierrez, “Performance of adaptive Volterra equalizers on nonlinear magnetic recording channels,” IEEE Trans. Magn., vol. 31, pp. 3054-3056, Nov. 1995.
X. Che, “Nonlinearity measurements and write precompensation studies for a PRML recording channel,” IEEE Trans. Magn., vol. 31, pp. 3021-3026, Nov. 1995.
O. E. Agazzi and N. Sheshadri, “On the use of tentative decisions to cancel intersymbol interference and nonlinear distortion (with application to magnetic recording channels),” IEEE Trans. Inform. Theory, vol. 43, pp. 394-408, Mar. 1997.
Miao, George J., Signal Processing for Digital Communications, 2006, Artech House, pp. 375-377.
Xiong, Fuqin. Digital Modulation Techniques, Artech House, 2006, Chapter 9, pp. 447-483.
Faulkner, Michael, “Low-Complex ICI Cancellation for Improving Doppler Performance in OFDM Systems”, Center for Telecommunication and Microelectronics, 1-4244-0063-5/061$2000 (c) 2006 IEEE. (5 pgs).
Stefano Tomasin, et al. “Iterative Interference Cancellation and Channel Estimation for Mobile OFDM”, IEEE Transactions on Wireless Communications, vol. 4, No. 1, Jan. 2005, pp. 238-245.
Int'l Search Report and Written Opinion for PCT/IB2013/01866 dated Mar. 21, 2014.
Int'l Search Report and Written Opinion for PCT/IB2013/001923 dated Mar. 21, 2014.
Int'l Search Report and Written Opinion for PCT/IB2013/001878 dated Mar. 21, 2014.
Int'l Search Report and Written Opinion for PCT/IB2013/002383 dated Mar. 21, 2014.
Int'l Search Report and Written Opinion for PCT/IB2013/01860 dated Mar. 21, 2014.
Int'l Search Report and Written Opinion for PCT/IB2013/01970 dated Mar. 27, 2014.
Int'l Search Report and Written Opinion for PCT/IB2013/01930 dated May 15, 2014.
Int'l Search Report and Written Opinion for PCT/IB2013/02081 dated May 22, 2014.
Supplementary European Search Report for EP 13807399 dated Nov. 20, 2015.
Adama A., et al., “Design of Low Intersymbol Interference Partial Response Data Transmission Filters”, IEE Proceedings G. Electroic Circuits & Systems, Instit. of Elec. Eng. Stevenage, GB, vol. 133, No. 4, Aug. 1, 1986, pp. 195-202, XP000853659 ISSN: 0622-0039.

Related Publications (1)

	Number	Date	Country
	20140328428 A1	Nov 2014	US

Provisional Applications (4)

Number	Date	Country
61747132	Dec 2012	US
61729774	Nov 2012	US
61726099	Nov 2012	US
61662085	Jun 2012	US

Continuations (1)

	Number	Date	Country
Parent	13755972	Jan 2013	US
Child	14291065		US

Multi-mode transmitter for highly-spectrally-efficient communications

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

CPC

International Classifications

Disclaimer

Abstract