December 12, 2015 by Chris on Web Bookmarks

Bookmarks for December 11th through December 12th

These are my links for December 11th through December 12th:

December 1, 2015 by Chris on Web Bookmarks

Bookmarks for December 1st

November 30, 2015 by Chris on Web Bookmarks

Tutorials on Digital Communications Engineering | Complex To Real – <blockquote>Tutorials on Digital Communications Engineering – Tutorial 1 – Basic concepts in signal analysis, power, energy and spectrum Tutorial 2 – What is Differential Phase Shift Keying Tutorial 3 …</blockquote>
DIYDSP – Electronic Music Instruments – <blockquote>This is where is all starts. | Powered by liveSite @ http://www.camelback.net</blockquote>
dspGuru.com | Digital Signal Processing Central –
On Radical Candor | Hacker News –
Radical Candor — The Surprising Secret to Being a Good Boss | First Round Review – <blockquote>Kim Scott cut her teeth as a manager at Apple and Google, and now helps create great leaders as an author and coach for companies like Twitter. Here's the secret that's made all the difference for her.</blockquote>

November 25, 2015 by Chris on Web Bookmarks

November 18, 2015 by Chris on Web Bookmarks

These are my links for July 20th through July 24th:

Ask HN: Best-architected open-source business applications worth studying? | Hacker News -
Monospaced Programming Fonts with Ligatures | Hacker News -
The language of choice - Propositional logic was discovered by Stoics around 300 B.C., only to be abandoned in later antiquity and rebuilt in the 19th century by George Boole’s successors. One of them, Charles Peirce, saw its significance for what we now call logic circuits, yet that discovery too was forgotten until the 1930s. In the ’50s John McCarthy invented conditional expressions, casting the logic into the form we’ll study here; then in 1986 Randal Bryant repeated one of McCarthy’s constructions with a crucial tweak that made his report “for many years the most cited paper in all of computer science, because it revolutionized the data structures used to represent Boolean functions” (Knuth).1 Let’s explore and code up some of this heritage of millennia, and bring it to bear on a suitable challenge: playing tic-tac-toe.
Then we’ll tackle a task that’s a little more practical: verifying a carry-lookahead adder circuit. Supposedly logic gets used all the time for all kinds of serious work, but for such you’ll have to consult the serious authors; what I can say myself, from working out the code to follow, is that the subject offers a fun playground plus the most primitive form of the pun between meaning and mechanism.

You’re encouraged to read with this article’s code cloned and ready