|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Redirect|LFSR|the airport using that ICAO code|Reims – Champagne Air Base}}
| | Results 1 - 15 of about a hundred for rims and tires on the market in houston Results 1 - 15 of about 100 for used cars for sale by proprietor Outcomes 1 - 15 of about one hundred for rims on the market craigslist advert Outcomes 1 - 15 of about one hundred for used tire changers for sale Outcomes 1 - 15 of about a hundred for low profile tires on the market We have now m embers with the following tools for sale. Please click on Outcomes 1 - 15 of about one hundred for alignment machine for sale Outcomes 1 - 15 of about 100 for excessive 4x4 for sale<br><br>Does that mean you must immediately swap to winter tires as soon as the season sets in? Well, not fairly, all-season tires do perform fairly effectively till the temperature drops to 44ºF or 7°C. So, before it becomes too chilly and chilly, simply undergo this transient guide by Buzzle, and get a pair or two of winter tires for your vehicle. There are principally three sorts of winter tires―snow tires, ice tires, and studded tires. Winter tires can be found in a large value vary, and it's best to have your specific necessities in form before you get one, to profit from your cash. Whereas most budget tires price no more than USD 100, some premium manufacturers come for anything close to USD one hundred fifty. Custom wheels and tires plus fast transport = One Low Price! The Proper Truck Tire<br><br>The tire sale banner that hangs exterior on the tire retailer building may be produced from vinyl. The banner will face up to water, rain, snow, sleet and wind. If you liked this write-up and you would like to receive a lot more data with regards to [http://ow.ly/AhDNp lifespan of the tire] kindly take a look at our own internet site. The banner will stand up to poor climate conditions even better if the sides of the banner are hemmed. Hemming it can assist the perimeters to not fray. Some retail tire establishments also provide used tires Look over carefully any used tire offered to you. Pay shut attention to the tread, and check the sidewalls of the tires for any form of damage like a reduce or a bubbled space. As you understand, truck tires are costly, and shopping for used could well prevent some cash. Many of these tires are offered by people who love their autos a lot that they mostly desire new tires different options for Outdated Tires The Results of Mud Tires<br><br>It's possible you'll come to know that a used golf cart is for sale by your personal contacts. Have a look at the car. Attempt to work together with the proprietor to know about the situation and efficiency of the cart. If doable check experience it. If the vehicle's performance is already known to you, then will probably be a deciding think about your choice to purchase it. You may as well inquire if any of the golf programs, airports or resorts close to your town is changing its fleet.<br><br>Model All COOPER TIRES DELINTE TIRES DICK CEPEK TIRES FALKEN TIRES FEDERAL TIRES FUZION TIRES GOODRIDE TIRES GT RADIAL TIRES HANKOOK TIRES MICKEY THOMPSON TIRES MULTI-MILE TIRES NANKANG TIRES NEXEN TIRES NITTO TIRES NOKIAN TIRES SAILUN TIRES SIGMA TIRES STARFIRE TIRES SUMITOMO TIRES TOYO TIRES VOGUE TIRES VREDESTEIN TIRES Treadwidth 225 135 a hundred forty five one hundred fifty five one hundred sixty five 175 185 195 205 215 225 235 245 255 265 275 285 295 305 315 325 335 345 27 30 31 32 33 34 35 36 37 38 6.50 6.70 7.00 7.50 8 eight.00 eight.seventy five 9.00 9.50 12 Profile 60 25 30 35 40 45 50 fifty five 60 sixty five 70 75 80 eighty five 9.50 10.50 eleven.50 12.50 thirteen.50 14.50 15.50 Rim size sixteen 12 thirteen 14 15 16 16.5 17 18 19 19.5 20 21 22 23 24 26 28 Winter Tires Only<br><br>Conrad's is likely one of the largest tire shops in the nation, and carries over 50,000 tires in inventory. So, even if you'd like a specialty tire or an uncommon measurement, you will find them at Conrad's. Changed authentic tires with Cooper CS4 tires. Noise degree virtually vanished. I'm extraordinarily happy and nicely glad as the Cooper CS4 tires far exceed my expectations. I extremely recommend these tires for any SUV automobile." So far total the tires are good tires for the cost." - WEST BABYLON, NY Read the other articles from Joko H E Saputro, to know extra about Boat Trailer Tires at -trailer- tirescom/boat-trailer- tires And you can too discover one other associated articles about it at -trailer- tirescom Can You Put 15-Inch Tires & Rims on a Automotive That Has sixteen-Inch? Making Radial Tires<br><br>I f for any motive the tire is flawed; we will cowl any defect below normal wear and tear situation. We are going to ship a substitute, or refund the purchase if we should not have a alternative in stock, we will difficulty a full refund. This is applicable to make use of tires only. In case you'll want to order pre-owned tires online, just remember to ask the vendor to ship you detailed footage of the products, so that you can choose the condition of the tires, and if they are really ok. Finding quality tires is usually a tricky alternative, their are quite a lot of choices to choose from and you may not know the proper alternative, hopefully this article may also help read extra Tire alternative/reimbursement outside of 25-mile radius of the Sallas Auto Repair locations. Tire placement and rotation<br><br>The 2009 Subaru WRX on the market is the proper alternative for the driving force looking for four-door sport and fun with out paying a premium. The WRX isn't exactly cheap, however most comparables are at a a lot higher price level. The 2010 mannequin that adopted was only a minor revision on that 2009 success, and the upcoming 2011 mannequin seems to be extra of the identical. If the 2008 WRX was the last one you check-drove, you owe it to your automobile-loving self to offer it one other chance. In regards to the Writer |
| {{Refimprove|date=March 2009}}
| |
| {{More footnotes|date=April 2009}}
| |
| | |
| [[Image:LFSR-F4.GIF|thumb|right|501 px|A 4-bit Fibonacci LFSR with its state diagram. The [[XOR gate]] provides feedback to the register that shifts bits from left to right. The maximal sequence consists of every possible state except the "0000" state.]]
| |
| | |
| In [[computing]], a '''linear-feedback shift register''' (LFSR) is a [[shift register]] whose input bit is a [[Linear#Boolean functions|linear]] function of its previous state.
| |
| | |
| The most commonly used [[Linear#Boolean functions|linear]] function of single bits is XOR. Thus, an LFSR is most often a shift register whose input bit is driven by the [[exclusive-or]] (XOR) of some bits of the overall shift register value.
| |
| | |
| The initial value of the LFSR is called the seed, and because the operation of the register is deterministic, the stream of values produced by the register is completely determined by its current (or previous) state. Likewise, because the register has a finite number of possible states, it must eventually enter a repeating cycle. However, an LFSR with a [[Primitive polynomial (field theory)|well-chosen feedback function]] can produce a sequence of bits which appears random and which has a [[Maximal length sequence|very long cycle]].
| |
| | |
| Applications of LFSRs include generating [[Pseudorandomness|pseudo-random numbers]], [[Pseudorandom noise|pseudo-noise sequences]], fast digital counters, and [[Scrambler|whitening sequences]]. Both hardware and software implementations of LFSRs are common.
| |
| | |
| The mathematics of a [[cyclic redundancy check]], used to provide a quick check against transmission errors, are closely related to those of an LFSR.
| |
| | |
| == Fibonacci LFSRs ==
| |
| [[Image:LFSR-F16.gif|thumb|right|351 px|A 16-bit Fibonacci LFSR. The feedback tap numbers in white correspond to a primitive polynomial in the table so the register cycles through the maximum number of 65535 states excluding the all-zeroes state. The state shown, 0xACE1 ([[hexadecimal]]) will be followed by 0x5670. ]] | |
| The bit positions that affect the next state are called the taps. In the diagram the taps are [16,14,13,11]. The rightmost bit of the LFSR is called the output bit. The taps are XOR'd sequentially with the output bit and then fed back into the leftmost bit. The sequence of bits in the rightmost position is called the output stream.
| |
| * The bits in the LFSR state which influence the input are called ''taps'' (white in the diagram).
| |
| * A maximum-length LFSR produces an [[maximum length sequence|m-sequence]] (i.e. it cycles through all possible 2<sup>''n''</sup> − 1 states within the shift register except the state where all bits are zero), unless it contains all zeros, in which case it will never change.
| |
| * As an alternative to the XOR based feedback in an LFSR, one can also use [[XNOR]].<ref>[http://www.xilinx.com/support/documentation/application_notes/xapp210.pdf Linear Feedback Shift Registers in Virtex Devices]</ref> This function is an [[affine transformation|affine map]], not strictly a [[linear map]], but it results in an equivalent polynomial counter whose state of this counter is the complement of the state of an LFSR. A state with all ones is illegal when using an XNOR feedback, in the same way as a state with all zeroes is illegal when using XOR. This state is considered illegal because the counter would remain "locked-up" in this state.
| |
| | |
| The sequence of numbers generated by an LFSR or its XNOR counterpart can be considered a [[binary numeral system]] just as valid as [[Gray code]] or the natural binary code.
| |
| <!-- perhaps this statement should be moved to the [[binary numeral system]] article ? -->
| |
| | |
| The arrangement of taps for feedback in an LFSR can be expressed in [[finite field arithmetic]] as a [[polynomial]] [[modular arithmetic|mod]] 2. This means that the coefficients of the polynomial must be 1's or 0's. This is called the feedback polynomial or reciprocal characteristic polynomial. For example, if the taps are at the 16th, 14th, 13th and 11th bits (as shown), the feedback polynomial is
| |
| | |
| :<math>x^{16} + x^{14} + x^{13} + x^{11} + 1.\,</math>
| |
| | |
| The 'one' in the polynomial does not correspond to a tap — it corresponds to the input to the first bit (i.e. ''x<sup>0</sup>'', which is equivalent to 1). The powers of the terms represent the tapped bits, counting from the left. The first and last bits are always connected as an input and output tap respectively.
| |
| | |
| The LFSR is maximal-length if and only if the corresponding feedback polynomial is [[primitive polynomial (field theory)|primitive]]. This means that the following conditions are necessary (but not sufficient):
| |
| * The number of taps should be [[Even and odd numbers|even]].
| |
| * The set of taps — taken all together, ''not'' pairwise (i.e. as pairs of elements) — must be [[relatively prime]]. In other words, there must be no divisor other than 1 common to all taps.
| |
| | |
| Tables of primitive polynomials from which maximum-length LFSRs can be constructed are given below and in the references.
| |
| | |
| There can be more than one maximum-length tap sequence for a given LFSR length. Also, once one maximum-length tap sequence has been found, another automatically follows. If the tap sequence, in an ''n''-bit LFSR, is [''n'', ''A'', ''B'', ''C'', 0], where the 0 corresponds to the ''x''<sup>0</sup> = 1 term, then the corresponding 'mirror' sequence is [''n'', ''n'' − ''C'', ''n'' − ''B'', ''n'' − ''A'', 0]. So the tap sequence [32, 7, 3, 2, 0] has as its counterpart [32, 30, 29, 25, 0]. Both give a maximum-length sequence.
| |
| | |
| Some example C code is below:
| |
| | |
| <source lang="c">
| |
| # include <stdint.h>
| |
| int main(void)
| |
| {
| |
| uint16_t lfsr = 0xACE1u;
| |
| unsigned bit;
| |
| unsigned period = 0;
| |
| | |
| do
| |
| {
| |
| /* taps: 16 14 13 11; feedback polynomial: x^16 + x^14 + x^13 + x^11 + 1 */
| |
| bit = ((lfsr >> 0) ^ (lfsr >> 2) ^ (lfsr >> 3) ^ (lfsr >> 5) ) & 1;
| |
| lfsr = (lfsr >> 1) | (bit << 15);
| |
| ++period;
| |
| } while(lfsr != 0xACE1u);
| |
| | |
| return 0;
| |
| }
| |
| </source>
| |
| | |
| The above code assumes the most significant bit of <code>lfsr</code> is bit 1, and the least significant bit is bit 16.
| |
| | |
| As well as ''Fibonacci'', this LFSR configuration is also known as '''standard''', '''many-to-one''' or '''external XOR gates'''. LFSR has an alternative configuration.
| |
| | |
| == Galois LFSRs ==
| |
| Named after the French mathematician [[Évariste Galois]], an LFSR in Galois configuration, which is also known as '''modular''', '''internal XORs''' as well as '''one-to-many LFSR''', is an alternate structure that can generate the same output stream as a conventional LFSR (but offset in time).<ref>
| |
| {{cite book
| |
| |last1 = Beker
| |
| |first1 = Henry
| |
| |last2 = Piper
| |
| |first2 = Fred
| |
| | title = Cipher Systems: The Protection of Communications
| |
| |publisher = [[Wiley-Interscience]]
| |
| |year = 1982
| |
| |page = 212}}</ref> In the Galois configuration, when the system is clocked, bits that are not taps are shifted one position to the right unchanged. The taps, on the other hand, are XOR'd with the output bit before they are stored in the next position. The new output bit is the next input bit. The effect of this is that when the output bit is zero all the bits in the register shift to the right unchanged, and the input bit becomes zero. When the output bit is one, the bits in the tap positions all flip (if they are 0, they become 1, and if they are 1, they become 0), and then the entire register is shifted to the right and the input bit becomes 1.
| |
| | |
| [[Image:LFSR-G16.gif|thumb|right|393 px|A 16-bit Galois LFSR. The register numbers in white correspond to the same primitive polynomial as the Fibonacci example but are counted in reverse to the shifting direction. This register also cycles through the maximal number of 65535 states excluding the all-zeroes state. The state ACE1 hex shown will be followed by E270 hex.]]
| |
| | |
| To generate the same output stream, the order of the taps is the ''counterpart'' (see above) of the order for the conventional LFSR, otherwise the stream will be in reverse. Note that the internal state of the LFSR is not necessarily the same. The Galois register shown has the same output stream as the Fibonacci register in the first section. A time offset exists between the streams, so a different startpoint will be needed to get the same output each cycle.
| |
| * Galois LFSRs do not concatenate every tap to produce the new input (the XOR'ing is done within the LFSR and no XOR gates are run in serial, therefore the propagation times are reduced to that of one XOR rather than a whole chain), thus it is possible for each tap to be computed in parallel, increasing the speed of execution.
| |
| * In a software implementation of an LFSR, the Galois form is more efficient as the XOR operations can be implemented a word at a time: only the output bit must be examined individually.
| |
| | |
| Below is a code example of a 32-bit maximal period Galois LFSR that is valid in [[C (programming language)|C]]:
| |
| <source lang="c">
| |
| # include <stdint.h>
| |
| int main(void)
| |
| {
| |
| uint32_t lfsr = 1;
| |
| unsigned period = 0;
| |
| | |
| do
| |
| {
| |
| /* taps: 32 31 29 1; feedback polynomial: x^32 + x^31 + x^29 + x + 1 */
| |
| lfsr = (lfsr >> 1) ^ (-(lfsr & 1u) & 0xD0000001u);
| |
| ++period;
| |
| } while (lfsr != 1u);
| |
| | |
| return 0;
| |
| }
| |
| </source>
| |
| | |
| And here is the code for the 16 bit example in the figure
| |
| | |
| <source lang="c">
| |
| # include <stdint.h>
| |
| int main(void)
| |
| {
| |
| uint16_t lfsr = 0xACE1u;
| |
| unsigned period = 0;
| |
| | |
| do
| |
| {
| |
| /* taps: 16 14 13 11; feedback polynomial: x^16 + x^14 + x^13 + x^11 + 1 */
| |
| lfsr = (lfsr >> 1) ^ (-(lfsr & 1u) & 0xB400u);
| |
| ++period;
| |
| } while (lfsr != 0xACE1u);
| |
| | |
| return 0;
| |
| }
| |
| </source>
| |
| | |
| These code examples create a toggle mask to apply to the shifted value using the XOR operator. The mask is created by first removing all but the least significant bit (the output bit) of the current value. This value is then negated ([[two's complement]] negation), which creates a value of either all 0s or all 1s, if the output bit is 0 or 1, respectively. By ANDing the result with the tap-value (e.g., 0xB400 in the second example) before applying it as the toggle mask, it acts functionally as a conditional to either apply or not apply the toggle mask based on the output bit. A more explicit but significantly less efficient code example is shown below.
| |
| | |
| <source lang="c">
| |
| # include <stdint.h>
| |
| int main(void)
| |
| {
| |
| uint16_t lfsr = 0xACE1u;
| |
| unsigned period = 0;
| |
| | |
| do
| |
| {
| |
| unsigned lsb = lfsr & 1; /* Get lsb (i.e., the output bit). */
| |
| lfsr >>= 1; /* Shift register */
| |
| if (lsb == 1) /* Only apply toggle mask if output bit is 1. */
| |
| lfsr ^= 0xB400u; /* Apply toggle mask, value has 1 at bits corresponding
| |
| * to taps, 0 elsewhere. */
| |
| ++period;
| |
| } while (lfsr != 0xACE1u);
| |
| | |
| return 0;
| |
| }
| |
| </source>
| |
| | |
| === Non-binary Galois LFSR ===
| |
| Binary Galois LFSRs like the ones shown above can be generalized to any ''q''-ary alphabet {0, 1, ..., ''q'' − 1} (e.g., for binary, ''q'' is equal to two, and the alphabet is simply {0, 1}). In this case, the exclusive-or component is generalized to addition [[Modular arithmetic|modulo]]-''q'' (note that XOR is addition modulo 2), and the feedback bit (output bit) is multiplied (modulo-''q'') by a ''q''-ary value which is constant for each specific tap point. Note that this is also a generalization of the binary case, where the feedback is multiplied by either 0 (no feedback, i.e., no tap) or 1 (feedback is present). Given an appropriate tap configuration, such LFSRs can be used to generate [[Finite field|Galois fields]] for arbitrary prime values of ''q''.
| |
| | |
| == Some polynomials for maximal LFSRs ==
| |
| The following table lists maximal-length polynomials for shift-register lengths up to 19. Note that more than one maximal-length polynomial may exist for any given shift-register length. A list of alternative maximal-length polynomials for shift-register lengths 4-32 (beyond which it becomes unfeasible to store or transfer them) can be found here: http://www.ece.cmu.edu/~koopman/lfsr/index.html
| |
| <!-- Since alternative polynomials are possible I have verified independently those tabulated here. ~~~~ -->
| |
| {|class="wikitable"
| |
| |-
| |
| !Bits
| |
| !Feedback polynomial
| |
| !Period
| |
| |-
| |
| !''n''
| |
| |
| |
| !<math>2^n - 1</math>
| |
| |-
| |
| ! 2
| |
| |<math>x^2 + x + 1</math>
| |
| | 3
| |
| |-
| |
| ! 3
| |
| |<math>x^3 + x^2 + 1</math>
| |
| | 7
| |
| |-
| |
| ! 4
| |
| |<math>x^4 + x^3 + 1</math>
| |
| | 15
| |
| |-
| |
| ! 5
| |
| |<math>x^{ 5 }+x^{ 3 }+1</math>
| |
| | 31
| |
| |-
| |
| ! 6
| |
| |<math>x^{ 6 }+x^{ 5 }+1</math>
| |
| | 63
| |
| |-
| |
| ! 7
| |
| |<math>x^{ 7 }+x^{ 6 }+1</math>
| |
| | 127
| |
| |-
| |
| ! 8
| |
| |<math>x^{ 8 }+x^{ 6 }+x^{ 5 }+x^{ 4 }+1</math>
| |
| | 255
| |
| |-
| |
| ! 9
| |
| |<math>x^{ 9 }+x^{ 5 }+1</math>
| |
| | 511
| |
| |-
| |
| ! 10
| |
| |<math>x^{ 10 }+x^{ 7 }+1</math>
| |
| | 1023
| |
| |-
| |
| ! 11
| |
| |<math>x^{ 11 }+x^{ 9 }+1</math>
| |
| | 2047
| |
| |-
| |
| ! 12
| |
| |<math>x^{ 12 }+x^{ 11 }+x^{ 10 }+x^{ 4 }+1</math>
| |
| | 4095
| |
| |-
| |
| ! 13
| |
| |<math>x^{ 13 }+x^{ 12 }+x^{ 11 }+x^{ 8 }+1</math>
| |
| | 8191
| |
| |-
| |
| ! 14
| |
| |<math>x^{ 14 }+x^{ 13 }+x^{ 12 }+x^{ 2 }+1</math>
| |
| | 16383
| |
| |-
| |
| ! 15
| |
| |<math>x^{ 15 }+x^{ 14 }+1</math>
| |
| | 32767
| |
| |-
| |
| ! 16
| |
| |<math>x^{ 16 }+x^{ 14 }+x^{ 13 }+x^{ 11 }+1</math>
| |
| | 65535
| |
| |-
| |
| ! 17
| |
| |<math>x^{ 17 }+x^{ 14 }+1</math>
| |
| | 131071
| |
| |-
| |
| ! 18
| |
| |<math>x^{ 18 }+x^{ 11 }+1</math>
| |
| | 262143
| |
| |-
| |
| ! 19
| |
| |<math>x^{ 19 }+x^{ 18 }+x^{ 17 }+x^{ 14 }+1</math>
| |
| | 524287
| |
| |-
| |
| !20-168
| |
| |[http://www.xilinx.com/support/documentation/application_notes/xapp052.pdf]
| |
| |
| |
| |-
| |
| !2-786,1024,2048,4096
| |
| |[http://www.eej.ulst.ac.uk/~ian/modules/EEE515/files/old_files/lfsr/lfsr_table.pdf]
| |
| |
| |
| |}
| |
| | |
| == Output-stream properties ==
| |
| * Ones and zeroes occur in 'runs'. The output stream 0110100, for example consists of five runs of lengths 1,2,1,1,2, in order. In one period of a maximal LFSR, 2<sup>''n'' −1</sup> runs occur (for example, a six bit LFSR will have 32 runs). Exactly half of these runs will be one bit long, a quarter will be two bits long, up to a single run of zeroes ''n'' − 1 bits long, and a single run of ones ''n'' bits long. This distribution almost equals the statistical [[Expected value|expectation value]] for a truly random sequence. However, the probability of finding exactly this distribution in a sample of a truly random sequence is rather low{{vague|date=April 2013}}.
| |
| * LFSR output streams are [[deterministic]]. If you know the present state as well as the positions of the XOR gates in the LFSR, you can predict the next state.<ref>http://www.xilinx.com/support/documentation/application_notes/xapp052.pdf</ref> This is not possible with truly random events. With minimal-length LFSRs, it is much easier to compute the next state, as there are only an easily limited number of them for each length.{{Clarify|reason=what is a "minimal-length" LFSR? That phrase does not appear in the Xilinx reference; neither does "limited" appear.|date=July 2013}}
| |
| * The output stream is reversible; an LFSR with mirrored taps will cycle through the output sequence in reverse order.
| |
| | |
| == Applications ==
| |
| LFSRs can be implemented in hardware, and this makes them useful in applications that require very fast generation of a pseudo-random sequence, such as [[direct-sequence spread spectrum]] radio. LFSRs have also been used for generating an approximation of [[white noise]] in various [[programmable sound generator]]s.
| |
| | |
| === Uses as counters ===
| |
| The repeating sequence of states of an LFSR allows it to be used as a [[clock divider]], or as a counter when a non-binary sequence is acceptable as is often the case where computer index or framing locations need to be machine-readable.<ref>http://www.xilinx.com/support/documentation/application_notes/xapp052.pdf</ref> LFSR [[counter]]s have simpler feedback logic than natural binary counters or [[Gray code]] counters, and therefore can operate at higher clock rates. However it is necessary to ensure that the LFSR never enters an all-zeros state, for example by presetting it at start-up to any other state in the sequence.
| |
| The table of primitive polynomials shows how LFSRs can be arranged in Fibonacci or Galois form to give maximal periods. One can obtain any other period by adding to an LFSR that has a longer period some logic that shortens the sequence by skipping some states.
| |
| | |
| === Uses in cryptography ===
| |
| LFSRs have long been used as [[pseudo-random number generator]]s for use in [[stream cipher]]s (especially in [[military]] [[cryptography]]), due to the ease of construction from simple [[electromechanical]] or [[electronic circuits]], long [[periodic function|periods]], and very uniformly [[probability distribution|distributed]] output streams. However, an LFSR is a linear system, leading to fairly easy [[cryptanalysis]]. For example, given a stretch of known plaintext and corresponding ciphertext, an attacker can intercept and recover a stretch of LFSR output stream used in the system described, and from that stretch of the output stream can construct an LFSR of minimal size that simulates the intended receiver by using the [[Berlekamp-Massey algorithm]]. This LFSR can then be fed the intercepted stretch of output stream to recover the remaining plaintext.
| |
| | |
| Three general methods are employed to reduce this problem in LFSR-based stream ciphers:
| |
| * [[Non-linear]] combination of several [[bit]]s from the LFSR [[state (computer science)|state]];
| |
| * Non-linear combination of the output bits of two or more LFSRs (see also: [[shrinking generator]]); or
| |
| * Irregular clocking of the LFSR, as in the [[alternating step generator]].
| |
| | |
| Important LFSR-based stream ciphers include [[A5/1]] and [[A5/2]], used in [[GSM]] cell phones, [[E0 (cipher)|E0]], used in [[Bluetooth]], and the [[shrinking generator]]. The A5/2 cipher has been broken and both A5/1 and E0 have serious weaknesses.<ref>{{Citation
| |
| | last = Barkam
| |
| | first = Elad
| |
| | last2 = Biham
| |
| | first2 = Eli
| |
| | last3 = Keller
| |
| | first3 = Nathan
| |
| | title= Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication
| |
| | journal=Journal of Cryptology
| |
| | volume=21
| |
| | issue=3
| |
| | year=2008
| |
| | pages=392–429
| |
| | url=http://cryptome.org/gsm-crack-bbk.pdf
| |
| }}</ref><ref>{{cite journal
| |
| | first = Yi | last = Lu | coauthors = Willi Meier; Serge Vaudenay
| |
| | title = The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
| |
| | journal = [[Crypto]] 2005 | year = 2005 | location = Santa Barbara, California, USA
| |
| | url = http://www.terminodes.org/micsPublicationsDetail.php?pubno=1216 | volume = 3621 | pages = 97–117 | doi=10.1007/11535218_7
| |
| }}</ref>
| |
| | |
| The linear feedback shift register has a strong relationship to [[linear congruential generator]]s.<ref>
| |
| RFC 4086
| |
| section 6.1.3 "Traditional Pseudo-random Sequences"
| |
| </ref>
| |
| | |
| === Uses in circuit testing ===
| |
| LFSRs are used in circuit testing, for test pattern generation(for exhaustive testing, pseudo random testing or pseudo exhaustive testing) and signature analysis.
| |
| ==== Test Pattern Generation ====
| |
| Complete LFSRs are commonly used as a pattern generator for exhaustive testing, since they cover all possible inputs for an n input circuit. Maximum length LFSRs and weighted LFSRs are widely used as a pseudo-random test pattern generators for pseudo-random test applications.
| |
| ==== Signature Analysis ====
| |
| In [[Built-in self-test|Built In Self Testing (BIST)]] techniques, storing all the circuit outputs on chip is not possible, but the circuit output can be compressed to form a signature which later will be compared to the golden signature (of the good circuit) to detect the faults. Since this compression is lossy, there is always a probability that a faulty output also generates the same signature as the golden signature and the faults can not be detected. This condition is called error masking or aliasing.
| |
| | |
| === Uses in digital broadcasting and communications ===
| |
| ==== Scrambling ====
| |
| {{ main | scrambler }}
| |
| To prevent short repeating sequences (e.g., runs of 0's or 1's) from forming spectral lines that may complicate symbol tracking at the
| |
| receiver or interfere with other transmissions, linear feedback registers are often used to "randomize" the transmitted bitstream. This
| |
| randomization is removed at the receiver after demodulation.
| |
| When the LFSR runs at the same [[bit rate]] as the transmitted symbol stream, this technique is referred to as [[Scrambler (randomizer)|scrambling]].
| |
| When the LFSR runs considerably faster than the symbol stream, expanding the bandwidth of the transmitted signal, this is [[direct-sequence spread spectrum]].
| |
| | |
| Neither scheme should be confused with [[encryption]] or [[encipherment]]; scrambling and spreading with LFSRs do ''not'' protect the information from eavesdropping. They are instead used to produce equivalent streams that possess convenient engineering properties to allow for robust and efficient modulation and demodulation.
| |
| | |
| Digital broadcasting systems that use linear feedback registers:
| |
| * [[ATSC Standards]] (digital TV transmission system – North America)
| |
| * [[Digital Audio Broadcasting|DAB]] ([[Digital Audio Broadcasting]] system – for radio)
| |
| * [[DVB-T]] (digital TV transmission system – Europe, Australia, parts of Asia)
| |
| * [[NICAM]] (digital audio system for television)
| |
| | |
| Other digital communications systems using LFSRs:
| |
| * INTELSAT business service (IBS)
| |
| * Intermediate data rate (IDR)
| |
| * [[Serial digital interface|SDI]] (Serial Digital Interface transmission)
| |
| * Data transfer over [[PSTN]] (according to the [[ITU-T]] V-series recommendations)
| |
| * [[CDMA]] (Code Division Multiple Access) cellular telephony
| |
| * [[Fast Ethernet#100BASE-T2|100BASE-T2 "fast" Ethernet]] scrambles bits using an LFSR
| |
| * [[Gigabit Ethernet#1000BASE-T|1000BASE-T Ethernet]], the most common form of Gigabit Ethernet, scrambles bits using an LFSR
| |
| * [[PCI Express]] 3.0
| |
| * [[SATA]]<ref>Section 9.5 of the SATA Specification, revision 2.6</ref>
| |
| * [[Serial attached SCSI]] (SAS/SPL)
| |
| * [[USB 3.0]]
| |
| * [[IEEE 802.11a]] scrambles bits using an LFSR
| |
| * [[Bluetooth Low Energy]] Link Layer is making use of LFSR (referred to as whitening)
| |
| | |
| ==== Other uses ====
| |
| The German time signal [[DCF77]], in addition to amplitude keying, employs [[phase-shift keying]] driven by a 9-stage LFSR to increase the accuracy of received time and the robustness of the data stream in the presence of noise.<ref name="phasemod">{{cite conference |url=https://www.ptb.de/cms/fileadmin/internet/fachabteilungen/abteilung_4/4.4_zeit_und_frequenz/pdf/5_1988_Hetzel_-_Proc_EFTF_88.pdf |title=Time dissemination via the LF transmitter DCF77 using a pseudo-random phase-shift keying of the carrier |first=P. |last=Hetzel |date=16 March 1988 |conference=2nd European Frequency and Time Forum |location=Neuchâtel |pages=351–364 |accessdate=11 October 2011}}</ref>
| |
| | |
| The [[Global Positioning System]] uses an LFSR to rapidly transmit a sequence that indicates high-precision relative time offsets.
| |
| | |
| LFSRs are also used in [[Communications System Jamming]] systems in which they are used to generate pseudo random noise to raise the noise floor of a target communication system.
| |
| | |
| == See also ==
| |
| * [[Pinwheel (cryptography)|Pinwheel]]
| |
| * [[Mersenne twister]]
| |
| * [[Maximum length sequence]]
| |
| * [[Analog feedback shift register]]
| |
| * [[NLFSR]], Non-Linear Feedback Shift Register
| |
| | |
| == References ==
| |
| <references />
| |
| | |
| == External links ==
| |
| * [http://www.newwaveinstruments.com/resources/articles/m_sequence_linear_feedback_shift_register_lfsr.htm LFSR Reference] LFSR theory and implementation, maximal length sequences, and comprehensive feedback tables for lengths from 7 to 16,777,215 (3 to 24 stages), and partial tables for lengths up to 4,294,967,295 (25 to 32 stages).
| |
| * [http://www.itu.int/rec/T-REC-O.151-199210-I/en International Telecommunications Union Recommendation O.151] (August 1992)
| |
| * [http://spreadsheets.google.com/ccc?key=0AvYtZsho-JTldFRYZnJLRFFaSWtUcVNXc1Y3M2VWd1E&hl=en Maximal Length LFSR table] with length from 2 to 67.
| |
| * [http://www.maxim-ic.com/appnotes.cfm?appnote_number=1743&CMP=WP-9 Pseudo-Random Number Generation Routine]
| |
| * http://www.ece.ualberta.ca/~elliott/ee552/studentAppNotes/1999f/Drivers_Ed/lfsr.html
| |
| * http://www.quadibloc.com/crypto/co040801.htm
| |
| * [http://www.yikes.com/~ptolemy/lfsr_web/index.htm Simple explanation of LFSRs for Engineers]
| |
| * [http://www.ece.cmu.edu/~koopman/lfsr/index.html Feedback terms]
| |
| * [http://homepage.mac.com/afj/lfsr.html General LFSR Theory]
| |
| * [http://opencores.org/project,lfsr_randgen An implementation of LFSR in VHDL.]
| |
| * [http://emmanuel.pouly.free.fr Simple VHDL coding for Galois and Fibonacci LFSR.]
| |
| | |
| [[Category:Binary arithmetic]]
| |
| [[Category:Digital registers]]
| |
| [[Category:Cryptographic algorithms]]
| |
| [[Category:Pseudorandom number generators]]
| |
| [[Category:Articles with example C code]]
| |