Mercurial > hg > octave-lyh
view scripts/audio/lin2mu.m @ 6116:b64fb24bf4a0
[project @ 2006-10-27 18:04:49 by jwe]
author | jwe |
---|---|
date | Fri, 27 Oct 2006 18:04:50 +0000 |
parents | 34f96dd5441b |
children | 93c65f2a5668 |
line wrap: on
line source
## Copyright (C) 1996, 1997 John W. Eaton ## ## This file is part of Octave. ## ## Octave is free software; you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 2, or (at your option) ## any later version. ## ## Octave is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ## General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with Octave; see the file COPYING. If not, write to the Free ## Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA ## 02110-1301, USA. ## -*- texinfo -*- ## @deftypefn {Function File} {} lin2mu (@var{x}, @var{n}) ## Converts audio data from linear to mu-law. Mu-law values use 8-bit ## unsigned integers. Linear values use @var{n}-bit signed integers or ## floating point values in the range -1<=@var{x}<=1 if @var{n} is 0. ## If @var{n} is not specified it defaults to 0, 8 or 16 depending on ## the range values in @var{x}. ## @seealso{mu2lin, loadaudio, saveaudio, playaudio, setaudio, record} ## @end deftypefn ## Author: Andreas Weingessel <Andreas.Weingessel@ci.tuwien.ac.at> ## Created: 17 October 1994 ## Adapted-By: jwe function y = lin2mu (x, bit) if (nargin == 1) range = max (abs (x (:))); if (range <= 1) bit = 0; elseif (range <= 128) bit = 8; warning ("lin2mu: no precision specified, so using %d", bit); else bit = 16; endif elseif (nargin == 2) if (bit != 0 && bit != 8 && bit != 16) error ("lin2mu: bit must be either 0, 8 or 16"); endif else print_usage (); endif ## Transform real and n-bit format to 16-bit. if (bit == 0) ## [-1,1] -> [-32768, 32768] x = 32768 * x; elseif (bit != 16) x = 2^(16-bit) .* x; endif ## Determine sign of x, set sign(0) = 1. sig = sign(x) + (x == 0); ## Take absolute value of x, but force it to be smaller than 32636; ## add bias. x = min (abs (x), 32635) + 132; ## Find exponent and fraction of bineary representation. [f, e] = log2 (x); y = 64 * sig - 16 * e - fix (32 * f) + 335; endfunction