# US 2019/0173490 A1 · Apparatus and method for data compression and decompression based on calculation of error vector magnitude > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0173490 A1 - Document ID: US20190173490A1 - Status: Published application - Kind: A1 - Application number: 16/158,375 - Filed: 2018-10-12 - Published: 2019-06-06 - Earliest claimed: 2017-12-05 - Assignees: Electronics and Telecommunications Research Institute - Applicants: Electronics and Telecommunications Research Institute - Inventors: Je-Won LEE; Eun-Hee HYUN; Heung-Mook KIM; Joon-Young JUNG - Web page: https://patentgrep.com/patent/US20190173490A1 ## CPC - H03M 7/6047: {Power optimization with respect to the encoder, decoder, storage or transmission} - H03M 7/30: Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction - H03M 7/3062: {Compressive sampling or sensing} - H03M 7/3066: {by means of a mask or a bit-map} - H03M 7/40: Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code - H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C) ## Abstract Disclosed herein are an apparatus and method for data compression and decompression based on calculation of an error vector magnitude. A data compression apparatus includes a lossy compression unit for calculating, in advance, a reference error vector magnitude depending on lossy compression and decompression by removing lower bits from a data signal composed of bitstreams, for setting removal target lower bits satisfying a preset error vector magnitude requirement, and for lossily compressing the data signal by removing the removal target lower bits from the data signal, and a communication unit for transmitting the compressed data signal to a data decompression apparatus. ## Claims ### Claim 1 A data compression apparatus, comprising: a lossy compression unit for calculating, in advance, a reference error vector magnitude depending on lossy compression and decompression by removing lower bits from a data signal composed of bitstreams, for setting removal target lower bits satisfying a preset error vector magnitude requirement, and for lossily compressing the data signal by removing the removal target lower bits from the data signal; and a communication unit for transmitting the compressed data signal to a data decompression apparatus. ### Claim 2 (depends on 1) The data compression apparatus of claim 1, wherein the reference error vector magnitude is an error vector magnitude calculated based on recovery target lower bits corresponding to the removal target lower bits that minimize the error vector magnitude using one or more of distribution characteristics of the data signal and distribution characteristics of the removal target lower bits. ### Claim 3 (depends on 2) The data compression apparatus of claim 2, wherein the recovery target lower bits are set by assuming that the removal target lower bits are uniformly distributed. ### Claim 4 (depends on 3) The data compression apparatus of claim 3, wherein the recovery target lower bits are set such that a Most Significant Bit (MSB) is populated with 1 and remaining bits are populated with 0. ### Claim 5 (depends on 1) The data compression apparatus of claim 1, further comprising a lossless compression unit for setting target upper bits for lossless compression, among bits of the data signal, and losslessly compressing the target upper bits for lossless compression, wherein the communication unit transmits the data signal compressed through the lossy compression unit and the lossless compression unit to the data decompression apparatus. ### Claim 6 (depends on 5) The data compression apparatus of claim 5, wherein the lossless compression unit losslessly compresses the target upper bits for lossless compression based on Huffman coding that causes a shorter bitstream to match a bitstream in which an identical bit from an MSB is more frequently repeated. ### Claim 7 (depends on 6) The data compression apparatus of claim 6, wherein the lossless compression unit sets a number of bits corresponding to the target upper bits for lossless compression in consideration of power of the data signal. ### Claim 8 A data decompression apparatus, comprising: a communication unit data for receiving a compressed data signal from a data compression apparatus; and a lossy decompression unit for setting recovery target lower bits corresponding to removal target lower bits that minimize an error vector magnitude using one or more of distribution characteristics of a data signal corresponding to the compressed data signal and distribution characteristics of removal target lower bits corresponding to the compressed data signal, and lossily decompressing the compressed data signal using the set recovery target lower bits. ### Claim 9 (depends on 8) The data decompression apparatus of claim 8, wherein the recovery target lower bits are set by assuming that the removal target lower bits are uniformly distributed. ### Claim 10 (depends on 9) The data decompression apparatus of claim 9, wherein the recovery target lower bits are set such that a Most Significant Bit (MSB) is populated with 1 and remaining bits are populated with 0. ### Claim 11 (depends on 8) The data decompression apparatus of claim 8, further comprising a lossless decompression unit for losslessly decompressing target upper bits for lossless compression, which have been losslessly compressed, using a number of bits corresponding to the target upper bits for lossless compression, among upper bits of the compressed data signal. ### Claim 12 (depends on 11) The data decompression apparatus of claim 11, wherein the lossless decompression unit performs lossless decompression based on Huffman coding that causes a shorter bitstream to match a bitstream in which an identical bit from an MSB is more frequently repeated. ### Claim 13 (depends on 12) The data decompression apparatus of claim 12, wherein the number of bits corresponding to the target upper bits for lossless compression is set based on power of the data signal. ### Claim 14 A data compression method, comprising: calculating, in advance, a reference error vector magnitude depending on lossy compression and decompression by removing lower bits from a data signal composed of bitstreams; setting removal target lower bits satisfying a preset error vector magnitude requirement; lossily compressing the data signal by removing the removal target lower bits from the data signal; and transmitting the compressed data signal to a data decompression apparatus. ### Claim 15 (depends on 14) The data compression method of claim 14, wherein the reference error vector magnitude is an error vector magnitude calculated based on recovery target lower bits corresponding to the removal target lower bits that minimize the error vector magnitude using one or more of distribution characteristics of the data signal and distribution characteristics of the removal target lower bits. ### Claim 16 (depends on 15) The data compression method of claim 15, wherein the recovery target lower bits are set by assuming that the removal target lower bits are uniformly distributed. ### Claim 17 (depends on 16) The data compression method of claim 16, wherein the recovery target lower bits are set such that a Most Significant Bit (MSB) is populated with 1 and remaining bits are populated with 0. ### Claim 18 (depends on 14) The data compression method of claim 14, further comprising: setting target upper bits for lossless compression, among bits of the data signal; and losslessly compressing the target upper bits for lossless compression, wherein transmitting the compressed data signal to the data decompression apparatus is configured to transmit the data signal compressed through lossy compression and lossless compression to the data decompression apparatus. ### Claim 19 (depends on 18) The data compression method of claim 18, wherein losslessly compressing is configured to losslessly compress the target upper bits for lossless compression based on Huffman coding that causes a shorter bitstream to match a bitstream in which an identical bit from an MSB is more frequently repeated. ### Claim 20 (depends on 19) The data compression method of claim 19, wherein setting the target upper bits for lossless compression is configured to set a number of bits corresponding to the target upper bits for lossless compression in consideration of power of the data signal.