Managing spectra of modulated signals in a communication network

Abstract
Information is modulated onto frequency components of a signal. The resulting modulated signal includes at least some redundancy in frequency enabling a portion of the information modulated onto selected frequency components to be recovered from fewer than all of the selected frequency components. Controlling the spectrum of the modulated signal includes enabling the amplitude of at least some frequency components of the modulated signal to be set below a predetermined amplitude used for modulating the information.
Description
TECHNICAL FIELD

The invention relates to managing spectra of modulated signals in a communication network.


BACKGROUND

Various types of communication systems transmit signals that may radiate in a portion of the electromagnetic spectrum and cause interference with devices that operate in that portion of the electromagnetic spectrum (e.g., radio frequency (RF) spectral bands). In some cases regulatory requirements for certain geographical regions (e.g., imposed by governments) place constraints on power that may be radiated in certain spectral regions, such as amateur radio bands. Some systems are wireless systems that communicate between stations using radio waves modulated with information. Other systems are wired systems that communicate using signals transmitted over a wired medium, but the wired medium may radiate enough power in restricted spectral bands to potentially cause interference.


Communication stations can be configured to avoid using or limit the amount of power that is radiated in certain restricted spectral bands. Alternatively, communication stations can be configured to adjust the spectral regions used for communication, based on whether the station is operating in an environment in which interference may occur. For example, orthogonal frequency division multiplexing (OFDM), also known as Discrete Multi Tone (DMT), is a spread spectrum signal modulation technique in which the available bandwidth is subdivided into a number of narrowband, low data rate channels or “carriers.” To obtain high spectral efficiency, the spectra of the carriers are overlapping and orthogonal to each other. Data are transmitted in the form of symbols that have a predetermined duration and encompass some number of carriers. The data transmitted on these carriers can be modulated in amplitude and/or phase, using modulation schemes such as Binary Phase Shift Key (BPSK), Quadrature Phase Shift Key (QPSK), or m-bit Quadrature Amplitude Modulation (m-QAM). An example of a system in which carriers can be disabled to avoid potential interference is described in more detail in U.S. Pat. No. 6,278,685, incorporated herein by reference. In this system, after one or more carriers are disabled, the modulation functions (e.g., an interleaver shift mechanism) are adjusted for a different number of usable carriers.


SUMMARY

In one aspect, in general, the invention features a method that includes modulating information onto frequency components of a signal. The resulting modulated signal includes at least some redundancy in frequency enabling a portion of the information modulated onto selected frequency components to be recovered from fewer than all of the selected frequency components. The method includes controlling the spectrum of the modulated signal, including enabling the amplitude of at least some frequency components of the modulated signal to be set below a predetermined amplitude used for modulating the information.


Aspects of the invention may include one or more of the following features.


Modulating the portion of the information onto selected frequency components comprises modulating redundant data from which the portion of the information can be decoded onto respective frequency components having different center frequencies.


The signal comprises a plurality of symbols, and at least some of the respective frequency components are in different symbols.


The redundant data comprises one or more encoded bits associated with the information.


The one or more encoded bits comprise data bits representing the information.


The one or more encoded bits comprise parity bits used for decoding the information.


The center frequencies are spread approximately uniformly over most of a set of frequency components available for modulating the information.


The method further comprises transmitting the modulated signal from a first node to a second node.


The first node and the second node each stores information identifying a set of frequency components available for modulating the information.


The second node is able to recover the portion of the information without needing to receive information from the first station indicating whether any of the selected frequency components have been set below the predetermined amplitude used for modulating the information.


The method further comprises demodulating each of the selected frequency components, and using resulting demodulated information to recover the portion of the information.


Recovering the portion of the information comprises decoding the demodulated information.


The amplitude of at least one of the selected frequency components has been set below the predetermined amplitude used for modulating the information.


The predetermined amplitude used for modulating the information comprises an amplitude corresponding to a phase shift keying modulation constellation.


The predetermined amplitude used for modulating the information comprises one of a plurality of amplitudes corresponding to a quadrature amplitude modulation constellation.


Setting the amplitude of one of the frequency components below the predetermined amplitude used for modulating the information comprises setting the amplitude of the frequency component below a limit based on a constraint on power that can be radiated in a portion of the spectrum of the modulated signal in which the frequency component is located.


The constraint on the power is based on a prohibition from interfering with a licensed entity.


The method further comprises setting the amplitude of the frequency component below the limit in response to detecting a transmission from the licensed entity.


Setting the amplitude of one of the frequency components below the predetermined amplitude used for modulating the information comprises turning off the frequency component.


The method further comprises selecting the frequency components of the signal according to a set of available frequencies that excludes at least some frequencies in a range of frequencies.


The excluded frequencies correspond to frequencies that are likely to interfere with licensed entities in a region.


In another aspect, in general, the invention features a transmitter. The transmitter includes an encoder module including circuitry to redundantly encode information to be modulated onto frequency components of a signal, the resulting modulated signal including at least some redundancy in frequency enabling a portion of the information modulated onto selected frequency components to be recovered from fewer than all of the selected frequency components. The transmitter also includes a spectral shaping module including circuitry to control the spectrum of the modulated signal, including enabling the amplitude of at least some frequency components of the modulated signal to be set below a predetermined amplitude used for modulating the information.


Among the many advantages of the invention (some of which may be achieved only in some of its various aspects and implementations) are the following.


The amplitude mask technique can be used to preserve interoperability between a user's local network (e.g., a home powerline network of devices such as computer, Ethernet bridge, TV, DVR, etc.) and an access network of a service provider, for example. The service provider may need to limit power radiated in a given spectral band due a constraint such as a prohibition from interfering with a licensed entity. The Federal Communications Commission (FCC) may require that the service provider be able to have a way to stop transmitting power in a given spectral band if they interfere with a licensed entity such as an amateur radio device or a radio station, for example. The amplitude mask technique enables the service provider to adjust the transmitted spectrum while preserving communication without the need to negotiate a change in modulation scheme with receiving stations.


For example, if a service provider is already communicating with a user's device using a given set of carriers, and the service provider needs to turn off one or more of the carriers, the amplitude mask technique enables the service provider to stop radiating power on an interfering carrier while still using that carrier in a modulation scheme agreed upon with the user station. Since the amplitude mask changes the amplitude of selected carriers but does not eliminate those carriers from the modulation scheme, the amplitude mask technique avoids the communication overhead of updating modulation parameters (e.g., the tone mask) before adjusting the transmitted spectrum.


Other features and advantages of the invention will be found in the detailed description, drawings, and claims.





DESCRIPTION OF DRAWINGS


FIG. 1 is a schematic diagram of a network configuration.



FIG. 2 is a block diagram of a communication system.



FIG. 3 is a block diagram of an encoder module.



FIG. 4 is a block diagram of a modulation module.





DETAILED DESCRIPTION

There are a great many possible implementations of the invention, too many to describe herein. Some possible implementations that are presently preferred are described below. It cannot be emphasized too strongly, however, that these are descriptions of implementations of the invention, and not descriptions of the invention, which is not limited to the detailed implementations described in this section but is described in broader terms in the claims.


As shown in FIG. 1, a network configuration 100 provides a shared communication medium 110 for a number of communication stations 102A-102E (e.g., computing devices, or audiovisual devices) to communicate with each other. The communication medium 110 can include one or more types of physical communication media such as coaxial cable, unshielded twisted pair, power lines, or wireless channels for example. The network configuration 100 can also include devices such as bridges or repeaters. The communication stations 102A-102E communicate with each other using predetermined physical (PHY) layer and medium access control (MAC) layer communication protocols used by network interface modules 106. The MAC layer is a sub-layer of the data link layer and provides an interface to the PHY layer, according to the Open Systems Interconnection (OSI) network architecture standard, for example. The network configuration 100 can have any of a variety of network topologies (e.g., bus, tree, star, mesh).


