LoRa Unlicensed Band

 https://makersportal.com/blog/2019/10/5/arduino-lora-network

https://www.digikey.com/en/articles/unlicensed-915-mhz-band-fits-many-applications-and-allows-higher-transmit-power
"FCC regulations for the 915-MHz ISM band, for example, place no restrictions on type of application or duty cycle."

Follow-Up with Compiler Thoughts for mm-ADTdocs

Original:
http://raptorlicious.blogspot.com/2020/06/i-glanced-at-mm-adt-docs-and-started.html

https://www.youtube.com/channel/UCSX3MR0gnKDxyXAyljWzm0Q
Computer Science 

Assembler and gdb

https://tldp.org/HOWTO/html_single/Assembly-HOWTO/

https://www.gnu.org/software/gdb/


Dr. Martin J.M. Codrington
https://www.youtube.com/channel/UCsVxr0vvJlUaKxRoCmg5FcQ

CQL:
https://www.youtube.com/channel/UCsVxr0vvJlUaKxRoCmg5FcQ

Bartosz Milewski:
https://www.youtube.com/channel/UC8BtBl8PNgd3vWKtm2yJ7aA

Topos:
https://www.youtube.com/channel/UCxUZjZaLPsHPlp8AtkSBZiA

Mathématiques et programmation:
https://www.youtube.com/channel/UC1LQmyz-CJ7RYWVtkmcHr8g

Fun(c)tional Programming Group:
https://www.youtube.com/channel/UCZ9Qv0y5IS-0DsN4ZDTDyqA

Hackers at Cambridge
https://www.youtube.com/channel/UCNY6ekV9z84ZYL4qUDusTFw

Tutorials Point (India) Ltd.
https://www.youtube.com/channel/UCVLbzhxVTiTLiVKeGV7WEBg

Theory of Computation & Automata Theory

Change Bit Field Order

 ardunioCode_flippedBitFields

compare to floatToIEEE754Binary.h and floatToIEEE754Binary.c in https://github.com/bshambaugh/changearray/tree/master/src

Working on understanding GNU Make

Start with the files:

a.c a.h b.c b.h c.c c.h d.c

Create the object files by compiling and assembling:

gcc -c a.c   ==> a.o

gcc -c b.c  ==> b.o

gcc -c c.c  ==> c.o

gcc -c d.c  ==> d.o

Link all of the files:

gcc -o output *.o  ==> output

Files:

a.c
#include "a.h"

int add(int a, int b)
{
    return a + b;
}

a.h
int add(int a, int b);

b.c
#include "b.h"

int multiply(int a, int b)
{
    return a * b;
}

b.h
int multiply(int a, int b);

c.c
#include "c.h"

int merge(int a, int b)
{
    return multiply(a,b) / multiply(a,b);
}

c.h
#include "a.h"
#include "b.h"

int merge(int a, int b);

d.c
#include "c.h"
#include <stdio.h>

int main()
{
   int a = 121;
   int b = 5;
   int c = merge(a,b);
   printf("here is the merge %d\n",c);
}

How do I build a makefile that does this???

Makefile:

d : a.o b.o c.o d.o
    cc -o d a.o b.o c.o d.o
a.o : a.c a.h
    cc -c a.c
b.o : b.c b.h
    cc -c b.c
c.o : c.c a.o b.o
    cc -c c.c
d.o : d.c c.o
    cc -c d.c

Commands followed to compile:

make

++++++++++++++++++++++++++++++++++

use make test:

https://stackoverflow.com/questions/4927676/implementing-make-check-or-make-test

compiling multiple c files for ardunio

compiling multiple c files....

For Ardunio?
It says to get make to do it.

or I might need to compile all of the files

https://www.cs.utah.edu/~zachary/isp/tutorials/separate/separate.html

Calloc notes ... looking for using calloc with struct...

 https://dyclassroom.com/c/c-dynamic-memory-allocation-calloc-function

selecting bits selectively from the float

After discovering bit fields for discovering the bits of the ieee754 representation:
https://www.geeksforgeeks.org/program-for-conversion-of-32-bits-single-precision-ieee-754-floating-point-representation/
uses binary right shift operator:
https://www.tutorialspoint.com/cprogramming/c_bitwise_operators.htm

I developed my algorithm:
https://gist.github.com/bshambaugh/fab368ae62da5f326b8876005de710d8 by watching:
https://www.youtube.com/watch?reload=9&v=8afbTaA-gOQ

But Now that I know about bit fields, I see them everywhere:
https://www.tutorialspoint.com/cprogramming/c_bit_fields.htm
https://www.cs.yale.edu/homes/aspnes/pinewiki/C(2f)FloatingPoint.html

Perhaps the computer represents things in IEEE754, and since unions have one location in memory then setting up bit fields in the union exposes the bits selectively from the float