{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T16:44:28Z","timestamp":1786812268891,"version":"build-2736575974"},"reference-count":26,"publisher":"Vilnius University Press","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,1,1]]},"abstract":"<jats:p>This paper introduces a novel approach that bridges the floating-point (FP) format, widely utilized in diverse fields for data representation, with the \u03bc-law companding quantizer, proposing a method for designing and linearizing the \u03bc-law companding quantizer to yield a piecewise uniform quantizer tailored to the FP format. A key outcome of the paper is a closed-form approximate expression for closely and efficiently evaluating the FP format\u2019s performance for data with the Laplacian distribution. This expression offers generality across various bit rates and data variances, markedly reducing the computational complexity of FP performance evaluation compared to prior methods reliant on summation of a large number of terms. By facilitating the evaluation of FP format performance, this research substantially aids in the selection of the optimal bit rates, crucial for digital representation quality, dynamic range, computational overhead, and energy efficiency. The numerical calculations spanning a wide range of data variances provided for some commonly used FP versions with an 8-bit exponent have demonstrated that the proposed closed-form expression closely approximates FP format performance.<\/jats:p>","DOI":"10.15388\/25-infor587","type":"journal-article","created":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T09:03:41Z","timestamp":1742288621000},"page":"125-140","source":"Crossref","is-referenced-by-count":3,"title":["An Approximate Closed-Form Expression for Calculating Performance of Floating-Point Format for the Laplacian Source"],"prefix":"10.15388","volume":"36","author":[{"given":"Zoran","family":"Peri\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bojan","family":"Deni\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milan","family":"Din\u010di\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sofija","family":"Peri\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"6097","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"2025032013050498756_j_infor587_ref_001","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/ARITH.2019.00023","volume-title":"Proceedings of the IEEE 26th Symposium on Computer Arithmetic (ARITH)","year":"2019"},{"issue":"2","key":"2025032013050498756_j_infor587_ref_002","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1109\/TCSII.2022.3213847","article-title":"Area efficient compression for floating-point feature maps in convolutional neural network accelerators","volume":"70","year":"2023","journal-title":"IEEE Transactions on Circuits and Systems II"},{"key":"2025032013050498756_j_infor587_ref_003","year":"2018"},{"key":"2025032013050498756_j_infor587_ref_004","first-page":"7950","volume-title":"Proceedings of the33rd Conference on Neural Information Processing Systems, (NeurIPS), No. 714","year":"2019"},{"key":"2025032013050498756_j_infor587_ref_005","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.ins.2021.06.073","article-title":"NeuNAC: a novel fragile watermarking algorithm for integrity protection of neural networks","volume":"576","year":"2021","journal-title":"Information Sciences"},{"issue":"7","key":"2025032013050498756_j_infor587_ref_006","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/TC.2018.2855729","article-title":"High-precision anchored accumulators for reproducible floating-point summation","volume":"68","year":"2019","journal-title":"IEEE Transactions on Computers"},{"key":"2025032013050498756_j_infor587_ref_007","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/ARITH.2019.00022","volume-title":"Proceedings of the IEEE 26th Symposium on Computer Arithmetic","year":"2019"},{"key":"2025032013050498756_j_infor587_ref_008","first-page":"172","volume-title":"Proceedings of the 21-st Euromicro Conference on Digital System Design (DSD)","year":"2018"},{"key":"2025032013050498756_j_infor587_ref_009","volume-title":"Speech Coding Algorithms: Foundation and Evolution of Standardized Coders","year":"2003"},{"key":"2025032013050498756_j_infor587_ref_010","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ATEE58038.2023.10108130","volume-title":"Proceedings of the IEEE 13th International Symposium on Advanced Topics in Electrical Engineering (ATEE)","year":"2023"},{"key":"2025032013050498756_j_infor587_ref_011","article-title":"Support region of \u03bc-law logarithmic quantizers for Laplacian source applied in neural networks","volume":"124","year":"2021","journal-title":"Microelectronics Reliability"},{"issue":"3","key":"2025032013050498756_j_infor587_ref_012","doi-asserted-by":"publisher","first-page":"527","DOI":"10.15388\/Informatica.2016.98","article-title":"New coding algorithm based on variable-length codewords for piecewise uniform quantizers","volume":"27","year":"2016","journal-title":"Informatica"},{"issue":"3","key":"2025032013050498756_j_infor587_ref_013","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1109\/TETC.2021.3069165","article-title":"Algorithms for stochastically rounded elementary arithmetic operations in IEEE 754 floating-point arithmetic","volume":"9","year":"2021","journal-title":"IEEE Transactions on Emerging Topics in Computing"},{"issue":"7","key":"2025032013050498756_j_infor587_ref_014","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/LSP.2003.813679","article-title":"Speech probability distribution","volume":"10","year":"2003","journal-title":"IEEE Signal Processing Letters"},{"key":"2025032013050498756_j_infor587_ref_015","volume-title":"Vector Quantization and Signal Compression","year":"1992"},{"key":"2025032013050498756_j_infor587_ref_016","year":"2019"},{"key":"2025032013050498756_j_infor587_ref_017","volume-title":"Digital Coding of Waveforms: Principles and Applications to Speech and Video","year":"1984"},{"key":"2025032013050498756_j_infor587_ref_018","doi-asserted-by":"publisher","DOI":"10.3390\/s22031230","article-title":"Optimal architecture of floating-point arithmetic for neural network training processor","volume":"22","year":"2022","journal-title":"Sensors"},{"issue":"1","key":"2025032013050498756_j_infor587_ref_019","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/MSP.2018.2875977","article-title":"Efficient floating-point division for digital signal processing application","volume":"36","year":"2019","journal-title":"IEEE Signal Processing Magazine"},{"issue":"5","key":"2025032013050498756_j_infor587_ref_020","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1109\/TSP.2011.2112354","article-title":"Asymptotic formulas for variance-mismatched fixed-rate scalar quantization of a Gaussian source","volume":"59","year":"2011","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"2025032013050498756_j_infor587_ref_021","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s11277-010-9929-3","article-title":"Forward adaptive logarithmic quantizer with new lossless coding method for Laplacian source","volume":"59","year":"2010","journal-title":"Wireless Personal Communications"},{"key":"2025032013050498756_j_infor587_ref_022","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ATEE52255.2021.9425265","volume-title":"Proceedings of the IEEE 12th International Symposium on Advanced Topics in Electrical Engineering (ATEE)","year":"2021"},{"key":"2025032013050498756_j_infor587_ref_023","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/MIEL52794.2021.9569094","volume-title":"Proceedings of the IEEE 32nd International Conference on Microelectronics (MIEL)","year":"2021"},{"key":"2025032013050498756_j_infor587_ref_024","first-page":"7686","volume-title":"Proceedings of the 32nd Conference on Neural Information Processing Systems (NeurIPS 2018)","year":"2018"},{"key":"2025032013050498756_j_infor587_ref_025","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.neucom.2022.08.045","article-title":"Towards efficient full 8-bit integer DNN online training on resource-limited devices without batch normalization","volume":"511","year":"2022","journal-title":"Neurocomputing"},{"issue":"11","key":"2025032013050498756_j_infor587_ref_026","doi-asserted-by":"publisher","first-page":"4478","DOI":"10.1109\/TCSI.2023.3300657","article-title":"Optimizing FPGA-based DNN accelerator with shared exponential floating-point format","volume":"70","year":"2023","journal-title":"IEEE Transactions on Circuits and Systems I"}],"container-title":["Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1368\/text","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1368\/text","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T11:09:12Z","timestamp":1742468952000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/25-INFOR587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,1]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,3,10]]}},"alternative-id":["10.15388\/25-INFOR587"],"URL":"https:\/\/doi.org\/10.15388\/25-infor587","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"value":"0868-4952","type":"print"},{"value":"1822-8844","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,1]]}}}