Abstract: An echo canceller for cancelling echoes which result from impedance mismatching in a two-wire/four-wire conversion circuit. The prior art employed an input terminal, an output terminal, a transmitter section, a receiver section, a digital-to-analog converter, an adaptive digital filter, a subtractor, a sample hold circuit, an analog-to-digital converter, a multiplier, a low pass filter, a hybrid circuit, and a two-wire communication path, for the purpose of generating a replica of the echo signal to cancel such echos. A method has also been proposed which employs a polarity discriminator circuit instead of an analog-to-digital converter, and utilizes approximation algorithms to correct an adaptive digital filter tap coefficient using the signs of an error signal.

Abstract: In a digital time division multiplexed telephone transmission system, a plurality of telephone signals are cyclically sampled and quantized so that each sampled value may be encoded into a binary codeword of a preset number of bits and that a series of codewords equal in number to the telephone signals may constitute a frame and a series of a predetermined number frames may in turn constitute a superframe. At the transmission end, an input circuit (202) receives the time division multiplexed telephone signals, and a code converter (204) coupled to the input circuit and responsive to a state-representing signal successively converts each of the binary codewords into a plurality of modified codewords. The modified codewords are variably assigned comparatively smaller and greater numbers of binary digits depending on the state-representing signal, the comparatively greater number being equal to or smaller than the preset number.

Abstract: An arithmetic unit for performing the operation of multiplying input data by successive powers of a constant and accumulating the products represented by ##EQU1## WHERE .alpha. IS A CONSTANT, IS DISCLOSED. The arithmetic unit includes a recursive path which does not necessitate a multiplier, and operations which really necessitate multiplication are carried out only when the input data have substantially entered this recursive path thereby substantially reducing the number of multiplications required. The arithmetic unit has particular application in performing DFT (Discrete Fourier Transform) or IDFT (Inverse Discrete Fourtier Transform).

Abstract: An FFT processing unit of simplified construction comprises one or more arithmetic stages serially connected. Each stage has a plurality of recursive arithmetic paths each consisting of a delay element, a simplified multiplier for multiplying by .+-.1 and .+-.j where j = .sqroot.-1, and an adder. The adder is supplied with a serial input digital data series and the output is provided to the delay element and multiplier connected in series. A switch successively selects the output signals obtained from the plurality of recursive arithmetic paths. A second multiplier multiplies the signals selected by the switch by predetermined coefficients.