DIGITAL RESOLUTION ENHANCEMENT FOR HIGH SPEED DIGITAL-TO-ANALOG CONVERTERS
20200287560 ยท 2020-09-10
Inventors
Cpc classification
H03M1/661
ELECTRICITY
H04B1/0475
ELECTRICITY
International classification
Abstract
A method for increasing the effective resolution of digital-to-analog conversion for the purpose of digital pre-distortion to compensate distortions of a communication channel, according to which a digital sequence of N samples x(n) to be transmitted over the communication channel are received and several quantization possibilities are generated by performing Soft Quantization (SQ) on each sample, using a soft quantizer, where low computational complexity is maintained by limiting the number of SQ possibilities. The Instantaneous costs for each possible SQ error is computed and converging paths in the Trellis diagram, which represents possible states and transitions between them, for each sample is eliminated. Then the averaged errors for each remaining path are computed and Hard-Quantization is performed to eliminate converging paths and to keep a constant number of states. These steps are repeated N times, one time for each sample and the optimal path with the lowest averaged error selecting. Then the sequence associated with the optimal path is fed into the DAC.
Claims
1. A method for increasing the effective resolution of digital-to-analog conversion for the purpose of digital pre-distortion to compensate distortions of a communication channel, comprising: a) receiving a digital sequence of N samples x(n) to be transmitted over said communication channel; b) generating several quantization possibilities by performing Soft Quantization (SQ) on each sample, using a soft quantizer; c) maintaining low computational complexity by limiting the number of SQ possibilities; d) computing the instantaneous costs for each possible SQ error by a path metric block; e) for each sample, eliminating converging paths in the Trellis diagram, which represents possible states and transitions between them, for each sample; f) computing the averaged errors for each remaining path; g) performing Hard-Quantization to eliminate converging paths and to keep a constant number of states; h) repeating steps b) to g) above N times, one time for each sample; i) selecting the optimal path having the lowest averaged error; and j) feeding the sequence associated with said optimal path into said DAC.
2. A method according to claim 1, wherein elimination is performed by using a Viterbi algorithm.
3. A method according to claim 1, wherein elimination is performed by using Maximum-Likelihood Sequence-Estimation (MLSE).
4. A method according to claim 1, wherein the complexity is reduced by using channel shortening filters that reduce the number of channel taps.
5. A method according to claim 1, wherein the quantization noise is shaped to be inversely related to the channel response.
6. A method according to claim 1, wherein the quantization noise is centered at the far ends of the spectrum.
7. A method according to claim 1, wherein the communication channel is an optical communication channel.
8. A method according to claim 1, wherein the communication channel is selected from one or more of the following: an ADSL communication channel; a wireless communication channel; a cellular communication channel; a WiFi channel.
9. A method according to claim 1, wherein feeding the sequence associated with the optimal path into the DAC reduces the quantization noise associated with said DAC, at the output of the communication channel.
10. A method according to claim 9, wherein feeding the sequence associated with the optimal path into a DAC with lower resolution maintains the quantization noise at the output of the communication channel.
11. Apparatus for compensating communication channel distortions by dynamic pre-distortion of Digital-to Analog conversion performed by a DAC before transmission over said communication channel, comprising: a) a DSP circuit, adapted to generate a digital sequence of N samples x(n) to be transmitted over said communication channel; b) a soft quantizer for generating several quantization possibilities by performing Soft Quantization (SQ) on each sample, said DSP circuit is further adapted to: maintain low computational complexity by limiting the number of SQ possibilities; compute the instantaneous costs for each possible SQ error by a path metric block in said DSP circuit; eliminate converging paths in the Trellis diagram, which represents possible states and transitions between them for each sample; compute the averaged errors for each remaining path; eliminate converging paths, to keep a constant number of states; repeat the preceding steps N times, one time for each sample; select the optimal path having the lowest averaged error; and feed the sequence associated with said optimal path into said DAC.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0021] In the drawings:
[0022]
[0023]
[0024]
[0025]
[0026]
[0027]
[0028]
[0029]
[0030]
DETAILED DESCRIPTION OF THE INVENTION
[0031] The present invention proposes a Dynamic Quantization (DQ) method using a Digital-Resolution-Enhancer (DRE), which mitigates the quantization distortion effects of prior art methods. This method is mostly directed to digital pre-compensation, and is based on the assumption that quantization is a non-linear deterministic operation (rather than the conventionally assumed white noise), implying that its impact on transmission can be anticipated and minimized. The proposed DRE improves the signal-to-quantization-noise-ratio (SQNR) by up to 8 dB. Thus, the DPC can be applied with reduced number of DAC's bits. Conversely, the DRE can enable the use of more complex DPC and more complex transmission (with higher QAM orders) schemes using the same DACs hardware, and consequently achieve extended reaches and higher transmission rates.
[0032]
where is the filter roll-off factor (steepness of its transmission function with frequency) and Ts is the symbol duration. By denoting the information bearing signal (symbols sequence) as s(n), the pulsed shaped signal can be written as z(n)=s(n)*hps(n), where hps(n) is the sampled RRC filter and * is the convolution operator. A DPC filter P(f) 12 is applied on z(n) to mitigate the channel low-pass response, resulting in the pre-compensated signal x(n). The general assumption is that the channel response Hc(f) is known at the transmitter and is used to optimize the DPC filter 12. {circumflex over ()}s(n) is the estimated symbol sequence.
[0033] The DPC frequency response, which was derived in [8] and has been used for the proof-of-concept, is given by
where .sub.0 is chosen to balance the trade-off between the bandwidth compensation and the amount of quantization errors. The proposed solution incorporates a DRE block 13, which implements the DQ algorithm, to transform the signal x(n) the DRE quantized digital signal Q [x (n)]=x.sub.q(n) which is fed to the DACs. The quantization error for each sample is given by q(n)=x.sub.q(n)x(n).
[0034] The electrical path includes DACs 14a and 14b, which are modeled as zero order hold interpolators (the quantization is obtained at the DRE 13), followed by a low-pass-filter (not shown), and analog drivers 15a and 15b. The electrical-to-optical conversion is applied using an IQ Mach-Zehnder Modulator (MZM) 16, which feeds the modulated optical signal into a Standard Single-Mode Fiber (SSMF) 17.
[0035] At the receiver Rx, the optical input is detected by an Integrated Coherent Receiver (ICR) 18 and amplified by using a linear Trans-Impedance Amplifier (TIA). The electrical signal is then sampled by high resolution ADCs 20a and 20b, and then fed to the receiver DSP block 21, which implements standard coherent algorithms. The ADCs quantization is modeled according to the present invention as additive noise, according to [14]. To evaluate the performance of the DRE 13, a new Figure-Of-Merit (FOM) is proposed, which captures the impact of quantization distortion at the receiver-side, while incorporating the channel response. A Matched Filter (MF) Mean-Squared-Quantization Error (MSQE) criterion is suggested to assess the quantization contribution to the Matched Filter Mean-Squared-Error (MF-MSE):
MF-MSQE=E[|(y.sub.q(n)y(n))*h.sub.ps(n)|.sup.2],(3)
where y(n) represents the discrete time samples at the channel output, without DACs quantization, and y.sub.q(n) represents the discrete time samples at the channel output, with DACs quantization (i.e., the received signal with digital-to-analog conversions).
[0036] Low Resolution DPC Based on Dynamic Quantization
[0037] Typically, DACs quantization is obtained as a round-off between each digital sample and its nearest analog value. Under certain conditions, the resulting error can be modeled as uniformly distributed white noise [14] [16]. However, modeling quantization error as noise completely disregards the fact that quantization is inherently a non-linear deterministic function. As the effect of quantization can be directly calculated, its impact on the system performance can be analytically derived and minimized.
[0038] The present invention proposes a novel algorithm, which optimizes the quantization decisions, based on the MF-MSQE criterion defined in Eq. 3. It is assumed that the channel generates correlation between successive quantization errors and therefore, the optimal error sequence is not necessarily white. Instead, the optimal error sequence should be inversely matched to channel, through which it is transmitted. Specifically, in the case of transmission over bandwidth limited channels, better performance can be achieved when the low frequency components of the quantization noise are suppressed on the expense of the enhancement of the high out-off-band frequencies. This noise spectral shaping leads to significant improvement, as the errors are naturally suppressed by the channel low-pass response.
[0039] Mathematically, the MF-MSQE is evaluated using the effective quantization error, obtained as the resultant error after applying MF at the receiver:
q.sub.eff(n)=q(n)*h(n),(4)
where h(n) is the combined Channel Impulse Response (CIR) of the channel hc(n), and the pulse shape filter hps(n), i.e. h(n)=hc(n)*hps(n). It is assumed that h(n) is finite impulse-response (FIR) filter, with L significant taps. Using these notations, the instantaneous cost of each quantization decision (i.e., of possible SQ error) can be written as
which can be directly related to the MF-MSQE from Eq. 3 via
MF-MSQE=E[J(n)].(6)
[0040] From equations 5-6, it is concluded that quantization decisions should not be viewed independently, as their actual impact on the MF-MSQE is also affected by previous decisions, and each decision impacts both current and future costs.
[0041] Dynamic Quantization
[0042] Eq. 6 shows the problem of dynamic quantizer design, where each quantization decision has a direct instantaneous cost and the performance is measured over its expectation (the expected value of a random variable). The objective is to balance the trade-off between the instantaneous cost of each decision and its impact on future costs, acknowledging the probability that greedy decisions may be destructive for the averaged cost, which is equivalent to the MF-MSQE. Optimization is performed by allowing the quantizer to make structured decisions, which are not necessarily constrained by trivial decisions. The conventional round-off error is replaced by the DQ error
q.sub.dq(n)=q.sub.ro(n)+u(n).Math.,(7)
which is a sum of the round-off error q.sub.ro(n), and a control parameter u(n). describes the quantizer step size (i.e. the analog distance between two neighboring output levels). To ensure finite and discrete outputs, u(n) must satisfy
u(n) and c.sub.minq.sub.ro(n)+u(n).Math.c.sub.max(8)
where c.sub.min and c.sub.max are the quantizer minimal and maximal values, respectively. Referring to the DQ problem, it is desired to find the optimal control sequence u.sub.opt=(u.sub.opt(0), u.sub.opt(1), . . . u.sub.opt(N1)) for arbitrary sequence length N (i.e., a digital sequence of N samples x(n)), such that the Mean-Squared Quantization Error (MSQE) described in Eq. 6 is minimized. Generally, the DAC should have sufficient separate levels, in order not to degrade performance due to quantization noise.
[0043]
[0044] This decorrelation property significantly simplifies the solution to the DQ problem. Since the round-off quantization error is essentially independent on the inputs, generic solution can be derived. Once the problem is well formulated, optimal solution can be obtained by applying DP algorithms [19] that are based on converging paths, such as the Viterbi algorithm.
[0045] Digital Resolution Enhancer
[0046] The digital resolution enhancer (DRE) block 13 solves the DQ problem efficiently by implementing a block-wise low-complexity Viterbi algorithm.
[0047]
[0048] To maintain low computational complexity, one can limit the number of SQ possibilities by constraining u(n) to a smaller subset than the one described in Eq. 8. Selecting a limited number of options, such as u(n){1,0,1}, results in a significant improvement. As a second step, path metric block computes the instantaneous costs J(n) for each possible sample, and the averaged errors for each of the surviving Viterbi paths. The optimal path with the lowest averaged error is selected, and the sequence associated with this optimal path is fed into the DAC.
[0049] At the Hard-Quantization (HQ) block, converging paths are eliminated to keep a constant number of states, so as to enable feasible hardware implementation. The complexity of the algorithm can be estimated similarly to other method that are based on Viterbi algorithm such as maximum-likelihood sequence-estimation (MLSE) [18], [22], [23]. The required number of calculation is approximated as M.sup.L.Math.N, where M is the number of SQ possibilities (M=3 was considered in this example), L is the number of channel taps and N is the length of the sequence. The complexity can be significantly reduced by using channel shortening filters, that reduces the number of channel taps [23], [24], or by reducing the number of states [25]. In addition the algorithm can be applied on truncated sequences for reduced latency, where using N5.Math.L is expected to yield near-optimal performance [22].
[0050] For example, if the channel memory is memory length L=3, after receiving 3 samples there are 3.sup.3=27 possibilities, which are 27 paths in the Trellis diagram. After receiving the 4 sample, the number of possibilities increases to be 3.sup.4=81 possibilities, so the number of required average error calculations will be 81. This number is reduced back to 27 by hard quantization, by eliminating converging paths in the Trellis diagram. These calculations and elimination are repeated N times (as the size of the input sequence) until only one path is left, which is the optimal path.
[0051] An inclusive set of Monte-Carlo simulations were carried out to evaluate the performance of the proposed method. The model is based on typical coherent systems.
[0052] The main channel impairment considered here was the limited bandwidth of the electrical and opto-electric components, which was modeled as a 3rd order Bessel Low-Pass-Filter (LPF) with 3 dB attenuation at 16 GHz. The transmitter consisted of an RRC filter with roll-off factor =0.2, followed by a DPC filter, as described in Eq. 2. The performance of the algorithm was measured by comparing the SNR at the receiver, after linear equalization with and without the DRE block, i.e. by comparing the DRE with the conventional round-off quantizer. The post-equalization is performed to mitigate the residual ISI, and optimize the SNR performance. Thus, the effect of DACs quantization could be measured accurately.
[0053] Spectral Response of the DRE Quantization Noise
[0054]
[0055] SNR Results
[0056]
[0057] Since the method proposed by present invention reduces the quantization noise, it improves performance. Therefore, is possible to work with DACs with lower resolution and get performance like working with DACs with higher resolution (for example, by using the proposed method, a DAC with 6 bit resolution may provide performance like a DAC with 8 bit resolution)
[0058] Experimental Results
[0059] Electrical Back-to-Back (BTB) Transmission
[0060] The foregoing results were verified in electrical BTB transmission. 45 Gbaud QAM-64 signal was obtained using 64 Gsamp/sec DACs and ADCs [26]. RRC filter with roll-off factor of =0.15 and pre-compensation filter were implemented at the transmitter. A 64 taps linear equalizer has been incorporated in the receiver.
[0061]
[0062]
[0063]
[0064] Optical Back-to-Back Transmission
[0065] The optical BTB setup is as described in
TABLE-US-00001 TABLE 1 Component Parameter Value TX DSP Modulation QPSK Pulse shape RRC, = 0.15 Pre-emphasis DAC Sample rate 64 Gsamp/s Analog bandwidth 16 GHz Resolution 4 out of 8 nominal bits Memory (N) 2.sup.15 Driver Analog bandwidth 20 GHz Gain 30 dB Modulator Type Dual-parallel MZM Analog bandwidth 25 GHz Extinction ratio 15 dB V.sub. 7 V (@20 GHz) ECL Linewidth 100 KHz Output power +15.5 dBm .sub.p (public ch.) 193.200 THz ADC Sample rate 64 Gsamp/s Analog bandwidth 16 GHz Resolution 8 bits Memory (N) 2.sup.17 ICR Analog bandwidth 22 Ghz Responsivity 0.06 A/W Noise current PSD 17 pA/(Hz).sup.2 RX DSP Synchronization CPE and frequency estimation Linear equalizer 64 taps Non-linear Volterra Memory polynomial non- equalizer linearity order 5, memory depth 3
[0066] The measured optical setup bandwidth is much more aggressive in this case, with 3 dB attenuation at <5 GHz, as shown in
[0067] The method proposed by the present invention provides a novel dynamic quantization (DQ) approach using DRE, to overcome the DAC resolution limitation. The proposed approach is based on the assumption that quantization is a nonlinear deterministic operation [18].
[0068] By using deterministic modeling, the new Figure-Of-Merit (FOM) is made available to evaluate the quantization effect on the system performance. The new FOM incorporates the channel response and is used for inclusive optimizations. This optimization problem is defined as dynamic-quantization (DQ) problem and is formulated within the general framework of dynamic-programming (DP) [19] and (iii) A modified DP Viterbi algorithm of low-complexity has been developed to solve the DQ problem.
[0069] As various embodiments have been described and illustrated, it should be understood that variations will be apparent to one skilled in the art without departing from the principles herein. Accordingly, the invention is not to be limited to the specific embodiments described and illustrated in the drawings.