Relevant bibliographies by topics / Bit-level

Academic literature on the topic 'Bit-level'

Author: Grafiati
Published: 14 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bit-level.'

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.

Journal articles on the topic "Bit-level"

1

Peters, Martine. "French, Bit By Bit Multimedia Level 1." CALICO Journal 21, no. 1 (December 4, 2017): 167–73. http://dx.doi.org/10.1558/cj.35193.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pikus, Marcin, and Wen Xu. "Bit-Level Probabilistically Shaped Coded Modulation." IEEE Communications Letters 21, no. 9 (September 2017): 1929–32. http://dx.doi.org/10.1109/lcomm.2017.2704596.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dong Ho Kim and Sang Wu Kim. "Bit-level stopping of turbo decoding." IEEE Communications Letters 10, no. 3 (March 2006): 183–85. http://dx.doi.org/10.1109/lcomm.2006.1603378.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

AGGOUN, A., A. ASHUR, and M. K. IBRAHIM. "Bit-level pipelined digit-serial multiplier." International Journal of Electronics 75, no. 6 (December 1993): 1209–19. http://dx.doi.org/10.1080/00207219308907196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Grover, Radhika S., Weijia Shang, and Qiang Li. "Bit-level two's complement matrix multiplication." Integration 33, no. 1-2 (December 2002): 3–21. http://dx.doi.org/10.1016/s0167-9260(02)00020-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Donoho, David L. "Unconditional Bases and Bit-Level Compression." Applied and Computational Harmonic Analysis 3, no. 4 (October 1996): 388–92. http://dx.doi.org/10.1006/acha.1996.0032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Peng, Cui Ni, Zhe Li, and Guangyuan Zhang. "Optimal CTU-level bit allocation in HEVC for low bit-rate applications." Multimedia Tools and Applications 78, no. 16 (May 9, 2019): 23733–47. http://dx.doi.org/10.1007/s11042-019-7680-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Heule, Marijn, and Hans van Maaren. "Parallel SAT Solving using Bit-level Operations1." Journal on Satisfiability, Boolean Modeling and Computation 4, no. 2-4 (May 1, 2008): 99–116. http://dx.doi.org/10.3233/sat190040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Roy, Satyaki. "The Extensive Bit-level Encryption System (EBES)." International Journal of Information Technology and Computer Science 5, no. 5 (April 1, 2013): 67–73. http://dx.doi.org/10.5815/ijitcs.2013.05.09.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Khanna, Neeraj, Dripto Chatterjee, Asoke Nath, and Joyshree Nath. "Bit Level Encryption Standard (BLES): Version-I." International Journal of Computer Applications 52, no. 2 (August 30, 2012): 41–46. http://dx.doi.org/10.5120/8177-1496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bit-level"

1

Lin, Wenjing. "Bit level diversity combining for D-MIMO." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106499.

