chegg ARM $32-$bit microcontrollers have a $32-$bit CPU and a $32-$bit memory address. The $32-$bit address can reference $2^32=4$ GB of memory, which is far more memory than a microcontroller usually has. Therefore, there is an abundance of unused addresses, which has inspired the bit$-$banding technique. Modifying a single bit in the memory takes three assembly instructions, e$.$g$.($load$-$OR$-$store to set a bit$).$ There is interest in making this type of operation faster since it$$s used frequently. The bit$-$banding technique takes unused addresses and maps them to bits of a variable. As shown below, the variable Data is at address $100.$ Accessing address $100$ references the whole $8$ bits in Data. The bit$-$banding technique takes the non$-$used addresses in the $2000$ range and maps them to individual bits of Data. That is$,$ address $2000$ maps to bit #$0$ of Data, address $2001$ maps to bit #$1$ of Data, etc. With this technique, the load$-$OR store operation to modify a bit can be reduced to a store operation. Writing $1$ to address $2000$ results in writing $1$ to bit #$0$ of Data, leaving the other bits unchanged.