We should do that. Come up with a challenge and see who can solve it in the
least number of symbols. Everybody shares their solution, and we all can
learn little shortcuts and such from each other.
toggle quoted message
Show quoted text
On Sat, Apr 21, 2012 at 2:36 PM, Chip <cfm@...> wrote:
Yeah - I've been digging this! Nice work guys... :)
- Chip
--- In Crestron@..., Eric Walters <sentry07@...> wrote:
Thank you for participating in this week's "Can It Be Done In SIMPL"
challenge. Stay tuned for next week's challenge.
On Sat, Apr 21, 2012 at 12:12 PM, Kool-Aid Drinker <
crug@...> wrote:
Nice. I ended up using the same number of symbols for a basic version,
but saved a crap-ton on digital signals.
Four SUB$ also looks better in terms of when to send the checksum (if
you're into that whole automatic send thing). Currently, I'm sending
it 1 tick after the string arrives, having no easy way to tell when
processing is done. Adding SAW pulses to the outputs of the SUB$ would
let you determine the last character was processed.
On Sat, 21 Apr 2012 11:04:22 -0700, Eric Walters <sentry07@...>
wrote:
If you want less moving parts, 4 SUB$ in 2 pairs will break your
string
into even and odd bytes. One SUB$ with parameters (1,1) goes into a
STOA,
the other SUB$ with parameters (2,100) feed the other set of SUB$. So
when
you get a string in, it hits one pair of SUB$. They push one byte into
your
logic, and the rest of the string to the other set. They push one byte
into
logic and the rest of the string back to the first two. I had gotten
that
far and put in the ATODs, XORs, and DTOAs to do the XOR logic, but the
SUB$
were getting too much priority over the XOR logic and nothing was
getting
calculated.
On Sat, Apr 21, 2012 at 6:45 AM, Kool-Aid Drinker <
crug@...
wrote:
Yup. It expects the string to be checksummmed to arrive whole, and
then deals however many bytes are in that serial signal.
Having the string arrive in pieces would require extra logic, but
should be do-able.
Basic idea is: SIO and INIT break the string into analog bytes,
TOGGLE
and ABUFs sort them into even and odd, ATOD decomposes the bytes,
XORs
do the deed, DFFs keeps the running total, DTOA, ATOS, blah blah
blah.
On Sat, 21 Apr 2012 08:03:57 -0000, "Chip" <cfm@...> wrote:
Did that account for messages of varying lengths?
- Chip
--- In Crestron@..., Kool-Aid Drinker <crug@> wrote:
Only took 51 symbols for a basic version of the checksum that
started
the thread.
------------------------------------
Check out the Files area for useful modules, documents, and drivers.
A contact list of Crestron dealers and programmers can be found in the
Database area.
Yahoo!
Groups Links
------------------------------------
Check out the Files area for useful modules, documents, and drivers.
A contact list of Crestron dealers and programmers can be found in the
Database area.
Yahoo!
Groups Links
