Journal articles on the topic 'Bit-complexity'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Bit-complexity.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Fagervik, K., and T. G. Jeans. "Low complexity bit by bit soft output demodulator." Electronics Letters 32, no. 11 (1996): 985. http://dx.doi.org/10.1049/el:19960666.
Elser, Veit. "The Complexity of Bit Retrieval." IEEE Transactions on Information Theory 64, no. 1 (January 2018): 412–28. http://dx.doi.org/10.1109/tit.2017.2754485.
Lingas, Andrzej. "Bit complexity of matrix products." Information Processing Letters 38, no. 5 (June 1991): 237–42. http://dx.doi.org/10.1016/0020-0190(91)90065-p.
Paˇtraşcu, Mihai, and Corina E. Tarniţaˇ. "On dynamic bit-probe complexity." Theoretical Computer Science 380, no. 1-2 (June 2007): 127–42. http://dx.doi.org/10.1016/j.tcs.2007.02.058.
Gerstel, O., and S. Zaks. "The Bit Complexity of Distributed Sorting." Algorithmica 18, no. 3 (July 1997): 405–16. http://dx.doi.org/10.1007/pl00009163.
Azmi, Elnaz, Uwe Ehret, Steven V. Weijs, Benjamin L. Ruddell, and Rui A. P. Perdigão. "Technical note: “Bit by bit”: a practical and general approach for evaluating model computational complexity vs. model performance." Hydrology and Earth System Sciences 25, no. 2 (March 3, 2021): 1103–15. http://dx.doi.org/10.5194/hess-25-1103-2021.
Mallikarachchi, Thanuja, Dumidu Talagala, Hemantha Kodikara Arachchi, Chaminda Hewage, and Anil Fernando. "A Decoding-Complexity and Rate-Controlled Video-Coding Algorithm for HEVC." Future Internet 12, no. 7 (July 16, 2020): 120. http://dx.doi.org/10.3390/fi12070120.
Tabeshnezhad, Azadeh, A. Lee Swindlehurst, and Tommy Svensson. "Reduced Complexity Precoding for One-Bit Signaling." IEEE Transactions on Vehicular Technology 70, no. 2 (February 2021): 1967–71. http://dx.doi.org/10.1109/tvt.2021.3052113.
Park, Sang-Hyun. "Frame Complexity-Based Adaptive Bit Rate Normalization." Journal of the Korea institute of electronic communication sciences 10, no. 12 (December 31, 2015): 1329–36. http://dx.doi.org/10.13067/jkiecs.2015.10.12.1329.
González, C. M., H. A. Larrondo, and O. A. Rosso. "Statistical complexity measure of pseudorandom bit generators." Physica A: Statistical Mechanics and its Applications 354 (August 2005): 281–300. http://dx.doi.org/10.1016/j.physa.2005.02.054.
Afek, Y., M. Cohen, and E. Haalman. "The bit complexity of the predecessor problem." Information Processing Letters 63, no. 2 (July 1997): 109–12. http://dx.doi.org/10.1016/s0020-0190(97)00094-x.
Dinitz, Yefim, and Noam Solomon. "Two absolute bounds for distributed bit complexity." Theoretical Computer Science 384, no. 2-3 (October 2007): 168–83. http://dx.doi.org/10.1016/j.tcs.2007.04.027.
Kovásznai, Gergely, Andreas Fröhlich, and Armin Biere. "Complexity of Fixed-Size Bit-Vector Logics." Theory of Computing Systems 59, no. 2 (September 7, 2015): 323–76. http://dx.doi.org/10.1007/s00224-015-9653-1.
Akl, Selim G., and Henk Meijer. "On the bit complexity of parallel computations." Integration 6, no. 2 (July 1988): 201–12. http://dx.doi.org/10.1016/0167-9260(88)90039-9.
Sadiq, B. J. S., V. Yu Tsviatkou, and M. N. Bobov. "Combined coding of bit planes of images." «System analysis and applied information science», no. 4 (December 30, 2019): 32–37. http://dx.doi.org/10.21122/2309-4923-2019-4-32-37.
Chandra Sekhar, M., S. K. Chandini, V. Sai Rohith, V. Jhansi Lakshmi, and M. Pavan Kumar. "Data hiding using bit plane complexity segmentation steganography." International Journal of Engineering & Technology 7, no. 2.20 (April 18, 2018): 33. http://dx.doi.org/10.14419/ijet.v7i2.20.11740.
Ababneh, Ahmad. "Low-Complexity Bit Allocation for RSS Target Localization." IEEE Sensors Journal 19, no. 17 (September 1, 2019): 7733–43. http://dx.doi.org/10.1109/jsen.2019.2914347.
Siahaan, Andysah Putera Utama. "Vernam Conjugated Manipulation of Bit-plane Complexity Segmentation." International Journal of Security and Its Applications 11, no. 9 (September 30, 2017): 1–12. http://dx.doi.org/10.14257/ijsia.2017.11.9.01.
Ferragina, Paolo, Igor Nitto, and Rossano Venturini. "On the Bit-Complexity of Lempel--Ziv Compression." SIAM Journal on Computing 42, no. 4 (January 2013): 1521–41. http://dx.doi.org/10.1137/120869511.
Giménez, Nardo, and Guillermo Matera. "On the bit complexity of polynomial system solving." Journal of Complexity 51 (April 2019): 20–67. http://dx.doi.org/10.1016/j.jco.2018.09.005.
Bramas, Quentin, and Sébastien Tixeuil. "The Random Bit Complexity of Mobile Robots Scattering." International Journal of Foundations of Computer Science 28, no. 02 (February 2017): 111–33. http://dx.doi.org/10.1142/s0129054117500083.
Lee, Jae Hack, and Myung Hoon Sunwoo. "Low-Complexity High-Throughput Bit-Wise LDPC Decoder." Journal of Signal Processing Systems 91, no. 8 (July 30, 2018): 855–62. http://dx.doi.org/10.1007/s11265-018-1398-z.
Métivier, Y., J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. "An optimal bit complexity randomized distributed MIS algorithm." Distributed Computing 23, no. 5-6 (November 27, 2010): 331–40. http://dx.doi.org/10.1007/s00446-010-0121-5.
Yu, Yang, Sha Xuejun, and Zhang Zhonghua. "Low complexity bit loading algorithm for OFDM system." Journal of Systems Engineering and Electronics 17, no. 1 (March 2006): 71–74. http://dx.doi.org/10.1016/s1004-4132(06)60013-3.
Lee, Changwook, and Gi J. Jeon. "Low complexity bit allocation algorithm for OFDM systems." International Journal of Communication Systems 21, no. 11 (November 2008): 1171–79. http://dx.doi.org/10.1002/dac.945.
Zamarrud and Muhammed Izharuddin. "8-Bit Quantizer for Chaotic Generator With Reduced Hardware Complexity." International Journal of Rough Sets and Data Analysis 5, no. 3 (July 2018): 55–70. http://dx.doi.org/10.4018/ijrsda.2018070104.
Dogan, M. Levent, Alperen A. Ergür, and Elias Tsigaridas. "On the Complexity of Chow and Hurwitz Forms." ACM Communications in Computer Algebra 57, no. 4 (December 2023): 167–99. http://dx.doi.org/10.1145/3653002.3653003.
Perić, Zoran H., and Milan R. Dinčić. "Optimization of the 24-Bit Fixed-Point Format for the Laplacian Source." Mathematics 11, no. 3 (January 21, 2023): 568. http://dx.doi.org/10.3390/math11030568.
Zhang, Jinwang, Fangxu Lv, Jianjun Shi, Zixiang Tang, and Dongbin Lv. "A High Phase Detection Density and Low Space Complexity Mueller-Muller Phase Detector for DB PAM-4 Wireline Receiver." Electronics 11, no. 19 (October 9, 2022): 3246. http://dx.doi.org/10.3390/electronics11193246.
Crook, David, and John Fulcher. "A Comparison of Bit Serial and Bit Parallel DCT Designs." VLSI Design 3, no. 1 (January 1, 1995): 59–65. http://dx.doi.org/10.1155/1995/30583.
Zhang, Yu Long, Guo Chu Shou, Yi Hong Hu, and Zhi Gang Guo. "Low Complexity GF(2m) Multiplier Based on Iterative Karatsuba Algorithm." Advanced Materials Research 546-547 (July 2012): 1409–14. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1409.
Sun, Shuliang. "A New Information Hiding Method Based on Improved BPCS Steganography." Advances in Multimedia 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/698492.
Ge, Shaodi, Chongyi Fan, Jian Wang, and Xiaotao Huang. "Low-Complexity One-Bit DOA Estimation for Massive ULA with a Single Snapshot." Remote Sensing 14, no. 14 (July 17, 2022): 3436. http://dx.doi.org/10.3390/rs14143436.
Xu, Guoliang, and Daowen Qiu. "Partial Boolean Functions With Exact Quantum Query Complexity One." Entropy 23, no. 2 (February 3, 2021): 189. http://dx.doi.org/10.3390/e23020189.
IBHARALU, F. T., M. O. FALOWO, and A. T. AKINWALE. "RSA ENCRYPTION ALGORITHM AUGUMENTED WITH BIT-STUFFING TECHNIQUE FOR DATA SECURITY." Journal of Natural Sciences Engineering and Technology 16, no. 1 (June 29, 2017): 19–34. http://dx.doi.org/10.51406/jnset.v16i1.1800.
Chung-Chin Lu and Sy-Hann Huang. "On bit-level trellis complexity of Reed-Muller codes." IEEE Transactions on Information Theory 41, no. 6 (1995): 2061–64. http://dx.doi.org/10.1109/18.476337.
Choi, Changryoul, and Jechang Jeong. "Constrained two-bit transform for low-complexity motion estimation." Optical Engineering 53, no. 6 (June 23, 2014): 063104. http://dx.doi.org/10.1117/1.oe.53.6.063104.
Vernon, Stephen Decker. "Reduced computational complexity of bit allocation for perceptual coding." Journal of the Acoustical Society of America 125, no. 1 (2009): 586. http://dx.doi.org/10.1121/1.3074487.
Tao Li, Wai Ho Mow, and K. B. Letaief. "Low complexity iterative decoding for bit-interleaved coded modulation." IEEE Transactions on Wireless Communications 5, no. 8 (August 2006): 1966–70. http://dx.doi.org/10.1109/twc.2006.1687705.
Lee, Chiou-Yng. "Low-complexity bit-parallel systolic multipliers over GF(2 )." Integration 41, no. 1 (January 2008): 106–12. http://dx.doi.org/10.1016/j.vlsi.2007.05.001.
Putera, Andysah. "High Complexity Bit-Plane Security Enchancement in BPCS Steganography." International Journal of Computer Applications 148, no. 3 (August 16, 2016): 17–22. http://dx.doi.org/10.5120/ijca2016911069.
Wang, Qi, Qiuliang Xie, Zhaocheng Wang, Sheng Chen, and Lajos Hanzo. "A Universal Low-Complexity Symbol-to-Bit Soft Demapper." IEEE Transactions on Vehicular Technology 63, no. 1 (January 2014): 119–30. http://dx.doi.org/10.1109/tvt.2013.2272640.
Zhao, Chun'e, Wenping Ma, Tongjiang Yan, and Yuhua Sun. "Linear Complexity of Least Significant Bit of Polynomial Quotients." Chinese Journal of Electronics 26, no. 3 (May 1, 2017): 573–78. http://dx.doi.org/10.1049/cje.2016.10.008.
Chang, Nam Su, Eun Sook Kang, and Seokhie Hong. "Low complexity bit-parallel multiplier forF2ndefined by repeated polynomials." Discrete Applied Mathematics 241 (May 2018): 2–12. http://dx.doi.org/10.1016/j.dam.2016.07.014.
Vozna, N., A. Davletova, Ya Nykolaychuk, and V. Gryga. "Improvement of multi-digital multiplicating devices structures in different theoretical and numerical bases." Computer systems and network 3, no. 1 (December 10, 2021): 7–19. http://dx.doi.org/10.23939/csn2021.01.007.
Wang, Zongyue, Xiaoyang Dong, Keting Jia, and Jingyuan Zhao. "Differential Fault Attack on KASUMI Cipher Used in GSM Telephony." Mathematical Problems in Engineering 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/251853.
Beeharry, Yogesh, Tulsi Pawan Fowdur, and Krishnaraj M. S. Soyjaudah. "SYMBOL LEVEL DECODING FOR DUO-BINARY TURBO CODES." IIUM Engineering Journal 18, no. 1 (May 30, 2017): 111–31. http://dx.doi.org/10.31436/iiumej.v18i1.661.
Chen, Qunlin, Derong Chen, Jiulu Gong, and Jie Ruan. "Low-Complexity Rate-Distortion Optimization of Sampling Rate and Bit-Depth for Compressed Sensing of Images." Entropy 22, no. 1 (January 20, 2020): 125. http://dx.doi.org/10.3390/e22010125.
Kuper, Rob. "Effects of Flowering, Foliation, and Autumn Colors on Preference and Restorative Potential for Designed Digital Landscape Models." Environment and Behavior 52, no. 5 (November 12, 2018): 544–76. http://dx.doi.org/10.1177/0013916518811424.
Sadiq, B. J. S., V. Yu Tsviatkou, and М. N. Bobov. "Аdaptive combined image coding with prediction of arithmetic code volume." Doklady BGUIR 19, no. 2 (March 27, 2021): 31–39. http://dx.doi.org/10.35596/1729-7648-2021-19-2-31-39.