%BITSHIFT Bit-wise shift.
%   C = BITSHIFT(A,K,N) returns the value of A shifted by K bits. Shifting
%   by K is the same as multiplication by 2^K and then rounding to the
%   nearest integer (i.e. C = fix(A*2^K)).  If the shift causes C to
%   overflow N bits, the overflowing bits are dropped.  A must contain
%   non-negative integers between 0 and BITMAX.
%
%   C = BITSHIFT(A,K) uses the default value of N = 53.
%
%   See also BITAND, BITOR, BITXOR, BITCMP, BITSET, BITGET, BITMAX.

%   Clay M. Thompson 2-12-95
%   Copyright (c) 1984-98 by The MathWorks, Inc.
%   $Revision: 1.11 $  $Date: 1998/07/23 19:46:05 $

