Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1735| Title: | An approximation-based truncation algorithm for binary data represented in two’s complement format |
| Authors: | Anandakrishna, Srinath |
| Keywords: | Truncation Binary |
| Issue Date: | 2009 |
| Publisher: | 2009 9th International Symposium on Communications and Information Technology, ISCIT 2009 |
| Citation: | 10.1109/ISCIT.2009.5341264 |
| Abstract: | The power consumption in digital systems is proportional to the number of bits used to represent the data. Therefore, the data is sometimes truncated to a lesser number of bits to reduce power consumption. This truncation introduces a DC bias in the signal which reduces system performance. If the original data is very close to the limits of representation in two’s complement format (i.e. (2n−1 − 1) or (−2n−1) in case of n-bit representation), addition of half the LSB value (using IEEE 754 Round to Nearest method to remove the DC bias) sometimes changes the sign of the sample value. This is similar to the effect of a full wave rectifier and therefore induces harmonics. A modified approach is proposed in which data that are close to the limits of representation are rounded to the highest or lowest possible number that can be represented after truncation without changing the sign of the data. This method was applied in sampling a sine wave in an AL4108 ADC board. It was found that the DC bias and the harmonics were removed. |
| Description: | NITW |
| URI: | http://localhost:8080/xmlui/handle/123456789/1735 |
| Appears in Collections: | Electronics and Communication Engineering |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| An_approximation-based_truncation_algorithm_for_binary_data_represented_in_twos_complement_format.pdf | 415.27 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.