Search - n2-1 - CodeBus

Search - n2-1 - List

[assembly language] Statistics DL : 0: 汇编语言，假设从变量Buff开始存放了13个字，编写一个程序统计出其正数、0和负数的个数，并把它们分别存入N1,N2和N3中，吴泽乐-Assembly language, assumed from the beginning Buff variables stored in 13 words, write a program out of its positive statistics, the number 0 and negative numbers, and put them separately into N1, N2 and N3, the WU Ze-Le
Date : 2026-01-09 Size : 2kb User :
[assembly language] Baseconversion DL : 0: Base n means that each place (x) in the number represents nx. (n0, n1, n2, n3, etc.) Valid digits in base n are 0 to n-1.When working with numbers in different bases a subscript is usually used to indicate the base (e.g. 25310 means 253 in base 10). We can represent any number in any base. The number will usually look different when expressed in another base, but its value is the same. When a number is stored in the computer’s memory, it has a specific value we can show it using base 10, base 2, base 16, etc., but the value never changes only the representation changes.-Base n means that each place (x) in the number represents nx. (n0, n1, n2, n3, etc.) Valid digits in base n are 0 to n-1.When working with numbers in different bases a subscript is usually used to indicate the base (e.g. 25310 means 253 in base 10). We can represent any number in any base. The number will usually look different when expressed in another base, but its value is the same. When a number is stored in the computer’s memory, it has a specific value we can show it using base 10, base 2, base 16, etc., but the value never changes only the representation changes.
Date : 2026-01-09 Size : 4kb User : mohammed fadhle
[assembly language] NO16 DL : 0: 变量Buff内存放了200个字，统计其中正数、0、负数的个数，并保存在N1、N2、N3中- Variable Buff storing 200 words, statistics of which positive, 0 negative number, and stored in the N1, N2, N3 in
Date : 2026-01-09 Size : 1kb User : submarry
[assembly language] (2) DL : 0: 用减奇数开平方运算 8086/8088指令系统中有乘除法指令但没有开平方指令，因此，开平方运算是通过程序来实现的。用减奇数法可求得近似平方根，获得平方根的整数部分。我们知道，N个自然数中的奇数之和等于N2 ，即： 1+3+5=32 1+3+5+7=16=42 1+3+5+7+9+11+13+15=64+82-Odd square root operation with reduced instruction set in 8086/8088 multiply and divide instructions, but no square root instruction, therefore, square root operation is achieved through the process. Reduction method can be obtained with approximate square root of the odd, the integer part to obtain the square root. We know, N a natural number equal to the sum of the odd N2, namely: 1+3+5 = 32 1+3+5+7 = 16 = 42 1+3+5+7+9+11+13+15 = 64+82
Date : 2026-01-09 Size : 4kb User : ada
[assembly language] bookperson DL : 0: 上述表达式中，FD是严格正交的，n1=n2= =1.FD STBC码的优势是通过条件检测可以大幅度降低译码复杂度，例如，一个FD码的译- (STBCs) suffer from a prohibitively high decoding complexity unless the low-complexity decodability property is taken into consideration in the STBC design. For this purpose, several families of STBCs that involve a reduced decoding complexity have been
Date : 2026-01-09 Size : 4kb User : lixuan
[assembly language] tiaohefenxi DL : 0: 利用 MSf，Q1，O1，K1，MS4，M6，N2，M2，S2，MK3，M4，P1，K2共13个分潮进行调和分析，计算调和常数。-Use MSf, Q1, O1, K1, MS4, M6, N2, M2, S2, MK3, M4, P1, K2 of 13 tidal harmonic analysis to calculate the harmonic constants.
Date : 2026-01-09 Size : 4kb User : ouc
[assembly language] count DL : 0: 数组SCORE中存有英语成绩，按照0~59,60~74,75~84,85~100统计各分数段人数，存入N0，N1，N2，N3变量内-SCORE array of English achievement there, according to the 0 to 59, 60 ~ 74 and 75 ~ 84 and 85 ~ 100 count the number of the fraction of the deposited N0, N1, N2, N3 in the variable
Date : 2026-01-09 Size : 9kb User : wqq
[assembly language] Subroutine DL : 0: 汇编语言，用子程序实现。数组SCORE中存有英语成绩，按照0~59,60~74,75~84,85~100统计各分数段人数，存入N0，N1，N2，N3变量内。-Assembly language, using subroutines. SCORE array of English achievement there, according to the 0 to 59, 60 ~ 74 and 75 ~ 84 and 85 ~ 100 count the number of the fraction of the deposited into N0, N1, N2, N3 variables.
Date : 2026-01-09 Size : 9kb User : wqq
[assembly language] STC_FFT DL : 0: 快速傅里叶变换法（FFT）是离散傅立叶变换的一种快速计算方法，它能使N点DFT的乘法计算量由N2 次降为次。下图是采样点数为8点FFT时间抽取算法信号流图，本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. The following figure is the sampling point of 8 points FFT time extraction algorithm signal flow diagram, the program is also designed in this form.
Date : 2026-01-09 Size : 4kb User : lqs