X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=lfsr.c;h=df1fe31e796fd05f44fde1e1466fdef89a841f34;hb=f7fae2bd36a4187bc5b0954253466844c2f4ee2b;hp=492f3c6404ee768536ef8ab4d6084e05f054c142;hpb=9d4c7bd6457fefe258ee2163b0338dda515d2365;p=rgblamp.git

diff --git a/lfsr.c b/lfsr.c
index 492f3c6..df1fe31 100644
--- a/lfsr.c
+++ b/lfsr.c
@@ -37,13 +37,7 @@
  * This is a small, fast and efficient software implementation of a 16-bit
  * Linear Feedback Shift Register (LFSR).  It uses the Galois method to perform
  * the exclusive OR operations in parallel for improved performance over the
- * standard, or Fibonacci, method.  The algorithm also skips the exlusive or
- * operations if it doesn't need to do them, though on this uC the branch may
- * not generate a net performance increase over doing the exclusive or
- * operations every time.
- *
- * After rng returns, RNGLO and RNGHI contain the updated 16-bit random number.
- * RNGLO will contain a value $01-$FF, RNGHI will contain $00-$FF.
+ * standard, or Fibonacci, method.
  *
  * @author R. Steve McKown <rsmckown@gmail.com>
  */