Full text
Abstract:
Multiple-Input Multiple-Output (MIMO) transmission techniques have been shown to be a powerful performance enhancing technology in wireless communications. However in realistic systems, when increasing the number of antennas in a restricted space, the capacity gain of MIMO is limited. Furthermore, co-located MIMO (C-MIMO) systems when affected by shadowing can not improve link quality. This motivates us to investigate Distributed MIMO (D-MIMO) system.This work considers a bit level combining scheme, aided by bit reliability information for an uplink D-MIMO system over a composite Rayleigh-lognormal fading channel. Bit reliability information is derived based on the logarithmic likelihood ratio (LLR) and further modified for the MIMO detection schemes: SD-ML (Sphere Decoding - Maximum Likelihood) and MMSE-OSIC (Minimum Mean Square Error - Ordered Successive Interference Cancellation). Computer simulation results demonstrate that such bit level combining scheme provides significant performance improvements for D-MIMO with M transmit and L receive antennas on each of its N geographically dispersed receive node, over conventional C-MIMO with M transmit and L receive antennas, even in the presence of channel estimation errors or channel spatial correlation. It is found that such a D-MIMO system provides a comparable performance to a C-MIMO system with M transmit and NL receive antennas, especially when space correlation becomes significant.Furthermore, an analytical BER evaluation technique is proposed for a C-MIMO system with SD-ML detection over a composite Rayleigh-lognormal fading channel with and without spatial correlation. Numerical results show that our technique provides tight approximations for C-MIMO over space uncorrelated, space semi-correlated and space correlated channels.We also provide a theoretical BER approximation technique for a D-MIMO system with SD-ML detection over a composite Rayleigh-lognormal fading channel with and without spatial correlation. Numerical results show that by optimizing two parameters, the BER approximation techinique provides good approximation for an uncorrelated D-MIMO when the number of transmit antennas equals the number of receive antennas on each of its N geographically dispersed receive node. We further notice that these optimized parameters set for an uncorrelated D-MIMO with equal number of transmit and receive antennas on each receive node can not provide good approximation for an uncorrelated D-MIMO when the number of transmit antennas is less than the number of receive antennas on each node. These analytical results confirm the significant performance improvement provided by D-MIMO with bit level combining.
Les techniques de transmission MIMO (Multiple-Input Multiple-Output) constituent une puissante technologie permettant des améliorations significatives en termes de performance dans le domaine des communications sans fil. Cependant, en pratique, lorsque le nombre d'antennes augmente dans un espace relativement restreint, le gain en capacité des systèmes MIMO est limité. De plus, lorsqu'ils sont affectés par l'effet d'ombrage, les systèmes MIMO co-localisés (C-MIMO) ne peuvent améliorer la qualité de transmission. Ces difficultés ont motivé notre investigation des systèmes D-MIMO (Distributed-MIMO).Cette thèse considère une méthode de combinaison au niveau du bit, utilisant l'information sur la fiabilité du bit, pour le canal montant d'un système D-MIMO subissant des évanouissements de Rayleigh-lognormale. L'information sur la fiabilité du bit est établie à partir de la fonction de vraisemblance logarithmique (LLR) et est par la suite modifiée pour différentes méthodes de détection pour les sysèmes MIMO, incluant SD-ML (Sphere Decoding-Maximum Likelihood) et MMSE-OSIC (Minimum Mean Square Error-Ordered Successive Interference Cancellation). Les résultats des simulations par ordinateur démontrent que comparée à un C-MIMO conventionnel utilisant M antennes d'émission et L antennes de réception, la méthode de combinaison au niveau du bit fournit des améliorations de performance significatives pour le D-MIMO utilisant M antennes d'émission et L antennes de réception sur chacun des N nœuds de réception géographiquement dispersés, et ceci même en présence d'erreurs d'estimation de canal ou de corrélation spatiale. Il est aussi démontré qu'un tel D-MIMO fournit une performance comparable à celle d'un C-MIMO avec M antennes d'émission et NL antennes de réception, surtout lorsque la corrélation spatiale est significative. De plus, une technique d'évaluation analytique de la probabilité d'error est proposée pour un système C-MIMO utilisant SD-ML comme méthode de détection sur un canal à évanouissements composites de Rayleigh-lognormale avec ou sans corrélation spatiale. Les résultats numériques montrent que notre technique fournit de très bonnes approximations pour un système C-MIMO avec ou sans corrélation spatiale.Nous présentons également une technique d'approximation théorique de la probabilité d'error pour un système D-MIMO utilisant SD-ML comme méthode de détection sur un canal à évanouissements composites de Rayleigh-lognormale avec ou sans corrélation spatiale. Les résultats numériques montrent qu'en optimisant deux paramètres, notre technique d'approximation de la probabilité d'error fournit une bonne approximation pour le D-MIMO sans corrélation spatiale utilisant M antennes d'émission et L antennes de réception sur chacun de ses N nœuds de réception géographiquement dispersés. Cependant les valeurs optimales des paramètres obtenues pour un D-MIMO où le nombre d'antennes d'émission est égal au nombre d'antennes de réception à chacun des nœuds de réception, ne peuvent fournir de bonnes approximations lorsque le nombre d'antennes d'émission est inférieur au nombre d'antennes de réception sur chacun des nœuds de réception. Ces résultats analytiques confirment l'amélioration significative de performance fournie par le D-MIMO utilisant la méthode de combinaison au niveau du bit.
APA, Harvard, Vancouver, ISO, and other styles
2

Jiang, Jing. "Advanced channel coding techniques using bit-level soft information." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1923.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Srinivasan, Sudarshan Kumar. "Efficient Verification of Bit-Level Pipelined Machines Using Refinement." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19815.