The stations use an amplitude mask technique, described in more detail below, for managing the spectra of modulated signals without needing to exchange information among stations indicating which carriers are in use or disabled. The amplitude mask technique is used with a redundant coding scheme that spreads data over multiple carriers so that the station can control the spectrum of modulated signals with a high likelihood that the modulated data can be recovered using redundant information.


In some implementations, the network interface modules 106 use protocols that include features to improve performance when the network configuration 100 includes a communication medium 110 that exhibits varying transmission characteristics. For example, the communication medium 110 may include AC power lines in a house, optionally coupled to other media (e.g., coaxial cable lines).


Power-line communication systems use existing AC wiring to exchange information. Owing to their being designed for much lower frequency transmissions, AC wiring provides varying channel characteristics at the higher frequencies used for data transmission (e.g., depending on the wiring used and the actual layout). To increase the data rate between various links, stations adjust their transmission parameters dynamically. This process is called channel adaptation. Channel adaptation results in adaptation information specifying a set of transmission parameters that can be used on each link. Adaptation information includes such parameters as the frequencies used, their modulation, and the forward error correction (FEC) used.


The communication channel between any two stations provided by the communication medium 110 may exhibit varying channel characteristics such as periodic variation in noise characteristics and frequency response. To improve performance and QoS stability in the presence of varying channel characteristics, the stations can synchronize channel adaptation with the frequency of the AC line (e.g., 50 or 60 Hz). There are typically variations in the phase and frequency of the AC line cycle from the power generating plant and local noise and load changes. This synchronization enables the stations to use consistent channel adaptation optimized for a particular phase region of the AC line cycle. An example of such synchronization is described in U.S. patent application Ser. No. 11/337,946, incorporated herein by reference.


Another aspect of mitigating potential impairments caused by the varying channel characteristics involves using a robust signal modulation format such as OFDM. An exemplary communication system that uses OFDM modulation is described below.


Any of a variety of communication system architectures can be used to implement the portion of the network interface module 106 that converts data to and from a signal waveform that is transmitted over the communication medium. An application running on a station provides and receives data to and from the network interface module 106 in segments. A “MAC Protocol Data Unit” (MPDU) is a segment of information including overhead and payload fields that the MAC layer has asked the PHY layer to transport. An MPDU can have any of a variety of formats based on the type of data being transmitted. A “PHY Protocol Data Unit (PPDU)” refers to the modulated signal waveform representing an MPDU that is transmitted over the power line.


In OFDM modulation, data are transmitted in the form of OFDM “symbols.” Each symbol has a predetermined time duration or symbol time Ts. Each symbol is generated from a superposition of N sinusoidal carrier waveforms that are orthogonal to each other and form the OFDM carriers. Each carrier has a peak frequency ƒi and a phase Φi measured from the beginning of the symbol. For each of these mutually orthogonal carriers, a whole number of periods of the sinusoidal waveform is contained within the symbol time Ts. Equivalently, each carrier frequency is an integral multiple of a frequency interval Δƒ=1/Ts. The phases Φi and amplitudes Ai of the carrier waveforms can be independently selected (according to an appropriate modulation scheme) without affecting the orthogonality of the resulting modulated waveforms. The carriers occupy a frequency range between frequencies ƒ1 and ƒN referred to as the OFDM bandwidth.


Referring to FIG. 2, a communication system 200 includes a transmitter 202 for transmitting a signal (e.g., a sequence of OFDM symbols) over a communication medium 204 to a receiver 206. The transmitter 202 and receiver 206 can both be incorporated into a network interface module 106 at each station. The communication medium 204 represents a path from one station to another over the communication medium 110 of the network configuration 100.


At the transmitter 202, modules implementing the PHY layer receive an MPDU from the MAC layer. The MPDU is sent to an encoder module 220 to perform processing such as scrambling, error correction coding and interleaving. Referring to FIG. 3, an exemplary encoder module 220 includes a scrambler 300, a Turbo encoder 302, and an interleaver 304.


The scrambler 300 gives the information represented by the MPDU a more random distribution (e.g., to reduce the probability of long strings of zeros or ones). In some implementations, the data is “XOR-ed” with a repeating Pseudo Noise (PN) sequence using a generator polynomial such as:

S(x)=x10+x3+1

The state bits in the scrambler 300 are initialized to a predetermined sequence (e.g., all ones) at the start of processing an MPDU.


Scrambled information bits from the scrambler 300 can be encoded by an encoder that uses any of a variety of coding techniques (e.g., convolutional codes). The encoder can generate a stream of data bits and in some cases auxiliary information such as one or more streams of parity bits. In this example, the Turbo encoder 302 uses a Turbo code to generate, for each block of m input information bits, a block of m “data bits” (d) that represent the input information, a first block of n/2 “parity bits” (p) corresponding to the information bits, and a second block of n/2 parity bits (q) corresponding to a known permutation of the information bits. Together, the data bits and the parity bits provide redundant information that can be used to correct potential errors. This scheme yields a code with a rate of m/(m+n).


The interleaver 304 interleaves the bits received from the Turbo encoder 302. The interleaving can be performed, for example on blocks corresponding to predetermined portions of an MPDU. The interleaving ensures that the redundant data and parity bits for a given block of information are distributed in frequency (e.g., on different carriers) and in time (e.g., on different symbols) to provide the ability to correct errors that occur due to localized signal interference (e.g., localized in time and/or frequency). The signal interference may be due to a jammer or may be due to spectral shaping of the spectral shaping module 400 described below. The interleaving can ensure that the redundant information for a given portion of the MPDU is modulated onto carriers that are evenly distributed over the OFDM bandwidth so that limited bandwidth interference is not likely to corrupt all of the carriers. The interleaving can also ensure that the redundant information is modulated onto more than one symbol so that broadband but short duration interference is not likely to corrupt all of the symbols.


The encoder module 220 includes a buffer that can be used to temporarily store data and parity bits from the Turbo encoder 302, to be read out by the interleaver 304 in a different order than the order in which they were stored. For example, a buffer can include includes k “data sub-banks” of m/k bits each and k “parity sub-banks” of n/k bits each (e.g., the sub-banks can correspond to logical regions of memory). In the case of k=4, the data bits are divided into four equal sub-blocks of m/4 bits, and the parity bits are divided into 4 equal sub-blocks of n/4 bits (where both m and n are selected to be divisible by 4). The Turbo encoder 302 writes the first m/4 data bits (in natural order) to the first data sub-bank, the next m/4 data bits to the second data sub-bank, and so on. The Turbo encoder 302 writes the first n/4 parity bits (in natural order) to the first parity sub-bank, the next n/4 parity bits to the second parity sub-bank, and so on.


The interleaver 304 generates a stream of bits to be modulated onto carriers of data symbols by reading from the sub-banks in a predetermined order. For example, the four data sub-banks of length m/4 may be thought of as a matrix consisting of m/4 rows and four columns, with column 0 representing the first sub-bank, column 1 representing the second sub-bank, and so on. Groups of four bits on the same row (one bit from each sub-block) are read out from the matrix at a time, starting with row 0. After a row has been read out, a row pointer is incremented by StepSize before performing the next row read. After m/4/StepSize row reads, the end of the matrix has been reached. The process is then repeated for different rows until all bits from the matrix have been read out. The parity bits can be interleaved in a similar manner. In some implementations, the data bits and the parity bits can also interleaved with each other in a predetermined manner.


In some modes of communication, called ROBO modes, the interleaver 304 performs additional processing to generate increased redundancy in the output data stream. For example, ROBO mode can introduce further redundancy by reading each sub-bank location multiple times at different cyclic shifts to represent each encoded bit by multiple bits at the output of the interleaver 304.


Other types of encoders and/or interleavers can be used that also provide redundancy to enable each portion of an MPDU to be recovered from fewer than all of the modulated carriers or fewer than all of the modulated symbols.


