Source: https://patents.google.com/patent/US8718115B2/en
Timestamp: 2020-02-18 10:21:14
Document Index: 179154320

Matched Legal Cases: ['Application No. 61', 'Application No. 61', 'Application No. 61', 'Application No. 61', 'Application No. 61', 'Application No. 61']

US8718115B2 - Building, transmitting, and receiving frame structures in power line communications - Google Patents
Building, transmitting, and receiving frame structures in power line communications Download PDF
US8718115B2
US8718115B2 US13/269,487 US201113269487A US8718115B2 US 8718115 B2 US8718115 B2 US 8718115B2 US 201113269487 A US201113269487 A US 201113269487A US 8718115 B2 US8718115 B2 US 8718115B2
preamble portion
US13/269,487
US20120093198A1 (en
2010-10-08 Priority to US39138210P priority Critical
2010-11-29 Priority to US41765710P priority
2010-12-01 Priority to US41858410P priority
2011-01-10 Priority to US201161431249P priority
2011-01-12 Priority to US201161431899P priority
2011-01-20 Priority to US201161434572P priority
2011-10-10 Priority to US13/269,487 priority patent/US8718115B2/en
2011-10-10 Application filed by Texas Instruments Inc filed Critical Texas Instruments Inc
2011-12-23 Assigned to TEXAS INSTRUMENTS INC. reassignment TEXAS INSTRUMENTS INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KIM, IL HAN, VARADARAJAN, Badri N., DABAK, ANAND G., PANDE, TARKESH
2012-04-19 Publication of US20120093198A1 publication Critical patent/US20120093198A1/en
2014-05-06 Publication of US8718115B2 publication Critical patent/US8718115B2/en
This application claims the benefit of the filing date of U.S. Provisional Patent Application No. 61/391,382 titled “Preamble Structure in G.HNEM” filed Oct. 8, 2010, U.S. Provisional Patent Application No. 61/417,657 titled “Preamble Structure in G.HNEM” filed Nov. 29, 2010, U.S. Provisional Patent Application No. 61/418,584 titled “Preamble Structure in G.HNEM” filed Dec. 1, 2010, U.S. Provisional Patent Application No. 61/431,249 titled “Preamble Structure in G.HNEM” filed Jan. 10, 2011, U.S. Provisional Patent Application No. 61/431,899 titled “Preamble Structure in G.HNEM” filed Jan. 12, 2011, and U.S. Provisional Patent Application No. 61/434,572 titled “G.hnem: Proposal for Repeated SYNCH Sequences for Frame Boundary Detection” filed Jan. 20, 2011, the disclosures of which are hereby incorporated by reference herein in their entirety.
Embodiments are directed, in general, to power line communications, and, more specifically, to systems and methods of building, transmitting, and receiving frame structures in power line communications.
In an embodiment, a method may include generating a chirp sequence having a bandwidth selected, at least in part, by subtracting an excess bandwidth parameter from a low nominal frequency and adding the excess bandwidth parameter to a high nominal frequency. For example, the high and low nominal frequencies may be based, at least in part, upon a PLC standard, and the excess bandwidth parameter may be a function of a difference between the high and low nominal frequencies. The method may also include extracting a phase angle of a frequency-domain version of the chirp sequence to obtain a flattened frequency spectrum, creating a phase quantized sequence based, at least in part, upon the flattened frequency spectrum, and employing the phased quantized sequence as a symbol to generate a PLC preamble portion of a PLC frame. In some cases, creating the phase quantized sequence may include using a quantization factor smaller than another quantization factor selected based, at least in part, upon the PLC standard.
In some implementations, to employ the phased quantized sequence as the symbol to generate the PLC preamble portion, the method may further include repeating the symbol N1 times to create a first section of the PLC preamble portion, where N1 is an integer, repeating a phase inverted version of the symbol N2 times to create a second section of the PLC preamble portion, where N2 is an integer that may be different from N1, extending the first and second sections of the PLC preamble portion, and combining the first and second extended sections of the PLC preamble portion.
Moreover, to extend the first and second sections of the PLC preamble portion, the method may further include prepending the last β samples of the symbol to a first symbol of the first section of the PLC preamble portion, appending the first β samples of the symbol to a last symbol of the first section of the PLC preamble portion to create the first extended section of the PLC preamble portion, where β is less than a number of samples in the symbol (e.g., half), and windowing the first and last β samples of the first extended section of the PLC preamble portion. The method may also include prepending the last β samples of the symbol to a first symbol of the second section of the PLC preamble portion, appending the first β samples of the symbol to a last symbol of the second section of the PLC preamble portion to create second extended section of the PLC preamble portion, and windowing the first and last β samples of the second extended section of the PLC preamble portion.
To employ the phased quantized sequence as the symbol to generate the PLC preamble portion, the method may include repeating the symbol N1 times to create a first section of the PLC preamble portion, where N1 is an integer, generating another sequence independent from than the phased quantized sequence of the symbol, repeating the another sequence N2 times to create a second section of the PLC preamble portion, where N2 is an integer, and combining the first and second sections of the PLC preamble portion. For example, the another sequence may include a Zadoff-Chu sequence.
In some cases, the another sequence (e.g., a Zadoff-Chu sequence or the like) may identify a given PLC domain. Accordingly, the preambles used in all signals transmitted within a given PLC domain may each include the same sequence in their second portions (preambles used in a different PLC domain may have a different sequence in their second portions). In this manner, by examining the sequence in the second portion of a preamble, it is possible to determine to which PLC domain the signal or frame belongs. In other cases, N1 may identify the given PLC domain. That is, the number of repetitions of the symbol used in the first portion of a PLC preamble may help determine the preamble's originating domain. In yet other cases, a combination of N1 and the another sequence may identify the PLC domain.
In another embodiment, another method may include identifying a first symbol within a PLC preamble. The method may also include inserting an instance of the first symbol at a predetermined location within a PLC header portion of a PLC frame and cause the PLC frame to be transmitted over a power line. In addition, the method may further include inserting another instance of the first symbol at another predetermined location within the PLC header portion of the PLC frame.
In some cases, the method may include identifying a second symbol within the PLC preamble portion of the PLC frame, the second symbol different from the first symbol, and inserting an instance of the second symbol at another predetermined location within the PLC header portion of the PLC frame. Upon receipt of another PLC frame, the method may include locating a position of a preamble symbol within a header portion of the another PLC frame and estimating at least one of: a start of the another PLC frame or a sampling frequency offset based, at least in part, upon the position.
In yet another embodiment, yet another method may include receiving a PLC frame. In response to a determination that the PLC device is operating in a multi-header decode mode where each different header portion is a accompanied by a same preamble portion, the method may include attempting to decode a header portion of the PLC frame using a first decoding based, at least in part, upon the preamble portion. In response to the attempt being successful, the method may include decoding the PLC frame using the first decoding. Otherwise, the method may include attempting to decode the header portion of the PLC frame using a second decoding based, at least in part, upon the preamble portion, each of the first and second decoding based upon a different PLC standard.
Additionally or alternatively, in response to a determination that the PLC device is operating in another multi-header decode mode where each different header portion is a accompanied by a different preamble portion, the method may include simultaneously attempting to decode the header portion of the PLC frame using the first and second decodings based, at least in part, upon the different preamble portions. Upon locating a position of a preamble symbol within the header portion of the PLC frame, the method may include estimating a start of the PLC frame and/or estimating a sampling frequency offset based, at least in part, upon the position.
In still other embodiments, a method may include attempting to decode a preamble portion of a PLC frame using a first decoding technique, the preamble portion following one of a plurality of different PLC standards. The method may also include, in response to the attempt being successful, decoding the PLC frame using the first decoding technique. The method may further include, in response to the attempt being unsuccessful, attempting to decode the preamble portion of the PLC frame using a second decoding technique, the first and second decoding techniques each based upon a different PLC standard.
In some implementations, one or more of the techniques described herein may be performed by one or more computer systems. In other implementations, a tangible computer-readable storage medium may have program instructions stored thereon that, upon execution by one or more computer systems, cause the one or more computer systems to execute one or more operations disclosed herein. In yet other implementations, a system (e.g., a PLC modem) may include at least one processor and a memory coupled to the at least one processor. Examples of a processor include, but are not limited to, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a system-on-chip (SoC) circuit, a field-programmable gate array (FPGA), a microprocessor, or a microcontroller. The memory may be configured to store program instructions executable by the at least one processor to cause the system to execute one or more operations disclosed herein.
FIGS. 4-6 are block diagrams illustrating alternative connections between a power line communications transmitter and/or receiver circuitry to three-phase power lines according to some embodiments.
FIG. 7 is a diagram of a PLC data frame according to some embodiments.
FIG. 8 is a flowchart of a method of creating a PLC preamble symbol or sequence according to some embodiments.
FIG. 9 is a graph of a fast Fourier transform (FFT) of a 36-90 kHz chirp signal with a 31-95 kHz signal also shown according to some embodiments.
FIG. 10 is a graph of a preamble symbol shown in the time domain with a PAPR of 4 dB according to some embodiments.
FIG. 11 is a graph illustrating the autocorrelation of a preamble symbol with respect to two repetitions of the same sequence according to some embodiments.
FIG. 12 is a graph of the FFT output magnitude of a chirp signal defined with nominal start and end tones of 79 and 178, respectively, according to some embodiments.
FIG. 13 is a graph of a difference between nominal and actual bandwidth for Nfft=256 according to some embodiments.
FIG. 14 is a diagram of a preamble time-domain generation according to some embodiments.
FIG. 15 is a diagram illustrating a PLC preamble portion of a PLC frame according to some embodiments.
FIG. 16 is a graph of sorted PAPR for time-domain and frequency-domain generated Zadoff-Chu sequences according to some embodiments.
FIG. 17 is a graph illustrating the autocorrelation of the frequency-domain based preamble sequences for q=23 using Zadoff-Chu constructions according to some embodiments.
FIG. 18 is a graph illustrating a comparison between auto-correlation and cross-correlation for Zadoff-Chu sequences with q=36, 37 generated using a time-domain technique according to some embodiments.
FIG. 19 illustrates the cumulative probability distribution of the cross-correlation of a chosen Zadoff-Chu sequence in addition to two other sequences according to some embodiments.
FIG. 20 is a diagram illustrating a portion of a PLC frame according to some embodiments.
FIGS. 21A-B are diagrams illustrating structures of pilot symbols within a PLC header according to some embodiments.
FIGS. 22 and 23 are flowcharts of methods of multi-mode detection according to some embodiments.
FIG. 24 is a diagram illustrating correlations of the preambles in G3-low band, G3 CEN A and G3 CEN B bands according to some embodiments.
FIG. 25 is a diagram illustrating correlations of preambles in G3 FCC band, G3 FCC 36 tone masks according to some embodiments.
FIG. 26 is a block diagram of a computing system configured to implement systems and methods described herein according to some embodiments.
In some embodiments, each concentrator 114 may be seen as a based node for a PLC domain, each such domain comprising downstream PLC devices that communicate with control center 130 through a respective concentrator 114. For example, in FIG. 1, device 106 a-n, 112 a-n, and 113 may all be considered part of the PLC domain that has data concentrator 114 as its base node; although in other scenarios other devices may be used as the base node of a PLC domain. In a typical situation, multiple nodes may be deployed in a given PLC network, and at least a subset of those nodes may be tied to a common clock through a backbone (e.g., Ethernet, digital subscriber loop (DSL), etc.).
External memory 303 may include any type of memory. For example, external memory 303 may include SRAM, nonvolatile RAM (NVRAM, such as “flash” memory), and/or dynamic RAM (DRAM) such as synchronous DRAM (SDRAM), double data rate (DDR, DDR2, DDR3, etc.) SDRAM, Rambus® DRAM, etc. External memory 303 may include one or more memory modules to which the memory devices are mounted, such as single inline memory modules (SIMMs), dual inline memory modules (DIMMs), etc.
In various embodiments, the circuits described above and/or the computer system shown in FIG. 24 implement signal processing operations configured to generate, transmit, and/or receive one or more PLC signals communicated over one or more power lines. Turning to FIG. 7, a diagram of a PLC data frame is depicted according to some embodiments. Particularly, frame 700 includes preamble portion 701, header portion 702, and payload portion 703. Generally speaking, each of portions 701-703 may contain different symbols (e.g., OFDM symbols) and may have distinct formats depending upon the PLC standard being used in a given communication. For example, the G3 and G.9955 standards are largely similar. Nonetheless, there are differences between them in terms of sampling frequency, tone spacing, coherent/differential modulation, etc. In some cases, the various embodiments described below, systems and methods for generating, transmitting, and/or receiving PLC frames may be used with any such PLC standard (e.g., PRIME, G3 CENELEC A, G3 FCC, G.hnem, IEEEP1901.2 devices, SFSK, etc.).
In some embodiments, one or more symbols used in preamble 701 (SYNC symbols) may be generated to enable lower peak-to-average power ratio (PAPR) in time domain, thus allowing a higher boosting of preamble 701 with respect to payload 703. In some cases, the techniques described below may enable preamble boosting of more than 4 dB with respect to the data. Preamble boosting may be helpful because in enabling accurate synchronitation with fewer preamble symbols. It may be made possible by the fact that the OFDM signal typically has a much larger PAPR than a well-chosen preamble sequence, and the power amplifier design is often constrained by the peak value of the signal and not its rms value. Thus, if the preamble sequence has smaller PAR, it may be boosted while maintaining the peak signal level.
A typical preamble sequence pattern in given by Table I:
TABLE I Carrier φc 0 2(π/8) 1 1(π/8) 2 0 3 15(π/8) 4 14(π/8) 5 12(π/8) 6 10(π/8) 7 7(π/8) 8 3(π/8) 9 15(π/8) 10 11(π/8) 11 6(π/8) 12 1(π/8) 13 11(π/8) 14 5(π/8) 15 14(π/8) 16 7(π/8) 17 15(π/8) 18 7((π/8) 19 15(π/8) 20 6(π/8) 21 13(π/8) 22 2(π/8) 23 8(π/8) 24 13(π/8) 25 2(π/8) 26 6(π/8) 27 10(π/8) 28 13(π/8) 29 0 30 2(π/8) 31 3(π/8) 32 5(π/8) 33 6(π/8) 34 7(π/8) 35 7(π/8)
The PAPR of this preamble sequence in time domain is found to be 5.9 dB. However, the original chirp sequence used to design this preamble sequence has a peak to average of only 3 dB. In other words, there is additional 2.9 dB increase of the PAPR when the chirp signal is used to generate the preamble sequence or symbol. Upon investigation, the inventors hereof have determined that, even though the original chirp sequence covers frequencies 36 to 90 kHz, the actual FFT of the chirp sequence shows that about 4 tones (6.25 kHz) on each side of the 36-90 kHz band has a very small amplitude. To illustrate this, FIG. 9 depicts a graph of a fast Fourier transform (FFT) of a 36-90 kHz chirp signal. (A 31-95 kHz signal is also shown as discussed below.) Therefore, when the preamble sequence is “flattened” in frequency domain to enable good channel estimates, there may be significant contribution to PAPR coming from the edge tones to increase the PAPR. As the inventors hereof have also recognized, the phase quantization operation using a 2*π/16 quantizer increases the PAPR even further.
To address these and other concerns, FIG. 8 depicts a flowchart of a method of creating a PLC preamble symbol or sequence according to some embodiments. At block 801 a chirp sequence may be defined over a wide bandwidth. The bandwidth may be selected, at least in part, by subtracting an excess bandwidth parameter from a low nominal frequency and adding the excess bandwidth parameter to a high nominal frequency. In some cases, the high and low nominal frequencies may be based, at least in part, upon a PLC standard. Additionally or alternatively, the excess bandwidth parameter may be a function of a difference between the high and low nominal frequencies. At block 802, a phase angle of a frequency-domain version of the chirp sequence may be extracted to yield a flattened frequency spectrum. Then, at block 803, a phase quantized sequence may be created based, at least in part, upon the flattened frequency spectrum. In some cases, the quantization factor may be smaller than another quantization factor selected based, at least in part, upon a PLC standard. For example, the quantization factor may be 2*π/32 or less.
In some implementations, reduce a preamble's PAPR, a chirp sequence may be defined over a wider bandwidth. For example, a bandwidth from 31-95 kHz may be used (as opposed to nominal frequencies 36-90 kHz). The FFT of the resulting chirp is shown in FIG. 9. Then, the frequency response in the 36-90 kHz band (i.e., between the nominal frequencies) may be flattened, for example, by taking only the phase angle of the FFT. Lastly, the resultant sequence phase may be phase quantized to 2*pi/32. The FFT of the resultant sequence is also shown in FIG. 9, and the phases of that sequence are shown in Table II below:
TABLE II Carrier φc 0 1(π/16) 1 −(π/16) 2 −4(π/16) 3 −7(π/16) 4 −10(π/16) 5 −15(π/16) 6 10(π/16) 7 3(π/16) 8 −4(π/16) 9 −12(π/16) 10 10(π/16) 11 0(π/16) 12 −10(π/16) 13 10(π/16) 14 −2(π/16) 15 −15(π/16) 16 3(π/16) 17 −11(π/16) 18 5(π/16) 19 −10(π/16) 20 4(π/16) 21 −13(π/16) 22 0(π/16) 23 13(π/16) 24 −7(π/16) 25 3(π/16) 26 14(π/16) 27 −8(π/16) 28 1(π/16) 29 8(π/16) 30 16(π/16) 31 −9(π/16) 32 −3(π/16) 33 (π/16) 34 4(π/16) 35 7(π/16)
FIG. 10 is a graph of a preamble symbol created as described above in the time domain exhibiting a PAPR of 4 dB, according to some embodiments. Specifically, the PAPR (20*log10(max/rms)) of this sequence is found to be 4 dB, which is 1.9 dB better than the preamble sequence of Table I. FIG. 11 is a graph illustrating the autocorrelation of a preamble symbol with respect to two repetitions of the same sequence, according to some embodiments. The correlation values to be noted are from 256 to 511, and it may be determined that the proposed sequence has a good autocorrelation property.
At least because the proposed preamble sequence has a PAPR of 4 dB, the preamble may be boosted with respect to the data by 4 dB or more, assuming the OFDM data has a PAPR of 9 dB. In terms of meeting the emissions mask for the CENELEC standard, for example, a transmitter implementation may introduce certain in-band filtering to meet the emissions mask if needed.
As described above, designing a preamble sequence may include choosing an excess bandwidth parameter for the chirp sequence to ensure desired band is occupied, such that the excess bandwidth is a function of the nominal bandwidth. Also, the preamble for the case of multiple sets of contiguous subcarriers by scaled addition may be obtained. In that regard, the generic formula for a chirp sequence may be given by:
S CH(t)=A·rect(t/T)·cos └2π(f 0 t+½μt 2)┘
where T is the sequence duration, f0 is the start frequency, and μ=(ff−f0)/T where ff is the end frequency. If one desires to define a chirp sequence between subcarriers k0 and kf, the question of selecting the appropriate values of start and end frequency may be addressed as follows. First, it should be noted that the peak-to-average ratio for all choices of start and end frequencies is 3 dB. Relevant properties of a SYNCP sequence include cyclic autocorrelation and the band occupancy—to ensure that the chirp sequence occupies the band from k0 and kf tones but not significantly more or less. Thus, we may define:
S CH(t)=Arect(t/T)·real(exp(j2πf 0 t)s o(t)), where s o(t)=exp(jπμt 2)
The spectrum of SCH(t) may be seen as a modulated version of the spectrum of S0(t). Consequently, both the bandwidth occupancy and the autocorrelation (equivalent defined by the magnitude of the FFT) may be determined by s0(t). In other words, it may be sufficient to make suitable choices for s0(t) alone. Note that s0(t) is determined only by the difference of the start and end frequencies, or the nominal bandwidth (ff−f0). If one defines a chirp sequence for a given nominal bandwidth, the actual bandwidth occupied is often less. FIG. 12 is a graph of the FFT output magnitude of a chirp signal defined with nominal start and end tones of 79 and 178, respectively, according to some embodiments. The chirp nominally is defined with start and end indices of 79 and 178 for a nominal bandwidth of 100 tones. However, the 3 dB crossing occurs at tone indices of 83 and 175, for a nominal bandwidth of only 93 tones. Thus, the nominal bandwidth is wider than the actual 3 dB bandwidth by 7 tones.
FIG. 13 is a graph of a difference between nominal and actual bandwidth for Nfft=256 according to some embodiments. More generally, for Nfft=256 tones, the difference between the actual bandwidth and the nominal bandwidth is plotted below. Accordingly, given a desired and end tone index of k0 and kf, the chirp sequence with nominal start and end tones of k0−ceil(D/2) and kf·floor(D/2), where D is an increasing function of the desired bandwidth (kf−k0). According to some embodiments, Table III below illustrates one such function.
For example, in the time domain, a preamble generator may generate an N-sample sequence for an arbitrary subcarrier mask. Specifically, the preamble sequence in time domain may be generated based upon a chirp sequence over a contiguous set of carriers. If all unmasked carriers are not contiguous, the set of unmasked subcarriers may be broken into Nset sets, each containing a contiguous set of subcarriers. For each of these sets, a chirp sequence is obtained. The preamble sequence may then be taken as the scaled sum of the chirp sequences.
Let the ith such set contain Nsc(i) subcarriers indexed from k0(i) to kf(i). To define the chirp sequence over this set, the excess bandwidth parameter Δ(i) may be defined as a function of kf(i)−k0(i), as given in Table III.
TABLE III kf-k0 Δ 0-2 3 3-9 4 10-21 5 22-34 6 35-54 7 55-76 8 55-76 8 77-102 9 103-138 10 139-200 11
Accordingly, the chirp sequence may be defined as:
c i ⁡ ( t ) = cos [ 2 ⁢ π ( k 0 ⁡ ( i ) - ⌈ Δ ⁡ ( i ) / 2 ⌉ N ⁢ t + 1 ⁢ ( k f ⁡ ( i ) - k 0 ⁡ ( i ) + Δ ⁡ ( i ) ) 2 ⁢ N 2 ⁢ t 2 ) ] c i ⁡ ( t ) = cos [ 2 ⁢ π ( k 0 ⁡ ( i ) - ⌈ Δ ⁡ ( i ) / 2 ⌉ N ⁢ t + 1 ⁢ ( k f ⁡ ( i ) - k 0 ⁡ ( i ) + Δ ⁡ ( i ) ) 2 ⁢ N 2 ⁢ t 2 ) ] for ⁢ ⁢ t = 0 , 1 , … ⁢ ⁢ N - 1.
Using the definition of Δ(i) and adjusting the start and end frequencies as above may ensure that the actual occupied bandwidth of the chirp sequence extends from k0(i) to kf(i). Hence, the time domain sequence is given by:
S 1 ⁡ ( t ) = N sc ⁡ ( i ) ∑ i = 1 N set ⁢ ⁢ N sc 2 ⁡ ( i ) ⁢ c i ⁡ ( t ) for ⁢ ⁢ t = 0 , 1 , … ⁢ , N - 1.
As another example, in the frequency domain, a frequency domain signal may be generated by taking a DFT of the time domain sequence generated above. The resultant sequence is made zero on all masked subcarriers. The magnitude of the unmasked carriers may be set to be the same, and the phase may be quantized to the nearest multiple of pi/4, for example.
To modulate the preamble symbol, for the non-masked subcarriers of the preamble, a bit sequence of all 1's may be mapped using the 1-bit constellation. A linear feedback shift register (LFSR) generator may be initialized at the beginning of the preamble to a given seed. The output of a mapper shall be subsequently rotated using the two bits that are the least significant bits (LSBs) of the LFSR, s1, and s2, resulting in constellation point Zi. The LFSR may then be advanced by 2 bits for each preamble's subcarrier (either masked or not).
To create an entire preamble (e.g., preamble portion 701 in FIG. 7) based on the generated symbols, the output time-domain symbol S1(t) may be repeated NI times. If N1 is a non-integer number, the fraction of the symbol replica may be be prepended at the beginning of the section. If N2 is a non-integer number, the fraction of the symbols replica may be appended at the end of the section. A first and a second section of the preamble may be windowed, overlapped and added as described below and shown in FIG. 14.
Specifically, as depicted in FIG. 14, for a first preamble section, a first symbol (e.g., a first OFDM symbol) of the first section may be cyclically extended by pre-pending the last β/2 samples of the symbol S1. The last symbol of the first section may be cyclically extended by appending the first β/2 samples of the symbol S1. The first and last β samples of the extended first section may be windowed with a window function wβ(n) and wβ(β−n−1) respectively. For a second preamble section, the first symbol of the second section may be cyclically extended by pre-pending the last β/2 samples of the symbol S2. In some cases, S2 may be the negative (or a phase inverted version) of S1. The last symbol of the second section may be cyclically extended by appending the first β/2 samples of the symbol S2. The first and last β samples of the extended second section may be windowed with a window function wβ(n) and wβ(β−n−1) respectively.
Still referring to FIG. 14, the β windowed samples at the end of the first section and at the beginning of the second section may be overlapped and added. And the β windowed samples at the end of the second section may be overlapped and added with the b windowed samples. The number Npr of samples in the preamble may then be computed as:
N pr =β+N 1 ·N+N 2 ·N
In some embodiments, multiple domains that operate physically close to each other may be differentiated during synchronization. Specifically, different G.hnem networks may operate in close vicinity for example in home area networking and other applications, and may cause interference to each other. This may happen, for example, in home area networking (HAN) scenario when multiple domains either in the same dwelling or in different dwellings interfere with each other. Another scenario may occur when signals from the low voltage (LV) side of the transformer may go through the MV/LV transformer and cross over to another LV domain. Yet another scenario may occur when the different domains for lighting interfere with each other. Therefore, the inventors hereof have discovered ways to differentiate between the different domains by using a synchronization preamble. In some cases, these techniques may allow a unique identification for each of the domain based upon synchronization preamble while ensuring low PAPR in order to permit boosting.
FIG. 15 is a diagram illustrating a PLC preamble portion of a PLC frame according to some embodiments. Current standards suggest that multiple preamble sequences (SYNCP) should be repeated with the last sequence (SYNCM) being phase inverted with respect to the previous ones. In contrast with that approach, some of the embodiments described below may employ a unique domain specific sequence as SYNCM. In the example shown in FIG. 15, a preamble is composed of N1=6 identical S1 symbols and N2=1½ identical S2 symbols. Each of the S1 and S2 symbols may be IFFT_SIZE=256 samples and is pre-stored in the transmitter and transmitted at the beginning of each frame. Again, in certain implementations, S2 is identical to S1 except that all the carriers are π phase shifted (or equivalently inverted time domain waveform of the S1 symbols).
For example, in some embodiments, sequence S2 be different from S1. Further different S2 sequences be allowed based upon the domain identification. The S2 sequences thus defined may have desirable cross-correlation properties. As an example, in some cases S2 sequences may include Zadoff-Chu sequences either in time domain or in frequency domain. Particularly, a Zadoff-Chu sequence of length N for a PLC domain ID “q” may be given by the equation below:
s q 2 ⁡ ( m ) = ⅇ - j ⁢ π ⁢ ⁢ qm ⁡ ( m + 1 ) N , ⁢ 0 ≤ m ≤ N - 1
Time domain construction preamble sequences using Zadoff-Chu sequences may be performed as follows. From the equation above, let us take N=37 and then take a length 37 FFT. Use this length 37 sequence in the frequency domain from G.hnem tone number 22 to 58 (and also the tones 236 to 200 with complex conjugate) and then take an IFFT of the resulting sequence. The resulting sequence in time domain may be used as the preamble sequence S2. For different values of q, different sequences may be used for different domains.
In the frequency domain, starting from the equation above, again let us take N=37 and use the resulting sequence directly in the frequency domain from tones 22-58 (and also the tones 236 to 200 with complex conjugate) and then take an IFFT of the resulting sequence. The resulting sequence in time domain may be used as the preamble sequence S2. Similarly to the time-domain generation, for different values of q, different sequences may be used for different domains.
The PAPR of frequency domain based construction may be higher than when using time domain based construction; the auto correlation of the two sequences, however, may be similar. As mentioned above, by changing the q different preamble sequences can be obtained that can be used to identify the different domains.
The 36 sequences based on the immediately preceding equation were generated and the PAPR for those sequences is shown in FIG. 16. Specifically, FIG. 16 is a graph of sorted PAPR for time-domain and frequency-domain generated Zadoff-Chu sequences according to some embodiments for N=37 and q=7. It may be noted that the resulting PAPR of the sequences using either time domain or frequency domain construction is similar. FIG. 17 is a graph illustrating the autocorrelation of the frequency-domain based preamble sequences for q=23 using Zadoff-Chu constructions according to some embodiments. The auto-correlation of time domain and frequency domain generated sequences is similar. As mentioned above, by changing the q different preamble sequences can be obtained that can be used to identify the different domains.
Assuming, for sake of illustration, that only 8 sequences are to be defined for the multiple domains, sequences for q=[14 15 16 18 19 21 22 23] may be defined in the frequency domain which give a low PAPR of [5.8, 5.4, 5.8, 5.4, 5.4, 5.8, 5.4, 5.8] dB respectively. In addition a 9th sequence can be chosen to be the chirp sequence. Also a 10th sequence can be chosen to be a time flipped version of the sequence. The worst case cross-correlation for all combinations for the 8 Zadoff-Chu sequences generated using frequency domain along with two other sequences was found to be 10 dB below the main peak. FIG. 18 is a graph illustrating a comparison between auto-correlation and cross-correlation for Zadoff-Chu sequences with q=36, 37 generated using a time-domain technique according to some embodiments. A cumulative probability distribution for the cross correlation is shown in FIG. 19. It may be noted that the cross-correlations for the chosen sequences lie 10-13 dB below the main peak.
Thus, according to some embodiments, preamble sequences may identify multiple domains based upon Zadoff-Chu sequences and the chirp sequence. In some implementations, for example, N1 and/or S2 sequence may be used, alone or in combination, identify a given PLC domain. The preamble sequence may be obtained by starting with either the length 37 Zadoff-Chu sequence in time or frequency domain. For a length 37 sequence, there are 36 Zadoff-Chu sequences. Thus, 8 sequences with low PAPR may be selected, with the 9th sequence being the chirp sequence and the 10th sequence being its time flipped version.
In some embodiments, the use of repeated SYNC sequences may enable frame boundary detection in the presence of impulsive noise. For example, one or more SYNCN symbols may be inserted in the PHY frame header (i.e., header 702 of FIG. 7) at predetermined locations. The receiver may then employ hypothesis testing; but only to locate the first SYNCN symbol in the header. Moreover, these symbols may also serve as pilots and may therefore be used for sampling frequency offset estimation.
To illustrate the foregoing, a preamble structure and waveform are shown as a portion of a PLC frame in FIG. 20. The waveform include of N1 repetitions of the preamble waveform S1, followed by N2 repetitions of its negative. The preamble is followed by the PHY frame header, which may include typical OFDM symbols (with the IFFT output and cyclic prefix). Each OFDM symbol, in turn, may contain pilot tones to aid channel estimation and sampling clock recovery. In a typical situation, after the initial preamble symbol S1 has been detected, impulsive noise may occur, wiping out part or all of the “S2” symbols. Consequently, the receiver may not know where the preamble ends and the frame control header begins.
In some cases, the receiver may try various hypotheses where the frame control header starts, perform channel estimation, soft output generation, and decoding for each of those hypotheses, and then determine the hypothesis that passes a cyclic redundancy check (CRC). Yet, under this approach, it is not possible to determine the correct frame boundary location before the end of the header. Accounting for the delay in decoding many hypotheses, at least the first few data symbols, requires having multiple FFTs taken, which complicates buffer management. Also, to reduce probability of false alarms and erroneous decisions, the CRC has to be made longer.
To address these concerns, certain embodiments described herein may use preamble symbols interspersed with the frame control header. These interspersed symbols may then be used, for example, to estimate both the frame boundary and the sampling frequency offset. For instance, assume that a preamble sequence includes a sequence of N1 symbols equal to S1. If the total number of header symbols is Nheader, an S2 sequence may be inserted after the first round(Nheader/3) symbols, and an S1 sequence may be inserted back-to-back after the second round(Nheader/3) symbols. To illustrate these techniques, FIG. 21A shows structures of pilot symbols within a PLC header according to some embodiments.
At the receiver, after acquiring the S1 symbol, every next symbol may be tested to determine whether it is also S1. Once a change is detected (either because of the actual end of the preamble, or because of impulse noise), the receiver may hunt for either the S2 or the S1 symbol. Once either of them is found, the receiver knows the frame start. Note that the S2 and S1 symbols can also be used for sampling frequency offset estimation. Indeed, because they contain more tones than time-interspersed pilots, they offer a better sampling frequency offset estimate.
In some implementations, pilot symbols may be kept every 12 tones in the header. Instead of multiplexing the pilots every 12th tone, however, a full symbol may be used as a pilot approximately with the same overhead. Turning to FIG. 21B, a diagram illustrating structures of pilot symbols within a PLC header is depicted according to some embodiments. In this non-limiting case, a total of 3 pilot symbols 2103 may be used the PHY-frame header interspersed among header symbols 2102 and after preamble 2101. Further, as previously noted, the added pilot symbols in the header may be used, for example, for channel estimation and frequency correction for decoding the header symbols using the hypothesis testing, for frame synchronization purposes (e.g., in the presence of impulse noise, etc.), and/or to accommodate a cyclic prefix (CP) for the SYNCM.
In various embodiments, more or less symbols (S1 and/or S2) may be embedded in the header. The number of additional symbols may be determined to ensure a small overhead. Also, if impulse noise erases a sequence of symbols, even if the receiver detects one of the embedded symbols, it may still need to determine which one has been detected. Thus, the inserted symbol may be distinguishable by the receiver. In the above example, distinction was achieved by making the embedded symbols have opposite sign: S2=−S1. In other cases, however, the symbols may be different from each other (e.g., S2 may be a Zadoff-Chu sequence). Yet other variations may involve, for example, embedding different uncorrelated symbols (not preferred due to complexity of running another correlation), embedding symbols with different phase variations (need to ensure sufficient “distance” between the chosen phases), and embedding symbols at different time periods relative to one another (position modulation), among others.
In some embodiments, certain techniques described herein may be employed in the detection, by a single PLC device, of frames communicated using two or more different standards. As previously noted, even among similar standards (e.g., G3 and G.9955) there may be differences in terms of sampling frequency, tone spacing, coherent/differential modulation, etc. Accordingly, systems and methods described herein may allow a PLC device or modem to support two or more modes of operation (e.g., both G3 and G.9955) coexisting on the PLC domain or environment in an interoperable manner. In some cases, a PLC device may decode headers for both standards by hypothesis testing and, based on the decoded header, the device may then decode the payload. For example, in some implementations, the preambles may be the same for two or more standards. In other implementations, however, different standards may use different preambles. In the latter case, a receiver may detect packets by using preambles of the different standards simultaneously and, according to detected packets, it may decode corresponding payload. These two different implementations are described below with respect to FIGS. 22 and 23, respectively.
Referring to FIG. 22, a receiver may enter dual-header decode mode at block 2201. Alternatively, the receiver may be preset to work in this mode. Further, this particular mode of operation may assume that different standards use the same preamble. At block 2202, the receiver may receive a packet. At block 2203, the receiver makes an assumption that the incoming packet is G.9955 packet and therefore it starts G.9955 header decoding. If decoding is successful, then the device starts decoding G.9955 payload at block 2204. If decoding is not successful, then the device tries to decode G3 header at block 2205. If decoding is successful, then the device decodes G3 payload at block 2206. Otherwise, the receiver may then start finding incoming preambles at block 2202.
Referring to FIG. 23, a receiver may again enter a multi-preamble decode mode at block 2301 (or it may be preset to operate in this mode). At block 2302, the receiver may receive one or more preambles following a plurality of possible PLC standards. At blocks 2303 and 2305, the device may try to detect packets with two or more potentially different preambles simultaneously. If the detected preamble is G3 preamble at block 2303, then the device tries to decode G3 packets at block 2304. If the detected preamble is G.9955 preamble at 2305, then the PLC device tries to decode G.9955 packets at block 2306. If neither is successful, control may return to block 2302.
Although the examples described in FIG. 22 refers to the specific case where only two standards are used (i.e., dual-mode), in other embodiments these techniques may be extended to environments using more than two standards (i.e., multi-mode). Furthermore, it should be recognized that standards other than G3 and G.9955 may be used.
More generally, systems and methods described herein may enable coexistence mechanisms for any two standards such as, for example, in PRIME, G3 CENELEC A, G3 FCC, G.hnem, IEEEP1901.2 devices, SFSK, etc. First, let the preambles from each standard be SPRIME(t), SG3-CENA(t), SG3-FCC(t), SGhnem(t), SSFSK(t). In a first implementation, the new preamble at the receiver may be defined as s(t)=SPRIME(t)+SG3-CENA(t)+SG3-FCC(t)+SGhnem(t)+SSFSK(t) (e.g., parallel or simultaneous detection). Additionally or alternatively, other suitable combination of preambles may be used. In the case where the preamble length from each standard is different, zeros may be padded depending on the longest preamble length. Then the receiver may correlate incoming sequences from each device and if the correlated value crosses a certain threshold, then the receiver may attempt to decode each standard's header. If header decoding passes, then the devices may move on to header decoding. If not, the decoding of that particular packet or frame may stop. In general, the new preamble may be some function of the preambles of the different technology—i.e., s(t)=F(sPRIME(t), sG3-CENA(t), SG3-FCC(t), SGhnem(t), SSFSK(t)), wherein F is a function such that correlation of s(t) against the preamble of that technology results in a peak being suitable for detection.
In another implementation, a preamble may be s(t)=[sPRIME(t)+SG3-CENA(t)+SG3-FCC(t) sGhnem(t) sSFSK(t)] (e.g., simultaneous detection). Additionally or alternatively, other suitable combination of preambles that may be received, whereby the incoming signal is independently correlated with the preambles for the different technologies. Again, the decoding procedure may be the same as in the preceding implementation, for example, as shown in FIG. 23. Alternatively, if the correlation threshold is exceeded for a technology that the transceiver cannot decode, the “back-off” may happen after the preamble detection stage. Depending upon the mode of operation the “back-off” time may be technology dependent or it may be a common time for the different technologies. In alternative embodiments, other suitable methods based on a combination of preamble detection techniques may be employed such that exact preamble correlation need not be used.
In another implementation, spacing for each standard may be different. In this case, a common FFT length or common sampling frequency may be determined for each standard. For example, for G3-FCC and G.9955 (G.hnem) standards, carrier spacing is 4.6875 kHz and the other is 3.1250 kHz (or 1.5625 kHz, which is 15.625/n, n=5, 10), common sampling frequency may be 2.4 MHz, the FFT length of G3-FCC may be 512, and the FFT length of G.hnem may be 768. Conversely, to find common FFT length, for example, the common FFT length may be 512, whereas the sampling frequency of G3-FCC may be 2.4 MHz and the sampling frequency of G.hnem may be 1.6 MHz. Other combinations may be developed in a similar manner.
In some cases, preamble correlation may be performed in time domain and/or frequency domain. The immediately preceding implementation may ease the frequency domain processing when the carrier spacing is different. In yet other implementation where carrier spacings are different among different standards, different length FFTs may be taken and correlation may be performed in the frequency domain against the preamble of that technology.
In yet another implementation, P1901.2 different band plans are possible such as FCC-Low (defined to be below 145 kHz), FCC high (e.g., from 145-478 kHz) or multi-tone mask mode where the receiver may communicate in one of the tone-masks. Tone mask 1 divides G3-FCC band into two distinct sub-bands each with 36 carriers (e.g., 145-309 kHz and 314-478 kHz). Tone mask 2 divides the G3-FCC band into four distinct bands (e.g., 145-225 kHz, 229-309 kHz, 314-393 kHz, and 398-478 kHz). Accordingly, detecting a packet on a power line for any one of these modes may involve taking an FFT at 1.2 MHz sampling frequency. A 256-point FFT may be taken and correlation may be done on the different bands against the preambles used for corresponding sub-bands.
For sake of illustration, Table IV below shows various different tone masks that may be considered for preamble definitions:
TABLE IV Sampling (Begin tone rate (kHz), index, end Tone mask Frequency (kHz) FFT size tone index) G3 CEN A 35.9375-90.625 400, 256 (23, 59) G3 CEN B 98.4375-121.875 400, 256 (63, 78) G3 low band 37.5-135.94 1200, 256 (8, 29) G3 FCC 154.6875-487.5 1200, 256 (33, 104) G3 FCC 36 tone 154.6875, 318.75 1200, 256 (33, 68) mask 1 G3 FCC 36 tone 323.4375-478.125 1200, 256 (69, 104) mask 2 G3 FCC 18 tone 154.6875-234.375 1200, 256 (33, 50) mask 1 G3 FCC 18 tone 239.0625-318.75 1200, 256 (51, 68) mask 2 G3 FCC 18 tone 323.4375-403.125 1200, 256 (69, 86) mask 3 G3 FCC 18 tone 407.8125-487.5 1200, 256 (87, 104) mask 4
The preamble for multiple tone mask may be obtained, for example, by starting with a chirp sequence over the G3-symbol period sweeping over the individual tone mask frequency and then the carrier phase φc over the multiple tone mask frequency limited to a multiple of π/8. To obtain the preamble for a tone mask in Table IV above, a method may be initiated with frequency Fstart FM, tone index Nstart TM and end frequency Fend TM, tone index Nend TM for sampling frequency Fs (Fs being 400 kHz for CENELEC A and 1.2 MHz for G3-FCC and FCC low band, for example), and the following operations (1-7) may be performed:
1. Let n=0:1:(N−1) (N=256 being the length of the FFT);
2. Let FC1=Fstart TM and FC2=Fstart TM+0.5*(Fend TM−Fstart TM);
Δ f = FC ⁢ ⁢ 2 - FC ⁢ ⁢ 1 N
4. Then the chirp may be defined as
chirp ⁡ ( n ) = cos [ 2 * π * n * ( F start TM + n * Δ f ) F s ] ,
n=0, 1, - - - (N−1);
5. Now define the FFT of the chirp to be fft_chirp(c)=FFT(chirp(n)); c=0, 2, - - - (N−1);
6. Let y(c)=0 for c=0, 1, 2, - - - (N−1). For each of the tone index, c=Nstart TM to c=Nend TM, let φc=angle(fft_chirp(c)) in radians, where in φcε[0,2π). The phase for tone c is given by φc=(π/8)*round(φc/(π/8)). To perform rounding, if the value to be quantized is exactly midway between two integers, then the larger integer may be chosen. Then, for these, cε └Nstart TM, . . . , Nend TM┘, y(c)=exp(j*φc), and y(N−c)=exp(−j*φc); and
7. The preamble sequence may then be given by SYNCP(n)=ifft(y), n=0, 1, 2, . . . (N−1). Using this construction, the SYNCP(n) should be a real valued sequence of length N.
For example, for the G3-FCC band, tone mask 0 we have Fstart TM=154.6875 kHz, Nstart TM=33, Fend TM=487.5 kHz, and Nend TM=104. Similarly, for the G3-FCC tone mask 1 case in table 10.1, for the first tone mask Fstart TM=154.6875 kHz, Nstart TM=33, Fend TM=318.75, and Nend TM=68. And for tone mask 2, FTstart TM=323.4375 kHz, Nstart TM=69, Fend TM=487.5, and Nend TM=104.
As may be seen from Table IV, there are several overlaps between the different tone masks. Again, one way to implement a coexistence mechanism is to detect different preambles at the receiver and use Carrier Sense Multiple Access (CSMA) backoff. In some cases, different sub-band preambles may be derived from the same sampling rate to enable simpler detection mechanism for different preambles. Also, the cross-correlation of the different sub-band preambles may be small (e.g., better than 10 dB of cross correlation value). FIG. 24 shows correlations of the preambles in G3-low band, G3 CEN A and G3 CEN B bands, and FIG. 25 shows correlations of preambles in G3 FCC band, G3 FCC 36 tone masks.
As noted above, embodiments of systems and methods for building, transmitting, and receiving frame structures may be implemented or executed by one or more computer systems. One such system is illustrated in FIG. 26. In various embodiments, system 2600 may be a server, a mainframe computer system, a workstation, a network computer, a desktop computer, a laptop, mobile device, or the like. In different embodiments, these various systems may be configured to communicate with each other in any suitable way, such as, for example, via a local area network or the like.
As illustrated, computer system 2600 includes one or more processors 2610 coupled to a system memory 2620 via an input/output (I/O) interface 2630. Computer system 160 further includes a network interface 2640 coupled to I/O interface 2630, and one or more input/output devices 2625, such as cursor control device 2660, keyboard 2670, display(s) 2680, and/or mobile device 2690. In various embodiments, computer system 2600 may be a single-processor system including one processor 2610, or a multi-processor system including two or more processors 2610 (e.g., two, four, eight, or another suitable number). Processors 2610 may be any processor capable of executing program instructions. For example, in various embodiments, processors 2610 may be general-purpose or embedded processors implementing any of a variety of instruction set architectures (ISAs), such as the x826, PowerPC®, ARM®, SPARC®, or MIPS® ISAs, or any other suitable ISA. In multi-processor systems, each of processors 2610 may commonly, but not necessarily, implement the same ISA. Also, in some embodiments, at least one processor 2610 may be a graphics processing unit (GPU) or other dedicated graphics-rendering device.
System memory 2620 may be configured to store program instructions and/or data accessible by processor 2610. In various embodiments, system memory 2620 may be implemented using any suitable memory technology, such as static random access memory (SRAM), synchronous dynamic RAM (SDRAM), nonvolatile/Flash-type memory, or any other type of memory. As illustrated, program instructions and data implementing certain operations such as, for example, those described in the figures above, may be stored within system memory 2620 as program instructions 2625 and data storage 2635, respectively. In other embodiments, program instructions and/or data may be received, sent or stored upon different types of computer-accessible media or on similar media separate from system memory 2620 or computer system 2600. Generally speaking, a computer-accessible medium may include any tangible storage media or memory media such as magnetic or optical media—e.g., disk or CD/DVD-ROM coupled to computer system 2600 via I/O interface 2630. Program instructions and data stored on a tangible computer-accessible medium in non-transitory form may further be transmitted by transmission media or signals such as electrical, electromagnetic, or digital signals, which may be conveyed via a communication medium such as a network and/or a wireless link, such as may be implemented via network interface 2640.
Input/output devices 2650 may, in some embodiments, include one or more display terminals, keyboards, keypads, touchpads, scanning devices, voice or optical recognition devices, mobile devices, or any other devices suitable for entering or retrieving data by one or more computer system 2600. Multiple input/output devices 2650 may be present in computer system 2600 or may be distributed on various nodes of computer system 2600. In some embodiments, similar input/output devices may be separate from computer system 2600 and may interact with one or more nodes of computer system 2600 through a wired or wireless connection, such as over network interface 2640.
As shown in FIG. 26, memory 2620 may include program instructions 2625, configured to implement certain embodiments described herein, and data storage 2635, comprising various data accessible by program instructions 26226. In an embodiment, program instructions 2625 may include software elements of embodiments illustrated in the above figures. For example, program instructions 2625 may be implemented in various embodiments using any desired programming language, scripting language, or combination of programming languages and/or scripting languages (e.g., C, C++, C#, Java™, JavaScript™, Perl, etc.). Data storage 2635 may include data that may be used in these embodiments (e.g., recorded communications, profiles for different modes of operations, etc.). In other embodiments, other or different software elements and data may be included.
A person of ordinary skill in the art will appreciate that computer system 2600 is merely illustrative and is not intended to limit the scope of the disclosure described herein. In particular, the computer system and devices may include any combination of hardware or software that can perform the indicated operations. In addition, the operations performed by the illustrated components may, in some embodiments, be performed by fewer components or distributed across additional components. Similarly, in other embodiments, the operations of some of the illustrated components may not be provided and/or other additional operations may be available. Accordingly, systems and methods described herein may be implemented or executed with other computer system configurations.
It will be understood that various operations illustrated in connection with FIGS. 1-26 may be executed simultaneously and/or sequentially. It will be further understood that each operation may be performed in any order and may be performed once or repetitiously. In various embodiments, the blocks shown in FIGS. 8, 22, and/or 23 may represent sets of software routines, logic functions, and/or data structures that are configured to perform specified operations. Although these modules are shown as distinct logical blocks, in other embodiments at least some of the operations performed by these modules may be combined in to fewer blocks. Conversely, any given one of the blocks shown in FIGS. 8, 22, and/or 23 may be implemented such that its operations are divided among two or more logical blocks. Moreover, although shown with a particular configuration, in other embodiments these various modules may be rearranged in other suitable ways.
a memory coupled to the processor, wherein the memory is configured to store program instructions, and wherein the program instructions are executable by the processor to cause the computing device to:
generate a chirp sequence having a bandwidth selected, at least in part, by subtracting an excess bandwidth parameter from a low nominal frequency and adding the excess bandwidth parameter to a high nominal frequency;
extract a phase angle of a frequency-domain version of the chirp sequence to obtain a flattened frequency spectrum;
create a phase quantized sequence based, at least in part, upon the flattened frequency spectrum;
employ the phased quantized sequence as a symbol to generate a power line communication (PLC) preamble portion of a PLC frame;
repeat the symbol N1 times to create a first section of the PLC preamble portion, where N1 is an integer;
repeat a phase inverted version of the symbol N2 times to create a second section of the PLC preamble portion, where N2 is an integer different from N1;
extend the first and second sections of the PLC preamble portion; and
combine the first and second extended sections of the PLC preamble portion.
4. The computing device of claim 1, wherein to extend the first and second sections of the PLC preamble portion, the program instructions are executable by the processor to further cause the computing device to:
prepend last β samples of the symbol to a first symbol of the first section of the PLC preamble portion and append first β samples of the symbol to a last symbol of the first section of the PLC preamble portion to create the first extended section of the PLC preamble portion, where β is less than a number of samples in the symbol;
window the first and last β samples of the first extended section of the PLC preamble portion;
prepend the last β samples of the symbol to a first symbol of the second section of the PLC preamble portion and append the first β samples of the symbol to a last symbol of the second section of the PLC preamble portion to create second extended section of the PLC preamble portion; and
window the first and last β samples of the second extended section of the PLC preamble portion.
5. The computing device of claim 1, wherein β is half the number of samples in the symbol, and wherein N1 identifies a given PLC domain.
generate another sequence independent from than the phased quantized sequence of the symbol;
repeat the another sequence N2 times to create a second section of the PLC preamble portion, where N2 is an integer; and
combine the first and second sections of the PLC preamble portion.
7. The computing device of claim 6, wherein the another sequence includes a Zadoff-Chu sequence.
8. The computing device of claim 6, wherein the another sequence identifies a given PLC domain.
9. The computing device of claim 6, wherein N1 and the another sequence in combination identify a given PLC domain.
identify the symbol within the PLC preamble portion of the PLC frame;
insert an instance of the symbol at a predetermined location within a PLC header portion of the PLC frame; and
cause the PLC frame to be transmitted over a power line.
receive another PLC frame;
in response to a determination that the computing device is operating in a multi-preamble decode mode,
attempt to decode a preamble portion of the another PLC frame using a first decoding technique, the preamble portion following one of a plurality of different PLC standards;
in response to the attempt being successful, decode the another PLC frame using the first decoding technique; and
in response to the attempt being unsuccessful, attempt to decode the preamble portion of the another PLC frame using a second decoding technique, the first and second decoding techniques each based upon a different PLC standard.
US13/269,487 2010-10-08 2011-10-10 Building, transmitting, and receiving frame structures in power line communications Active 2032-06-04 US8718115B2 (en)
US39138210P true 2010-10-08 2010-10-08
US41765710P true 2010-11-29 2010-11-29
US41858410P true 2010-12-01 2010-12-01
US201161431249P true 2011-01-10 2011-01-10
US201161431899P true 2011-01-12 2011-01-12
US201161434572P true 2011-01-20 2011-01-20
US13/269,487 US8718115B2 (en) 2010-10-08 2011-10-10 Building, transmitting, and receiving frame structures in power line communications
US14/169,773 US9252841B2 (en) 2010-10-08 2014-01-31 Building, transmitting, and receiving frame structures in power line communications
US14/979,730 US20160112548A1 (en) 2010-10-08 2015-12-28 Building, transmitting, and receiving frame structures in power line communications
US14/169,773 Division US9252841B2 (en) 2010-10-08 2014-01-31 Building, transmitting, and receiving frame structures in power line communications
US20120093198A1 US20120093198A1 (en) 2012-04-19
US8718115B2 true US8718115B2 (en) 2014-05-06
ID=45934115
US13/269,487 Active 2032-06-04 US8718115B2 (en) 2010-10-08 2011-10-10 Building, transmitting, and receiving frame structures in power line communications
US14/169,773 Active US9252841B2 (en) 2010-10-08 2014-01-31 Building, transmitting, and receiving frame structures in power line communications
US14/979,730 Pending US20160112548A1 (en) 2010-10-08 2015-12-28 Building, transmitting, and receiving frame structures in power line communications
US (3) US8718115B2 (en)
US8792567B2 (en) 2011-06-17 2014-07-29 Texas Instruments Incorporated Preamble sequence extension
US9136908B2 (en) 2012-06-05 2015-09-15 Texas Instruments Incorporated Long preamble and duty cycle based coexistence mechanism for power line communication (PLC) networks
CN102752040B (en) * 2012-06-21 2014-12-24 四川启明星蜀达电气有限公司 Hybrid networking and communication method based on wireless and power line carrier
US9485130B2 (en) * 2012-10-21 2016-11-01 Semitech Semiconductor Pty. Ltd. Universal OFDM synchronizer for power line communication
US8976878B2 (en) * 2013-01-15 2015-03-10 Raytheon Company Polynomial phases for multi-carrier modulation schemes with time domain windowing
EP3128708A4 (en) * 2014-04-01 2017-11-15 Ubiquoss Inc. Method for performing pairing in access network having g.hn technology applied thereto, and access network line concentration instrument (gam), access network terminal (gnt) and access network system using same
CN103927862B (en) * 2014-04-30 2017-05-24 威胜集团有限公司 G3 data forwarder and meter recording method for same
CN107005328B (en) * 2014-11-24 2019-04-19 松下知识产权经营株式会社 Communication device and communication means
FR3036566B1 (en) * 2015-05-20 2019-07-19 Sagemcom Energy & Telecom Sas Method for selecting a filter for application in reception of a frame
US20170078117A1 (en) * 2015-09-11 2017-03-16 Enphase Energy, Inc. Method and apparatus for channel estimation for three-phase plc systems
CN106100903A (en) * 2016-08-05 2016-11-09 南京理工大学 A kind of home power line adapts to the chance routing algorithm of topological structure time-varying
CN106447127A (en) * 2016-10-21 2017-02-22 黄东 Energy consumption optimization planning method for smart grid
EP0990027A1 (en) * 1997-05-31 2000-04-05 Hoechst Schering AgrEvo GmbH Herbicides test method
US6019005A (en) * 1997-08-21 2000-02-01 The United States Of America As Represented By The Secretary Of Agriculture Automatic sampling apparatus for the farmer stock peanut pneumatic sampler
JP2002351510A (en) * 2001-05-29 2002-12-06 Mitsubishi Electric Corp Setting display device for programmable controller
JP4663795B2 (en) * 2005-11-29 2011-04-06 エルエス コーポレーション Power line communication system using optical coaxial mixed network and communication equipment used in this power line communication system
2011-10-10 US US13/269,487 patent/US8718115B2/en active Active
2014-01-31 US US14/169,773 patent/US9252841B2/en active Active
2015-12-28 US US14/979,730 patent/US20160112548A1/en active Pending
US20160112548A1 (en) 2016-04-21
US20140146900A1 (en) 2014-05-29
US20120093198A1 (en) 2012-04-19
US9252841B2 (en) 2016-02-02
US8488615B2 (en) 2013-07-16 Contention groups for hidden nodes
CA2459778C (en) 2012-02-14 System and method for modulation of non-data bearing carriers in a multi-carrier modulation system
US6888790B2 (en) 2005-05-03 Frame synchronization technique for OFDM based modulation scheme
EP1780969A1 (en) 2007-05-02 Mitigation of radio frequency interference in multicarrier transmission
Ferreira et al. 2001 Power line communication
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DABAK, ANAND G.;VARADARAJAN, BADRI N.;KIM, IL HAN;AND OTHERS;SIGNING DATES FROM 20111006 TO 20111220;REEL/FRAME:027497/0042