Full text
Abstract:
Functional verification is a critical problem facing the semiconductor industry: hardware designs are extremely complex and highly optimized, and even a single bug in deployed systems can cost more than $10 billion. We focus on the verification of pipelining, a key optimization that appears extensively in hardware systems such as microprocessors, multicore systems, and cache coherence protocols. Existing techniques for verifying pipelined machines either consume excessive amounts of time, effort, and resources, or are not applicable at the bit-level, the level of abstraction at which commercial systems are designed and functionally verified. We present a highly automated, efficient, compositional, and scalable refinement-based approach for the verification of bit-level pipelined machines. Our contributions include: (1) A complete compositional reasoning framework based on refinement. Our notion of refinement guarantees that pipelined machines satisfy the same safety and liveness properties as their instruction set architectures. In addition, our compositional framework can be used to decompose correctness proofs into smaller, more manageable pieces, leading to drastic reductions in verification times and a high-degree of scalability. (2) The development of ACL2-SMT, a verification system that integrates the popular ACL2 theorem prover (winner of the 2005 ACM Software System Award) with decision procedures. ACL2-SMT allows us to seamlessly take advantage of the two main approaches to hardware verification: theorem proving and decision procedures. (3) A proof methodology based on our compositional reasoning framework and ACL2-SMT that allows us to reduce the bit-level verification problem to a sequence of highly automated proof steps. (4) A collection of general-purpose refinement maps, functions that relate pipelined machine states to instruction set architecture states. These refinement maps provide more flexibility and lead to increased verification efficiency. The effectiveness of our approach is demonstrated by verifying various pipelined machine models, including a bit-level, Intel XScale inspired processor that implements 593 instructions and includes features such as branch prediction, precise exceptions, and predicated instruction execution.
APA, Harvard, Vancouver, ISO, and other styles
4

Wentzlaff, David 1979. "Architectural implications of bit-level computation in communication applications." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87324.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lai, Jiunn-Yiing 1958. "RTL AND SWITCH-LEVEL SIMULATION COMPARISON ON EIGHT BIT MICROPROCESSOR." Thesis, The University of Arizona, 1987. http://hdl.handle.net/10150/276532.

Full text
Abstract:
In this research, an AHPL (A Hardware Programming Language) based automation system is used to design and verify the Intel-8080 microprocessor from the RTL (Register Transfer Level) hardware description through the network list of transistors. The HPSIM is used as a RTL simulator which interprets the AHPL description and executes the connections, branches, and register transfer, and prints line or register values for each circuit clock period. After the AHPL description has been translated to switch-level link list, ESIM is applied for more detailed simulation to ensure the digital behavior in this microprocessor design is correct. The ESIM is an event-driven switch-level simulator which accepts commands from the user, and executes each command before reading the next one. After performing these different levels of simulations, a comparison is discussed at the end.
APA, Harvard, Vancouver, ISO, and other styles
6

Stierstorfer, Clemens [Verfasser]. "A Bit-Level-Based Approach to Coded Multicarrier Transmission / Clemens Stierstorfer." Aachen : Shaker, 2010. http://d-nb.info/1084535459/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Oh, Min-seok. "Low complexity bit-level soft-decision decoding for Reed-Solomon codes." Thesis, University of Surrey, 1999. http://epubs.surrey.ac.uk/842687/.

Full text
Abstract:
Reed-Solomon codes (RS codes) are an important method for achieving error-correction in communication and storage systems. However, it has proved difficult to find a soft-decision decoding method which has low complexity. Moreover, in some previous soft-decision decoding approaches, bit-level soft-decision information could not be employed fully. Even though RS codes have powerful error correction capability, this is a critical shortcoming. This thesis presents bit-level soft-decision decoding schemes for RS codes. The aim is to design a low complexity sequential decoding method based on bit-level soft- decision information approaching maximum likelihood performance. Firstly a trellis decoding scheme which gives easy implementation is introduced, since the soft-decision information can be used directly. In order to allow bit-level soft-decision, a binary equivalent code is introduced and Wolf's method is used to construct the binary-trellis from a systematic parity check matrix. Secondly, the Fano sequential decoding method is chosen, which is sub-optimal and adaptable to channel conditions. This method does not need a large amount of storage to perform an efficient trellis search. The Fano algorithm is then modified to improve the error correcting performance. Finally, further methods of complexity reduction are presented without loss of decoding performance, based on reliability-first search decoding using permutation groups for RS codes. Compared with the decoder without permutation, those schemes give a large complexity reduction and performance improvement approaching near maximum likelihood performance. In this thesis, three types of permutation, cyclic, squaring and hybrid permutation, are presented and the decoding methods using them are implemented.
APA, Harvard, Vancouver, ISO, and other styles
8

Shah, Milap. "Parallel Aes diffusion inter block diffusion at bit level and compression." Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-42449.