Referring again to FIG. 2, the encoded data is fed into a mapping module 222 that takes groups of data bits (e.g., 1, 2, 3, 4, 6, 8, or 10 bits), depending on the constellation used for the current symbol (e.g., a BPSK, QPSK, 8-QAM, 16-QAM constellation), and maps the data value represented by those bits onto the corresponding amplitudes of in-phase (I) and quadrature-phase (Q) components of a carrier waveform of the current symbol. This results in each data value being associated with a corresponding complex number Ci=Ai exp(jΦi) whose real part corresponds to the I component and whose imaginary part corresponds to the Q component of a carrier with peak frequency ƒi. Alternatively, any appropriate modulation scheme that associates data values to modulated carrier waveforms can be used.


The mapping module 222 also determines which of the carrier frequencies ƒ1, . . . , ƒN (or “tones”) within the OFDM bandwidth are used by the system 200 to transmit information according to a “tone mask.” For example, some carriers that are likely to interfere with licensed entities in a particular region (e.g., North America) can be avoided, and no power is radiated on those carriers. Devices sold in a given region can be programmed to use a tone mask configured for that region. The mapping module 222 also determines the type of modulation to be used on each of the carriers in the tone mask according to a “tone map.” The tone map can be a default tone map (e.g., for redundant broadcast communication among multiple stations), or a customized tone map determined by a receiving station that has been adapted to characteristics of the communication medium 204 (e.g., for more efficient unicast communication between two stations). If a station determines (e.g., during channel adaptation) that a carrier in the tone mask is not suitable for use (e.g., due to fading or noise) the tone map can specify that the carrier is not to be used to modulate data, but instead can use pseudorandom noise for that carrier (e.g., coherent BPSK modulated with a binary value from a Pseudo Noise (PN) sequence). For two stations to communicate, they should use the same tone mask and tone map, or at least know what tone mask and tone map the other device is using so that the signals can be demodulated properly.


A modulation module 224 performs the modulation of the resulting set of N complex numbers (some of which may be zero for unused carriers) determined by the mapping module 222 onto N orthogonal carrier waveforms having peak frequencies ƒ1, . . . , ƒN. The modulation module 224 performs an inverse discrete Fourier transform (IDFT) to form a discrete time symbol waveform S(n) (for a sampling rate ƒR), which can be written as










S


(
n
)


=




i
=
1

N




A
i



exp


[

j


(


2

π





i






n
/
N


+

Φ
i


)


]








Eq
.





(
1
)









where the time index n goes from 1 to N, Ai is the amplitude and Φi is the phase of the carrier with peak frequency ƒi=(i/N) ƒR, and j=√−1. In some implementations, the discrete Fourier transform corresponds to a fast Fourier transform (FFT) in which N is a power of 2.


A post-processing module 226 combines a sequence of consecutive (potentially overlapping) symbols into a “symbol set” that can be transmitted as a continuous block over the communication medium 204. The post-processing module 226 prepends a preamble to the symbol set that can be used for automatic gain control (AGC) and symbol timing synchronization. To mitigate intersymbol and intercarrier interference (e.g., due to imperfections in the system 200 and/or the communication medium 204) the post-processing module 226 can extend each symbol with a cyclic prefix that is a copy of the last part of the symbol. The post-processing module 226 can also perform other functions such as applying a pulse shaping window to subsets of symbols within the symbol set (e.g., using a raised cosine window or other type of pulse shaping window) and overlapping the symbol subsets.


The modulation module 224 or the post-processing module 226 can include a spectral shaping module that further modifies the spectrum of a signal that includes modulated symbols according to an “amplitude mask.” While the tone mask can be changed by exchanging messages among stations in a network, the amplitude mask enables a station to attenuate power transmitted on certain carriers without needing to exchange messages among the stations. Thus, the spectral shaping module enables dynamic spectral shaping in response to dynamic spectral constraints by changing the amplitude of carriers that may cause interference. In some cases, the spectral shaping module sets the amplitude of the frequency component below a predetermined limit in response to an event such as detecting a transmission from a licensed entity.


Referring to FIG. 4, an exemplary implementation of the modulation module 224 includes a spectral shaping module 400 coupled to an IDFT module 402. The spectral shaping module 400 modifies the amplitude Ai for the carriers that are to be attenuated, providing an attenuated amplitude A′i to the IDFT module 402. The value of the phase and Φi for the attenuated carriers can be passed through the spectral shaping module 400 without modification. Thus, in this example, the IDFT module 402 performs a discrete Fourier transform that includes the attenuated carrier frequencies.


The amplitude mask specifies an attenuation factor α for the amplitude A′i=αAi according to the amount by which the power is to be attenuated (e.g., 2 dB in amplitude for each 1 dB in power). The amplitude A′i is set below a predetermined amplitude that is normally used for modulating the information (e.g., according to a predetermined constellation) such that the resulting radiated power does not interfere with other devices. The amplitude mask entry may also indicate that a carrier is to be nulled completely with the corresponding amplitude set to zero. The attenuated carriers are still processed by the receiving station even if they are transmitted with zero amplitude so that the modulation and encoding scheme is preserved.


Generally, for two stations to communicate, they don't necessarily need to know what amplitude mask the other station is using (or whether the station is using an amplitude mask at all). Even though no modification of the modulation scheme between a transmitter and a receiver is necessary to partially attenuate or fully attenuate (i.e., turn off) a carrier using the amplitude mask, in some cases, when a receiving station updates a tone map (which determines how carriers within the tone mask are to be modulated) the receiving station will detect a very poor signal-to-noise ratio on the attenuated carriers and may exclude them from the updated tone map (indicating that those carriers are not to be used for modulating data).


In alternative implementations, the spectral shaping module can be included in the post-processing module 226, for example, as a programmable notch filter that reduces the amplitude of one or more narrow frequency bands in the signal.


An Analog Front End (AFE) module 228 couples an analog signal containing a continuous-time (e.g., low-pass filtered) version of the symbol set to the communication medium 204. The effect of the transmission of the continuous-time version of the waveform S(t) over the communication medium 204 can be represented by convolution with a function g(τ;t) representing an impulse response of transmission over the communication medium. The communication medium 204 may add noise n(t), which may be random noise and/or narrowband noise emitted by a jammer.


At the receiver 206, modules implementing the PHY layer receive a signal from the communication medium 204 and generate an MPDU for the MAC layer. An AFE module 230 operates in conjunction with an Automatic Gain Control (AGC) module 232 and a time synchronization module 234 to provide sampled signal data and timing information to a discrete Fourier transform (DFT) module 236.


After removing the cyclic prefix, the receiver 206 feeds the sampled discrete-time symbols into DFT module 236 to extract the sequence of N complex numbers representing the encoded data values (by performing an N-point DFT). Demodulator/Decoder module 238 maps the complex numbers onto the corresponding bit sequences and performs the appropriate decoding of the bits (including deinterleaving, error correction, and descrambling). The data that was modulated onto carriers that were subsequently attenuated by the spectral shaping module 400 can be recovered due to the redundancy in the encoding scheme.


Any of the modules of the communication system 200 including modules in the transmitter 202 or receiver 206 can be implemented in hardware, software, or a combination of hardware and software.


Many other implementations of the invention other than those described above are within the invention, which is defined by the following claims.

Claims
  • 1. A method for operating a communicating station in order to transmit information through a communication medium using a set of channels, wherein the channels have respective carrier frequencies, the method comprising: determining a list of one or more of the carrier frequencies over which transmissions are to be attenuated;encoding information bits according to an error correction code in order to obtain coded bits, wherein the coded bits represent the received information bits with redundancy;interleaving the coded bits to obtain interleaved bits;mapping blocks of the interleaved bits to corresponding sets of complex numbers, wherein each set of complex numbers includes one complex number for each of the carrier frequencies;modifying each set of complex numbers by attenuating one or more of the complex numbers in the set that correspond to the one or more carrier frequencies on the list, wherein said attenuating includes scaling the one or more complex numbers so that their amplitudes are less than a predetermined amplitude level;computing an inverse Fourier transform of each modified set of complex numbers to obtain a sequence of time-domain samples; andtransmitting a time-domain signal over the communication medium based on the sequence of time-domain samples.
  • 2. The method of claim 1, wherein the one or more carrier frequencies on the list are determined without negotiating with any other communicating station over the communication medium.
  • 3. The method of claim 1, wherein the one or more carrier frequencies on the list are determined without exchanging messages with any other communicating station over the communication medium.
  • 4. The method of claim 1, wherein the list is not provided to a receiving station that receives and demodulates the time-domain signal.
  • 5. The method of claim 1, wherein the predetermined amplitude level is zero.
  • 6. The method of claim 1, wherein the predetermined amplitude level is an amplitude level that based on a regulatory limit for radiated power.
  • 7. The method of claim 1, wherein the predetermined amplitude level is a level that ensures non-interference with one or more other communication stations.
  • 8. The method of claim 1, wherein the said interleaving spreads coded bits across different blocks of the interleaved bits.
  • 9. The method of claim 1, wherein said interleaving spreads coded bits over the carrier frequencies.
  • 10. The method of claim 9, wherein said interleaving spreads coded bits uniformly over the carrier frequencies.
  • 11. The method of claim 1, further comprising detecting transmission from another communication station over the communication medium, wherein said determining the list includes adding one or more of the carrier frequencies to the list in response to detecting said transmission.
  • 12. The method of claim 1, wherein said mapping of blocks of the interleaved bits to corresponding sets of complex numbers includes applying a tone mask to avoid one or more frequencies specified by the tone mask, wherein one or more complex numbers in each set that correspond to the one or more specified frequencies are set to zero and are not determined by the interleaved bits, wherein the tone mask is determined by negotiation with another communication station over the communication medium.
  • 13. The method of claim 1, further comprising: scrambling the information bits prior said encoding the information bits.
  • 14. A communicating station including a system for transmitting information through a communication medium using a set of channels, wherein the channels have respective carrier frequencies, the system comprising: memory for storing a list of one or more of the carrier frequencies over which transmissions are to be attenuated;an encoding unit configured to encode information bits according to an error correction code in order to obtain coded bits, wherein the coded bits represent the received information bits with redundancy;an interleaver configured to interleave the coded bits to obtain interleaved bits;a modulation module configured to: map blocks of the interleaved bits to corresponding sets of complex numbers, wherein each set of complex numbers includes one complex number for each of the carrier frequencies;modify each set of complex numbers by attenuating one or more of the complex numbers in the set that correspond to the one or more carrier frequencies on the list, wherein said attenuating includes scaling the one or more complex numbers so that their amplitudes are less than a predetermined amplitude level; andcompute an inverse Fourier transform of each modified set of complex numbers to obtain a sequence of time-domain samples.
  • 15. The communicating station of claim 14, wherein the system is configured to determine the one or more carrier frequencies on the list without negotiating a change in modulation scheme with a receiving station over the communication medium.
  • 16. The communicating station of claim 14, wherein the system is configured to determine the one or more carrier frequencies on the list without exchanging messages with any other communicating station over the communication medium.
  • 17. The communicating station of claim 14, wherein the list is not provided to a receiving station that receives and demodulates the time-domain signal.
  • 18. The communicating station of claim 14, wherein the predetermined amplitude level is zero.
  • 19. The communicating station of claim 14, wherein the predetermined amplitude level is an amplitude level that based on a regulatory limit for radiated power.
  • 20. The communicating station of claim 14, wherein the predetermined amplitude level is a level that ensures non-interference with one or more other communication stations.
  • 21. The communicating station of claim 14, wherein the interleaver is configured to spread coded bits across different blocks of the interleaved bits.
  • 22. The communicating station of claim 14, wherein said interleaver is configured to spread coded bits over the carrier frequencies.
  • 23. The communicating station of claim 22, wherein said interleaver is configured to spread coded bits uniformly over the carrier frequencies.
  • 24. The communicating station of claim 14, further comprising a receiver, wherein the communicating station is configured to add one or more of the carrier frequencies to the list in response to the receiver's detecting of a transmission from a licensed entity.
  • 25. The communicating station of claim 14, wherein said modulation module is configured to apply a tone mask to avoid one or more frequencies specified by the tone mask, wherein one or more complex numbers in each set that correspond to the one or more specified frequencies are set to zero and are not determined by the interleaved bits, wherein the tone mask is determined by negotiation with another communication station over the communication medium.
  • 26. The communicating station of claim 14, further comprising: a scrambler configured to scramble the information bits prior said encoding the information bits.
  • 27. The communicating station of claim 14 further comprising: a front end configured to transmit a time-domain signal over the communication medium based on the sequence of time-domain samples.
PRIORITY INFORMATION

This application is a continuation of U.S. application Ser. No. 11/493,382, titled MANAGING SPECTRA OF MODULATED SIGNALS IN A COMMUNICATION NETWORK, by Lawrence W. Yonge III, which was filed on Jul. 26, 2006 now U.S. Pat. No. 8,175,190, which claims priority to U.S. Application Ser. No. 60/702,717, titled POWERLINE NETWORK MANAGEMENT AND CONTROL by Lawrence W. Yonge III, and filed on Jul. 27, 2005, and U.S. Application Ser. No. 60/705,720, titled COMMUNICATING IN A NETWORK THAT INCLUDES A MEDIUM HAVING VARYING TRANSMISSION CHARACTERISTICS by Yiorgos M. Peponides et al. and filed on Aug. 2, 2005, each of which is incorporated herein by reference as though fully and completely set forth herein.

