The present disclosure relates generally to an intelligent electronic device (IED), such as used by commercial, industrial, or residential customers of power utility companies and, more particularly, to an IED having various operational capabilities such as power quality measurement and/or energy management, and, in particular, to an IED capable of capturing and recording concurrent waveform data at multiple data rates in real time.
An advanced feature for a power meter and for power quality monitoring is to be able to capture and record waveform data (i.e., perform data logging) at multiple rates concurrently in real-time. This is beneficial in that it allows the simultaneous capture of events which require a high resolution data capture with other events which require a lower resolution data capture. The high resolution events are captured using a high sample rate while the low resolution events are captured using a low sample rate, with the low resolution events being captured over a longer period of time. One example of a high resolution event monitored in an IED is a transient capture and one example of a low resolution event monitored in an IED is a Surge/Sag waveform capture.
In the case of a high speed transient capture event (e.g., transient capture), a high resolution sampling rate of 1024 samples/cycle or higher is desirable to observe the high speed transients. In the case of a low speed event (e.g., Surge/Sag waveform capture), a low resolution sampling rate of 128 samples per cycle is desirable to support capture over a longer period of time, such as 3 seconds, or continuously in some cases without requiring use of excessive resources of the IED.
Conventional hardware architectures can not support multiple rate waveform capture (data logging) due to burdens placed on both the processing (performance limitations) and data management and storage of the waveform data (memory bandwidth limitation and memory size).
For example, by not utilizing the data management techniques of the present disclosure, waveform capture data is conventionally pooled into a single large data buffer whose size must be sufficient to accommodate data over large intervals of time (e.g., on the order of 3 seconds or more) to support low sample rate data time intervals. To present both high and low resolution data capture, the actual sample rate would have to be set at the higher sample rate to maintain the high resolution data capture while the time interval of the data capture would be set by the requirements of a low resolution interval capture time, which can be long.
By way of example, if the high resolution sample rate is 1024 samples per cycle and the sample rate requirement of the low resolution waveform capture is 128 samples per cycle, then using the high sample rate for all captures would require a storage requirement 8 times larger (i.e., 1024/128) than is really needed for low resolution waveform capture. As a further requirement, considering that the data is captured in a single large memory pool of samples captured at the higher rate (e.g., 1024 samples/cycle), a processor or central processing unit (CPU) would be required to identify and select the low resolution data from the memory pool (e.g., selecting every eighth sample to construct an image of the low resolution waveform capture). As understood by those skilled in the art, this is a very inefficient process for a general purpose CPU.
Conversely, for a system optimized to do low resolution waveform capture continuously, which is a requirement for the IED to capture slow changing SAG and SWELLs which tend to change slowly, the CPU is required to select every eighth sample (using the instant example) in real-time, which is a very difficult performance goal for a CPU to achieve and costly to implement given the current state of technology. Further, the use of a single large pool of memory is also processing inefficient because all the data captured at the high sample rate must then be read to access those data points which define a low resolution data stream. For example, if the high sample rate is 1024 samples per cycle and the low sample rate is 128 samples per cycle, for the low sample rate data (i.e., 128 samples per cycle), every eighth sample (i.e., 1024/128=8) is extracted from the 1024 sample stream. For example, by extracting every eighth data point from the high resolution 1024 bit data stream, a low resolution data stream may be dynamically constructed having a sample rate of 128 samples per cycle.
A need therefore exists for a hardware architecture that is capable of supporting multiple rate waveform capture (data logging) and which overcomes the performance limitations, memory bandwidth limitation and memory size limitations of conventional hardware architectures.
The present disclosure addresses the above needs, as well as others, by providing a system and method for use in an IED that performs high resolution waveform capture to generate multi-rate waveform data in real-time. In one embodiment, high-resolution sampled data is dynamically pre-ordered into separate high resolution and low resolution data streams for presentation and storage. This pre-ordering of data is optimized so as to minimize the amount of data manipulation required to prepare the sampled data for eventual presentation and storage in the IED. Pre-ordering of data facilitates minimum performance impact so that continuous real-time data capture can be achieved.
In accordance with one aspect of the present disclosure, data is managed while in process, by utilizing various approaches to minimize buffer size requirements and the number of necessary reads and writes to the available storage devices.
In accordance with another aspect of the present disclosure, the pre-ordering of data is performed on the input (i.e., data reception) side of a CPU/IO processor. In this manner, the CPU/IO processor acts as a data distributor of the pre-ordered sampled data by distributing the pre-ordered data to the available storage devices of the IED. The pre-ordering of the data on an input side of the CPU/IO processor thereby removes the processing load of having to order the data output by the CPU/IO processor. This is a key feature given that the CPU/IO processor cannot handle out of order data efficiently. Specifically, it can not efficiently pick out every certain sample from the output data stream. Pre-ordering the data and leaving the distribution of pre-ordered data to the CPU/IO processor provides efficiencies because the DSP and FPGA are specifically structured to efficiently order data, whereas the CPU/IO suffers a severe performance penalty.
According to yet another aspect of the present disclosure, full bandwidth samples are processed up to the maximum sample rate of the system. The process of pre-ordering the full bandwidth samples, in real time, into two or more data sub-streams at various data rates is offloaded from the CPU/IO processor so that low sample rate data which is normally interspersed among the high resolution samples are grouped together. By grouping the low sample rate data apart from the high resolution samples, the data can then be stored in permanent storage memory without any further data movement or processing. The accumulation of high resolution samples and low resolution samples occur concurrently, each with an independently settable capture interval to efficiently implement multi-rate concurrent waveform capture and storage within the IED.
These and other objects, features and advantages of the present disclosure will be apparent from a consideration of the following Detailed Description considered in conjunction with the drawing Figures, in which:
To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures, except that alphanumerical suffixes may be added, when appropriate, to differentiate such elements. The images in the drawings are simplified for illustrative purposes and are not depicted to scale.
The appended drawings illustrate exemplary embodiments of the present disclosure and, as such, should not be considered as limiting the scope of the disclosure that may admit to other equally effective embodiments. Correspondingly, it has been contemplated that features or steps of one embodiment may beneficially be incorporated in other embodiments without further recitation.
In some embodiments, particular method steps of the discussed methods are performed in the depicted order. In alternate embodiments, in the respective methods, at least two method steps or portions thereof may be performed contemporaneously, in parallel, or in a different order.
It should be understood that the elements shown in the figures may be implemented in various forms of hardware, software or combinations thereof. Preferably, these elements are implemented in a combination of hardware and software on one or more appropriately programmed general-purpose devices, which may include a processor, memory and input/output interfaces.
The present description illustrates the principles of the present disclosure. It will thus be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the disclosure and are included within its spirit and scope.
All examples and conditional language recited herein are intended for pedagogical purposes to aid the reader in understanding the principles of the disclosure and the concepts contributed by the inventor to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions.
Moreover, all statements herein reciting principles, aspects, and embodiments of the disclosure, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.
Thus, for example, it will be appreciated by those skilled in the art that the block diagrams presented herein represent conceptual views of illustrative circuitry embodying the principles of the disclosure. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudo-code, and the like represent various processes which may be substantially represented in computer readable media and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.
The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software. When provided by a processor, the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared. Moreover, explicit use of the term “processor” or “controller” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (“DSP”) hardware, read only memory (“ROM”) for storing software, random access memory (“RAM”), and nonvolatile storage.
Other hardware, conventional and/or custom, may also be included. Similarly, any switches shown in the figures are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the implementer as more specifically understood from the context.
Aspects of the present disclosure are illustratively described herein within the context of intelligent electronic devices (“IEDs”) such as digital electrical power and energy meters, including revenue accuracy certifiable meters. The term “digital electrical power and energy meters” is broadly used herein in reference to IEDs adapted to record, measure, and communicate at least some of supply currents and supply voltages of the respective electrical service, their waveforms, harmonics, transients, and other disturbances, and the corresponding parameters, such as power, power quality, energy, revenue, and the like.
It will be appreciated by those skilled in the art that the disclosure may also be utilized within the context of other IEDs, including Programmable Logic Controllers (“PLC's”), Remote Terminal Units (“RTUs”), protective relays, and fault recorders, among other devices or systems used to manage and control quality, distribution, and consumption of electrical power.
The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any configuration or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other configurations or designs. Herein, the phrase “coupled with” is defined to mean directly connected to or indirectly connected with through one or more intermediate components. Such intermediate components may include both hardware and software based components.
I—General Overview of an IED
As used herein, intelligent electronic devices (“IED's”) include Programmable Logic Controllers (“PLC's”), Remote Terminal Units (“RTU's”), electric power meters, protective relays, fault recorders and other devices which are coupled with power distribution networks to manage and control the distribution and consumption of electrical power. A meter is a device that records and measures power events, power quality, current, voltage waveforms, harmonics, transients and other power disturbances. Revenue accurate meters (“revenue meter”) relate to revenue accuracy electrical power metering devices with the ability to detect, monitor, report, quantify and communicate power quality information about the power that they are metering. The meter is installable as a socket
The IED 10 of
The plurality of sensors 112 sense electrical parameters, e.g., voltage and current, on incoming lines, (i.e., phase A, phase B, phase C, neutral N, auxiliary voltgae VAUX), from an electrical power distribution system.
A/D converters 117 are respectively configured to convert an analog voltage output to a digital signal that is transmitted to a gate array, such as Field Programmable Gate Array (FPGA) 80. The digital signal is then transmitted from the FPGA 80 to the CPU 50 and/or one or more DSP processors 60, 70 to be processed in a manner to be described below.
The CPU 50 or DSP Processors 60, 70 are configured to operatively receive digital signals from the A/D converters 117 (see
The power supply 15 provides power to each component of the IED 10. Preferably, the power supply 15 is a transformer with its primary windings coupled to the incoming power distribution lines and having windings to provide a nominal voltage, e.g., 5 VDC, +12 VDC and −12 VDC, at its secondary windings. In other embodiments, power may be supplied from an independent power source to the power supply 15. For example, power may be supplied from a different electrical circuit or an uninterruptible power supply (UPS).
In one embodiment, the power supply 15 can be a switch mode power supply in which the primary AC signal will be converted to a form of DC signal and then switched at high frequency, such as, for example, 100 Khz, and then brought through a transformer to step the primary voltage down to, for example, 5 Volts AC. A rectifier and a regulating circuit would then be used to regulate the voltage and provide a stable DC low voltage output. Other embodiments, such as, but not limited to, linear power supplies or capacitor dividing power supplies are also contemplated.
The multimedia user interface 13 is shown coupled to the CPU 50 in
The IED 10 will support various file types including but not limited to MICROSOFT™ WINDOWS™ Media Video files (.wmv), MICROSOFT™ Photo Story files (.asf), MICROSOFT™ WINDOWS™ Media Audio files (.wma), MP3 audio files (.mp3), JPEG image files (.jpg, .jpeg, .jpe, .jfif), MPEG movie files (.mpeg, .mpg, .mpe, .mlv, .mp2v .mpeg2), MICROSOFT™ Recorded TV Show files (.dvr-ms), MICROSOFT™ WINDOWS™ Video files (.avi) and MICROSOFT™ WINDOWS™ Audio files (.wav).
The IED 10 may communicate to a server or other computing device via a communication network. The IED 10 may be connected to a communications network, e.g., the Internet, by any means, for example, a hardwired or wireless connection, such as dial-up, hardwired, cable, DSL, satellite, cellular, PCS, wireless transmission (e.g., 802.11a/b/g), etc. It is to be appreciated that the network may be a local area network (LAN), wide area network (WAN), the Internet or any network that couples a plurality of computers to enable various modes of communication via network messages. Furthermore, the IED 10 will communicate using various protocols such as Transmission Control Protocol/Internet Protocol (TCP/IP), File Transfer Protocol (FTP), Hypertext Transfer Protocol (HTTP), etc. and secure protocols such as Hypertext Transfer Protocol Secure (HTTPS), Internet Protocol Security Protocol (IPSec), Point-to-Point Tunneling Protocol (PPTP), Secure Sockets Layer (SSL) Protocol, etc.
The IED 10 further comprises a volatile memory 19 and a non-volatile memory 17. In addition to storing audio and/or video files, volatile memory 19 will store the sensed and generated data for further processing and for retrieval when called upon to be displayed at the IED 10 or from a remote location. The volatile memory 19 includes internal storage memory, e.g., random access memory (RAM), or removable memory such as magnetic storage memory; optical storage memory, e.g., the various types of CD and DVD media; solid-state storage memory, e.g., a Compact Flash card, a Memory Stick, Smart Media card, Multimedia Card (MMC), SD (Secure Digital) memory; or any other memory storage that exists currently or will exist in the future. By utilizing removable memory, an IED can be easily upgraded as needed. Such memory will be used for storing historical trends, waveform captures, event logs including time-stamps and stored digital samples for later downloading to a client application, web-server or PC application.
In a further embodiment, the IED 10 will include a communication device 32 for enabling communications between the IED, and a remote terminal unit, programmable logic controller and other computing devices, microprocessors, a desktop computer, laptop computer, other meter modules, etc. The communication device 32 may be a modem, network interface card (NIC), wireless transceiver, etc. The communication device 32 will perform its functionality by hardwired and/or wireless connectivity. The hardwire connection may include but is not limited to hard wire cabling e.g., parallel or serial cables, RS232, RS485, USB cable, Firewire (1394 connectivity) cables, Ethernet, and the appropriate communication port configuration. The wireless connection will operate under any of the various wireless protocols including but not limited to BLUETOOTH™ interconnectivity, infrared connectivity, radio transmission connectivity including computer digital signal broadcasting and reception commonly referred to as WIFI™ or 802.11.X (where x denotes the type of transmission), satellite transmission or any other type of communication protocols, communication architecture or systems currently existing or to be developed for wirelessly transmitting data including spread spectrum 900 MHz, or other frequencies, ZIGBEE™, WIFI™ or any mesh enabled wireless communication.
In an additional embodiment, the IED 10 will also have the capability of not only digitizing voltage and current waveforms, but storing the waveforms and transferring that data upstream to a central computer, e.g., a remote server, when an event occurs such as a voltage surge or sag or a current short circuit. This data will be triggered and captured on an event, stored to memory, e.g., non-volatile RAM, and additionally transferred to a host computer within the existing communication infrastructure either immediately in response to a request from a remote device or computer to receive said data in response to a polled request. The digitized waveform will also allow the CPU 50 to compute other electrical parameters such as harmonics, magnitudes, symmetrical components and phasor analysis. Using the harmonics, the IED 10 will also calculate dangerous heating conditions and can provide harmonic transformer derating based on harmonics found in the current waveform.
In a further embodiment, the IED 10 will execute an e-mail client and will send e-mails to the utility or to the customer direct on an occasion that a power quality event occurs. This allows utility companies to dispatch crews to repair the condition. The data generated by the meters are use to diagnose the cause of the condition. The data is transferred through the infrastructure created by the electrical power distribution system. The e-mail client will utilize a pop3 or other standard mail protocol. A user will program the outgoing mail server and e-mail address into the meter. An exemplary embodiment of said functionality is disclosed in U.S. Pat. No. 6,751,563, the contents of which are incorporated by reference herein. In one embodiment of U.S. Pat. No. 6,751,563, a web server provides real time data through an Hypertext Markup Language (HTML) or Extensible Markup Language (XML) interface. Additionally, the web server allows viewing of stored historical and power quality data and provides users with an interface for retrieval of historical data via industry standard protocols including Hypertext Transfer Protocol (HTTP) and File Transfer Protocol (FTP).
The techniques of the present disclosure can be used to automatically maintain program data and provide field wide updates upon which IED firmware and/or software can be upgraded. An event command can be issued by a user, on a schedule or by digital communication that will trigger the IED 10 to access a remote server and obtain the new program code. This will ensure that program data will also be maintained allowing the user to be assured that all information is displayed identically on all units.
It is to be understood that the present disclosure may be implemented in various forms of hardware, software, firmware, special purpose processors, or a combination thereof. The IED 10 also includes an operating system and micro instruction code. The various processes and functions described herein may either be part of the micro instruction code or part of an application program (or a combination thereof) which is executed via the operating system.
It is to be further understood that because some of the constituent system components and method steps depicted in the accompanying figures may be implemented in software, or firmware, the actual connections between the system components (or the process steps) may differ depending upon the manner in which the present disclosure is programmed. Given the teachings of the present disclosure provided herein, one of ordinary skill in the related art will be able to contemplate these and similar implementations or configurations of the present disclosure.
The IED 10 of the present disclosure can compute a calibrated VPN (phase to neutral) or VPP (phase to phase) voltage RMS from VPE (phase to earth) and VNE (neutral to earth) signals sampled relative to the Earth's potential. The desired voltage signal can be produced by subtracting the received channels, for example the phase to neutral voltage VPN=VPE−VNE. Calibration involves removing (by adding or subtracting) an offset (o, p) and scaling (multiplying or dividing) by a gain (g, h) to produce a sampled signal congruent with the original input signal.
RMS is the Root-Mean-Square value of a signal, the square root of an arithmetic mean (average of n values) of squared values. Properly combined, one representation of this formula is:
where VAN is the voltage measured from phase A to neutral, VAE is the voltage measured from phase A to earth and VNE is the voltage measured from neutral to earth.
Implementation of the computation in this arrangement is comparatively inefficient, in that many computations involving constants (−o, −p, g, h) are performed n times, and that computational precision can either be minimized, forcing the use of large numbers (requiring increased memory for storage and increased time to manipulate), or be degraded, increasing the uncertainty. However, a mathematical rearrangement can be carried out on the above formula, producing an equivalent computation that can be carried out more efficiently, decreasing the effort needed to produce similar or superior results. That representation is:
where VAN is the voltage measured from phase A to neutral, VAE is the voltage measured from phase A to earth and VNE is the voltage measured from neutral to earth.
Implementation of the computation in this arrangement can be accomplished with more efficiency and precision. All involvement of constants has been shifted to single steps, removed from the need to be applied n times each. This savings in computation can then be partially utilized to perform slower but more precise applications of the gains and Square Root. The result is a value of equal or higher precision in equal or lesser time.
These calculations are preferably implemented in software by at least one processor such as the CPU 50 or, in the alternative, by at least one DSP Processor 70 and at least one FPGA 80.
II. Overview
Systems and methods are provided for performing waveform capture in real time by dynamically pre-ordering a waveform capture of a high-resolution sampled data stream into low and high resolution streams. The two streams are formed concurrently and independently providing multi-rate concurrent waveform capture, storage and presentation for power quality metering. By creating separate high and low resolution streams, the degree of subsequent data manipulation required to prepare the data for eventual storage in the available storage devices of an IED is minimized. In this manner, the dynamic pre-ordering constitutes a form of data optimization.
To achieve the objectives of the present disclosure, partitioning of processing tasks among the different hardware elements has been optimized to support the pre-ordering of data in real-time. In addition, various data management techniques are utilized, such as managing data while in process, to minimize buffer size requirements and managing the number of necessary reads and writes to the memory buffers. The data management techniques described herein overcomes processing and storage inefficiencies associated with pooling data into a single large buffer.
III. High Resolution Waveform Capture
A process of creating multi-rate waveform data from a high resolution waveform capture begins with the sampling of a full bandwidth waveform to derive a full bandwidth sampled data stream sampled at some sampling rate (e.g., 1024 samples/cycle) (step 202). It is understood that the selected sample rate of 1024 samples/cycle is by way of example only. In other embodiments, the sample rate can be any sample rate sufficient to sample a three phase power source (e.g., 2048 samples/cycle, 4096 samples/cycle).
With continued reference to
The step of separating the data stream into multi-rate waveform data further comprises performing sub-steps 204-a through 204-d, described as follows.
First, a low resolution sample rate mode is established (step 204-a). Next, a high resolution sample rate mode is determined from the previously established low resolution sample rate mode as some integer multiple of the low sample rate mode (step 204-b). Some non-limiting examples of the establishment of low/high sample rate modes are: (high/low)={2048/1024, 2048/512, 2048/256, 1024/512, 1024/512, 1024/256. 1024/128, 512/256, 512/128, 512/64}.
It should be understood that irrespective of the particular multi-rate sample rate modes selected, both the high and low data streams are created directly from the sampled full bandwidth 1024 sample/cycle data stream for eventual presentation and storage.
A process by which the sampled full bandwidth 1024 sample/cycle data stream is separated into multi-rate data is referred to herein as dynamic pre-ordering. In the described embodiments, this process of dynamic pre-ordering sampled data is performed on the input side of a processor, which can be a CPU processor.
With continued reference to
The creation of a low resolution data stream may be implemented differently according to various embodiments of the present disclosure, two of which are described as follows.
Creating a Low Resolution Data Stream via Data Extraction
In one embodiment, the low resolution data stream is created at step 204-c by a process of extraction. Assume, for example, that the desired multi-rate (high/low) data stream rates to be created are 1024/128, having a respective ratio of 8:1. To create a 128 sample/sec low resolution data stream, every eighth data point is extracted from the sampled full bandwidth 1024 sample/cycle data stream to be separately stored in a Dual Port memory. Once extracted, these data points are separately stored in a dedicated memory.
Thereafter, once all of the data points have been extracted, the remaining (un-extracted) data points are separately stored in a different dedicated memory as the high resolution data stream, as described above with reference to step 204-d. In this embodiment, it should be understood that the stored high resolution data stream is missing the extracted data points. However, the high resolution data stream can be restored to its original form by simply re-inserting the previously extracted data points when needed (i.e., upon a trigger event). It is to be understood that when the extracted data points are re-inserted (restored) upon the occurrence of a trigger event, the high resolution data stream is identical to the originally sampled full bandwidth 1024 sample/cycle data stream.
Restoration comprises re-inserting the lower sample rate data from the previously stored low resolution data stream into the high resolution data stream in a corrected time order. This restoration may be performed, for example, on playback when using a log viewer or at other times convenient to the user. Further, it should be appreciated that restoration of the higher and/or lower sample rate data does not have to be performed in real-time, thereby optimizing the performance of the embedded system.
Creating a Low Resolution Data Stream Via Data Copying
In one embodiment, the low resolution data stream is created at step 204-c by a process of copying. Assume, for example, that the desired multi-rate (high/low) data stream rates to be created are 1024/128, having a respective ratio of 8:1. Similar to that described above, every eighth data point is now copied from the sampled full bandwidth 1024 sample/cycle data stream to be separately stored in a dedicated memory.
Thereafter, once all of the low resolution data points are copied from the Dual Port memory, all of the data points from the full bandwidth 1024 sample/cycle data stream are copied from Dual Port memory to be separately stored in a dedicated memory as the high resolution data stream. It is noted that, in contrast to the extraction embodiment described above, in the presently described (copying) embodiment, the high resolution data stream is not missing any data points by virtue of the fact that data points have been copied and not extracted. This results in two complete sets of data points, one for high resolution data and one for low resolution data).
Alternatively, with reference now to
Trigger Events
In the described embodiments, multi-rate waveform data created in accordance with the methods taught herein is separately stored in dedicated memories and is only reconstituted for presentation upon the occurrence of a trigger event. Trigger events are well known and may include, for example, a transient voltage spike or a sag or swell in the RMS voltage, any of which (or combinations thereof) may occur while sampling the full bandwidth sampled waveform (e.g., at 2048, 1024 or any other sampling rate).
When a trigger event occurs, the IED can be set up to trigger a capture of sample data points of the trigger event to a log file. It is understood that the log file to which the sample data points are written may be different for different events. That is, log files are dedicated for use with different types of trigger events (e.g., transient captures, sag/swell captures). For example, transient events are captured at the full bandwidth sampling rate while a sag/swell event may be captured at a programmable rate which may be of lower resolution.
The events that trigger a high resolution capture are usually independent of events that trigger a low resolution capture, that is, they have separate triggers; however, both events could happen simultaneously. In conventional usage, whenever multiple trigger events occurs, both a low sample rate data stream and a high sample rate data stream are constructed substantially simultaneously, requiring intensive computations to be performed by a CPU processor, for example, or other processing device. The computations performed by the CPU processor undesirably result in a data storage time problem requiring that the CPU first calculate the location of each low resolution sample and then read it and form a low resolution capture by putting the data into a buffer and then writing it to storage. The low resolution samples are spread across the entirety of full bandwidth samples. Without performing any grouping operation, CPU's processing execution time and resources become overburdened resulting in an inability to meet the real-time requirements of the meter. Therefore, it is desirable to offload the task of gathering and grouping the low resolution samples from among the full bandwidth 1024 sample/cycle data stream from CPU. Offloading this task from CPU optimizes performance and data storage time so that for low sample rate data, it is possible to achieve continuous recording of data if the trigger conditions are continuously met. For example, for an IED set to perform 3 seconds of low resolution capture upon the occurrence of a sag/swell event, continuous recording may occur if the next sag/swell event occurs within the 3 second window of the current sag/swell event. Also, the IED may be configured to perform continuous capturing upon the occurrence of an initial (first) sag/swell event.
In one embodiment to be described below, as data is written into Dual Port Memory 82, FPGA 80 intervenes by remapping the data to write it to Dual Port Memory 82 as pre-ordered data. This process is described below as to the second embodiment in view of
In another embodiment, to be described below, data is written into Dual Port Memory 82 as originally sampled. However, as the data is read from the DPM 82 by CPU 50, it is remapped by FPGA 80 to create pre-ordered data. This process is described below as the third embodiment in view of
In yet another embodiment to be described below, as data is written into Dual Port Memory 82, the DSP 70 remaps the data so that it is written into Dual Port Memory 82 as pre-ordered data.
Dual Port Memory
By virtue of its structure, Dual Port Memory 82 allows access to its memory by both DSP 70 and CPU 50 so that Dual Port Memory 82 acts as a communication hub between DSP 70 and CPU 50. CPU 50 is therefore able to read the frame of processed data that was created by DSP 70 for further processing, presentation and storage. Dual Port memory is split into two zones by either FPGA or DSP. One zone is dedicated to low resolution data and the other zone is dedicated to high or full bandwidth data. It is understood that other memory types other than a dual port memory are suitable for use with the presently described hardware architecture. The use of a dual port memory arrangement, or other memory types that are suitable memory arrangements, is well understood by those of ordinary skill in the art.
Once written into Dual Port Memory 82, the pre-ordered data is then sequentially read out from Dual Port Memory 82 by CPU 50 without requiring CPU 50 to perform address calculations or special data movements on a sample by sample basis by virtue of the data being pre-ordered by FPGA 80 prior to the write attempts by DSP 70, as described above. Thus, a significant savings in processing time is realized. In accordance with this embodiment, CPU 50 advantageously operates on groups of data which have been pre-ordered by virtue of a remapping performed by FPGA 80.
In operation, to dynamically pre-order DSP processed data under control of FPGA 80, first CPU 50 sets the LOW sample rate mode of FPGA 80. In response, FPGA 80 adjusts its remapping so that CPU 50 first reads the correct number of low resolution samples from the dual-port memory 82 in a desired ratio to the high resolution samples (step 502). It is assumed that waveform data 22 representative of a three phase power source is available to be sensed by sensor 112 and conditioned by analog signal conditioning module 115 which outputs a conditioned analog data stream (step 504). The analog data stream is converted by A/D converter 117 to digital signals 9 (step 506). The digitized sampled signals 9 may then be read by FPGA 80 (step 508). In one embodiment, FPGA 80 is a Field Programmable Gate Array which controls A/D converter 117 and passes the data it reads to DSP 70 (step 510). DSP 70 operates on the digitized input signals (step 512). Processing may include RMS calculations, Power, Apparent Power (VA), Reactive Power (VAR), Power Factor, Harmonic Distortion and Flicker. DSP 70 attempts to access Dual Port Memory 82 to sequentially write the processed data (step 514). However, the attempt is circumvented by FPGA 80. Specifically, before the sequential access can be performed by DSP 70, FPGA 80, programmed to manage the operations of CPU 50, remaps the memory address of CPU 50 (step 516). Remapping is defined in detail further below. The process continues with the Low resolution samples being read by CPU 50 from Dual Port Memory 82 and stored in a memory buffer (step 518). Next, the high resolution samples are read by CPU 50 and stored in a memory buffer (step 520).
The low rate samples are continuously accumulated frame by frame from Dual Port Memory 82 for a user specified buffer length in memory buffers 210 of CPU which is typically specified on the order of seconds or longer until for example a Surge/Sag trigger event occurs at which point the accumulated low rate samples can be directly permanently stored in a storage device such as a compact flash 212 from the memory buffers 210 of CPU in which the low resolution samples have been accumulating.
In this embodiment, data is written into Dual Port Memory 82 as non pre-ordered data. However, as the data is read out by CPU 50 from DPM 82 it is remapped by FPGA 80 to create pre-ordered data.
The process of pre-ordering data is performed dynamically by FPGA 80 in the sense that FPGA 80 pre-orders data by remapping the read operations as CPU 50 reads data frames from Dual Port Memory 82.
In operation, to dynamically pre-order DSP processed data under control of FPGA 80, first CPU 50 sets the low sample rate mode of FPGA 80. In response, FPGA 80 adjusts its remapping so that CPU 50 first reads the correct number of low resolution samples from the dual-port memory 82 in a desired ratio to the high resolution samples (step 702). It is assumed that waveform data 22 representative of a three phase power source is available to be sensed by sensor 112 and conditioned by analog signal conditioning module 115 which outputs a conditioned analog data stream (step 704). The analog data stream is converted by A/D converter 117 to digital signals (step 706). The digitized sampled signals 9 may then be read by FPGA 80 (step 708). In one embodiment, FPGA 80 is a Field Programmable Gate Array which controls A/D converter 117 and passes the data it reads to DSP 70. (step 710). DSP 70 operates on the digitized input signals 9 (step 712). Processing may include RMS calculations, Power, Apparent Power (VA), Reactive Power (VAR), Power Factor, Harmonic Distortion and Flicker. The digitized and processed sample signals are then stored in the dual-port memory 82 (step 714). Next, CPU 50 attempts to access dual-port memory 82 sequentially (step 716). However, the attempt is circumvented. Specifically, before the sequential access can be performed by CPU 50, FPGA 80 (programmed to manage the operations of CPU 50) remaps the memory address of CPU 50 (step 718). Remapping causes CPU 50 to first read the low rate samples from among the stored digitized and stored sample signals in Dual Port Memory 82 in a selective manner before reading a single high rate sample. Remapping is defined in more detail further below. The low resolution samples are read by CPU 50 from the dual-port memory 82 and are stored in memory buffers 210 (step 720). Next, the high resolution samples are read from dual-port memory 82 by CPU 50 and stored in memory buffers 214 (step 722).
The low rate samples are continuously accumulated frame by frame from Dual Port Memory 82 for the user specified buffer length in memory buffers 210 of CPU which is typically specified on the order of seconds or longer until for example a Surge/Sag trigger event occurs at which point the accumulated low rate samples can be directly permanently stored in a storage device such as a compact flash 212 from the memory buffers 210 of CPU in which the low resolution samples have been accumulating.
The process of segregating the low resolution samples from the high resolution samples, by storing them to a separate dedicated memory, is referred to herein as pre-ordering the data. Pre-ordering is transparent to CPU 50 and involves no processing overhead because the pre-ordering occurs on an input side of CPU 50.
Re-Mapping
Remapping, briefly described above, is performed by FPGA 80 under control of CPU 50 which sets registers in FPGA 80 to control the multiplexing of the addresses as a function of a desired low resolution sample rate selected by a user. In general, CPU 50 sets registers in FPGA 80 such that the multiplexing of addresses for accessing Dual Port Memory corresponds to the access of the low resolution samples before a single high resolution sample is accessed from Dual Port Memory. By way of example, assume that a user defines a desired capture ratio of 8:1, i.e., high to low resolution samples. In other words, the user desires that the low resolution sample rate is ⅛th of the high resolution sample rate. In response, CPU 50 sets (adjusts) the low sample rate mode of FPGA 80 to 8:1.
It has therefore been shown that FPGA 80 re-mapping of the sampled data accessed by CPU 50 is a function of a user defined desired low resolution sample rate. CPU 50 sets the low sample rate mode of FPGA 80 and FPGA 80 sets (adjusts) its remapping so that it first reads all of the low resolution samples from the dual-port memory 82 in a desired ratio to the high resolution sample rate.
By way of example, to construct two multi-rate data streams in a desired ratio of 8:1, each time CPU 50 increments by one address to attempt to access the next sample from Dual Port memory, the addressing operation is circumvented in satisfaction of a remapping operation performed by FPGA 80 to its internal Dual Port Memory 82. In other words, the remapping operation trumps the addressing operation each time.
Remapping comprises FPGA 80 creating alternate physical addresses directed to the internal dual port memory 82. The physical addresses are alternate address in the sense that they are used in lieu of sequential addresses attempted to be implemented by CPU 50, but circumvented by FPGA 80 in its remapping operations. Each alternate addresses created by FPGA 80 is a multiple of a sequential address attempted to be implemented by CPU 50. For ease of explanation, this multiple can be expressed as a ratio. For example, the ratio can be 16:1, 8:1, 4:1, and 2:1. Using an exemplary ratio of 8:1 to further describe remapping, the first number of the ratio, 8 corresponds to a high resolution data stream sampled at 1024 samples/cycle and the second number of the ratio 1 corresponds to a low resolution data stream sampled at 128 samples/cycle. Hence the ratio 8:1. In this example, every eighth sample stored in the dual-port memory 82 is effectively a single data point of a low resolution data stream capture (i.e., the low resolution 128 samples/cycle stream).
According to the present embodiment, data samples are seamlessly reordered under control of a DSP 70 or secondary processor. In this embodiment, the DSP writes pre-ordered data samples to Dual Port memory without intervention (i.e., remapping) by FPGA. Pre-ordering data under control of the DSP provides a cost effective solution since it already exists in the hardware architecture performing power quality and revenue calculations. Therefore, the additionally functionality of controlling the pre-ordering of waveform data comes at no added cost. The DSP efficiently performs the pre-ordering because of its inherent powerful DMA capabilities which are needed to support digital signal processing algorithms that it must perform.
With reference again to
In one embodiment, DSP 70 can be configured as part of FPGA 80 so that the processing of data and pre-ordering of data is performed within FPGA 80.
In the present embodiment, a low sample rate data block is first read out from Dual Port Memory 82 by CPU 50 followed by reading the remaining samples which define a high resolution data block. When the trigger conditions are met for either the low and/or high sample rate data, the data can be transferred from Dual Port Memory 82 to be directly stored to a permanent storage device and support continuous real-time recording of data.
It should be understood that high resolution and low resolution samples are accumulated substantially concurrently as independent processes. More particularly, the accumulation of high resolution samples occurs at a high rate but with a very limited time interval while at the same time low resolution data is accumulated at a much slower rate but over a much greater interval of time. This longer interval of time allows the IED to easily support the capture and storage of low resolution waveforms continuously in real-time.
Memory Utilization
According to one aspect of the present disclosure, memory utilization directly impacts both system performance and system resources. Memory utilization entails various aspects including the way memory is accessed and allocated once the samples have been captured in the process described above.
Memory may be accessed and allocated in a number of different ways, some of which are described in the following embodiments.
First Memory Allocation Scheme
Referring now to
In the presently described embodiment, it is assumed, by way of example, that the high sample rate is 1024 samples/cycle where each sample is two bytes. It is further assumed that the signal input is a 60 Hz power signal input. Based on this set of assumptions, a memory buffer size needed for the large memory buffer 912 to capture 3 seconds of low sample rate data (e.g., 3 seconds of full bandwidth samples which include 3 seconds of low sample rate data) can be calculated as:
For a multiple channel system that includes, for example, 10 channels of data (e.g., Va, Vb, Vc, Ia, Ib, Ic, etc.), a memory buffer size needed to accommodate the totality of data points is on the order of 3.6 Megabytes (i.e., 10 channels*386,640 bytes/channel). Those knowledgeable in the art will appreciate this requirement to be a very inefficient use of memory for at least the following reasons.
Each block of data transferred by the DSP (not shown) to the CPU 908 is pre-ordered where each block transfer is comprised of two sample groups. Namely, a first group of low resolution samples, which are transferred first by the DSP, followed by a second group (which is the balance of the full bandwidth samples) of high resolution samples. In successive cycles of operation, each group of low resolution samples are accumulated (stored) in the large memory buffer 912 until a trigger event occurs at which time the stored groups of low resolution samples in each cycle are placed in a storage device 910 for permanent storage.
This approach requires a large memory buffer 912 (e.g., 3.6 Megabytes for 3 seconds of data capture for 10 channels, where 3 seconds represents the time interval setting of the low resolution capture). Second, this approach also requires a certain amount of overhead in concentrating the respective blocks of low resolution samples for permanent storage. For example, for each frame of data transferred by the CPU 908 from the Dual Port memory 902 to permanent storage 910, there is included a block of samples of low resolution data followed by a block of samples of high resolution data (e.g., 32/224). As described above, each frame of data is placed in a single large memory buffer 912 in a repetitive sequenced order corresponding to a set of low resolution samples followed by a set of high resolution samples for a number of successive frames. At some point, the low resolution samples must be concentrated for permanent storage. In other words, the sets of low resolution samples must be extracted from the stored sequence of low resolution samples followed by high resolution samples and appended in time sequence order.
Second Memory Allocation Scheme
Referring now to
It is noted that this process is performed for each frame of data samples read by the CPU 1004 from the dual port memory 1002. In other words, Buffer (1) 1008 and Buffer (2) 1010 are updated on a frame by frame basis so that when a trigger event occurs there is no re-ordering of data required nor further processing necessary other than saving the waveforms to a storage device 1006.
By way of example, if only one cycle of the high sample rate data is saved along with 3 seconds of low sample rate data, assuming a 1024 high sample rate and low sample rate of 128 per cycle, a total memory buffer size required can be calculated as:
It is understood that the sample rate of 1024 samples per cycle is for by way of explanation and not limitation. The sample rate is a matter of design choice. In general, the buffer size for storing the full bandwidth data is a function of a number of parameters, including, but not limited to, the number of cycles of data to be stored and the sampling rate. The reader will now be aware of other parameters.
For 10 channels the memory buffer size can be calculated as 480K bytes of memory. Buffer (2) 1010 stores only 3 seconds of data so that the oldest low resolution samples are overwritten as new low resolutions samples arrive. It is noted that while the memory size is significantly reduced as compared to the immediately preceding embodiment, an increased number of reads and writes are required. This occurs because the low sample rate data needs to be moved into its own dedicated buffer, Buffer (2) 1010, after all the data of the frame has been already written into the high sample rate buffer, Buffer (1) 1008.
Third Memory Allocation Scheme
Referring now to
By way of example, if the dual port memory 1102 stores a quarter of a cycle of sampled data where the maximum samples per cycle is 1024 samples, then the Dual Port Memory 1102 holds 256 data points. If the high sample rate is 1024 samples/cycle and the low sample rate is 128 samples/cycle then the first 32 samples of the 256 samples stored in the Dual Port Memory 1102, which have been pre-ordered into one block of contiguous 32 data points of low sample rate data, are stored in Buffer (1) 1112. The balance of the data stored in the Dual Port Memory 1102, namely, the 224 data points (256-32) are stored into a small buffer constituting the high resolution, high sample rate data, i.e., Buffer (2) 1114.
Upon the occurrence of a trigger event associated with the low sample rate data, the 128 low sample rate data, stored in Buffer (1) 1112, can be directly written to permanent memory. Similarly the high sample rate data can be written to permanent memory upon a trigger event such as a transient event, with the additional CPU operation of having to only add back the 128 samples associated with the low sample rate capture.
This implementation can be performed on a cyclic basis as described above or on a half cycle or quarter cycle basis or any other convenient block size. This approach requires: ((896 samples per cycle×2 bytes)+(128 samples per cycle×2 bytes))×60 Hz×3 seconds=47,872 bytes per channel. For 10 channels this would require 478K.
This embodiment advantageously minimizes the memory resource requirements and also minimizes the movement of data by the CPU 1104 so that it maximizes both performance and resources. The capture of low resolution samples can be performed on a continuous real-time basis because the samples are pre-ordered and the accumulation time of the low resolution samples occurs at a much slower rate than the accumulation of full bandwidth samples leaving enough processing time so that the CPU can continuously capture low resolution samples and transfer them in real-time to the storage device 1110.
Although the disclosure herein has been described with reference to particular illustrative embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present disclosure. Therefore numerous modifications may be made to the illustrative embodiments and other arrangements may be devised without departing from the spirit and scope of the present disclosure, which is defined by the appended claims.
Furthermore, although the foregoing text sets forth a detailed description of numerous embodiments, it should be understood that the legal scope of the present disclosure is defined by the words of the claims set forth at the end of this patent. The detailed description is to be construed as exemplary only and does not describe every possible embodiment, as describing every possible embodiment would be impractical, if not impossible. One could implement numerous alternate embodiments, using either current technology or technology developed after the filing date of this patent, which would still fall within the scope of the claims.
It should also be understood that, unless a term is expressly defined in this patent using the sentence “As used herein, the term ‘——————’ is hereby defined to mean . . . ” or a similar sentence, there is no intent to limit the meaning of that term, either expressly or by implication, beyond its plain or ordinary meaning, and such term should not be interpreted to be limited in scope based on any statement made in any section of this patent (other than the language of the claims). To the extent that any term recited in the claims at the end of this patent is referred to in this patent in a manner consistent with a single meaning, that is done for sake of clarity only so as to not confuse the reader, and it is not intended that such claim term be limited, by implication or otherwise, to that single meaning Finally, unless a claim element is defined by reciting the word “means” and a function without the recital of any structure, it is not intended that the scope of any claim element be interpreted based on the application of 35 U.S.C. §112, sixth paragraph.
This application is a continuation application of U.S. patent application Ser. No. 12/211,447, now U.S. Pat. No. 8,121,801, filed Sep. 16, 2008, which is a continuation-in-part application of U.S. patent application Ser. No. 12/075,747 filed on Mar. 13, 2008, now U.S. Pat. No. 8,666,688, the contents of which are hereby incorporated by reference in its entirety. This application is related to U.S. patent application Ser. No. 12/036,356 filed on Feb. 25, 2008, now U.S. Pat. No. 7,899,630, which is a continuation application of U.S. patent application Ser. No. 11/341,802 filed on Jan. 27, 2006 entitled “METERING DEVICE WITH CONTROL FUNCTIONALITY AND METHOD THEREOF”, now U.S. Pat. No. 7,337,081, which claims priority to U.S. Provisional Patent Application Ser. No. 60/647,669 filed on Jan. 27, 2005, the contents of which are hereby incorporated by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
1863741 | Leon | Jun 1932 | A |
2292163 | Shea | Aug 1942 | A |
2435753 | Richter et al. | Feb 1948 | A |
2606943 | Barker | Aug 1952 | A |
2883255 | Anderson | Apr 1959 | A |
2900605 | Squires et al. | Aug 1959 | A |
2987704 | Gimpel et al. | Jun 1961 | A |
2992365 | Brill | Jul 1961 | A |
3084863 | Du | Apr 1963 | A |
3142820 | Daniels | Jul 1964 | A |
3166726 | Jensen et al. | Jan 1965 | A |
3205439 | Michael et al. | Sep 1965 | A |
3333194 | Batcher | Jul 1967 | A |
3453540 | Dusheck | Jul 1969 | A |
3458810 | Wald | Jul 1969 | A |
3467864 | Plaats | Sep 1969 | A |
3504164 | Farrell et al. | Mar 1970 | A |
3534247 | Miljanic | Oct 1970 | A |
3535637 | Nils | Oct 1970 | A |
3629852 | Thexton et al. | Dec 1971 | A |
3815013 | Milkovic | Jun 1974 | A |
3824441 | Heyman et al. | Jul 1974 | A |
3995210 | Milkovic | Nov 1976 | A |
4066960 | Milkovic | Jan 1978 | A |
4077061 | Johnston et al. | Feb 1978 | A |
4140952 | Miller | Feb 1979 | A |
4182983 | Heinrich et al. | Jan 1980 | A |
4215697 | Demetrescu | Aug 1980 | A |
4240149 | Fletcher et al. | Dec 1980 | A |
4246623 | Sun | Jan 1981 | A |
4255707 | Miller | Mar 1981 | A |
4283772 | Johnston | Aug 1981 | A |
4336736 | Mishima | Jun 1982 | A |
4345311 | Fielden | Aug 1982 | A |
4360879 | Cameron | Nov 1982 | A |
4437059 | Hauptmann | Mar 1984 | A |
4442492 | Karlsson et al. | Apr 1984 | A |
4463311 | Kobayashi | Jul 1984 | A |
4466071 | Russell | Aug 1984 | A |
4486707 | Randall et al. | Dec 1984 | A |
4495463 | Milkovic | Jan 1985 | A |
4608533 | Starkie | Aug 1986 | A |
4642563 | McEachern | Feb 1987 | A |
4689752 | Fernandes et al. | Aug 1987 | A |
4713608 | Catiller et al. | Dec 1987 | A |
4713609 | Losapio et al. | Dec 1987 | A |
4742296 | Petr et al. | May 1988 | A |
4799008 | Kannari | Jan 1989 | A |
4811011 | Sollinger | Mar 1989 | A |
4839819 | Begin et al. | Jun 1989 | A |
4841236 | Miljanic et al. | Jun 1989 | A |
4843311 | Rozman et al. | Jun 1989 | A |
4884021 | Hammond et al. | Nov 1989 | A |
4897599 | Koslar | Jan 1990 | A |
4902965 | Bodrug et al. | Feb 1990 | A |
4933633 | Allgood | Jun 1990 | A |
4949029 | Cooper et al. | Aug 1990 | A |
4958294 | Herscher et al. | Sep 1990 | A |
4958640 | Logan | Sep 1990 | A |
4989155 | Begin et al. | Jan 1991 | A |
4996646 | Farrington | Feb 1991 | A |
4999572 | Bickford et al. | Mar 1991 | A |
5006846 | Granville et al. | Apr 1991 | A |
5014229 | Mceachern | May 1991 | A |
5017860 | Germer et al. | May 1991 | A |
5039937 | Mandt | Aug 1991 | A |
5079715 | Venkataraman et al. | Jan 1992 | A |
5122735 | Porter et al. | Jun 1992 | A |
5132609 | Nguyen | Jul 1992 | A |
5132610 | Ying-Chang | Jul 1992 | A |
5166887 | Farrington et al. | Nov 1992 | A |
5170115 | Kashiwabara et al. | Dec 1992 | A |
5170360 | Porter et al. | Dec 1992 | A |
5185705 | Farrington | Feb 1993 | A |
5212441 | Mceachern et al. | May 1993 | A |
5220495 | Zulaski | Jun 1993 | A |
5224006 | MacKenzie et al. | Jun 1993 | A |
5224054 | Wallis | Jun 1993 | A |
5229713 | Bullock et al. | Jul 1993 | A |
5233538 | Wallis | Aug 1993 | A |
5237511 | Caird et al. | Aug 1993 | A |
5243536 | Bradford | Sep 1993 | A |
5245275 | Germer et al. | Sep 1993 | A |
5248935 | Sakoyama et al. | Sep 1993 | A |
5248967 | Daneshfar | Sep 1993 | A |
5258704 | Germer et al. | Nov 1993 | A |
5289115 | Germer et al. | Feb 1994 | A |
5298854 | Mceachern et al. | Mar 1994 | A |
5298855 | Mceachern et al. | Mar 1994 | A |
5298856 | Mceachern et al. | Mar 1994 | A |
5298859 | Mceachern et al. | Mar 1994 | A |
5298885 | Mceachern et al. | Mar 1994 | A |
5298888 | Mceachern et al. | Mar 1994 | A |
5300924 | Mceachern et al. | Apr 1994 | A |
5301121 | Garverick et al. | Apr 1994 | A |
5302890 | Mceachern et al. | Apr 1994 | A |
5307009 | Mceachern et al. | Apr 1994 | A |
5315527 | Beckwith | May 1994 | A |
5325051 | Germer et al. | Jun 1994 | A |
5343143 | Voisine et al. | Aug 1994 | A |
5347464 | Mceachern et al. | Sep 1994 | A |
5391983 | Lusignan et al. | Feb 1995 | A |
5402148 | Post et al. | Mar 1995 | A |
5406495 | Hill | Apr 1995 | A |
5438257 | Berkcan | Aug 1995 | A |
5442279 | Kitayoshi et al. | Aug 1995 | A |
5453697 | Schweer et al. | Sep 1995 | A |
5459395 | Berkcan | Oct 1995 | A |
5459459 | Lee, Jr. | Oct 1995 | A |
5475628 | Adams et al. | Dec 1995 | A |
5514958 | Germer | May 1996 | A |
5528507 | McNamara et al. | Jun 1996 | A |
5544064 | Beckwith | Aug 1996 | A |
5548527 | Hemminger et al. | Aug 1996 | A |
5555508 | Munday et al. | Sep 1996 | A |
5559719 | Johnson et al. | Sep 1996 | A |
5563506 | Fielden et al. | Oct 1996 | A |
5568047 | Staver et al. | Oct 1996 | A |
5574654 | Bingham et al. | Nov 1996 | A |
5581173 | Yalla et al. | Dec 1996 | A |
5592165 | Jackson et al. | Jan 1997 | A |
5619142 | Schweer et al. | Apr 1997 | A |
5627759 | Bearden et al. | May 1997 | A |
5642300 | Gubisch et al. | Jun 1997 | A |
5650936 | Loucks et al. | Jul 1997 | A |
5675754 | King et al. | Oct 1997 | A |
5706204 | Cox et al. | Jan 1998 | A |
5706214 | Putt et al. | Jan 1998 | A |
5734571 | Pilz et al. | Mar 1998 | A |
5736847 | Doorn et al. | Apr 1998 | A |
5737231 | Pyle et al. | Apr 1998 | A |
5757357 | Grande et al. | May 1998 | A |
5758331 | Johnson | May 1998 | A |
5764523 | Yoshinaga et al. | Jun 1998 | A |
5774366 | Beckwith | Jun 1998 | A |
5801643 | Williams et al. | Sep 1998 | A |
5819203 | Moore et al. | Oct 1998 | A |
5822165 | Moran | Oct 1998 | A |
5825656 | Moore et al. | Oct 1998 | A |
5828576 | Loucks et al. | Oct 1998 | A |
5832210 | Akiyama et al. | Nov 1998 | A |
5862391 | Salas et al. | Jan 1999 | A |
5874903 | Shuey et al. | Feb 1999 | A |
5890097 | Cox | Mar 1999 | A |
5892758 | Argyroudis | Apr 1999 | A |
5897607 | Jenney et al. | Apr 1999 | A |
5898387 | Davis et al. | Apr 1999 | A |
5899960 | Moore et al. | May 1999 | A |
5907238 | Owerko et al. | May 1999 | A |
5933029 | Kuroda et al. | Aug 1999 | A |
5952819 | Berkcan et al. | Sep 1999 | A |
5963734 | Ackerman et al. | Oct 1999 | A |
5978655 | Ohura et al. | Nov 1999 | A |
5986574 | Colton | Nov 1999 | A |
5994892 | Turino et al. | Nov 1999 | A |
5995911 | Hart | Nov 1999 | A |
6005759 | Hart et al. | Dec 1999 | A |
6011519 | Sadler et al. | Jan 2000 | A |
6018690 | Saito et al. | Jan 2000 | A |
6018700 | Edel | Jan 2000 | A |
6023160 | Coburn | Feb 2000 | A |
6032109 | Ritmiller, III | Feb 2000 | A |
6038516 | Alexander et al. | Mar 2000 | A |
6064192 | Redmyer | May 2000 | A |
6073169 | Shuey et al. | Jun 2000 | A |
6098175 | Lee | Aug 2000 | A |
6100817 | Mason, Jr. et al. | Aug 2000 | A |
6112136 | Paul et al. | Aug 2000 | A |
6133720 | Elmore | Oct 2000 | A |
6157329 | Lee et al. | Dec 2000 | A |
6163243 | Titus | Dec 2000 | A |
6167329 | Engel et al. | Dec 2000 | A |
6185508 | Van Doorn et al. | Feb 2001 | B1 |
6186842 | Hirschbold et al. | Feb 2001 | B1 |
6195614 | Kochan | Feb 2001 | B1 |
6262672 | Brooksby et al. | Jul 2001 | B1 |
6269316 | Hubbard et al. | Jul 2001 | B1 |
6289267 | Alexander et al. | Sep 2001 | B1 |
6292717 | Alexander et al. | Sep 2001 | B1 |
6351112 | Felps | Feb 2002 | B1 |
6363057 | Ardalan et al. | Mar 2002 | B1 |
6374084 | Fok | Apr 2002 | B1 |
6396421 | Bland | May 2002 | B1 |
6396839 | Ardalan et al. | May 2002 | B1 |
6397155 | Przydatek et al. | May 2002 | B1 |
6401054 | Andersen | Jun 2002 | B1 |
6415244 | Dickens | Jul 2002 | B1 |
6417661 | Berkcan et al. | Jul 2002 | B1 |
6423960 | Engelhardt et al. | Jul 2002 | B1 |
6429637 | Gandhi | Aug 2002 | B1 |
6429785 | Griffin et al. | Aug 2002 | B1 |
6433981 | Fletcher et al. | Aug 2002 | B1 |
6437692 | Petite et al. | Aug 2002 | B1 |
6444971 | Engelhardt et al. | Sep 2002 | B1 |
6479976 | Edel | Nov 2002 | B1 |
6483291 | Bhateja et al. | Nov 2002 | B1 |
6493644 | Jonker et al. | Dec 2002 | B1 |
6509850 | Bland | Jan 2003 | B1 |
6519537 | Yang | Feb 2003 | B1 |
6522517 | Edel | Feb 2003 | B1 |
6528957 | Luchaco | Mar 2003 | B1 |
6538577 | Ehrke et al. | Mar 2003 | B1 |
6542838 | Haddad et al. | Apr 2003 | B1 |
6590380 | Edel | Jul 2003 | B2 |
6615147 | Jonker et al. | Sep 2003 | B1 |
6621433 | Hertz | Sep 2003 | B1 |
6636030 | Rose et al. | Oct 2003 | B1 |
6639538 | Sechi | Oct 2003 | B1 |
6657552 | Belski et al. | Dec 2003 | B2 |
6661357 | Bland | Dec 2003 | B2 |
6671635 | Forth et al. | Dec 2003 | B1 |
6671654 | Forth et al. | Dec 2003 | B1 |
6671802 | Ott | Dec 2003 | B1 |
6674379 | Li | Jan 2004 | B1 |
6675071 | Griffin, Jr. et al. | Jan 2004 | B1 |
6687627 | Gunn et al. | Feb 2004 | B1 |
6694270 | Hart | Feb 2004 | B2 |
6701264 | Caso et al. | Mar 2004 | B2 |
6714881 | Carlson et al. | Mar 2004 | B2 |
6717394 | Elms | Apr 2004 | B2 |
6735535 | Kagan et al. | May 2004 | B1 |
6745138 | Przydatek et al. | Jun 2004 | B2 |
6751562 | Blackett et al. | Jun 2004 | B1 |
6751563 | Spanier et al. | Jun 2004 | B2 |
6757628 | Anderson et al. | Jun 2004 | B1 |
6759837 | Gandhi | Jul 2004 | B2 |
6792364 | Jonker et al. | Sep 2004 | B2 |
6813571 | Lightbody et al. | Nov 2004 | B2 |
6829267 | Vaughan et al. | Dec 2004 | B2 |
6836737 | Petite et al. | Dec 2004 | B2 |
6842707 | Raichle et al. | Jan 2005 | B2 |
6871150 | Huber et al. | Mar 2005 | B2 |
6900738 | Crichlow | May 2005 | B2 |
6917888 | Logvinov et al. | Jul 2005 | B2 |
6944555 | Blackett et al. | Sep 2005 | B2 |
6957158 | Hancock et al. | Oct 2005 | B1 |
6961641 | Forth et al. | Nov 2005 | B1 |
6963195 | Berkcan | Nov 2005 | B1 |
6985087 | Soliman | Jan 2006 | B2 |
6988043 | Randall | Jan 2006 | B1 |
7006934 | Jonker et al. | Feb 2006 | B2 |
7010438 | Hancock et al. | Mar 2006 | B2 |
7035593 | Miller et al. | Apr 2006 | B2 |
7043459 | Peevey | May 2006 | B2 |
7049975 | Vanderah et al. | May 2006 | B2 |
7050808 | Janusz et al. | May 2006 | B2 |
7050916 | Curtis et al. | May 2006 | B2 |
7072779 | Hancock et al. | Jul 2006 | B2 |
7085824 | Forth et al. | Aug 2006 | B2 |
7085938 | Pozzuoli et al. | Aug 2006 | B1 |
7126493 | Junker et al. | Oct 2006 | B2 |
7174261 | Gunn et al. | Feb 2007 | B2 |
7191076 | Huber et al. | Mar 2007 | B2 |
7196673 | Savage et al. | Mar 2007 | B2 |
7209804 | Curt et al. | Apr 2007 | B2 |
7239184 | Cetrulo et al. | Jul 2007 | B2 |
7243050 | Armstrong | Jul 2007 | B2 |
7304586 | Wang et al. | Dec 2007 | B2 |
7304829 | Nadipuram et al. | Dec 2007 | B2 |
7305310 | Slota et al. | Dec 2007 | B2 |
7313176 | Groen | Dec 2007 | B1 |
7337081 | Kagan | Feb 2008 | B1 |
7342507 | Jonker et al. | Mar 2008 | B2 |
7359809 | Bruno | Apr 2008 | B2 |
7369950 | Wall et al. | May 2008 | B2 |
7372574 | Sanders et al. | May 2008 | B2 |
7409303 | Yeo et al. | Aug 2008 | B2 |
7436687 | Patel | Oct 2008 | B2 |
7444454 | Yancey et al. | Oct 2008 | B2 |
7511468 | Mceachern et al. | Mar 2009 | B2 |
7514907 | Rajda et al. | Apr 2009 | B2 |
7554320 | Kagan | Jun 2009 | B2 |
7577542 | Vacar et al. | Aug 2009 | B2 |
7616656 | Wang et al. | Nov 2009 | B2 |
7630863 | Zweigle et al. | Dec 2009 | B2 |
7660682 | Slota et al. | Feb 2010 | B2 |
7761910 | Ransom et al. | Jul 2010 | B2 |
7877169 | Slota et al. | Jan 2011 | B2 |
7881907 | Curt et al. | Feb 2011 | B2 |
7899630 | Kagan | Mar 2011 | B2 |
7916060 | Zhu et al. | Mar 2011 | B2 |
7962298 | Przydatek et al. | Jun 2011 | B2 |
7974713 | Disch et al. | Jul 2011 | B2 |
7996171 | Banhegyesi | Aug 2011 | B2 |
7999696 | Wang et al. | Aug 2011 | B2 |
8022690 | Kagan | Sep 2011 | B2 |
8063704 | Wu et al. | Nov 2011 | B2 |
8073642 | Slota et al. | Dec 2011 | B2 |
8078418 | Banhegyesi et al. | Dec 2011 | B2 |
8107491 | Wang et al. | Jan 2012 | B2 |
8121801 | Spanier et al. | Feb 2012 | B2 |
8160824 | Spanier et al. | Apr 2012 | B2 |
8190381 | Spanier et al. | May 2012 | B2 |
8269482 | Banhegyesi | Sep 2012 | B2 |
8442660 | Kagan | May 2013 | B2 |
8515348 | Kagan | Aug 2013 | B2 |
8599036 | Wang et al. | Dec 2013 | B2 |
8620608 | Banhegyesi et al. | Dec 2013 | B2 |
8666688 | Spanier | Mar 2014 | B2 |
8700347 | Spanier et al. | Apr 2014 | B2 |
8797202 | Zhu et al. | Aug 2014 | B2 |
8862435 | Spanier et al. | Oct 2014 | B2 |
8878517 | Banhegyesi | Nov 2014 | B2 |
8930153 | Kagan et al. | Jan 2015 | B2 |
8933815 | Kagan et al. | Jan 2015 | B2 |
9080894 | Spanier | Jul 2015 | B2 |
9092593 | Nasle | Jul 2015 | B2 |
9194898 | Banhegyesi et al. | Nov 2015 | B2 |
9482555 | Spanier et al. | Nov 2016 | B2 |
9897665 | Taft | Feb 2018 | B2 |
9903895 | Banhegyesi et al. | Feb 2018 | B2 |
9989618 | Spanier et al. | Jun 2018 | B2 |
11307227 | Spanier | Apr 2022 | B2 |
20010038343 | Meyer et al. | Nov 2001 | A1 |
20020018399 | Schultz et al. | Feb 2002 | A1 |
20020032535 | Alexander et al. | Mar 2002 | A1 |
20020091784 | Baker | Jul 2002 | A1 |
20020105435 | Yee et al. | Aug 2002 | A1 |
20020109608 | Petite et al. | Aug 2002 | A1 |
20020120723 | Forth et al. | Aug 2002 | A1 |
20020129342 | Kil et al. | Sep 2002 | A1 |
20020169570 | Spanier et al. | Nov 2002 | A1 |
20020180420 | Lavoie et al. | Dec 2002 | A1 |
20030014200 | Jonker et al. | Jan 2003 | A1 |
20030018982 | Zeidler et al. | Jan 2003 | A1 |
20030025620 | Bland | Feb 2003 | A1 |
20030065459 | Huber et al. | Apr 2003 | A1 |
20030076247 | Bland | Apr 2003 | A1 |
20030093429 | Nishikawa et al. | May 2003 | A1 |
20030154471 | Teachman et al. | Aug 2003 | A1 |
20030178982 | Elms | Sep 2003 | A1 |
20030178985 | Briese et al. | Sep 2003 | A1 |
20030187550 | Wilson et al. | Oct 2003 | A1 |
20030204756 | Ransom et al. | Oct 2003 | A1 |
20030226058 | Miller et al. | Dec 2003 | A1 |
20040113810 | Mason et al. | Jun 2004 | A1 |
20040122833 | Forth et al. | Jun 2004 | A1 |
20040128260 | Amedure et al. | Jul 2004 | A1 |
20040138835 | Ransom et al. | Jul 2004 | A1 |
20040167686 | Baker et al. | Aug 2004 | A1 |
20040172207 | Hancock et al. | Sep 2004 | A1 |
20040177062 | Urquhart et al. | Sep 2004 | A1 |
20040183522 | Gunn et al. | Sep 2004 | A1 |
20040193329 | Ransom et al. | Sep 2004 | A1 |
20040208182 | Boles et al. | Oct 2004 | A1 |
20050027464 | Jonker et al. | Feb 2005 | A1 |
20050060110 | Jones et al. | Mar 2005 | A1 |
20050071106 | Huber et al. | Mar 2005 | A1 |
20050093571 | Suaris et al. | May 2005 | A1 |
20050144437 | Ransom et al. | Jun 2005 | A1 |
20050165585 | Bhateja et al. | Jul 2005 | A1 |
20050187725 | Cox | Aug 2005 | A1 |
20050220079 | Asokan | Oct 2005 | A1 |
20050240362 | Randall | Oct 2005 | A1 |
20050243204 | Zhu | Nov 2005 | A1 |
20050273280 | Cox | Dec 2005 | A1 |
20050288876 | Doig et al. | Dec 2005 | A1 |
20060047787 | Agarwal et al. | Mar 2006 | A1 |
20060052958 | Hancock et al. | Mar 2006 | A1 |
20060066456 | Jonker et al. | Mar 2006 | A1 |
20060066903 | Shiimori | Mar 2006 | A1 |
20060083260 | Wang et al. | Apr 2006 | A1 |
20060085419 | Rosen | Apr 2006 | A1 |
20060095219 | Bruno | May 2006 | A1 |
20060145890 | Junker et al. | Jul 2006 | A1 |
20060161360 | Yao et al. | Jul 2006 | A1 |
20060200599 | Manchester et al. | Sep 2006 | A1 |
20060261296 | Heath et al. | Nov 2006 | A1 |
20060267560 | Rajda et al. | Nov 2006 | A1 |
20070058320 | Lee | Mar 2007 | A1 |
20070058634 | Gupta et al. | Mar 2007 | A1 |
20070067119 | Loewen et al. | Mar 2007 | A1 |
20070067121 | Przydatek et al. | Mar 2007 | A1 |
20070081597 | Disch et al. | Apr 2007 | A1 |
20070096765 | Kagan | May 2007 | A1 |
20070096942 | Kagan et al. | May 2007 | A1 |
20070112446 | Deveaux et al. | May 2007 | A1 |
20070114987 | Kagan | May 2007 | A1 |
20070152058 | Yeakley et al. | Jul 2007 | A1 |
20070233323 | Wiemeyer et al. | Oct 2007 | A1 |
20080075194 | Ravi et al. | Mar 2008 | A1 |
20080086222 | Kagan | Apr 2008 | A1 |
20080091770 | Petras et al. | Apr 2008 | A1 |
20080147334 | Kagan | Jun 2008 | A1 |
20080172192 | Banhegyesi | Jul 2008 | A1 |
20080195794 | Banker | Aug 2008 | A1 |
20080215264 | Spanier et al. | Sep 2008 | A1 |
20080234957 | Banhegyesi et al. | Sep 2008 | A1 |
20080235355 | Spanier et al. | Sep 2008 | A1 |
20080238406 | Banhegyesi | Oct 2008 | A1 |
20080238713 | Banhegyesi et al. | Oct 2008 | A1 |
20080252481 | Vacar et al. | Oct 2008 | A1 |
20080255782 | Bilac et al. | Oct 2008 | A1 |
20090012728 | Spanier et al. | Jan 2009 | A1 |
20090066528 | Bickel et al. | Mar 2009 | A1 |
20090072813 | Banhegyesi | Mar 2009 | A1 |
20090096654 | Zhu et al. | Apr 2009 | A1 |
20090228224 | Spanier et al. | Sep 2009 | A1 |
20090265124 | Kagan | Oct 2009 | A1 |
20100054276 | Wang et al. | Mar 2010 | A1 |
20100076616 | Kagan | Mar 2010 | A1 |
20100082844 | Stoupis et al. | Apr 2010 | A1 |
20100153036 | Elwarry et al. | Jun 2010 | A1 |
20100169876 | Mann | Jul 2010 | A1 |
20100324845 | Spanier et al. | Dec 2010 | A1 |
20110040809 | Spanier et al. | Feb 2011 | A1 |
20110153697 | Nickolov et al. | Jun 2011 | A1 |
20110158244 | Long et al. | Jun 2011 | A1 |
20110260710 | Zhu et al. | Oct 2011 | A1 |
20110270551 | Kagan et al. | Nov 2011 | A1 |
20120025807 | Banhegyesi | Feb 2012 | A1 |
20120131100 | Olst et al. | May 2012 | A1 |
20120209057 | Siess et al. | Aug 2012 | A1 |
20120209552 | Spanier et al. | Aug 2012 | A1 |
20120209557 | Crandall et al. | Aug 2012 | A1 |
20130158918 | Spanier et al. | Jun 2013 | A1 |
20140180613 | Banhegyesi et al. | Jun 2014 | A1 |
20140222357 | Spanier et al. | Aug 2014 | A1 |
20170046458 | Meagher et al. | Feb 2017 | A1 |
Number | Date | Country |
---|---|---|
2618228 | Jul 2013 | EP |
08-247783 | Sep 1996 | JP |
9854583 | Dec 1998 | WO |
0155733 | Aug 2001 | WO |
Entry |
---|
7700 Ion 3-Phase Power Meter, Analyzer and Controller, pp. 1-8, Nov. 30, 2000. |
Futura+Series, “Advanced Power Monitoring and Analysis for the 21st Century”, Electro Industries/Gauge Tech, specification, 8 pages, Apr. 13, 2000. |
IEC 61000-4-15: Electromagnetic compatibility (EMC) Part 4: Testing and measuring techniques, Section 15: Flickermeter—Functional and design specifications; CENELEC—European Committee for Electrotechnical Standardization; Apr. 1998. |
ION Technology 7500 ION 7600 ION High Visibility Energy and Power Quality Compliance Meters, specification, Power Measurement, pp. 1-8, revision date Nov. 30, 2000. |
ION Technology, 7500 ION High Visibility 3-Phase Energy & Power Quality Meter, Power Measurement, specification, pp. 1-8, revision date Mar. 21, 2000. |
ION7550/ion7650 PowerLogic power-monitoring units, Technical data sheets, Copyright 2006 Schneider Electric. |
Nexus 1250 Installation and Operation Manual Revision 1.20, Electro Industries/Gauge Tech, 50 pages, Nov. 8, 2000. |
Nexus 1250, Precision Power Meter & Data Acquisition Node, Accumeasure(r) Technology, Electro Industries/Gauge Tech, specification, 16 pages, Nov. 1999. |
Performance Power Meter & Data Acquisition Node, Electro Industries/Gauge Tech, Nexus 1250 specification, 8 pages, Dec. 14, 2000. |
PowerLogic Series 4000 Circuit Monitors, pp. 1-4; Document #3020HO0601; Jan. 2006. |
User' Installation & Operation and User's Programming Manual, The Futura Series, Electro Industries, pp. 1-64, (c) 1995. |
“Power Quality—A guide to voltage fluctuation and light flicker”; BChydro Power Smart, Vancouver, B.C., Canada; Dated Mar. 2005; pp. 1-12. |
European Standard EN-50160; “Voltage characteristics of electricity supplied by public distribution networks”; Copyright 2007 CENELEC; published Oct. 31, 2007; pp. 1-23. |
IEEE Std 1159-1995; IEEE Recommended Practice for monitoring Electric Power Quality; Copyright The Institute of Electrical and Electronics Engineers, Inc. 1995; New York, NY; pp. 1-76. |
IEEE Std 519-1992; IEEE Recommended Practices and Requirements for Harmonic Control in Electrical Power Systems; Copyright The Institute of Electrical and Electronics Engineers, Inc. 1993; New York, NY; pp. 1-101. |
International Standard IEC-1180-1; “High-voltage test techniques for low-voltage equipment”; Copyright Commission Electrotechnique Commission 1992; Geneva, Switzerland; pp. 1-62. |
International Standard IEC-61000-2-4, Second Edition; “Electromagnetic compatibility (EMC)—Part 2-4:Enviroment-Compatbility levels in industrial plants for low-frequency conducted distribances”; Copyright Commission Electrotechnique Commission 2002; Geneva, Switzerland; pp. 1-84. |
International Standard IEC-61000-4-30, First Edition; “Electromagnetic compatibility (EMC)—Part 4-30:Testing and measurement techniques—Power quality measurement methods”; Copyright Commission Electrotechnique Commission 2003; Geneva, Switzerland; pp. 1-98. |
International Standard IEC-61000-4-7, Second Edition; “Electromagnetic compatibility (EMC)—Part 4-7:Testing and measurement techniques”; Copyright Commission Electrotechnique Commission 2002; Geneva, Switzerland; pp. 1-80. |
International Standard IEC-687, Second Edition; “Alternating current static watt-hours meters for active energy”; Copyright Commission Electrotechnique Commission 1992; Geneva, Switzerland; pp. 1-36. |
Power Platform 4300 Multi-DAQ TASKCard Operator's Manual; Dranetz-BMI, Original Issue—Jul. 2002, pp. 203. |
Power Platform PP1 & PP1E TASKCard—Inrush Operator's Manual; Dranetz-BMI, Revision A—Apr. 15, 1997, pp. 231. |
Series 5500 InfoNode User's Guide; Dranetz-BMI, Edison, NJ; Copywright 1999, 2002, 2004; pp. 1-220. |
The Dranetz Field Handbook for Power quality Analysis; Dranetz Technologies Incorporated, Edison, NJ; Copyright 1991; pp. 1-271. |
Zeinalipour-Yazti et ai, MicroHash: An Efficient Index Structure for Flash-Based Sensor Devices, Proceedings of the 4th Conference on USENIX Conference on File and Storage Technologies, vol. 4, Dec. 2005, pp. 14. |
3720 ACM, 3-hase Power Instruction Package, Power Measurement, specification, 8 pages, revision date Dec. 16, 1998. |
3720 ACM, Installation & Operation Manual, Power Measurement, 67 pages, revision date Apr. 4, 2000. |
6200 ION, Installation & Basic Setup Instructions, (c)Power Measurement Ltd., Revision Date Apr. 25, 2001, 50 pages. |
8400 ION/8500 Ion Instruction Leaflet, Power Measurement, pp. 1-8, Oct. 1999. |
8500 ION Technical Documentation, 8500 ION and 8500 ION-PQ Advanced Intelligent Billing Meters, specification, Power Measurement, revision date Apr. 15, 1999. |
Braden, R (editor), “Requirements for Internet Hosts-Application and Support”, RFC 1123, pp. 1-97Oct. 1989. |
Brochure, Sentinel TM Electronic “Multimeasurement Meter,” Schlumberger, Mar. 2001, 4 pages. |
Communicator EXT 3.0 User Manual Revision 1.32, Electro Industries/Gauge Tech, 558 pages, Aug. 27, 2007. |
Deutsch, P., Emtage, A., and Marine, A., “How to Use Anonymous FTP”, RFC1635, pp. 1-13, May 1994. |
Electro Industries/Gauge Tech DM Series—specification brochure, “DMMS 425 Low-Cost Multifunction Power Monitoring Outperforms All Others in its Class”, 4 pages. |
http://www.landisgyr.us/Landis_Gyr/Meters/2510_socket_meter. asp, Apr. 18, 2005, 25 pages. |
Hubbert, “What is flat file?”, WhatIs.com,http://searchsqlserver.techtarget.com/definition/flat-file, Jul. 2006, 1pp. |
ION 7550/ION7650 User Guide Power Measurement—Revision Date Aug. 31, 2004. |
ION Technology 7700 ION 3-Phase Power Meter, Analyzer and Controller, Power Measurement, specification, pp. 1-10, revision date Dec. 8, 1998. |
ION Technology 7700 ION Installation & Operation Manual, Power Measurement, revision date Nov. 20, 1996. |
Ion Technology 8500 ION. 8400 ION Advanced Socket-Mount Meter, specification, Power Measurement, pp. 1-12, revision date Dec. 3, 1999. |
ION(R) Technology, Meter Shop User's Guide, (C)Power Measurement Ltd., Revision DAte May 10, 2001, 48 pages. |
Manual, “3300 ACM, Economical Digital Power Meter/Transducer—Installation and Operation Manual, Power Measurement, Ltd.”, 1999, pp. 79. |
Nagura et al., “Correction method for a single chip power meter”, May 10-12, 1994, IEEE, 1994 IEEE Instrumentation and Measurement Technology Conference, 1994. ITMC/94. |
Postel, J.B., and Reynolds, J.K. “File Transfer Protocol (FTP)”, RFC959, pp. 1-66, Oct. 1985. |
Ramboz, J.D. And Petersons, O., Nist Measurement Services: A Calibration Service for Current Transformers, U.S. Dept. of Commerce, National Institute of Standards and Tech., U.S. Gov. PMtg. Ofc., Jun. 1991. |
Speirs, “What is binary file?”, WhatIs.com, http://whatis.techtarget.com/definition/binary-file, Apr. 2005, 1 pp. |
Number | Date | Country | |
---|---|---|---|
20120146808 A1 | Jun 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12211447 | Sep 2008 | US |
Child | 13397824 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12075747 | Mar 2008 | US |
Child | 12211447 | US |