Full text
Abstract:
Information is an intelligent data through which knowledgeable and usable things can be convicted or interpreted in a proper manner. With the advancement of technology, transmission of information over the network has come a trend. This information must be transmitted securely over the network. Data security was not a problem if a secure channel was provided for single transmission. It is a necessity to convert the information into an unintelligible form for transmitting it over an unsecured channel. Encryption is a technique through which original information can be converted into unintelligible form. As time has elapsed, various encryption algorithms are employed so that information can be transmitted securely over an unsecured channel. Unless an intruder accesses the encrypted text, he / she cannot gain any information from that text. But as the new algorithms are designed, all the algorithms are challenged and their cryptanalysis is available. In the year 1998, Advanced Encryption Standards (A (S)) were proposed and later it was widely accepted as the most secure encryption algorithm that can be used to encrypt the information so that it can be transmitted securely and unsecured. fixed to a new scheme called Parallel AЕS, was an employee who takes four blocks of 16 bytes at a time to generate four blocks of 16 bytes of text thus providing diffusion of blocks at exchange. than all sequential AЕs. All the algorithms are challenged and their cryptanalysis is available. In the year 1998, To make A morS more fixed to a new scheme called Parallel AЕS, was an employee who took four blocks of 16 bytes at a time to generate four blocks of 16 bytes of text, thus providing diffusion of blocks at exchange. By doing this parallel A stoodS stood to be much firmer than sequential AЕS. Advanced Encryption Standards (AЕS) was proposed and later it was widely accepted as the most secure encryption algorithm that can be used to encrypt the information so that it can be transmitted securely over an unsecured channel. To make A morS more fixed to a new scheme called Parallel AЕS, was an employee who took four blocks of 16 bytes at a time to generate four blocks of 16 bytes of text, thus providing diffusion of blocks at exchange. By doing this parallel A stoodS stood to be much firmer than sequential AЕS. Advanced Encryption Standards (AЕS) was proposed and later it was widely accepted as the most secure encryption algorithm that can be used to encrypt the information so that it can be transmitted securely over an unsecured channel. To make A morS more fixed to a new scheme called Parallel AЕS, was an employee who took four blocks of 16 bytes at a time to generate four blocks of 16 bytes of text, thus providing diffusion of blocks at exchange. By doing this parallel A stoodS stood to be much firmer than sequential AЕS. was an employee who took four blocks of 16 bytes at a time to generate four blocks of 16 bytes of text, thus providing diffusion of blocks at exchange. By doing this parallel A stoodS stood to be much firmer than sequential AЕS. was an employee who took four blocks of 16 bytes at a time to generate four blocks of 16 bytes of text, thus providing diffusion of blocks at exchange. By doing this parallel A stoodS stood to be much firmer than sequential AЕS.
APA, Harvard, Vancouver, ISO, and other styles
9

González, Julio E. "A study of gray level recording capability for a reflective six bit desktop scanner /." Online version of thesis, 1994. http://hdl.handle.net/1850/11289.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Satheesh, Varma Nikhil. "Design and implementation of an approximate full adder and its use in FIR filters." Thesis, Linköpings universitet, Elektroniksystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-89430.

Full text
Abstract:
Implementation of the polyphase decomposed FIR filter structure involves two steps; the generation of the partial products and the efficient reduction of the generated partial products. The partial products are generated by a constant multiplication of the filter coefficients with the input data and the reduction of the partial products is done by building a pipelined adder tree using FAs and HAs. To improve the speed and to reduce the complexity of the reduction tree a4:2 counter is introduced into the reduction tree. The reduction tree is designed using a bit-level optimized ILP problem which has the objective function to minimize the overall cost of the hardware used. For this purpose the layout design for a 4:2 counter has been developed and the cost function has been derived by comparing the complexity of the design against a standard FA design. The layout design for a 4:2 counter is implemented in a 65nm process using static CMOS logic style and DPL style. The average power consumption drawn from a 1V power supply, for the static CMOS design was found to be 16.8μWand for the DPL style it was 12.51μW. The worst case rise or fall time for the DPL logic was 350ps and for the static CMOS logic design it was found to be 260ps. The usage of the 4:2 counter in the reduction tree infused errors into the filter response, but it helped to reduce the number of pipeline stages and also to improve the speed of the partial product reduction.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Bit-level"

1

Keating, Michael. Simple art of SoC design: Closing the gap between RTL and ESL. New York: Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

BIT By Bit: Level 6. MacMillan Publishing Company, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