US Referenced Citations (395)
Number Name Date Kind
3806885 Moore Apr 1974 A
4569044 Tao et al. Feb 1986 A
4581734 Olson et al. Apr 1986 A
4630261 Irvin Dec 1986 A
4677612 Olson et al. Jun 1987 A
4682324 Ulug Jul 1987 A
4720850 Oberlander et al. Jan 1988 A
4726018 Bux et al. Feb 1988 A
4792947 Takiyasu et al. Dec 1988 A
4819229 Pritty et al. Apr 1989 A
4881241 Pommier et al. Nov 1989 A
4943959 Arnold Jul 1990 A
4977593 Ballance Dec 1990 A
5001472 Fischer et al. Mar 1991 A
5003539 Takemoto et al. Mar 1991 A
5046069 Calvignac et al. Sep 1991 A
5081678 Kaufman et al. Jan 1992 A
5105423 Tanaka et al. Apr 1992 A
5121396 Irvin et al. Jun 1992 A
5140584 Suzuki Aug 1992 A
5142578 Matyas et al. Aug 1992 A
5157659 Schenkel Oct 1992 A
5185796 Wilson Feb 1993 A
5197061 Halbert-Lassalle et al. Mar 1993 A
5204903 Okada et al. Apr 1993 A
5214646 Yacoby May 1993 A
5228025 Le Floch et al. Jul 1993 A
5231634 Giles et al. Jul 1993 A
5249184 Woest et al. Sep 1993 A
5274629 Helard et al. Dec 1993 A
5280480 Pitt et al. Jan 1994 A
5297275 Thayer Mar 1994 A
5307376 Castelain et al. Apr 1994 A
5339313 Ben-Michael et al. Aug 1994 A
5343473 Cidon et al. Aug 1994 A
5359625 Vander Mey et al. Oct 1994 A
5384777 Ahmadi et al. Jan 1995 A
5416801 Chouly et al. May 1995 A
5426646 Slack Jun 1995 A
RE35001 Grow Jul 1995 E
5432848 Butter et al. Jul 1995 A
5436905 Li et al. Jul 1995 A
5448565 Chang et al. Sep 1995 A
5452288 Rahuel et al. Sep 1995 A
5452322 Lauer Sep 1995 A
5473602 McKenna et al. Dec 1995 A
5481535 Hershey Jan 1996 A
5483529 Baggen et al. Jan 1996 A
5488632 Mason et al. Jan 1996 A
5504747 Sweazey Apr 1996 A
5515379 Crisler et al. May 1996 A
5524027 Huisken Jun 1996 A
5537414 Takiyasu et al. Jul 1996 A
5541922 Pyhalammi Jul 1996 A
5548649 Jacobson Aug 1996 A
5555268 Fattouche et al. Sep 1996 A
5563883 Cheng Oct 1996 A
5563897 Pyndiah et al. Oct 1996 A
5568476 Sherer et al. Oct 1996 A
5610908 Shelswell et al. Mar 1997 A
5612975 Becker et al. Mar 1997 A
5615212 Ruszczyk et al. Mar 1997 A
5619651 Young Apr 1997 A
5623512 Sasaki Apr 1997 A
5629942 Zijderhand May 1997 A
5629948 Hagiwara et al. May 1997 A
5636230 Marturano et al. Jun 1997 A
5644576 Bauchot et al. Jul 1997 A
5651009 Perreault et al. Jul 1997 A
5694389 Seki et al. Dec 1997 A
5706348 Gray et al. Jan 1998 A
5717689 Ayanoglu Feb 1998 A
5732113 Schmidl et al. Mar 1998 A
5737330 Fulthorp et al. Apr 1998 A
5745769 Choi Apr 1998 A
5757766 Sugita May 1998 A
5757770 Lagoutte et al. May 1998 A
5764931 Schmahl et al. Jun 1998 A
5771235 Tang et al. Jun 1998 A
5787071 Basso et al. Jul 1998 A
5790541 Patrick et al. Aug 1998 A
5793307 Perreault et al. Aug 1998 A
5793861 Haigh Aug 1998 A
5799033 Baggen Aug 1998 A
5812599 Van Kerckhove Sep 1998 A
5818821 Schurig Oct 1998 A
5818826 Gfeller et al. Oct 1998 A
5825807 Kumar Oct 1998 A
5828677 Sayeed et al. Oct 1998 A
5841778 Shaffer et al. Nov 1998 A
5841873 Lockhart et al. Nov 1998 A
5884040 Chung Mar 1999 A
5886993 Ruszczyk et al. Mar 1999 A
5887063 Varadharajan et al. Mar 1999 A
5892769 Lee Apr 1999 A
5896561 Schrader et al. Apr 1999 A
5903614 Suzuki et al. May 1999 A
5914932 Suzuki et al. Jun 1999 A
5914959 Marchetto et al. Jun 1999 A
5940399 Weizman Aug 1999 A
5940438 Poon et al. Aug 1999 A
5948060 Gregg et al. Sep 1999 A
5956338 Ghaibeh Sep 1999 A
5966412 Ramaswamy Oct 1999 A
5970062 Bauchot Oct 1999 A
5987011 Toh Nov 1999 A
5987331 Grube et al. Nov 1999 A
6005894 Kumar Dec 1999 A
6006017 Joshi et al. Dec 1999 A
6028933 Heer et al. Feb 2000 A
6035000 Bingham Mar 2000 A
6041063 Povlsen et al. Mar 2000 A
6041358 Huang et al. Mar 2000 A
6044154 Kelly Mar 2000 A
6044482 Wong Mar 2000 A
6052377 Ohmi et al. Apr 2000 A
6055316 Perlman et al. Apr 2000 A
6074086 Yonge, III Jun 2000 A
6076115 Sambamurthy et al. Jun 2000 A
6092214 Quoc et al. Jul 2000 A
6097703 Larsen et al. Aug 2000 A
6097817 Bilgic et al. Aug 2000 A
6098179 Harter, Jr. Aug 2000 A
6108713 Sambamurthy et al. Aug 2000 A
6111919 Yonge, III Aug 2000 A
6125150 Wesel et al. Sep 2000 A
6130887 Dutta Oct 2000 A
6130894 Ojard et al. Oct 2000 A
6151296 Vijayan et al. Nov 2000 A
6160443 Maalej et al. Dec 2000 A
6169744 Grabelsky et al. Jan 2001 B1
6172615 Kogure Jan 2001 B1
6172616 Johnson et al. Jan 2001 B1
6182147 Farinacci Jan 2001 B1
6188717 Kaiser et al. Feb 2001 B1
6192397 Thompson Feb 2001 B1
6202082 Tomizawa et al. Mar 2001 B1
6215792 Abi-Nassif Apr 2001 B1
6216244 Myers et al. Apr 2001 B1
6222851 Petry Apr 2001 B1
6222873 Bang et al. Apr 2001 B1
6243386 Chan et al. Jun 2001 B1
6243449 Margulis et al. Jun 2001 B1
6246770 Stratton et al. Jun 2001 B1
6252849 Rom et al. Jun 2001 B1
6259696 Yazaki et al. Jul 2001 B1
6263445 Blumenau Jul 2001 B1
6269132 Yonge, III Jul 2001 B1
6278357 Croushore et al. Aug 2001 B1
6278685 Yonge, III et al. Aug 2001 B1
6278716 Rubenstein et al. Aug 2001 B1
6279716 Kayatani et al. Aug 2001 B1
6289000 Yonge, III Sep 2001 B1
6295296 Tappan Sep 2001 B1
6334185 Hansson et al. Dec 2001 B1
6343083 Mendelson et al. Jan 2002 B1
6363052 Hosein Mar 2002 B1
6370156 Spruyt et al. Apr 2002 B2
6385672 Wang et al. May 2002 B1
6397368 Yonge, III May 2002 B1
6421725 Vermilyea et al. Jul 2002 B1
6430192 Creedon et al. Aug 2002 B1
6430661 Larson et al. Aug 2002 B1
6434153 Yazaki et al. Aug 2002 B1
6442129 Yonge, III Aug 2002 B1
6445717 Gibson et al. Sep 2002 B1
6456649 Isaksson et al. Sep 2002 B1
6466580 Leung Oct 2002 B1
6469992 Schieder Oct 2002 B1
6473435 Zhou et al. Oct 2002 B1
6480489 Muller et al. Nov 2002 B1
6487212 Erimli et al. Nov 2002 B1
6501760 Ohba et al. Dec 2002 B1
6519263 Huth Feb 2003 B1
6526451 Kasper Feb 2003 B2
6526581 Edson Feb 2003 B1
6538985 Petry et al. Mar 2003 B1
6553534 Yonge, III Apr 2003 B2
6559757 Deller et al. May 2003 B1
6567416 Chuah May 2003 B1
6567914 Just et al. May 2003 B1
6577231 Litwin, Jr. et al. Jun 2003 B2
6587453 Romans et al. Jul 2003 B1
6587474 Griessbach Jul 2003 B1
6594268 Aukia et al. Jul 2003 B1
6647250 Bultman et al. Nov 2003 B1
6654410 Tzannes Nov 2003 B2
6667991 Tzannes Dec 2003 B1
6671284 Yonge, III Dec 2003 B1
6747976 Bensaou et al. Jun 2004 B1
6759946 Sahinoglu et al. Jul 2004 B2
6765885 Jiang et al. Jul 2004 B2
6775280 Ma et al. Aug 2004 B1
6778507 Jalali Aug 2004 B1
6782476 Ishibashi Aug 2004 B1
6807146 McFarland Oct 2004 B1
6834091 Litwin, Jr. et al. Dec 2004 B2
6882634 Bagchi et al. Apr 2005 B2
6888844 Mallory et al. May 2005 B2
6901064 Cain et al. May 2005 B2
6907044 Yonge, III Jun 2005 B1
6909723 Yonge, III Jun 2005 B1
6952399 Bayerl et al. Oct 2005 B1
6985072 Omidi et al. Jan 2006 B2
7000031 Fischer et al. Feb 2006 B2
7085284 Negus Aug 2006 B1
7200147 Shin et al. Apr 2007 B2
7206320 Iwamura Apr 2007 B2
7212513 Gassho et al. May 2007 B2
7218901 Mobley et al. May 2007 B1
7233804 Sugaya et al. Jun 2007 B2
7242932 Wheeler et al. Jul 2007 B2
7274792 Chin et al. Sep 2007 B2
7280517 Benveniste Oct 2007 B2
7298706 Yoshida et al. Nov 2007 B2
7307357 Kopp Dec 2007 B2
7315524 Ohmi et al. Jan 2008 B2
7330457 Panwar et al. Feb 2008 B2
7339457 Trochesset Mar 2008 B2
7342896 Ayyagari Mar 2008 B2
7352770 Yonge, III Apr 2008 B1
7356010 He et al. Apr 2008 B2
7359398 Sugaya Apr 2008 B2
7369579 Logvinov et al. May 2008 B2
7388853 Ptasinski et al. Jun 2008 B2
7423992 Iwamura Sep 2008 B2
7457306 Watanabe et al. Nov 2008 B2
7496078 Rahman Feb 2009 B2
7506042 Ayyagari Mar 2009 B2
7519030 Cimini, Jr. et al. Apr 2009 B2
7522630 Ho et al. Apr 2009 B2
7551606 Iwamura Jun 2009 B2
7558294 Yonge, III Jul 2009 B2
7623542 Yonge, III Nov 2009 B2
7664145 Akamatsu et al. Feb 2010 B2
7684568 Yonge, III Mar 2010 B2
7684756 Bohnke et al. Mar 2010 B2
7729372 Yonge, III Jun 2010 B2
7822059 Katar et al. Oct 2010 B2
7856008 Ayyagari et al. Dec 2010 B2
7894487 Yonge, III et al. Feb 2011 B2
7904021 Yonge, III Mar 2011 B2
8089901 Yonge, III Jan 2012 B2
8090857 Yonge, III Jan 2012 B2
8175190 Yonge, III May 2012 B2
20010043576 Terry Nov 2001 A1
20010048692 Karner Dec 2001 A1
20020001314 Yi et al. Jan 2002 A1
20020012320 Ogier et al. Jan 2002 A1
20020015423 Rakib et al. Feb 2002 A1
20020015466 Akiba et al. Feb 2002 A1
20020015477 Geile et al. Feb 2002 A1
20020027897 Moulsley et al. Mar 2002 A1
20020042836 Mallory Apr 2002 A1
20020048368 Gardner Apr 2002 A1
20020061031 Sugar et al. May 2002 A1
20020065047 Moose May 2002 A1
20020105901 Chini et al. Aug 2002 A1
20020107023 Chari et al. Aug 2002 A1
20020115458 Mizuno et al. Aug 2002 A1
20020116342 Hirano et al. Aug 2002 A1
20020131591 Henson et al. Sep 2002 A1
20020137462 Rankin Sep 2002 A1
20020150249 Ohkita et al. Oct 2002 A1
20020163933 Benveniste Nov 2002 A1
20020191533 Chini et al. Dec 2002 A1
20030006883 Kim et al. Jan 2003 A1
20030012166 Benveniste Jan 2003 A1
20030016123 Tager et al. Jan 2003 A1
20030038710 Manis et al. Feb 2003 A1
20030039257 Manis et al. Feb 2003 A1
20030048183 Vollmer et al. Mar 2003 A1
20030051146 Ebina et al. Mar 2003 A1
20030053493 Graham Mobley et al. Mar 2003 A1
20030056014 Verberkt et al. Mar 2003 A1
20030066082 Kliger et al. Apr 2003 A1
20030071721 Manis et al. Apr 2003 A1
20030079169 Ho et al. Apr 2003 A1
20030086437 Benveniste May 2003 A1
20030107476 Sahinoglu et al. Jun 2003 A1
20030133427 Cimini, Jr. et al. Jul 2003 A1
20030133473 Manis et al. Jul 2003 A1
20030137993 Odman Jul 2003 A1
20030174664 Benveniste Sep 2003 A1
20030181204 Benveniste Sep 2003 A1
20030198246 Lifshitz et al. Oct 2003 A1
20030203716 Takahashi et al. Oct 2003 A1
20030217182 Liu et al. Nov 2003 A1
20030227934 White et al. Dec 2003 A1
20030231607 Scanlon et al. Dec 2003 A1
20030231652 Sprague et al. Dec 2003 A1
20030231658 Liang et al. Dec 2003 A1
20030231715 Shoemake et al. Dec 2003 A1
20040001499 Patella et al. Jan 2004 A1
20040008728 Lee Jan 2004 A1
20040009783 Miyoshi Jan 2004 A1
20040010736 Alapuranen Jan 2004 A1
20040013135 Haddad Jan 2004 A1
20040037248 Tamaki et al. Feb 2004 A1
20040047319 Elg Mar 2004 A1
20040047351 Del Prado Pavon et al. Mar 2004 A1
20040064509 Ayyagari et al. Apr 2004 A1
20040066783 Ayyagari Apr 2004 A1
20040070912 Kopp Apr 2004 A1
20040075535 Propp et al. Apr 2004 A1
20040077338 Hsu et al. Apr 2004 A1
20040081089 Ayyagari et al. Apr 2004 A1
20040083362 Park et al. Apr 2004 A1
20040122531 Atsuta et al. Jun 2004 A1
20040136396 Yonge, III Jul 2004 A1
20040141523 Bhushan et al. Jul 2004 A1
20040141548 Shattil Jul 2004 A1
20040165532 Poor et al. Aug 2004 A1
20040165728 Crane et al. Aug 2004 A1
20040174851 Zalitzky et al. Sep 2004 A1
20040184427 Lynch et al. Sep 2004 A1
20040184481 Lee Sep 2004 A1
20040186994 Herbert et al. Sep 2004 A1
20040208139 Iwamura Oct 2004 A1
20040214570 Zhang et al. Oct 2004 A1
20040218577 Nguyen et al. Nov 2004 A1
20040250159 Tober et al. Dec 2004 A1
20040264557 Maruyama Dec 2004 A1
20050001694 Berkman Jan 2005 A1
20050015805 Iwamura Jan 2005 A1
20050025176 Ko et al. Feb 2005 A1
20050033960 Vialen et al. Feb 2005 A1
20050041588 Kim et al. Feb 2005 A1
20050041673 Jiang et al. Feb 2005 A1
20050053066 Famolari Mar 2005 A1
20050058089 Vijayan et al. Mar 2005 A1
20050063402 Rosengard et al. Mar 2005 A1
20050078803 Wakisaka et al. Apr 2005 A1
20050089062 Zegelin Apr 2005 A1
20050099938 Sarraf et al. May 2005 A1
20050122994 Mangin et al. Jun 2005 A1
20050124293 Alicherry et al. Jun 2005 A1
20050135312 Montojo et al. Jun 2005 A1
20050135403 Ketchum et al. Jun 2005 A1
20050147075 Terry Jul 2005 A1
20050149649 Carneal et al. Jul 2005 A1
20050149757 Corbett et al. Jul 2005 A1
20050163067 Okamoto et al. Jul 2005 A1
20050169222 Ayyagari et al. Aug 2005 A1
20050170835 Ayyagari et al. Aug 2005 A1
20050174950 Ayyagari Aug 2005 A1
20050180453 Gaskill Aug 2005 A1
20050190785 Yonge, III Sep 2005 A1
20050192011 Hong et al. Sep 2005 A1
20050193116 Ayyagari et al. Sep 2005 A1
20050243765 Schrader et al. Nov 2005 A1
20050276276 Davis Dec 2005 A1
20060007907 Shao et al. Jan 2006 A1
20060077997 Yamaguchi et al. Apr 2006 A1
20060083205 Buddhikot et al. Apr 2006 A1
20060098606 Pandey et al. May 2006 A1
20060126493 Hashem et al. Jun 2006 A1
20060164969 Malik et al. Jul 2006 A1
20060218269 Iwamura Sep 2006 A1
20060227729 Budampati et al. Oct 2006 A1
20060233203 Iwamura Oct 2006 A1
20060233266 Suetsugu Oct 2006 A1
20060256881 Yonge, III et al. Nov 2006 A1
20070013419 Ayyagari et al. Jan 2007 A1
20070025266 Riedel et al. Feb 2007 A1
20070025383 Katar et al. Feb 2007 A1
20070025384 Ayyagari et al. Feb 2007 A1
20070025386 Riedel et al. Feb 2007 A1
20070025391 Yonge, III Feb 2007 A1
20070025398 Yonge, III Feb 2007 A1
20070026794 Ayyagari et al. Feb 2007 A1
20070058659 Ayyagari et al. Mar 2007 A1
20070058661 Chow Mar 2007 A1
20070058732 Riedel et al. Mar 2007 A1
20070060141 Kangude et al. Mar 2007 A1
20070091925 Miyazaki et al. Apr 2007 A1
20070127381 Oh et al. Jun 2007 A1
20070147322 Agrawal et al. Jun 2007 A1
20070230497 Choi et al. Oct 2007 A1
20070237070 Geile et al. Oct 2007 A1
20070248089 Redi et al. Oct 2007 A1
20080095126 Mahany et al. Apr 2008 A1
20080117891 Damnjanovic et al. May 2008 A1
20080132264 Krishnamurthy et al. Jun 2008 A1
20080201503 McKim et al. Aug 2008 A1
20090011782 Yonge, III Jan 2009 A1
20090034552 Yonge, III Feb 2009 A1
20090067389 Lee et al. Mar 2009 A1
20090116461 Yonge, III May 2009 A1
20090154487 Ryan et al. Jun 2009 A1
20090207865 Yonge, III Aug 2009 A1
20090238153 Sim Sep 2009 A1
20090279638 Kurobe et al. Nov 2009 A1
20100111099 Yonge, III May 2010 A1
20110128973 Yonge, III Jun 2011 A1
Foreign Referenced Citations (49)
Number Date Country
3413144 Oct 1985 DE
0571005 Nov 1993 EP
0818905 Jan 1998 EP
1065818 Jan 2001 EP
0844563 Jan 2003 EP
1693998 Aug 2006 EP
1748574 Jan 2007 EP
1748597 Jan 2007 EP
1179919 Jul 2010 EP
3107317 May 1991 JP
08265241 Oct 1996 JP
10503624 Mar 1998 JP
2000512450 Sep 2000 JP
2002500388 Jan 2002 JP
2002135177 May 2002 JP
2003507930 Feb 2003 JP
2004088180 Mar 2004 JP
2005073240 Mar 2005 JP
2005079615 Mar 2005 JP
2005529518 Sep 2005 JP
2007509530 Apr 2007 JP
WO9528773 Oct 1995 WO
WO9634329 Oct 1996 WO
WO9748206 Dec 1997 WO
WO9857439 Dec 1998 WO
WO9857440 Dec 1998 WO
WO9934548 Jul 1999 WO
WO0072495 Nov 2000 WO
WO0113560 Feb 2001 WO
WO0118998 Mar 2001 WO
WO0182550 Nov 2001 WO
WO0206986 Jan 2002 WO
WO0213442 Feb 2002 WO
WO0241598 May 2002 WO
WO02103943 Dec 2002 WO
WO03015291 Feb 2003 WO
WO03026224 Mar 2003 WO
WO03100996 Dec 2003 WO
WO03104919 Dec 2003 WO
WO030103222 Dec 2003 WO
WO2004038980 May 2004 WO
2004095165 Nov 2004 WO
WO2004102893 Nov 2004 WO
WO2005015841 Feb 2005 WO
WO2005024558 Mar 2005 WO
WO2005039127 Apr 2005 WO
WO2005048047 May 2005 WO
WO2005062546 Jul 2005 WO
WO2007014319 Feb 2007 WO
Non-Patent Literature Citations (95)
Entry
‘Initialization Vector’ Wikipedia, the Free Encyclopedia [online] [retrieved on Jun. 21, 2006] <URL: http://en.wikipedia.org/wiki/Initialization.sub.--vector>.
Advisory Action for U.S. Appl. No. 11/388,584 dated Mar. 23, 2010.
Afkhamie et al., “An Overview of the upcoming HomePlug AV Standard”, May 2005, IEEE 0-7803-8844-5/05, pp. 400-404.
Anuj Batra et al., TI Physical Layer Proposal for IEEE 802.15 Task Group 3A, May 14, 2003, IEEE, IEEE 802.15-03/142R2, pp. 1-76.
Applied Cryptography, Second Edition: protocols, algorithms, and source code in C, Bruce Schneier, 1996.
Ayyagari Deepak,“High Speed Home Networking for AV and IP Applications using existing Powerline Infrastructure,”Dec. 2004,p. 65-72,paras:[0001]&[0004],Sharp Technical Journal.
Baig Sobia, et al., “A Discrete Multitone Transceiver at the Heart of the PHY Layer of an In-Home Power Line Communication Local Area Network,” IEEE Communications Magazine, Apr. 2003, pp. 48-53.
Benedetto S et al: “A soft-input soft-ouput maximum a posteriori (MAP) module to decode parallel and serial concatenated codes” TDA Progress Report, XX, XX, vol. 42, No. 127, Nov. 15, 1996, pp. 1-20, XP002959296.
Bertsekas, et al., Data Networks, Prentice Hall, Englewood Cliffs, NJ, Section 2.4.3 Selective Repeat ARQ (1992).
Blake et al., “An Architecture for Differentiated Services,” RFC 2475, pp. 1-31, The Internet Society, Dec. 1998.
Bruschi Danilo, “Secure Multicast in Wireless Networks of Mobile Hosts: Protocols and Issues”, 2002, Mobile Networks and Applications, pp. 503-511.
Bux, “Token-Ring Local-Area Networks and Their Performance,” Procs. of the IEEE, vol. 77, No. 2, Feb. 1989.
Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications, ISO/IEC 8802-3: 1996 International Standard (ANSI/IEEE Std 802.3).
Dube P, et al., “Queueing analysis of early message discard policy”, Communications, 2002. ICC 2002. IEEE International Conference, vol. 4, Iss., 2002, pp. 2426-2430.
Ehrsam, et al., “A cryptographic key management scheme for implementing the Data Encryption Standard,” IBM Syst J, vol. 17, No. 2 (1978).
Final Office action for U.S. Appl. No. 11/388,584 dated Jan. 13, 2010.
Final Office action for U.S. Appl. No. 11/388,584 dated Jan. 7, 2009.
Final Office action for U.S. Appl. No. 11/388,869 dated Jan. 14, 2010.
Final Office action for U.S. Appl. No. 11/421,155 dated Aug. 12, 2009.
Final Office action for U.S. Appl. No. 11/420,432, dated Nov. 23, 2009.
Final Office action for U.S. Appl. No. 11/420,432 mailed Aug. 31, 2010.
Goalic et al., “Real-Time Turbo-Decoding of Product Codes on a Digital Signal Processor,” IEEE, pp. 624-628 (1997).
HiPerformance Radio Local Area Network (HiperLAN) Type I: Functional Specification, European Standard (Telecommunication Series) No. 300652 V. 1.2.1 Jul. 1998.
HomePlug Powerline Alliance, HomePlug 1.0.1 Specification, Dec. 1, 2001.
HomePlug Powerline Alliance Inc., “HomePlug AV White Paper,” Doc. Ver. No. HPAVWP—050818, Aug. 2005, pp. 1-11.
IBM, Combined use of collision resolution and collision avoidance MAC protocols, Oct. 1, 1994, IBM Technical Disclosure Bulletin, vol. 37, pp. 299-302 (NN9410299).
Interface Specification for HomePNA.TM. 2.0—10M8 Technology—Link Layer Protocols, Dec. 1, 1999.
International Search Report dated Apr. 30, 2008 referencing PCT Appliction No. PCT/US2007/085189 12 pages.
ISO/IEC 8802-11: 1999 International Standard (ANSI/IEEE Std802.11) Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications.
ISO/IEC 8802-3: 2002 International Standard (ANSI/IEEE Std 802.3) Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications.
Jeon, Wha Sook, Dong Geun Jeong, Chong-Ho Choi, “An Integrated Services MAC Protocol for Local Wireless Communications,” Feb. 1, 1998, IEEE Transactions on Vehicular Technology, vol. 47, pp. 352-364.
Kamerman, A; Aben, G; Net throughput with IEEE 802.11 wireless LANs; Wireless Communications and Networking Conference, 2000. WCNC 2000 IEEE, vol. 2, Sep. 23-28, 2000; pp. 747-752.
Katar et al., “Beacon Schedule Persistence to Mitigate Beacon Loss in HomePlug AV Networks,” May 2006, IEEE 1-4244-0113-05/06, pp. 184-188.
Korean Office Action with English Summary of Office Action issued in Korean Application No. 10-2006-7012758, dated Mar. 7, 2011, 5 pages.
Lee et al., “HomePlug 1.0 powerline communication LANs—protocol description and performance results”, Int. J. Commun. Syst., vol. 16 (2003).
Lee et al., “HomePlug 1.0 Powerline Communication LANs-Protocol Description and Performance Results version 5.4,” 2000, International Journal of Communication Systems, 2000 00: 1-6, pp. 1-25.
Non-Final Office action for U.S. Appl. No. 11/388,584, dated Jun. 25, 2009.
Non-Final Office action for U.S. Appl. No. 11/388,584, dated Oct. 6, 2008.
Non-Final Office action for U.S. Appl. No. 11/388,869 dated Jul. 7, 2010.
Non-Final Office action for U.S. Appl. No. 11/388,869 dated Jun. 10, 2009.
Non-Final Office action for U.S. Appl. No. 11/420,945, dated Jan. 29, 2009.
Non-Final Office action for U.S. Appl. No. 11/420,945, dated Jul. 8, 2009.
Non-Final Office action for U.S. Appl. No. 11/421,155 dated Feb. 23, 2009.
Non-Final Office action for U.S. Appl. No. 11/421,155 dated Mar. 2, 2010.
Non-Final Office action for U.S. Appl. No. 11/420,432, dated Apr. 28, 2009.
Non-Final Office action for U.S. Appl. No. 11/420,432, dated Mar. 25, 2010.
Notice of Allowance for U.S. Appl. No. 11/420,945 dated May 5, 2010.
Notice of Allowance for U.S. Appl. No. 12/728,040 dated Aug. 23, 2010.
Notice of Allownace for U.S. Appl. No. 12/728,040 dated Aug. 23, 2010.
Notice of Allownace for U.S. Appl. No. 11/421,155 dated Aug. 5, 2010.
Notice of Pre-Appeal Brief for U.S. Appl. No. 11/388,584 dated Jun. 16, 2010.
Notification of First Office Action, The State Intellectual Property Office of the People's Republic of China, issued in Chinese Application No. 200610107587.1, dated Oct. 11, 2010, 6 pages.
Notification of Reasons for Rejection, Japanese Patent Office, issued in Japanese Patent Application No. 2006-205200, dated Jan. 18, 2011, 3 pages.
Pavlidou, et al., “Power Line Communications: State of the Art and Future Trends.” IEEE Communications Magazine, Apr. 2003, pp. 34-40.
PCT International Search Report for Appliction No. PCT/US2006/029718; dated Sep. 21, 2007.
Peterson et al., “Error-Correcting Codes”, Second Edition, The Massachusetts Institute of Technology Press, 1972, pp. 212-213, 261-263, 362.
PKCS #5 v. 20: Password-Based Cryptography Standard RSA Laboratories, Mar. 25, 1999.
Pyndiah, “Near Optimum Decoding of Product Codes,” IEEE, pp. 339-343 (1994).
Pyndiah, “Near-Optimum Decoding of Product Codes: Block Turbo Codes”, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, US, vol. 46, No. 8, Aug. 1, 1998, pp. 1003-1010.
Pyndiah, “Performance of Block Turbo Coded 16-QAM and 64-QAM Modulations,” IEEE, pp. 1039-1043 (1995).
Ruiz, David, et al., “In-Home AV PLC MAC with Neighboring Networks Support,” IEEE, 2005, p. 17, rt. hand column, line 14-p.20,rt. hand column, line 16; and Figs. 2,3,& 6.
Schneier, Bruce, “Applied Cryptography,”1996, John Wiley & Sons, Inc., Second Edition, pp. 34-38, pp. 48-49, pp. 513-514, and pp. 518-520.
Shared Wireless Access Protocol (Cordless Access) Specification, SWAP-CA Revision 1.21, Jan. 27, 1999, by the HomeRFTm Technical Committee.
Sun et al., Public-key ID-based Cryptosystem, 1991, IEEE, pp. 142-144.
Supplementary European Search Report—EP06788301—Search Authority—Munich—Apr. 14, 2010.
Wang, Contribution to the TG3 and TG4 MAC: MPDU Formats, May 10, 2001, Wi-LAN Inc., IEEE 802.16 Broadband Wireless Access Working Group <http://ieee802.org/16>.
“Programmable PSD Mask”, V1.1.1 (Feb. 2006); Proposed Technical Specification, European Telecommunications Standards Institute, available prior to Jun. 2006.
PCT International Search Report for Application No. PCT/US06/29818; dated Sep. 21, 2007.
Programmable PSD Mask, V1.1.1 (Feb. 2006); Proposed Technical Specification, European Telecommunications Standards Institute, available prior to Jun. 2006, 10 pages.
International Search Report and Written Opinion for Application No. PCT/US2007/85189 dated Apr. 30, 2008, 12 pages.
International Search Report and Written Opinion for Application No. PCT/US06/29718 dated Sep. 21, 2007, 10 pages.
International Search Report and Written Opinion—PCT/US2008/065831, International Searching Authority, European Patent Office, Feb. 20, 2009, 22 pages.
International Search Report from PCT application No. PCT/US06/29377, dated Sep. 25, 2007, 9 pages.
“U.S. Appl. No. 11/337,946 Office Action”, Jan. 26, 2009, 23 pages.
“U.S. Appl. No. 11/337,963 Office Action”, Feb. 6, 2009, 17 pages.
“U.S. Appl. No. 11/492,487 Office Action”, Jun. 23, 2009, 13 pages.
“U.S. Appl. No. 11/492,487 Final Office Action”, Mar. 9, 2010, 15 pages.
“U.S. Appl. No. 11/492,505 Final Office Action”, Jan. 14, 2010, 18 pages.
“U.S. Appl. No. 11/492,505 Office Action”, Jun. 25, 2009, 14 pages.
“U.S. Appl. No. 11/492,505 Office Action”, Mar. 3, 2011, 16 pages.
“U.S. Appl. No. 11/492,505 Office Action”, Oct. 19, 2011, 19 pages.
“U.S. Appl. No. 11/492,505 Final Office Action”, May 21, 2012 , 16 pages.
“U.S. Appl. No. 11/492,506 Final Office Action”, Oct. 28, 2009 , 10 pages.
“U.S. Appl. No. 11/492,506 Final Office Action”, Aug. 30, 2010 , 13 pages.
“U.S. Appl. No. 11/492,506 Office Action”, May 29, 2012 , 11 pages.
“U.S. Appl. No. 11/492,506 Office Action”, Apr. 3, 2009 , 14 pages.
“U.S. Appl. No. 11/492,506 Office Action”, Feb. 19, 2010 , 8 pages.
“U.S. Appl. No. 11/493,382 Final Office Action”, Jan. 6, 2010 , 12 pages.
“U.S. Appl. No. 11/493,382 Office Action”, Mar. 17, 2011 , 11 pages.
“U.S. Appl. No. 11/493,382 Office Action”, May 15, 2009 , 13 pages.
“U.S. Appl. No. 11/493,382 Office Action”, Jun. 25, 2010 , 15 pages.
“U.S. Appl. No. 12/431,433 Final Office Action”, Sep. 13, 2010 , 9 pages.
“U.S. Appl. No. 12/431,433 Office Action”, May 25, 2010 , 11 pages.
“U.S. Appl. No. 12/628,507 Final Office Action”, May 2, 2011 , 13 pages.
“U.S. Appl. No. 12/628,507 Office Action”, Sep. 27, 2010 , 35 pages.
Related Publications (1)
Number Date Country
20110310953 A1 Dec 2011 US
Provisional Applications (2)
Number Date Country
60702717 Jul 2005 US
60705720 Aug 2005 US
Continuations (1)
Number Date Country
Parent 11493382 Jul 2006 US
Child 13219863 US