|Publication number||US7876257 B2|
|Application number||US 12/110,834|
|Publication date||Jan 25, 2011|
|Filing date||Apr 28, 2008|
|Priority date||Apr 28, 2008|
|Also published as||US20090267825|
|Publication number||110834, 12110834, US 7876257 B2, US 7876257B2, US-B2-7876257, US7876257 B2, US7876257B2|
|Inventors||Anthony Vetro, Shan Liu, Jian Lou, Stephen R. Burgess|
|Original Assignee||Mitsubishi Electric Research Laboratories, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (6), Non-Patent Citations (5), Referenced by (14), Classifications (13), Legal Events (2)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The invention relates generally to compressing signals acquired by synthetic aperture radar (SAR), and more particularly to compressing raw SAR signals in low complexity devices.
Synthetic aperture radar (SAR) acquires raw radar data from target objects or terrain typically using a space-based platform. Post-processing converts the raw SAR data to an amplitude image and phase maps, such that objects and terrain can be visualized. Due to the very high computational complexity, the SAR data processing is typically performed on the ground.
Alternatively as shown in
It is known that standardized image compression methods, such as JPEG, are not suited for achieving high coding efficiency of raw SAR data. The main reason is due to the noisy nature of the raw SAR data, which is not well matched with the JPEG coding standard that has been optimized for coding natural images. It is noted that the statistics of raw SAR data, which resemble Gaussian noise, are completely different from statistics of natural image data.
Block adaptive quantization (BAQ) can be used to compress the raw SAR data acquired by the Magellan spacecraft, see e.g., U.S. Pat. No. 5,661,477, “Methods for compressing and decompressing raw digital SAR data and devices for executing them,” and Kwok et al., “Block Adaptive Quantization of Magellan SAR Data,” IEEE Trans on Geosc. and Remote Sensing, vol. 27, No. 4, pp. 375-383, July 1989, all incorporated herein by reference. Similar to many conventional image compression methods, BAQ quantizes raw pixel values, e.g. from 8 bits to 4 bits. However, for inputs with a large dynamic range, such as raw data acquired by SAR, the quantization step size has to be adaptive to the level of input signals in order to achieve more efficient compression. Therefore, BAQ adapts the quantization step size for each 16×16 block.
To achieve a higher resolution, the sampling rate of the raw data needs to increase. Given limitation in transmission bandwidth, a higher compression ratio is also needed, while maintaining the quality of the SAR image. BAQ could provide reasonably quality SAR images at moderate compression ratios. However, it is known that the quality degrades substantially when the compression ratio is greater than 2:1. Hence, there is a need to provide a method for compressing raw SAR at an increased compression ratio without decreasing quality.
A number of methods are known for compressing processed SAR data, but relatively few methods have been developed for compressing raw SAR data, see Delp et al., “Image Compression Using Block Truncation Coding (BTC)”, IEEE Transactions Communications, Vol. Com-27, No. 9, September 1979, Magli et al., “Wavelet-based compression of SAR raw data,” Geoscience and Remote Sensing Symposium, 2002, IEEE International, pp. 1129-1131, and “Frequency domain raw SAR data compression for multi-mode SAR Instruments,” National Aerospace Laboratory (NLR), EUSAR 2006, 16-18 May 2006, all incorporated herein by reference.
The BTC method uses a two-level quantizer that adapts to local block properties of the SAR image. That method has a low complexity, and can achieve a high compression ratio, e.g., about 4:1. However, the quality of the output image is substantially degraded. In general, BTC performs worse than BAQ.
Magli et al. apply adaptive quantization to blocks of pixels, as in BAQ. A digital wavelet transform (DWT) is first applied to the raw data, such that the BAQ is performed on wavelet coefficients in the frequency domain. It is well known that the wavelet transform has a high computational complexity relative to block-based scheme and also requires significantly more memory. Thus, that method is not suitable for low complexity devices.
The NLR (FFT-ECBAQ) method applies a 2-dimensional fast Fourier transform (FFT) to the raw SAR data, and then an entropy-constrained BAQ (ECBAQ), followed by entropy encoding. The major drawback of that method is the FFT causes cross-leak noise with smaller block sizes, which implies that larger FFT-sizes are preferred, e.g., an FFT size of 128×64. However, that FFT is too complex to implement in low complexity devices. In fact, that method relies on the fastest known FFT-oriented DSP ASIC (powerFFT™) to compute the long sized FFT. Without that chip, the transform size would have to be greatly reduced, to e.g., by a factor of 8 or 16. The maximum throughput of that method is up to 125 mega-samples per second (MSPS), or 1 Gbits per second, assuming each sample is 8 bits, which is not sufficient for applications requiring higher throughputs, e.g. 4 Gbits per second, as required by applications that aim to reconstruct high resolution SAR images.
It is desirable to have a method and apparatus for compressing raw SAR data, which can achieve an increased compression ratio, high resolution SAR images, while maintaining low hardware complexity, and overcome the disadvantages of the prior art.
A method compresses synthetic aperture radar (SAR) data by sampling the SAR data into blocks and transforming each block to a corresponding block of transform coefficients. Each block of transform coefficient is quantized according to a quantization parameter to obtain a corresponding block of quantized transform coefficients, which are demultiplexed into sets of blocks of quantized transform coefficients. The quantized transform coefficients in the blocks in each set are arithmetically encoding in parallel according to a probability model to produce an intermediate bitstream for each set of blocks. The encoding of the quantized transform coefficients of one block is independent of the quantized transform coefficients of a successive block. The intermediate of bitstream are then multiplexed to a compressed bitstream, which can be transmitted, or stored, for subsequent decoding to construct an SAR image.
The method can be implemented in field programmable gate arrays (FPGAs). A single FPGA can be used for the entire method. Alternatively, an independent FPGA can be used for each block in the set to encode the blocks in the set in parallel. Another FPGA can then be used for the front end steps.
The embodiments of our invention describe a method and apparatus for compressing raw synthetic aperture radar (SAR) signals. Due to the hardware constraints, such as memory size, processing power, bandwidth and throughput, the raw SAR data are compressed block by block. To limit complexity and in contrast with the prior art methods, the compression method is design to be effective for relatively small block sizes, e.g. 8×8 or 16×16 pixels. Although the focus of our invention is on limited complexity implementations, larger block sizes can also be used.
A variance of the raw data in each block is also determined 320. An initial quantization parameter (QP) is determined 330 according to a target output bit rate or compression ratio stored in a table 500, see
The QP value 601 and the quantized transform coefficients 351 are sent to a modified arithmetic encoder 360, which uses a probability model 361.
Our samples are independent and randomly distributed. Therefore, our probability model is conventional and represents the random distribution of the quantized transform coefficients. It is defined on our sample space, samples and probabilities of each sample. The model can be linear, binomial, or Gaussian as known in the art. The model can be learned from SAR training data or updated based on previously coded data. In our invention, a separate model is maintained for each quantized transform coefficient in a block, e.g., the DC coefficient has one probability model, while each of the AC coefficients have their own probability models.
Conventional arithmetic coding is well known for its efficient compression capability. However, conventional arithmetic encoders are limited to sequential processing. This means that conventional arithmetic encoders are not suited for low complexity hardware devices with high throughput requirements. In our invention, we describe a parallel design for arithmetic encoding that makes it possible to realize higher throughput with low complexity hardware.
The output of our arithmetic encoder 360 is a compressed bitstream 302. A bit count is provided as feedback to the rate control module 340 to update 370 the total bit usage ratio, and adjust the QP as needed. It is noted that the Qp used for encoding each block is also inserted into the compressed bitstream to be used during subsequent decoding.
The blocks 731 are demultiplexed 740 into sets of N blocks 741. The N blocks in each set are encoded 750 arithmetically and in parallel according to a probability model 749 to produce an intermediate bitstream 751 for each set of blocks. The encoding of the quantized transform coefficients of one block is independent of the quantized transform coefficients of successive blocks. The intermediate bitstreams are multiplexed 760 to a compressed bitstream 761 for further processing on the ground 762.
It should be noted that the demultiplexing 740 can be performed during the sampling 710 so that the N streams of blocks 1110 are produced in parallel as indicated by dashed lines. In this embodiment, there are N data streams processed in parallel by the transform, quantization and encoding modules, also see
In a preferred embodiment of our invention, the 1D-DCT is used to transform the input signal from a spatial sample domain to a frequency domain. The 1D-DCT does not compress the raw SAR data, but decorrelates the SAR data to facilitate more efficient compression. Relative to the 2D-DCT the 1D-DCT has a lower complexity. Also, due to the nature of the raw SAR data, which resembles Gaussian noise, there is not a substantial gain provided by performing a 2D transformation, especially for small block sizes.
In our invention, the 1D-DCT is performed along rows of each block, which corresponds to range directions in the raw SAR data. Columns correspond to the azimuth angle. With a block size of 8×8, an 8×1 DCT is applied to each row, and the eight rows of the 8×1 DCT coefficients together form our 8×8 block of transform coefficients.
The QP is initialized according to the target bit-rate or compression ratio. The target compression ratio is determined from a given transmission bandwidth, e.g., a target bit rate, and the size of raw SAR data without compression, in number of bits. The target compression ratio is an input parameter to our arithmetic encoder 360.
As shown in
For applications that require finer control of the output bit-rate, the initial QP can also be adjusted by the variance to better-allocate and utilize the available bit rate, and thus achieve a better overall compression. This rate control procedure is described in further details below 340.
Adjusting the QP
The QP is adjusted for the purposes of maximizing compression quality and rate control. The adjustment is mainly based on two factors, the block data entropy, and the consumed or remaining number of bits. Higher entropy implies that more information is contained in the data block, thus a smaller QP should be applied for more conservative compression. Similarly, lower entropy implies that less information is contained in the data block, and a larger QP should be applied for more aggressive compression. Because the calculation of entropy is too complex for low-cost hardware devices, the block variance is a good approximation of the entropy, and not as computationally demanding to calculate as entropy.
Each threshold corresponds to a QP difference (ΔQp). This correspondence is represented by the table 500. By comparing the variance and searching the table, the QP difference ΔQp(var) is determined 610. For example, if the variance is smaller than the first threshold, then the QP difference ΔQp(var) is set to be the first ΔQp in the table. The initial QP is determined as described above according to the target compression ratio and is used as the initial QP for all blocks of the raw SAR data. By adding 620 the QP difference ΔQp(var) to the initial QP, the adjusted QP is obtained.
As described above, another factor that affects the QP is the bit usage ratio. This adjustment could also be made when rate control is required and enforced. In order to determine the QP difference influenced by the bit usage ratio, i.e., ΔQp(rate), the estimated total bit usage is first determined 630 from the number of blocks coded 605 and number of bits consumed 606 to encode the blocks. Then, the estimated total bit usage is 607 compared with target bit rate 608 to determine 640 the ΔQp(rate). The details on the method for calculating the total bit usage and ΔQp(rate) are described below. The ΔQp(rate) is then added 650 to the previously adapted QP, i.e., the adjusted QP 601 is equal to the initial QP+ΔQp(var)+ΔQp(rate).
In order to examine the bit usage condition, three variables, i.e., the total number of blocks, the number of blocks that have been encoded 605, and the number of bits that have been consumed 606, are first obtained for estimating the total number of bits that will be approximately required to encode the raw SAR data 301. This approximation is then compared with the target bit usage. If the approximated bit usage is greater and exceeds a tolerance percentage, then the QP is increased. Otherwise, if the approximated bit usage is less than the target bit usage and exceeds the tolerance percentage, then the QP is decreased.
After each block is encoded, the total number of encoded blocks 605 and the total number of consumed bits 606 are updated. Before quantizing the current block, the approximate total number of bits 630 is determined by (number of consumed bits)/(number of coded blocks)×(number of total blocks. Then the estimated total bit usage is compared to the target bit usage.
The ratio of (estimated total bits:target total bits) is determined. If the ratio is greater then one, then the bit consumption is exceeding the bit budget. Otherwise, it is within the budget. By subtracting one from this ratio, the percentage of estimated total bits that are exceeding or below the target is given. This percentage is then divided by a tolerance threshold in order to find out how many times the estimated bit rate exceeds or is under a specified tolerance.
For example, if the application can tolerate 5% bit rate variance, while the ratio of estimated bit usage to target bit usage is 9%, then the estimation is ( 9/5) times above the tolerance.
The transform coefficients are subject to the scalar quantization 350. The scalar quantization is a lossy compression, the larger the QP value, the coarser the compression quality.
In one embodiment, uniform scalar quantization is applied to all transform coefficients obtained form the 1D-DCT. In a second embodiment of this invention, non-uniform quantization of the transform coefficients is applied, where the QP value for the block is further modified by a quantization matrix that determines a non-uniform scaling for each transform coefficient.
Parallel Arithmetic Coding
The quantized transform coefficients are losslessly encoded by our modified arithmetic encoder. One major drawback of the conventional arithmetic encoding method is its sequential processing nature, which makes it unsuitable for low complexity devices and where a high throughput is required. In the conventional method, the encoding has to be performed symbol-by-symbol and block-by-block. The reason is that the encoding of one syntax element, e.g., a quantized transform coefficient, can depend on the following elements. In some cases, a number of successive elements are encoded jointly.
Without parallelization, block(n+1) is encoded after block(n), and the last element of block(n) can be dependent on elements of block(n+1). That is, the bits to represent the last element of block(n) can depend on the first or later element in block(n+1), or a probability of this element. Furthermore, those bits can only be written to the bit stream after the first or later element of block(n+1) is encoded.
Arithmetic encoding is a method for lossless data compression that uses variable-length entropy encoding. Frequently used bit strings are represented by fewer bits, and infrequently used bit strings use more bits. In contrast with other entropy encoding techniques, such as Huffman encoding that separate the input data into component strings and replace each string with a code word, arithmetic coding encodes the entire input data with a single code word, e.g., a fraction n in the range [0, 1]
Arithmetic encoding works as follows. First, we begin with a “current interval” [Low, High) initialized to [0, 1). Then, for each symbol (bit string), perform two steps:
Arithmetic encoding scales the cumulative probabilities given by the probability model into the interval [Low, High) for each symbol encoded. When Low and High are very close together, so close that this scaling operation maps some different symbols of the probability model onto the same integer in the [Low, High) interval, the encoding cannot continue until the next symbol (or symbols) are encoded.
In arithmetic encoding, a bit can be written only when the first bit in Low and High are identical. If Low is 0 . . . and High is 0 . . . , then write a zero bit, or if Low is 1 . . . and High is 1 . . . , then write a one bit. Thus, no bit can be written when Low is 01 and High is 10. This can happen when First-quarter≦Low<Half≦High<Third-quarter. In this case, the two bits for Low and High have opposite polarity, either 01 or 10. For example, if the next bit turns out to be zero, i.e., High descends below Half and [0, Half] is expanded to the full interval, the following bit is one, because the range of the interval has to be above the midpoint of the expanded interval. After the interval expansion, it is still possible to have First-quarter≦Low<Half≦High<Third-quarter. In this case, the arithmetic encoder continues to examine whether the next Low and High have identical bits that can be written.
Conversely, if the next output bit is one, then the arithmetic coder writes a zero bit afterwards. In this way, the interval can safely be expanded. That is, when a bit can be output, it is followed by a certain number of bits of opposite parity. Sometimes, after one or more interval expansions, the [Low, High) still falls in the condition First-quarter≦Low<Half≦High<Third-quarter. In this case, the number of times that the interval is expanded without writing any bits is recorded in a variable f. Then, when a bit is finally written, it is followed by a total number of f opposite parity bits. These bits are called follow bits.
In order to break the dependency that is intrinsic to conventional arithmetic encoding, and thus achieve parallelization, a compatible encoding scheme writes the bits corresponding to the quantized transform coefficients in a block after the last coefficient of each block is encoded, regardless of any elements in the next block.
In our invention, we describe an enhanced modified arithmetic coding that uses a “stop mark” for a set of blocks. This eliminates the dependency between blocks and allows a parallel implementation. The effect is that multiple symbols, which correspond to quantized transform coefficients in our invention, can be encoded concurrently. In order to achieve this, the coding dependencies among successive symbols are broken. A consequence of this enhancement is that there are additional redundant bits in the bitstream. Normally, the more independent the symbols are encoded, the more flexible parallelization can be achieved at the cost of higher bit rate. In the following, we describe a block-level parallel design, which provides a good tradeoff between encoding efficiency and parallelization.
Our invention achieves parallelization by invoking the following process. If the “Low” from the last element (quantized transform coefficient) is less than a quarter of the largest pre-defined possible code value, e.g., 65535, or 1 if normalized, then the arithmetic encoder writes a zero bit, followed by (f+1) one bits, followed by a zero bit. Otherwise, if the last element is greater than or equals to a quarter of the largest pre-defined possible code, then the arithmetic encoder writes a one bit, followed by (f+1) zero bits, then followed by a one bit. By writing this additional bit after the follow bits, the end of each block is independently encoded, and the symbols of the current block are unambiguously represented in binary form and without any ambiguity for the decoder regarding the symbol to be reconstructed.
The last bit is necessary if the decoder does not fully follow the f bits counting process as performed by the encoder. In the case that the decoder does follow the f bits counting process as performed by the encoder, which incurs additional complexity, then it is not required that the last bit be written to the output. With this approach, however, the encoding of the quantized transform coefficients of one block is still independent of the quantized transform coefficients of a successive block.
In conventional adaptive arithmetic encoding, the probability model is updated after each symbol is encoded. Then, the model is used to better encode the next symbol. However, in our parallel design, updating the model on a symbol-basis from multiple units is not manageable and could cause read-write chaos under a race condition, i.e., the order of reads and writes could be undetermined.
In one embodiment of our invention, which as shown in
In a second embodiment of the invention, each of the arithmetic encoding units encodes one block of quantized transform coefficients based on a specified probability model that is specific to that unit and independent from other units. Updates to the probability model for each unit are performed independently and based only on data that the particular unit encodes.
In both of the above embodiments, the probability model(s) could also be updated 820 periodically, over time, based on the statistics of previously encoded symbols.
To encode the quantized transform coefficients, which are in the range [−512/QP, +511/QP], one embodiment of our invention first adds an offset of (512/QP) so that all coefficients to be encoded are in the range [0, 1023/QP], and then apply arithmetic encoding as described above. This embodiment requires 1024/QP*N bits of memory for each probability model, where N is the number of bits to represent the probabilities for each quantized transform coefficient in the probability model.
We realize that the probability distribution of quantized transform coefficients is symmetric. Therefore, we can reduce the size of the memory by encoding the absolute value of the quantized transform coefficients without the offset, i.e., the absolute value of coefficients in the range [−512/QP, +511/QP]. If the value is not zero, then an unencoded sign bit is written to the intermediate bitstream, separately. That is, the sign bits are not arithmetic encoded. This change effectively reduces the required memory for each probability model by at least a factor of two from 1024/QP*N to 512/QP*N. The overall memory savings can be greater if there are separate probability models for each quantized transform coefficient, and the implementation might store several versions of the same table to satisfy timing requirements for read/write operations.
Field programmable gate arrays (FPGA) are typical for onboard SAR processing. However, as compared to semi-custom ASIC and other custom silicon devices, FPGA performance is typically far more limited. In particular, radiation-tolerant and military application devices typically have lower performance than state of art commercial devices.
As shown in
As shown in
As shown in
It is emphasized that the modified arithmetic encoding method according to the embodiments our invention enables the designs described above to attain high throughput through parallelization.
Comparison to Prior Art
In contrast to the prior art systems, our system has significant differences and advantages.
Compared to the conventional BAQ approach, our invention is more comprehensive. In contrast with BAQ, which processes block adaptive quantization to raw data samples, our invention also involves a discrete cosine transform, entropy coding and rate control. The quantization in our invention is performed in the frequency domain. Furthermore, the scalar quantization in our invention is different than the quantization in BAQ, which is computational simpler and very efficient combined with entropy coding. With this comprehensive design, higher compression ratios are achievable without severe degradation of compression quality.
Relative to the FFT-ECBAQ method, our invention is different in several ways. First, a shorter length 1D-DCT is used to transform samples into the frequency domain, which makes our encoding more practical and feasible for limited complexity platforms. Compared with long size 2D-FFT in FFT-ECBAQ, our invention significantly reduces the hardware complexity. Thus, our invention can be implemented in one FPGA, without requiring the accessibility to other external chips. The reason why shorter transform size can be used in our invention, without severe loss of compression quality, is because that we use different block adaptive quantization scheme.
The quantization used by our invention is scalar quantization, which applies a uniform division of all DCT coefficients in the block. Thus, we do not need the block size to be large for bit allocation within one block, as performed in FFT-ECBAQ.
In fact, the bit allocation in our invention is among smaller sized blocks, according to the block variance, as an approximation of block entropy. This bit allocation “moves” more bits to blocks containing more information, i.e., with greater variance, in order to achieve higher overall quality.
We adapt the QP for a block with a rate control procedure. The type of entropy coder in FFT-ECBAQ is not specified; whereas in our invention, we used arithmetic encoding for more efficient compression. Moreover, the arithmetic encoder and decoder used by our invention are modified to enable a parallel design.
Comparing to other prior art method, Such as BTC, our invention is different and more advanced, by introducing a DCT, entropy coding and more efficient quantization, with block-based bit allocation and rate control. Our invention yields a much higher performance.
It is to be understood that various other adaptations and modifications can be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4801939 *||Sep 4, 1987||Jan 31, 1989||Unisys Corporation||High-speed data compressor/decompressor for synthetic aperture radar|
|US5661477||Aug 3, 1995||Aug 26, 1997||Deutsche Forschungsanstalt Fur Luft- Und Raumfaht E.V.||Methods for compressing and decompressing raw digital SAR data and devices for executing them|
|US5666121 *||Sep 19, 1995||Sep 9, 1997||California Institute Of Technology||VLSI processor design of real-time data compression for high resolution imaging radar|
|US6658159 *||Mar 17, 2000||Dec 2, 2003||Hewlett-Packard Development Company, L.P.||Block entropy coding in embedded block coding with optimized truncation image compression|
|US6674910 *||Nov 24, 1999||Jan 6, 2004||Hyundai Electronics Industries Co., Ltd.||Apparatus and method for image-compression encoding and decoding using adaptive transform|
|US7099387 *||Aug 30, 2002||Aug 29, 2006||Realnetorks, Inc.||Context-adaptive VLC video transform coefficients encoding/decoding methods and apparatuses|
|1||"Frequency domain in raw SAR data compression for multi-mode SAR Instruments," National Aerospace Laboratory (NLR), EUSAR 2006, 6th European Conference on Synthetic Aperture, May 16-18, 2006, Dresden.|
|2||*||Benz et al. "A Comparison of Several Algorithms for SAR Raw Data Compression." IEEE Transactions on Geoscience and Remote Sensing. vol. 33, Issue 5. Sep. 1995. pp. 1266-1276.|
|3||Edward J. Delp et al., "Image Compression Using Block Truncation Coding (BTC)", IEEE Transactions Communications, vol. Com-27, No. 9, Sep. 1979.|
|4||Enrico Magli et al., "Wavelet-based compression of SAR raw data," Geoscience and Remote Sensing Symposium, 2002, IEEE International, pp. 1129-1131.|
|5||Ronald Kwok "Block Adaptive Quantization of Magellan SAR Data," IEEE Trans on Geoscience and Remote Sensing, vol. 27, No. 4, pp. 375-383, Jul. 1989.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7999724 *||Dec 15, 2008||Aug 16, 2011||The Boeing Company||Estimation and correction of error in synthetic aperture radar|
|US8670506 *||Feb 10, 2012||Mar 11, 2014||Innovationszentrum Fuer Telekommunikationstechnik Gmbh Izt||Apparatus and method for providing a reduced representation based on a time-domain RF signal|
|US9020040 *||Oct 17, 2007||Apr 28, 2015||Panasonic Intellectual Property Corporation Of America||Variable length coding method and variable length decoding method|
|US9020041 *||Oct 17, 2007||Apr 28, 2015||Panasonic Intellectual Property Corporation Of America||Variable length coding method and variable length decoding method|
|US9025671 *||Oct 17, 2007||May 5, 2015||Panasonic Intellectual Property Corporation Of America||Variable length coding method and variable length decoding method|
|US9031133 *||Oct 17, 2007||May 12, 2015||Panasonic Intellectual Property Corporation Of America||Variable length coding method and variable length decoding method|
|US9054734 *||Oct 17, 2007||Jun 9, 2015||Panasonic Intellectual Property Corporation Of America||Variable length coding method and variable length decoding method|
|US20080056374 *||Oct 17, 2007||Mar 6, 2008||Satoshi Kondo||Variable length coding method and variable length decoding method|
|US20080063083 *||Oct 17, 2007||Mar 13, 2008||Satoshi Kondo||Variable length coding method and variable length decoding method|
|US20080260037 *||Oct 17, 2007||Oct 23, 2008||Satoshi Kondo||Variable length coding method and variable length decoding method|
|US20080260038 *||Oct 17, 2007||Oct 23, 2008||Satoshi Kondo||Variable length coding method and variable length decoding method|
|US20080260039 *||Oct 17, 2007||Oct 23, 2008||Satoshi Kondo||Variable length coding method and variable length decoding method|
|US20100149023 *||Dec 15, 2008||Jun 17, 2010||The Boeing Company||Estimation and Correction of Error in Synthetic Aperture Radar|
|US20120201325 *||Aug 9, 2012||Rainer Perthold||Apparatus and method for providing a reduced representation based on a time-domain rf signal|
|U.S. Classification||342/25.00F, 342/179, 342/197, 342/25.00R|
|Cooperative Classification||H03M7/4006, H03M7/30, G01S7/003, G01S13/90|
|European Classification||G01S13/90, H03M7/30, G01S7/00R, H03M7/40A|
|Jun 23, 2008||AS||Assignment|
Owner name: MITSUBISHI ELECTRIC RESEARCH LABORATORIES, INC., M
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VETRO, ANTHONY;LIU, SHAN;LOU, JIAN;AND OTHERS;REEL/FRAME:021141/0960;SIGNING DATES FROM 20080612 TO 20080613
Owner name: MITSUBISHI ELECTRIC RESEARCH LABORATORIES, INC., M
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VETRO, ANTHONY;LIU, SHAN;LOU, JIAN;AND OTHERS;SIGNING DATES FROM 20080612 TO 20080613;REEL/FRAME:021141/0960
|Mar 25, 2014||FPAY||Fee payment|
Year of fee payment: 4