BIT By Bit: Challenge Activities (Level 6-7). MacMillan Publishing Company, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

BIT By Bit: Teaching Charts (Level 6-7). MacMillan Publishing Company, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mason, Joshua, and Chet Sandberg. Eight-Bit Bastards: Level Two. Independently Published, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mason, Joshua, and Chet Sandberg. Eight-Bit Bastards: Level One. Independently published, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Joel, Micah. Level Up: An 8-Bit Gamelit Novel. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sadar, Albin, and Valerio Fabbretti. Hamster Holmes, a Bit Stumped: Ready-To-Read Level 2. Simon Spotlight, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Halbutoğulları, Alper. Fast bit-level, word-level and parallel arithmetic in finite fields for elliptic curve cryptosystems. 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Halbutoğulları, Alper. Fast bit-level, word-level and parallel arithmetic in finite fields for elliptic curve cryptosystems. 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Bit-level"

1

Hartley, Richard, and Keshab K. Parhi. "Bit-Level Unfolding." In Digit-Serial Computation, 147–63. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2327-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Drechsler, Rolf, and Bernd Becker. "Bit-level Decision Diagrams." In Graphenbasierte Funktionsdarstellung, 37–50. Wiesbaden: Vieweg+Teubner Verlag, 1998. http://dx.doi.org/10.1007/978-3-663-01442-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ivrii, Alexander, and Yakir Vizel. "Bit-Level Model Checking." In Handbook of Computer Architecture, 1–40. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-15-6401-7_35-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bamberg, Lennart, Jan Moritz Joseph, Alberto García-Ortiz, and Thilo Pionteck. "Estimation of the Bit-Level Statistics." In 3D Interconnect Architectures for Heterogeneous Technologies, 113–32. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-98229-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Issariyakul, Teerawat, and Ekram Hossain. "BSD Link List and Bit Level Functions." In Introduction to Network Simulator NS2, 499–500. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4614-1406-3_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Adjé, Assalé, Dorra Ben Khalifa, and Matthieu Martel. "Fast and Efficient Bit-Level Precision Tuning." In Static Analysis, 1–24. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88806-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Molina, María C., Rafael Ruiz Sautua, José M. Mendías, and Román Hermida. "Bit-Level Allocation for Low Power in Behavioural High-Level Synthesis." In Lecture Notes in Computer Science, 617–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39762-5_68.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ciesielski, Maciej, Walter Brown, and André Rossi. "Arithmetic Bit-Level Verification Using Network Flow Model." In Hardware and Software: Verification and Testing, 327–43. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03077-7_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aranha, Diego F., Laura Fuentes-Castañeda, Edward Knapp, Alfred Menezes, and Francisco Rodríguez-Henríquez. "Implementing Pairings at the 192-Bit Security Level." In Pairing-Based Cryptography – Pairing 2012, 177–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36334-4_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Wenxi, Harald Søndergaard, and Peter J. Stuckey. "A Bit-Vector Solver with Word-Level Propagation." In Integration of AI and OR Techniques in Constraint Programming, 374–91. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33954-2_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bit-level"

1

Yadegari, Babak, and Saumya Debray. "Bit-Level Taint Analysis." In 2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 2014. http://dx.doi.org/10.1109/scam.2014.43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jhala, Ranjit, and Rupak Majumdar. "Bit level types for high level reasoning." In the 14th ACM SIGSOFT international symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1181775.1181791.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Jiwoong, and Hyunchul Shin. "Scheduling considering bit level delays." In 2008 International SoC Design Conference (ISOCC). IEEE, 2008. http://dx.doi.org/10.1109/socdc.2008.4815639.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wedler, M., D. Stoffel, and W. Kunz. "Normalization at the arithmetic bit level." In 2005 42nd Design Automation Conference. IEEE, 2005. http://dx.doi.org/10.1109/dac.2005.193852.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abbass, Jad F., and Ramzi A. Haraty. "Bit-level locking for concurrency control." In 2009 IEEE/ACS International Conference on Computer Systems and Applications. IEEE, 2009. http://dx.doi.org/10.1109/aiccsa.2009.5069320.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wedler, Markus, Dominik Stoffel, and Wolfgang Kunz. "Normalization at the arithmetic bit level." In the 42nd annual conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1065579.1065699.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Hao, Hongwen Yang, and Mingyue Ma. "Bit Level Adaptive Interleaving for WiMAX." In 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing. IEEE, 2010. http://dx.doi.org/10.1109/nswctc.2010.160.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Incera, J., and G. Rubino. "Bit-level and packet-level, or Pollaczec-Khintchine formulae revisited." In First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/qest.2004.1348022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sharma, Hardik, Jongse Park, Naveen Suda, Liangzhen Lai, Benson Chau, Vikas Chandra, and Hadi Esmaeilzadeh. "Bit Fusion: Bit-Level Dynamically Composable Architecture for Accelerating Deep Neural Network." In 2018 ACM/IEEE 45th Annual International Symposium on Computer Architecture (ISCA). IEEE, 2018. http://dx.doi.org/10.1109/isca.2018.00069.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Jou-An, Hsin-Hsuan Sung, Xipeng Shen, Nathan Tallent, Kevin Barker, and Ang Lit. "Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU." In 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2022. http://dx.doi.org/10.1109/ipdps53621.2022.00056.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Bit-level"

