The present invention relates to modulation of digital data for signal transmission and corresponding demodulation of received signals to recover digital data carried thereby, and relates especially to the particular type of modulation used to encode the data, such as pulse-duration (width) modulation (PDM or PWM), on/off keying, non-return-to-zero (NRZ) schemes, differential phase-shift keying (DPSK), multiple-frequency-shift keying (MFSK), and various forms of multi-bit/N-ary encoding.
Communication signals are typically classified according to modulation type. Each of the various forms of modulation has its own set of advantages and disadvantages relative to a specific application for which it will be used. Some factors to consider in choosing a particular form of modulation include bandwidth, power consumption requirements, and the potential for signal propagation errors and recovery of the original information. For digital data, whether a separate clock signal is required or the modulated signal is self-clocking may be important. The relative simplicity or complexity of the modulating and demodulating equipment or circuitry may also be a factor in the decision. Low power consumption is particularly sought for use with capacitive-loaded transmission lines.
Each type of modulation has specialized encoder circuitry for performing the modulation. For example, U.S. Pat. No. 6,439,679 to Roylance discloses a pulse width modulator (PWM) circuit that includes a clock delay circuit with multiple taps, a tap selection circuit making a selection based on a pulse code input, and a transition generating circuit that generates the PWM output from the selected delayed clock. The pulse code input is interpreted by a timing instruction processing instruction circuit that generates a corresponding vector output that indicates when timing transitions associated with the PWM output should occur.
U.S. Pat. No. 5,442,664 to Rust et al. describes a modulator used for RF interference reduction that produces clock pulses with a series of different phase displacements by using a delay chain with a plurality of taps to provide various phase delays of a clock, an up/down counter serving as a selector module that sequentially renders active different ones of its output lines, and a multiplexer circuit made up of AND gates with one input receiving the various delayed clocks and another input receiving the selector output lines and OR gates propagating the selected delayed clock to the output.
The present invention is a dual phase pulse modulation (DPPM) encoder circuit that encodes data as a series of high and low signal pulses each of whose durations or “pulse widths” represent groups of M data bits. The encoder circuit includes means for receiving data words, means for subdividing the data words into an ordered sequence of groups of M data bits each, means for specifying successive time durations for each signal pulse based on the received groups, and means for producing alternately high and low signal pulses with the specified time durations. In particular, each of the possible 2M data values of an M-bit group corresponds to a unique one of 2M distinct time durations. The high signal pulses and the low signal pulses separately represent successive symbols.
More particularly, the encoder circuit may be implemented with a parallel data input bus supplying data words to a set of M parallel-in, serial-out shift registers that receive unique subsets of bits of the data and then synchronously shift out the M-bit groups of data bits to a state machine. The state machine may implement the specifying of successive time durations of the signal pulses by incrementing its state by an amount that corresponds to the duration for each received M-bit group, and outputting a control signal that indicates the selected signal pulse transition times. A delay chain circuit with a plurality of parallel taps provides a system clock with various delay times corresponding to possible pulse transition times. A multiplexer may select successive delayed system clocks according to the control signal from the state machine, with the multiplexer's selection triggering transitions of a toggle flip-flop whose output forms the generated DPPM signal.
a and 2b are graphical illustrations of DPPM pulse trains in accord with the present invention for a set of exemplary data, showing transmission of a series of 9 high and low going pulses within a single 100 ns system clock period.
The present invention is an encoder circuit (an embodiment of which is shown in
“Dual Phase” refers to the fact that the information is sent as both the high-going pulses and the low-going pulses. Most pulse width modulation schemes simply vary the width of the high going pulse and therefore are really modulating the duty cycle. DPPM independently modulates the width of both high and low going pulses, with different groups of bits encoded in the high and low portions of each “cycle.” Therefore, clock period and duty cycle are not valid concepts with respect to the generated pulse train. DPPM is by its nature “clockless,” meaning the data can be decoded by simply detecting the width of the pulse with respect to each transition. This means that no clock need be sent with the data, nor must a clock be encoded and recovered from the data. This is a major advantage when transmitting time critical bursts between different chips, since it removes the necessity of manipulating a clock which would introduce opportunity for timing variance and error. The only clock consideration is the fact that several pulse “cycles” will be sent within each system clock period. For example,
Since information is sent on both positive and negative phases of the pulse train, DPPM is by its nature a non-return-to-zero (or non-return-to-one) modulation scheme. However, it is typically desired that the sequence of pulses contained within a system clock period return to zero (or one) at the end of each such sequence. This preference is most easily implemented when, as in the
Thus, the DPPM method represents groups of M data bits, such as dibits (M=2), as signal pulses of specified widths. Each of the 2M possible data values corresponds to one of 2M distinct pulse widths, and successive groups of M data bits are represented by signal pulses that are alternately high and low. Signal encoding and decoding circuitry performs the conversion between the data bit and signal pulse representations of the information content.
For encoding data bits as signal pulses, received data words are first subdivided into an ordered sequence of groups of M data bits, then each group in the sequence is converted into its corresponding signal pulse representation, thus producing a series of high and low signal pulses that represent the data. One way to perform the conversion of data words into signal pulses is to specify signal pulse transition times, each corresponding to a preceding transition time that is incremented by a specified pulse width corresponding to a present group of M data bits, and then producing signal pulse transitions at those specified transition times. The exemplary encoder hardware that is described below with reference to
For decoding a DPPM signal back into data, the pulse width for each of the high and low signal pulses is determined, then converted back into an ordered sequence of groups of M data bits, and recombined into data words. One way to perform this conversion is carried out by the exemplary decoder hardware set forth in the following description with reference to
An Encoder Circuit in Accord with the Present Invention:
With reference to
The circuit takes the received data on the odd and even data buses 11A and 11B and, synchronously to the system clock, loads it into two parallel-in, serial-out shift registers 13A and 13B. The odd bits (i.e., bits 1, 3, 5, 7, 9, 11, 13, 15, and 17) are loaded from bus lines 11A into the other shift register 13A (Shift Reg Odd). The even bits (i.e., bits 0, 2, 4, 6, 8, 10, 12, 14, and 16) are loaded from bus lines 11B into one shift register 13B (Shift Reg Even).
The contents of the registers are then serially shifted out in pairs 15A and 15B. A Shift Clock pulse fed from the multiplexer output 29 ensures that successive shifts of data out of the registers 13A and 13B are synchronized to the end of each DPPM signal pulse. In this way, the data words are subdivided into an ordered sequence of groups of M data bits each (here, M=2). If the data were to be divided instead into groups of three or four bits each, then the input bus 11 would typically be divided into three or four parts loading into three or four shift registers, each shift register providing one of the bits of each group on its serial output.
The register outputs 15A and 15B are connected to an input 17 to a state machine 19, whose N-bit output 21 is a function of its current value and the 2-bit pair to be encoded. In particular, the state machine 19 iteratively increments its state by an amount corresponding to the pulse widths for the successive 2-bit pairs received at state machine input 17. The N-bit output 21 has only one active bit and is used as an input 23 to control an multiplexer 25 for selecting the successive taps from the current-controlled delay chain 27. The multiplexer output 29 is used to clock a toggle flip-flop 31 and thus encode the data on its output 33 as a series of high and low pulses whose width represents the value of the 2-bit pair.
An edge detector circuit 14, which may be any known edge detector, issues a start pulse of 2 to 3 ns duration at each rising edge of the system clock, Sys_Clock. The start pulse resets the state machine 19 to a first tap selection state (tap_select[44:1]=0 and tap_select[0]=1). The start pulse also sets the toggle flip-flop 31 to its ‘set’ state (output high). A 1 ns pulse synchronous to the system clock is presented on input 12 to the start of a 92-element delay chain 27. A first delay element 26, shown separately, takes into account the time involved in loading the shift registers 13A and 13B and presenting the first pair of data bits to the state machine 19.
Each element in the delay chain 27 is here calibrated to have a 1 ns delay. Therefore, the pulse takes 92 ns to travel down the delay chain. Assuming that a first DPPM signal transition occurs at a time delay of 2 ns (corresponding to tap_select[0]), the delay chain's size corresponds to the maximum total time needed to represent a complete 18-bit word as a series of DPPM signal pulses, when using the set of pulse widths described above for
The least significant bits in the two shift registers 13A and 13B represent the current bit pair to be encoded and are input from lines 17 into a tap selector state machine 19. This state machine 19 selects a tap point for the 92-element delay chain 27. The pulse widths may be 4, 6, 8, or 10 ns for the four possible bit pairs, in which case the valid tap points are only on the even delay elements, so that there are 46 valid tap points in this implementation. (However, the choice of pulse widths is arbitrary and another set of pulse widths could be chosen. The choice of pulse widths is based on the need to provide enough separation such that the decoder can accurately distinguish between them. “Enough” is determined by factors such as desired noise/error margin, amount of noise in the system, and characteristics of the technology used, including process variation, switching speed, and setup/hold requirements.)
The tap point selection 21 is incremented based on the present tap point (STATE(i)) and the next 2-bit data (DATA[1:0]) to be encoded. The tap selects are preferably implemented as a one-shot state machine 19—essentially a shift register capable of multiple shifts per cycle—where a single active state is incremented by 2, 3, 4, or 5 positions on each clock, depending upon the 2-bit data value input from data lines 17. While requiring a register for every state is area-inefficient, this implementation allows for extremely fast switching of states and therefore quick control of the multiplexer 25. There is a one-to-one correspondence between the tap selection 21 that is output from the state machine 19 and the delay chain tap, T2 through T92, that is selected by the multiplexer 25. The timing is such that the tap point must increment to the next value before the rising edge propagating down the delay chain reaches the next tap point.
The tap point selection 21 is the selector control 23 for the multiplexer 25. The output 29 of the multiplexer 25 is a 1 ns pulse that occurs once at each selected tap point. This multiplexer output 29 clocks a toggle flip-flop 31 and also forms the Shift Clock pulse that shifts the data in the shift registers 13A and 13B and clocks the state machine 19 from one state to the next. The output 33 of the toggle flip-flop 31 is the DPPM output of the entire encoder circuit of
A Decoder Circuit for Use with the Present Invention:
With reference to
In general, the value of the data is determined by detecting the pulse widths with respect to the leading edge of each pulse. The modulated signal representing the data is piped through a short delay chain and outputs are used to clock and sample the non-delayed signal. As a result, the decoding requires no independent or recovered clock. More specifically, the serial-to-parallel DPPM data decoder includes two delay chains 49 and 50, each having K−1 outputs representing different stages of the delay chain, where K is the number of different delay values representing encoded data. For 2-bit encoding, K=4 (for 3-bit encoding, K=8, etc).
Returning to
As seen in
The logic AND gates 63–66 convert the sampled pulse values that are output from the flip-flops 51B–51D and 52B–52D on lines 57B–57D and 58B–58D into their corresponding data values.
It can be seen that dual phase pulse modulation (DPPM) allows pulse widths to be decoded with respect to the leading edges of pulses, and therefore does not require a clock. This means that no extra clock lines, clock encoding, or clock recovery circuits are required on the receiver. In fact, because delayed versions of the data pulses are actually used to clock (or sample) the incoming non-delayed data pulses, this decoding technique produces an added benefit of eliminating the possibility of introducing error when manipulating or recovering a clock.
This application claims the benefit under 35 U.S.C. 119(e) from U.S. provisional application No. 60/510,738, filed on Oct. 10, 2003.
Number | Name | Date | Kind |
---|---|---|---|
4049909 | Peck | Sep 1977 | A |
4218770 | Weller | Aug 1980 | A |
RE30482 | Whitlock | Jan 1981 | E |
4408166 | Moeller | Oct 1983 | A |
4592072 | Stewart | May 1986 | A |
4641323 | Tsang | Feb 1987 | A |
4686484 | Otani | Aug 1987 | A |
4931751 | Keller et al. | Jun 1990 | A |
4951159 | Van Beek | Aug 1990 | A |
5027372 | Wong | Jun 1991 | A |
5157693 | Lemersal, Jr. et al. | Oct 1992 | A |
5175549 | Back | Dec 1992 | A |
5202643 | Sato | Apr 1993 | A |
5270714 | Tanaka et al. | Dec 1993 | A |
5379323 | Nakaya | Jan 1995 | A |
5408499 | Sasaki | Apr 1995 | A |
5428321 | Yoshida et al. | Jun 1995 | A |
5442664 | Rust et al. | Aug 1995 | A |
5506873 | Suzuki | Apr 1996 | A |
5614861 | Harada | Mar 1997 | A |
5625645 | Greier et al. | Apr 1997 | A |
5627500 | Wolaver et al. | May 1997 | A |
5652552 | Chung | Jul 1997 | A |
5696790 | Graham et al. | Dec 1997 | A |
5742135 | Horst | Apr 1998 | A |
5841816 | Dent et al. | Nov 1998 | A |
5963074 | Arkin | Oct 1999 | A |
5977821 | Shibata | Nov 1999 | A |
6025758 | Lu | Feb 2000 | A |
6094450 | Shockey | Jul 2000 | A |
6115428 | Kim | Sep 2000 | A |
6204726 | Toshinori | Mar 2001 | B1 |
6255866 | Wolaver et al. | Jul 2001 | B1 |
6297691 | Anderson et al. | Oct 2001 | B1 |
6429693 | Staszewski et al. | Aug 2002 | B1 |
6439679 | Roylance | Aug 2002 | B1 |
6473252 | Graham | Oct 2002 | B1 |
6778491 | Fourcand et al. | Aug 2004 | B1 |
20030035496 | Noda | Feb 2003 | A1 |
20030053521 | Huang et al. | Mar 2003 | A1 |
20030198478 | Vrazel et al. | Oct 2003 | A1 |
Number | Date | Country | |
---|---|---|---|
20050078021 A1 | Apr 2005 | US |
Number | Date | Country | |
---|---|---|---|
60510738 | Oct 2003 | US |