Construction of de Bruijn sequences of minimal complexity

It is well known that the linear complexity of a de Bruijn sequence
S
of length
2^{n}
is bounded below by
2^{n- 1} + n
for
n \geq 3
. It is shown that this lower bound is attainable for all
n
.