1

Bryant, Randal E. Bit-Level Analysis of an SRT Divider Circuit. Fort Belvoir, VA: Defense Technical Information Center, April 1995. http://dx.doi.org/10.21236/ada294842.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hillestad, Torgeir Martin. The Metapsychology of Evil: Main Theoretical Perspectives Causes, Consequences and Critique. University of Stavanger, 2014. http://dx.doi.org/10.31265/usps.224.

Full text
Abstract:
The purpose of this text or dissertation is to throw some basic light on a fundamental problem concerning manhood, namely the question of evil, its main sources, dynamics and importance for human attitudes and behaviour. The perspective behind the analysis itself is that of psychology. Somebody, or many, may feel at bit nervous by the word “evil” itself. It may very well be seen as too connected to religion, myth and even superstition. Yet those who are motivated to lose oneself in the subject retain a deep interest in human destructiveness, malevolence and hate, significant themes pointing at threatening prospects for mankind. The text is organized or divided into four main ordinary chapters, the three first of them organized or divided into continuous and numbered sections. A crucial point or question is of cause how to define evil itself. It can of cause be done both intentional, instrumental and by consequence. Other theorists however have stated that the concept of evil exclusively rests on a myth originated in the Judean-Christian conception of Satan and ultimate evil. This last argument presupposes evil itself as non-existent in the real rational world. It seems however a fact that most people attach certain basic meaning to the concept, mainly that it represents ultimately bad and terrible actions and behaviour directed toward common people for the purpose of bringing upon them ultimate pain and suffer. However, there is no room for essentialism here, meaning that we simply can look “inside” some original matter to get to know what it “really” is. Rather, a phenomenon gets its identity from the constituted meaning operating within a certain human communities and contexts loaded with intentionality and inter-subjective meaning. As mentioned above, the concept of evil can be interpreted both instrumental and intentional, the first being the broadest of them. Here evil stands for behaviour and human deeds having terrifying or fatal consequences for subjects and people or in general, regardless of the intentions behind. The intentional interpretation however, links the concept to certain predispositions, characteristics and even strong motives in subjects, groups and sometimes political systems and nations. I will keep in mind and clear the way for both these perspectives for the discussion in prospect. This essay represents a psychological perspective on evil, but makes it clear that a more or less complete account of such a psychological view also should include a thorough understanding or integration of some basic social and even biological assumptions. However, I consider a social psychological position of significant importance, especially because in my opinion it represents some sort of coordination of knowledge and theoretical perspectives inherent in the subject or problem itself, the main task here being to integrate perspectives of a psychological as well as social and biological kind. Since humans are essential social creatures, the way itself to present knowledge concerning the human condition, must be social of some sort and kind, however not referring to some kind of reductionism where social models of explanation possess or holds monopoly. Social and social psychological perspectives itself represents parts of the whole matter regarding understanding and explanation of human evil. The fact that humans present, or has to represent themselves as humans among other humans, means that basically a social language is required both to explain and describe human manners and ways of being. This then truly represents its own way or, more correctly, level or standard of explanation, which makes social psychology some sort of significant, though not sufficient. More substantial, the vision itself of integrating different ontological and theoretical levels and objects of science for the purpose of manifesting or make real a full-fledged psychological perspective on evil, should be considered or characterized a meta-psychological perspective. The text is partially constructed as a review of existing theories and theorists concerning the matter of evil and logically associated themes such as violence, mass murder, genocide, antisocial behaviour in general, aggression, hate and cruelty. However, the demands of making a theoretical distinction between these themes, although connected, is stressed. Above all, an integral perspective combining different scientific disciplines is aimed at.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bit-level' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography