Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: assembly language

Sortuj według:

Ogranicz wyniki do:

Pure Infinitely Self-Modifying Code is Realizable and Turing-complete

Morse G.

International Journal of Electronics and Telecommunications

2018

Vol. 64, No. 2

123--129

Although self-modifying code has been shyed away from due to its complexity and discouragement due to safety issues, it nevertheless provides for a very unique obfuscation method and a different perspective on the relationship between data and code. The generality of the von Neumann architecture is hardly realized by today’s processor models. A code-only model is shown where every instruction merely modifies other instructions yet achieves the ability to compute and Turing machine operation is easily possible.

Propozycja metody mnożenia liczb ze znakiem

Gryś S.

Metody Informatyki Stosowanej

2009

nr 1 (18)

15-27

Niniejszy artykuł poświęcono programowym rozwiązaniom operacji mnożenia, przeznaczonym do implementacji w relatywnie prostych systemach wbudowanych wyposażonych w 8/16 bitowe mikroprocesory, które nie posiadają w liście rozkazów mnożenia liczb ze znakiem. Reprezentantami tej grupy mikroprocesorów są m.in.: 8051, Freescale 68HC08 i HCS12, Atmel ATtiny, Zilog eZ8core!, STMicroelectronics ST7, Microchip PIC16/18, Texas Instruments MSP430, NEC 78K0S/0R i in.

An efficient technique of signed binary multiplication using unsigned multiply instruction was presented in this paper. A performance of the proposed technique was compared to the software emulated versions of classical techniques such as: radix-2 Booth method, reversal of sign method (negative to positive conversion) and sign extension method. Numerous examples were provided to show the efficiency of the technique in the context of practical software implementation. The proposed algorithm is suitable for embedded systems based on the widespread microprocessors/microcontrollers which have an unsigned multiplication in their instruction set but they lack signed multiply instruction. The sampies of code presenting the solutton of signed multiplication problem using various techniques were prepared in an assembly language for MCS 8051 compatible microcontroller. The comparison of the performance of algorithms was carried out als for 8051 core treated as reference microcontroller architecture but the obtained conclusions are potentially general and not only limited to this microcontroller.