A-law compression and decompression method based on multi-carrier communication system
By using A-law compression and decompression methods, the data bit width of the multi-carrier communication system is optimized to 8 bits, which solves the problems of insufficient resources and high algorithm complexity caused by the increase in the number of carriers, and achieves improved resource utilization and enhanced noise resistance.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- NANJING 6902 TECH
- Filing Date
- 2026-01-28
- Publication Date
- 2026-04-28
AI Technical Summary
In multi-carrier communication systems, the increased number of carriers leads to a decrease in signal bit width, which affects resource utilization. Resources are insufficient to support system design, and existing compression and decompression algorithms are highly complex, have insufficient transmission bandwidth, low resource utilization, and are difficult to effectively combat path loss and interference.
The A-law compression and decompression method is used to compress the uplink data stream, compressing 16/13-bit data into 8-bit data, and decompress the downlink data stream, restoring 8-bit data back to 16/13-bit data. Data concatenation and padding are performed by judging the highest absolute value bit and the sign bit, thus optimizing the data transmission method.
It reduces the computational resource utilization of multi-carrier communication systems, improves resource utilization and signal-to-noise ratio, optimizes dynamic range, reduces hardware power consumption, enhances noise immunity, and improves bandwidth efficiency.
Smart Images
Figure CN121940461A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of communication technology, and in particular to an A-law compression and decompression method based on a multi-carrier communication system. Background Technology
[0002] In multi-carrier communication systems, the increased number of carriers directly leads to an increase in the number of uplinks and downlinks. During digital signal processing, the signal bit width directly impacts resource utilization. Increased resource utilization means that the original chip resources are insufficient to support the multi-carrier system design, resulting in increased costs. Simultaneously, changing the transmission method of IQ data can reduce resource utilization, making the optimization of transmission data types and compression / decompression techniques particularly important. Furthermore, reducing the complexity of compression and decompression techniques is crucial for improving development efficiency, shortening project cycles, and improving the signal-to-noise ratio of weak signals to combat path loss and interference. Summary of the Invention
[0003] Purpose of the invention: The purpose of this invention is to provide an A-law compression and decompression method for multi-carrier communication systems, which addresses the problems of excessively high complexity of IQ data compression and decompression algorithms, insufficient transmission bandwidth, and increased resource occupancy in multi-channel digital signal processing due to the increased number of carriers.
[0004] Technical solution: The A-law compression and decompression method based on a multi-carrier communication system described in this invention includes the following steps:
[0005] (1) Compress the uplink data stream and proceed to step (2); decompress the downlink data stream and proceed to step (7).
[0006] (2) Perform the absolute value operation on the original data;
[0007] (3) Determine the compression method. If it is Intel type compression, proceed to step (4); if it is standard type compression, proceed to step (5).
[0008] (4) Compress the 16-bit data into 8-bit data, determine the highest bit where the absolute value is high, and correspond this bit to the compressed data [6:4], and proceed to step (6).
[0009] (5) Compress the 13-bit data into 8-bit data, determine the highest bit where the absolute value is high, and determine the compressed data [6:4] based on this bit, and proceed to step (6).
[0010] (6) Concatenate the sign bit of the uncompressed data, the [6:4] of the compressed data, and the last four bits of the highest bit where the absolute value is high;
[0011] (7) Determine whether the decompression method is Intel or standard. If it is Intel, proceed to step (8); if it is standard, proceed to step (9).
[0012] (8) Decompress the 8-bit data into 16-bit data. According to the value of [6:4] of the undecompressed data, the highest bit of the decompressed data high level is filled with [3:0] and 0 of the undecompressed data in sequence. Then fill the remaining unoperated bits with 0 and jump to step (10).
[0013] (9) Decompress the 8-bit data into 13-bit data. According to the value of [6:4] of the undecompressed data, which corresponds to the highest bit of the high level of the decompressed data, fill the [3:0] and 1 of the undecompressed data after it in turn. Then fill the remaining unoperated bits with 0 and jump to step (10).
[0014] (10) Perform data recovery operation on the decompressed data.
[0015] Further, in step (2), the absolute value operation of the original data is as follows: determine the highest bit of the original data, a high level indicates a negative number, and the absolute value operation is performed; a low level indicates a positive number, and the data is kept.
[0016] Further, in step (4), the Intel-type compression first determines the highest bit of the absolute value that is high. When the highest bit of the high level appears in the 14th bit, the [6:4] data corresponding to the compressed data is 7; when the highest bit of the high level appears in the 13th bit, the [6:4] data corresponding to the compressed data is 6; when the highest bit of the high level appears in the 12th bit, the [6:4] data corresponding to the compressed data is 5; when the highest bit of the high level appears in the 11th bit, the [6:4] data corresponding to the compressed data is 4; when the highest bit of the high level appears in the 10th bit, the [6:4] data corresponding to the compressed data is 3; when the highest bit of the high level appears in the 9th bit, the [6:4] data corresponding to the compressed data is 2; when the highest bit of the high level appears in the 8th bit, the [6:4] data corresponding to the compressed data is 1; when the high level does not appear in the [14:8] of the absolute value, the [6:4] data corresponding to the compressed data is 0.
[0017] Further, in step (5), the standard compression first determines the highest bit of the absolute value that is high. When the highest bit of the high level appears in the 11th bit, the data corresponding to [6:4] of the compressed data is 7; when the highest bit of the high level appears in the 10th bit, the data corresponding to [6:4] of the compressed data is 6; when the highest bit of the high level appears in the 9th bit, the data corresponding to [6:4] of the compressed data is 5; when the highest bit of the high level appears in the 8th bit, the data corresponding to [6:4] of the compressed data is 4; when the highest bit of the high level appears in the 7th bit, the data corresponding to [6:4] of the compressed data is 3; when the highest bit of the high level appears in the 6th bit, the data corresponding to [6:4] of the compressed data is 2; when the highest bit of the high level appears in the 5th bit, the data corresponding to [6:4] of the compressed data is 1; when the high level does not appear in the [11:5] of the absolute value, the data corresponding to [6:4] of the compressed data is 0.
[0018] Furthermore, in step (6), the highest bit of the compressed data is determined by the sign bit of the uncompressed original data.
[0019] Furthermore, the [6:4] of the compressed data is determined by the highest bit where the absolute value is high.
[0020] Furthermore, the [3:0] of the compressed data is determined by the last four bits of the highest bit where the absolute value is high; the sign bit of the uncompressed data, the [6:4] of the compressed data, and the [3:0] of the compressed data are concatenated to obtain the compressed 8-bit data.
[0021] Further, in step (8), the Intel-type decompression, when the uncompressed data [6:4] is decimal 7, the highest bit of the high level of the decompressed data appears in the 14th bit, and the decompressed data [13:10] is the [3:0] of the uncompressed data, while filling the remaining [9:0] with 0; when the uncompressed data [6:4] is decimal 6, the highest bit of the high level of the decompressed data appears in the 13th bit, and the decompressed data [12:9] is the [3:0] of the uncompressed data. [3:0], and fill the remaining [8:0] with 0; when the uncompressed data [6:4] is decimal 5, the highest bit of the high level of the decompressed data appears in the 12th bit, and the decompressed data [11:8] is the [3:0] of the uncompressed data, and fill the remaining [7:0] with 0; when the uncompressed data [6:4] is decimal 4, the highest bit of the high level of the decompressed data appears in the 11th bit, and the decompressed data [10:7] is the [3:0] of the uncompressed data. [6:0], and fill the remaining [6:0] with 0; when the uncompressed data [6:4] is decimal 3, the highest bit of the high level of the decompressed data appears in the 10th bit, and the decompressed data [9:6] is the [3:0] of the uncompressed data, and fill the remaining [5:0] with 0; when the uncompressed data [6:4] is decimal 2, the highest bit of the high level of the decompressed data appears in the 9th bit, and the decompressed data [8:5] is the [3:0] of the uncompressed data, and fill the remaining [5:0] with 0; All [4:0] are filled with 0; when the uncompressed data [6:4] is decimal 1, the highest bit of the high level of the decompressed data appears in the 8th bit, and the decompressed data [7:4] is the [3:0] of the uncompressed data, and the remaining [3:0] are filled with 0; when the uncompressed data [6:4] is decimal 0, the [14:8] of the decompressed data are all 0, and the decompressed data [7:4] is the [3:0] of the uncompressed data, and the remaining [3:0] are filled with 0.
[0022] Further, in step (9), in the standard decompression, when the uncompressed data [6:4] is decimal 7, the highest bit of the high level of the decompressed data appears in the 11th bit, and the decompressed data [10:7] is the [3:0] of the uncompressed data, while the remaining [6:0] are all filled with 1; when the uncompressed data [6:4] is decimal 6, the highest bit of the high level of the decompressed data appears in the 10th bit, and the decompressed data [9:6] is the [3:0] of the uncompressed data. [3:0], and fill the remaining [5:0] with 1; when the uncompressed data [6:4] is decimal 5, the highest bit of the high level of the decompressed data appears in the 9th bit, and the decompressed data [8:5] is the [3:0] of the uncompressed data, and fill the remaining [4:0] with 1; when the uncompressed data [6:4] is decimal 4, the highest bit of the high level of the decompressed data appears in the 8th bit, and the decompressed data [7:4] is the [3:0] of the uncompressed data. [0], and fill the remaining [3:0] with 1; when the uncompressed data [6:4] is decimal 3, the highest bit of the high level of the decompressed data appears in the 7th bit, and the decompressed data [6:3] is the [3:0] of the uncompressed data, and fill the remaining [2:0] with 1; when the uncompressed data [6:4] is decimal 2, the highest bit of the high level of the decompressed data appears in the 6th bit, and the decompressed data [5:2] is the [3:0] of the uncompressed data, Meanwhile, fill all the remaining [1:0] with 1; when the uncompressed data [6:4] is decimal 1, the highest bit of the high level of the decompressed data appears in the 5th bit, and the decompressed data [4:1] is the uncompressed data [3:0], and fill the remaining [0] with 1; when the uncompressed data [6:4] is decimal 0, the decompressed data [11:5] are all 0, and the decompressed data [7:4] is the uncompressed data [3:0], and fill the remaining [0] with 1.
[0023] Further, in step (10), the data recovery operation is performed on the decompressed data. The highest bit of the data before compression is determined. A high level indicates a negative number, and the absolute value of the data is calculated. A low level indicates a positive number, and the data is retained.
[0024] Beneficial Effects: Compared with existing technologies, this invention has the following significant advantages: 1. In multi-carrier communication systems, compression and decompression methods shorten the IQ data bit width, reduce algorithm complexity, decrease computational resource occupancy, improve resource utilization, and reduce hardware power consumption; 2. In multi-carrier communication systems, compression and decompression methods optimize the dynamic range, perform high-precision quantization on weak signals to avoid them being submerged by noise, and perform low-precision quantization on strong signals; 3. In multi-carrier communication systems, compression and decompression methods improve bandwidth efficiency. Through non-uniform quantization, the original 16-bit or 13-bit IQ data is compressed to 8 bits, reducing transmission bandwidth requirements; 4. In multi-carrier communication systems, compression and decompression methods enhance noise immunity, improve the signal-to-noise ratio of weak signals, and help combat path loss and interference. Attached Figure Description
[0025] Figure 1 The flowchart shows the A-law compression and decompression method of the multi-carrier communication system of the present invention. Detailed Implementation
[0026] The technical solution of the present invention will be further described below with reference to the accompanying drawings.
[0027] like Figure 1 As shown, the A-law compression and decompression method based on a multi-carrier communication system according to the present invention includes the following steps:
[0028] Step 1: Compress the uplink data stream, proceed to Step 2; decompress the downlink data stream, proceed to Step 7. Since the communication system consists of uplink and downlink, uplink data compression is required to increase transmission bandwidth and rate, i.e., compressing large-bit-width data into smaller-bit-width data; downlink data decompression is required to restore the compressed data, i.e., decompressing small-bit-width data into large-bit-width data. For uplink compression, proceed to Step 2; for downlink decompression, proceed to Step 7.
[0029] Step 2: Perform an absolute value operation on the original data. Determine the highest bit of the original data, i.e., the sign bit. If the sign bit is high, it indicates a negative number, and the absolute value operation is performed, specifically by taking the inverse code of the data and adding one; if the sign bit is low, it indicates a positive number, and the data is stored.
[0030] Step 3: Determine whether the compression method is Intel or Standard. If it is Intel, proceed to Step 4; if it is Standard, proceed to Step 5. Since compression methods are divided into Intel and Standard, Intel compression means compressing 16-bit data into 8-bit data. If it is Intel, proceed to Step 4; Standard compression means compressing 13-bit data into 8-bit data. If it is Standard, proceed to Step 5.
[0031] Step 4: Intel-type compression compresses 16-bit data into 8-bit data, determines the highest bit with a high absolute value, and corresponds this bit to the compressed data [6:4], then proceeds to Step 6. For Intel-type compression, 16-bit data is compressed into 8-bit data. First, the most significant bit of the absolute value that is high is determined. If the most significant bit of the high level appears in bit 14, the compressed data [6:4] corresponds to 7; if it appears in bit 13, the compressed data [6:4] corresponds to 6; if it appears in bit 12, the compressed data [6:4] corresponds to 5; if it appears in bit 11, the compressed data [6:4] corresponds to 4; if it appears in bit 10, the compressed data [6:4] corresponds to 3; if it appears in bit 9, the compressed data [6:4] corresponds to 2; if it appears in bit 8, the compressed data [6:4] corresponds to 1; if the high level does not appear in the uncompressed data [14:8], the compressed data [6:4] corresponds to 0, and proceed to step six.
[0032] Step 5: Standard compression compresses 13-bit data into 8-bit data, determines the highest bit with a high absolute value, and uses this bit to determine the compressed data [6:4], then proceeds to Step 6. For standard compression, 12-bit data is compressed into 8-bit data. First, the highest-order bit of the absolute value that is high is determined. If the highest-order bit of the high-order value appears in the 11th bit, the [6:4] data corresponding to the compressed data is 7; if it appears in the 10th bit, the [6:4] data corresponding to the compressed data is 6; if it appears in the 9th bit, the [6:4] data corresponding to the compressed data is 5; if it appears in the 8th bit, the [6:4] data corresponding to the compressed data is 4; if it appears in the 7th bit, the [6:4] data corresponding to the compressed data is 3; if it appears in the 6th bit, the [6:4] data corresponding to the compressed data is 2; if it appears in the 5th bit, the [6:4] data corresponding to the compressed data is 1; if the high-order bit does not appear in the [11:5] of the uncompressed data, the [6:4] data corresponding to the compressed data is 0, and proceed to step six.
[0033] Step Six: Concatenate the sign bit of the uncompressed data, the [6:4] of the compressed data, and the last four bits of the highest bit where the absolute value is high. The highest bit of the compressed data, i.e., the sign bit, is determined by the sign bit of the uncompressed original data. The [6:4] of the compressed data is determined by the compressed data [6:4] corresponding to the highest bit where the absolute value is high, as described in Steps Four and Five above. The [3:0] of the compressed data is determined by the last four bits of the highest bit where the absolute value is high. Concatenating the sign bit of the uncompressed data, the [6:4] of the compressed data, and the last four bits of the highest bit where the absolute value is high yields the compressed 8-bit data.
[0034] For Intel-type compression: In step four, if the highest high bit of the absolute value appears in bit 14, then the uncompressed original data sign bit, 3'h7, and the uncompressed original data [13:10] are concatenated to obtain the compressed 8-bit data; if the highest high bit of the absolute value appears in bit 13, then the uncompressed original data sign bit, 3'h6, and the uncompressed original data [12:9] are concatenated to obtain the compressed 8-bit data; if the highest high bit of the absolute value appears in bit 12, then the uncompressed original data sign bit, 3'h5, and the uncompressed original data [11:8] are concatenated to obtain the compressed 8-bit data; if the highest high bit of the absolute value appears in bit 11, then the uncompressed original data sign bit, 3'h4, and the uncompressed original data [10:7] are concatenated to obtain the compressed 8-bit data. The compressed 8-bit data; when the highest bit of the absolute value's high level appears in the 10th bit, the uncompressed original data sign bit, 3'h3, and the uncompressed original data [9:6] are concatenated to obtain the compressed 8-bit data; when the highest bit of the absolute value's high level appears in the 9th bit, the uncompressed original data sign bit, 3'h2, and the uncompressed original data [8:5] are concatenated to obtain the compressed 8-bit data; when the highest bit of the absolute value's high level appears in the 8th bit, the uncompressed original data sign bit, 3'h1, and the uncompressed original data [7:4] are concatenated to obtain the compressed 8-bit data; when the high level does not appear in the uncompressed data [14:8], the uncompressed original data sign bit, 3'h0, and the uncompressed original data [7:4] are concatenated to obtain the compressed 8-bit data.
[0035] For standard compression: If the highest high bit of the absolute value appears in bit 11 in step five, then the uncompressed original data sign bit, 3'h7, and the uncompressed original data [10:7] are concatenated to obtain the compressed 8-bit data; if the highest high bit of the absolute value appears in bit 10, then the uncompressed original data sign bit, 3'h6, and the uncompressed original data [9:6] are concatenated to obtain the compressed 8-bit data; if the highest high bit of the absolute value appears in bit 9, then the uncompressed original data sign bit, 3'h5, and the uncompressed original data [8:5] are concatenated to obtain the compressed 8-bit data; if the highest high bit of the absolute value appears in bit 8, then the uncompressed original data sign bit, 3'h4, and the uncompressed original data [7:4] are concatenated to obtain the compressed... 8-bit data; when the highest high bit of the absolute value appears in the 7th bit, the uncompressed original data sign bit, 3'h3, and the uncompressed original data [6:3] are concatenated to obtain the compressed 8-bit data; when the highest high bit of the absolute value appears in the 6th bit, the uncompressed original data sign bit, 3'h2, and the uncompressed original data [5:2] are concatenated to obtain the compressed 8-bit data; when the highest high bit of the absolute value appears in the 5th bit, the uncompressed original data sign bit, 3'h1, and the uncompressed original data [4:1] are concatenated to obtain the compressed 8-bit data; when the high level does not appear in the uncompressed data [11:5], the uncompressed original data sign bit, 3'h0, and the uncompressed original data [4:1] are concatenated to obtain the compressed 8-bit data.
[0036] Step 7: Determine whether the decompression method is Intel or Standard. If it is Intel, proceed to Step 8; if it is Standard, proceed to Step 9. Since decompression methods are divided into Intel and Standard, Intel decompression means decompressing 8-bit data into 16-bit data, while Standard decompression means decompressing 8-bit data into 13-bit data.
[0037] Step 8: Intel Decompression. Decompress 8-bit data into 16-bit data. Based on the [6:4] value of the uncompressed data, the highest bit of the high-level data in the decompressed data is located. Then, fill the remaining bits with [3:0] and 0 from the uncompressed data. Add 0 to the remaining uncompressed bits and jump to Step 10. For Intel decompression, 8-bit data is decompressed into 16-bit data. When the uncompressed data [6:4] is decimal 7, the highest bit of the high-level data in the decompressed data appears at bit 14, and the decompressed data [13:10] is the [3:0] of the uncompressed data. Simultaneously, fill the remaining [9:0] bits with 0. When the uncompressed data [6:4] is decimal 6, the highest bit of the high-level data in the decompressed data appears at bit 13, and the decompressed data [12:9] is the [3:0] of the uncompressed data. The compressed data [3:0] is filled with 0, and the remaining [8:0] is filled with 0; when the uncompressed data [6:4] is decimal 5, the highest bit of the high level of the decompressed data appears in the 12th bit, and the decompressed data [11:8] is the uncompressed data [3:0], and the remaining [7:0] is filled with 0; when the uncompressed data [6:4] is decimal 4, the highest bit of the high level of the decompressed data appears in the 11th bit, and the decompressed data [10:7] is the uncompressed data [3:0], and fill the remaining [6:0] with 0; when the uncompressed data [6:4] is decimal 3, the highest bit of the high level of the decompressed data appears in the 10th bit, and the decompressed data [9:6] is the uncompressed data [3:0], and fill the remaining [5:0] with 0; when the uncompressed data [6:4] is decimal 2, the highest bit of the high level of the decompressed data appears in the 9th bit, and the decompressed data [8:5] is the uncompressed data [3:0], and fill the remaining [5:0] with 0; when the uncompressed data [6:4] is decimal 2, the highest bit of the high level of the decompressed data appears in the 9th bit, and the decompressed data [8:5] is the uncompressed data [3:0], and fill the remaining [5:0] with 0. Fill the remaining [4:0] with 0; when the uncompressed data [6:4] is decimal 1, the highest bit of the high level of the decompressed data appears in the 8th bit, and the decompressed data [7:4] is the [3:0] of the uncompressed data, and fill the remaining [3:0] with 0; when the uncompressed data [6:4] is decimal 0, the [14:8] of the decompressed data are all 0, and the decompressed data [7:4] is the [3:0] of the uncompressed data, and fill the remaining [3:0] with 0.
[0038] Step Nine: Standard decompression decompresses 8-bit data into 13-bit data. Based on the [6:4] value of the uncompressed data, the highest bit of the high-level signal in the decompressed data is corresponding to the [3:0] and 1 bits of the uncompressed data. The remaining unprocessed bits are then padded with 0, and the process jumps to Step Ten. For standard decompression, 8-bit data is decompressed into 12-bit data. When the uncompressed data [6:4] is decimal 7, the highest bit of the high-level signal in the decompressed data appears at bit 11, and the decompressed data [10:7] is the [3:0] of the uncompressed data. Simultaneously, the remaining [6:0] bits are all padded with 1. When the uncompressed data [6:4] is decimal 6, the highest bit of the high-level signal in the decompressed data appears at bit 10, and the remaining [6:0] bits are padded with 1. Decompress the data in the [3:0] range and fill the remaining [5:0] ranges with 1s. When the uncompressed data [6:4] is decimal 5, the highest bit of the high level of the decompressed data appears in the 9th bit, and the decompressed data [8:5] is the same as the uncompressed data in the [3:0] range. Fill the remaining [4:0] ranges with 1s. When the uncompressed data [6:4] is decimal 4, the highest bit of the high level of the decompressed data appears in the 8th bit, and the decompressed data [7:4] is the same as the uncompressed data in the [7:4] range. The [3:0] is filled with 1, and the remaining [3:0] is filled with 1; when the uncompressed data [6:4] is decimal 3, the highest bit of the high level of the decompressed data appears in the 7th bit, and the decompressed data [6:3] is the [3:0] of the uncompressed data, and the remaining [2:0] is filled with 1; when the uncompressed data [6:4] is decimal 2, the highest bit of the high level of the decompressed data appears in the 6th bit, and the decompressed data [5:2] is the [3:0] of the uncompressed data. ], and fill all the remaining [1:0] with 1; when the uncompressed data [6:4] is decimal 1, the highest bit of the high level of the decompressed data appears in the 5th bit, and the decompressed data [4:1] is the [3:0] of the uncompressed data, and fill the remaining [0] with 1; when the uncompressed data [6:4] is decimal 0, the [11:5] of the decompressed data are all 0, and the decompressed data [7:4] is the [3:0] of the uncompressed data, and fill the remaining [0] with 1.
[0039] Step 10: Perform data recovery operations on the decompressed data. Determine the highest bit of the data before compression, i.e., the sign bit. If it is high, it indicates a negative number, and the absolute value is calculated. Specifically, the data from step 8 or 9 is inverted and incremented by one, while considering whether overflow will occur. If it is low, it indicates a positive number, and the data is retained.
Claims
1. A method for A-law compression and decompression based on a multi-carrier communication system, characterized in that, Includes the following steps: (1) Compress the uplink data stream and proceed to step (2); decompress the downlink data stream and proceed to step (7). (2) Perform the absolute value operation on the original data; (3) Determine the compression method. If it is Intel type compression, proceed to step (4); if it is standard type compression, proceed to step (5). (4) Compress the 16-bit data into 8-bit data, determine the highest bit where the absolute value is high, and correspond this bit to the compressed data [6:4], and proceed to step (6). (5) Compress the 13-bit data into 8-bit data, determine the highest bit where the absolute value is high, and determine the compressed data [6:4] based on this bit, and proceed to step (6). (6) Concatenate the sign bit of the uncompressed data, the [6:4] of the compressed data, and the last four bits of the highest bit where the absolute value is high; (7) Determine whether the decompression method is Intel or standard. If it is Intel, proceed to step (8); if it is standard, proceed to step (9). (8) Decompress the 8-bit data into 16-bit data. According to the value of [6:4] of the undecompressed data, the highest bit of the decompressed data high level is filled with [3:0] and 0 of the undecompressed data in sequence. Then fill the remaining unoperated bits with 0 and jump to step (10). (9) Decompress the 8-bit data into 13-bit data. According to the value of [6:4] of the undecompressed data, which corresponds to the highest bit of the high level of the decompressed data, fill the [3:0] and 1 of the undecompressed data after it in turn. Then fill the remaining unoperated bits with 0 and jump to step (10). (10) Perform data recovery operation on the decompressed data.
2. The A-law compression and decompression method according to claim 1, characterized in that, In step (2), the absolute value operation of the original data is as follows: determine the highest bit of the original data. A high level indicates a negative number, and the absolute value operation is performed; a low level indicates a positive number, and the data is kept.
3. The A-law compression and decompression method according to claim 1, characterized in that, In step (4), the Intel-type compression first determines the highest bit of the absolute value that is high. When the highest bit of the high level appears in bit 14, the compressed data [6:4] corresponds to 7; when the highest bit of the high level appears in bit 13, the compressed data [6:4] corresponds to 6; when the highest bit of the high level appears in bit 12, the compressed data [6:4] corresponds to 5; when the highest bit of the high level appears in bit 11, the compressed data [6:4] corresponds to 4; when the highest bit of the high level appears in bit 10, the compressed data [6:4] corresponds to 3; when the highest bit of the high level appears in bit 9, the compressed data [6:4] corresponds to 2; when the highest bit of the high level appears in bit 8, the compressed data [6:4] corresponds to 1; when the high level does not appear in the absolute value [14:8], the compressed data [6:4] corresponds to 0.
4. The A-law compression and decompression method according to claim 1, characterized in that, In step (5), the standard compression first determines the highest bit of the absolute value that is high. When the highest bit of the high level appears in the 11th bit, the compressed data [6:4] corresponds to 7; when the highest bit of the high level appears in the 10th bit, the compressed data [6:4] corresponds to 6; when the highest bit of the high level appears in the 9th bit, the compressed data [6:4] corresponds to 5; when the highest bit of the high level appears in the 8th bit, the compressed data [6:4] corresponds to 4; when the highest bit of the high level appears in the 7th bit, the compressed data [6:4] corresponds to 3; when the highest bit of the high level appears in the 6th bit, the compressed data [6:4] corresponds to 2; when the highest bit of the high level appears in the 5th bit, the compressed data [6:4] corresponds to 1; when the high level does not appear in the absolute value [11:5], the compressed data [6:4] corresponds to 0.
5. The A-law compression and decompression method according to claim 1, characterized in that, In step (6), the highest bit of the compressed data is determined by the sign bit of the uncompressed original data.
6. The A-law compression and decompression method according to claim 5, characterized in that, The [6:4] ratio of the compressed data is determined by the highest bit where the absolute value is high.
7. The A-law compression and decompression method according to claim 5, characterized in that, The [3:0] of the compressed data is determined by the last four bits of the highest bit where the absolute value is high; the sign bit of the uncompressed data, the [6:4] of the compressed data, and the [3:0] of the compressed data are concatenated to obtain the compressed 8-bit data.
8. The A-law compression and decompression method according to claim 1, characterized in that, In step (8), during the Intel-type decompression, when the uncompressed data [6:4] is decimal 7, the highest bit of the high level of the decompressed data appears at bit 14, and the decompressed data [13:10] is the same as the uncompressed data [3:0], while the remaining [9:0] are all filled with 0; when the uncompressed data [6:4] is decimal 6, the highest bit of the high level of the decompressed data appears at bit 13, and the decompressed data [12:9] is the same as the uncompressed data [3:0] Meanwhile, fill the remaining [8:0] with 0; when the uncompressed data [6:4] is decimal 5, the highest bit of the high level of the decompressed data appears in the 12th bit, and the decompressed data [11:8] is the [3:0] of the uncompressed data, and fill the remaining [7:0] with 0; when the uncompressed data [6:4] is decimal 4, the highest bit of the high level of the decompressed data appears in the 11th bit, and the decompressed data [10:7] is the [3:0] of the uncompressed data, and fill the remaining [7:0] with 0; when the uncompressed data [6:4] is decimal 4, the highest bit of the high level of the decompressed data appears in the 11th bit, and the decompressed data [10:7] is the [3:0] of the uncompressed data, and fill the remaining [7:0] with 0. When the uncompressed data [6:4] is decimal 3, the highest bit of the high level of the decompressed data appears at bit 10, and the decompressed data [9:6] is the uncompressed data [3:0], while filling the remaining [5:0] with 0; when the uncompressed data [6:4] is decimal 2, the highest bit of the high level of the decompressed data appears at bit 9, and the decompressed data [8:5] is the uncompressed data [3:0], while filling the remaining [5:0] with 0. All [4:0] are filled with 0; when the uncompressed data [6:4] is decimal 1, the highest bit of the high level of the decompressed data appears in the 8th bit, and the decompressed data [7:4] is the [3:0] of the uncompressed data, and the remaining [3:0] are filled with 0; when the uncompressed data [6:4] is decimal 0, the [14:8] of the decompressed data are all 0, and the decompressed data [7:4] is the [3:0] of the uncompressed data, and the remaining [3:0] are filled with 0.
9. The A-law compression and decompression method according to claim 1, characterized in that, In step (9), the standard decompression, when the uncompressed data [6:4] is decimal 7, the highest bit of the high level of the decompressed data appears in the 11th bit, and the decompressed data [10:7] is the [3:0] of the uncompressed data, while filling all the remaining [6:0] with 1; when the uncompressed data [6:4] is decimal 6, the highest bit of the high level of the decompressed data appears in the 10th bit, and the decompressed data [9:6] is the [3:0] of the uncompressed data. At the same time, fill all the remaining [5:0] bits with 1; when the uncompressed data [6:4] is decimal 5, the highest bit of the high level of the decompressed data appears in the 9th bit, and the decompressed data [8:5] is the [3:0] of the uncompressed data, and fill all the remaining [4:0] bits with 1; when the uncompressed data [6:4] is decimal 4, the highest bit of the high level of the decompressed data appears in the 8th bit, and the decompressed data [7:4] is the [3:0] of the uncompressed data, Simultaneously, fill all remaining [3:0] bits with 1; when the uncompressed data [6:4] is decimal 3, the highest bit of the high level of the decompressed data appears in the 7th bit, and the decompressed data [6:3] is the uncompressed data [3:0], simultaneously filling all remaining [2:0] bits with 1; when the uncompressed data [6:4] is decimal 2, the highest bit of the high level of the decompressed data appears in the 6th bit, and the decompressed data [5:2] is the uncompressed data [3:0], simultaneously... When the uncompressed data [6:4] is decimal 1, the highest bit of the high level of the decompressed data appears in the 5th bit, and the decompressed data [4:1] is the uncompressed data [3:0], and the remaining [0] is filled with 1; when the uncompressed data [6:4] is decimal 0, the decompressed data [11:5] is 0, and the decompressed data [7:4] is the uncompressed data [3:0], and the remaining [0] is filled with 1.
10. The A-law compression and decompression method according to claim 1, characterized in that, In step (10), the data recovery operation is performed on the decompressed data. The highest bit of the data before compression is determined. A high level indicates a negative number, and the absolute value of the data is calculated. A low level indicates a positive number, and the data is retained.