ARM下 Implement matrix multiplication of 2 square matrices, with data read from an input file and printed both to the console and to an Output file.
• Assume a file with correct data (no garbage, characters, etc.).
• you must check and provide appropriate execution for 2 extra cases, namely when the matrix size given is either “0” , or when the size is greater than the maximum handled of “5” . In these 2 cases you must implement the following behaviour:
o If size = 0, then print a message “Size = 0 is unacceptable” and continue by reading the
next size for the next 2 matrices (if not end of file).
o If size >5, then print two messages: “Size is too big - unacceptable”. Then read and
discard the next (size2 ) integers and continue by reading the next size for the next 2 matrices (if not end of file).
簡(jiǎn)單混合衰落信道
This mfile inputs an unmodulated sinewave through a simple Rayleigh two path fading channel and shows the Output with phase, gain, and attenuation characteristics via animation.
數(shù)字運(yùn)算，判斷一個(gè)數(shù)是否接近素?cái)?shù)
A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum of its digits divides its value.
Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not.
Input
Each line of input contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone.
Output
For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise.
Sample Input
10 111
2 110
10 123
6 1000
8 2314
0
Sample Output
yes
yes
no
yes
no
2^x mod n = 1 acm競(jìng)賽題 Give a number n, find the minimum x that satisfies 2^x mod n = 1.
Input
One positive integer on each line, the value of n.
Output
If the minimum x exists, print a line with 2^x mod n = 1.
Print 2^? mod n = 1 otherwise.
You should replace x and n with specific numbers.
Sample Input
2
5
Sample Output
2^? mod 2 = 1
2^4 mod 5 = 1
Frequency Scale Conversion
From f To f Scale
frq2mel mel2frq mel The mel scale is based on the human perception of sinewave pitch.
frq2erb erb2frq erb The erb scale is based on the equivalent rectangular bandwidths of the human ear.
frq2midi midi2frq midi The midi standard specifies a numbering of semitones with middle C being 60. They can use the normal equal tempered scale or else the pythagorean scale of just intonation. They will in addition Output note names in a character format.
Routine mampres: To obtain amplitude response from h(exp(jw)).
input parameters:
h :n dimensioned complex array. the frequency response is stored
in h(0) to h(n-1).
n :the dimension of h and amp.
fs :sampling frequency (Hz).
iamp:If iamp=0: The Amplitude Res. amp(k)=abs(h(k))
If iamp=1: The Amplitude Res. amp(k)=20.*alog10(abs(h(k))).
Output parameters:
amp :n dimensioned real array. the amplitude-frequency response is
stored in amp(0) to amp(n-1).
Note:
this program will generate a data file "filename.dat" .
in chapter 2
Routine mar1psd: To compute the power spectum by AR-model parameters.
Input parameters:
ip : AR model order (integer)
ep : White noise variance of model input (real)
ts : Sample interval in seconds (real)
a : Complex array of AR parameters a(0) to a(ip)
Output parameters:
psdr : Real array of power spectral density values
psdi : Real work array
in chapter 12
