Abstract:
An error detecting device of received digital data solves a problem for detecting errors in a conventional device in that error detection following the Viterbi decoding performed on most important bits cannot detect errors even if they include a considerable amount of errors, and that odd sounds result from decoding of voice data, for example. The present error detecting device includes a Viterbi decoder for carrying out the Viterbi decoding of the received digital data, an error number decision portion for comparing a threshold value with the number of errors of the path metric obtained by the Viterbi decoding, and a voice decoder for decoding the received digital data, on which the error number decision portion decides that the number of errors is below the threshold value.
Abstract:
A digital transmission system provides selective protection by combining a convolutional coding, a punctured coding and a digital quadrature amplitude modulation. The rate of the convolutional coding in N/2N and the modulation uses a 2.sup.2N -point constellation, with N>1.
Abstract:
A method and device for error-correcting a plurality of bits transmitted over RF channels in a cellular communication system are provided. The present invention applies principles of majority voting to error-correct a plurality of bits in a message word simultaneously. Further, the present invention applies its error-correction capability to virtually any number of repeat transmissions over forward and reverse control/voice channels. Following synchronization of the transmit and receive stations, a message word having n-bits is transmitted repeatedly. The repeat bits are separated and analyzed whereafter the true logical state of the original n-bits is determined. The originally transmitted message word is then reconstructed based upon the determined true logical state of the n-bits.
Abstract:
The turbo coding system combines: a) repetitive turbo encoder bit partitioning and decoder bit deletion; with b) error-floor mitigating encoder non-flushing the second constituent encoder with the second a-posteriori probability (APP) decoder starting backward recursion from any possible states as a powerful improvement to conventional turbo coding. The repetitive turbo encoding process repeats the bits of the systematic root sequence and appends flushing sequence prior to interleaving and encoding by the second constituent turbo encoder for providing an interleaved repetitive second encoded output for turbo decoding. The error-floor mitigating turbo encoding process does not flush the second constituent encoder to the zero ending state so that turbo decoding forward recursion may be end in any possible state and backward recursion may start from any possible state to avoid potential mismatches between the forward and backward recursions. The modified a posterior probability second decoder initializes the beginning state metric of the backward recursion with the ending state metric of the forward recursion. The two processes provide significant bit error rate improvement. Iterative decoding provides iterative results that are subject to majority voting selection for improved estimations of the decoded systematic data sequence.
Abstract:
The present invention provides an improved Viterbi decoder with a trace-back memory that requires a much less storage capacity required for signal decoding processing as compared with a commonly-used trace-back memory. Based on an input received code, an add-compare-select (ACS) circuit generates path select (PS) signals, and m generated PS signals per unit are written into a path storing means and are fed to a starting node number deciding circuit where the number m indicates a trace-back length. The starting node number deciding circuit finds from the m PS signals a trace-back starting node number for a PS signal preceding the m PS signals. PS signals are read out from the path storing means, trace-back processing starts from the starting node number found by the starting node number deciding circuit, and signal decoding processing is carried out. This eliminates the need for providing a state of performing provisional trace-back processing for finding a starting node number, thereby reducing the number of states necessary for the decoding of signals from four down to three. This reduces the storage capacity of memory required for storing PS signals and thereby achieves a considerable reduction of the circuit size.
Abstract:
In a concatenated code data, correctly decoded code words from a block decoder is utilized to improve the performance of the convolutional decoder. A code word can sometimes be correctly decoded prior to receipt of all the symbols for the code word. Early decoding of the code word allows for the correct recreation of the entire code word, even the symbols which have not yet been received. The entire corrected code word is used by the convolutional decoder to eliminate branches the trellis, thus improving decoding of prior data bits and future data bits in the trellis. The chain back distance of the convolutional decoder can also be made shorter based on the knowledge that some of the received code words have been correctly decoded. Finally, the parity symbols which have not yet been received for the correctly decoded code word can be eliminated from transmission to improve the overall transmission rate.
Abstract:
Received data representing voice information is subjected to Viterbi decoding to correct an error in the received data. Thereby, the received data is decoded into second data. A path metric is calculated to determine the second data during the Viterbi decoding. A decision is made as to whether or not at least one error is present in the second data by referring to a cyclic redundancy check code in the second data. The second data is discarded when it is decided that at least one error is present in the second data. A decision is made as to whether or not the calculated path metric exceeds a threshold value. The second data is discarded when it is decided that the path metric exceeds the threshold value. The second data is converted into sound when it is decided that at least one error is not present in the second data and that the path metric does not exceed the threshold value.
Abstract:
A viterbi decoder includes a maximum branch metric value detecting device separated from a feedback loop consisting of an ACS arithmetic unit, a normalization arithmetic unit, and a state value storing device. In operation, a maximum branch metric value is detected by utilizing the output of the state value storing device, to thereby enhance operating speed. Further, a judgment is made as to whether a state having the minimum state value at an immediately preceding time is back-traceable from a state having the minimum state value at a current time by using survivor path information. Non-back-traceable non-correspondences are then detected, and the number of occurrences of non-correspondences are counted. If the occurrences of non-correspondences exceed a reference value, it is judged a non-synchronization. In another method, synchronization/non-synchronization is judged by detecting whether a trace back is possible, without utilizing survivor path information.
Abstract:
An apparatus for receiving data block-interleaved and multi level/phase modulated data and restoring the block-interleaved multi level/phase modulated data into original data, comprises a demodulation and error correction portion for demodulating and error-correcting data to be received and outputting the modulated and error-corrected data; a synchronization portion for generating a fixed sync position signal, based on the comparison between the data output from the demodulation and error correction portion and stored block sync data; and a block deinterleaver for block-deinterleaving the data which is output from the demodulation and error correction portion according to the fixed sync position signal. The apparatus makes certain that a sync signal for block deinterleaving is identical to a sync signal at the transmission end and performs block deinterleaving even though no error correction is made. Furthermore, the present invention is capable of reliably detecting a sync signal, even when the sync signal is momentarily deviated because error correction is not completely made.
Abstract:
The present invention comprises: M units of Bessel function calculation means for inputting M signals X.sub.1 to X.sub.M that are produced by performing a reception signal high-speed Hadamard's transformation and outputting M modified Bessel functions Y.sub.1 to Y.sub.M corresponding to the signals; and K units of bit metric calculation means having addition means for adding the modified Bessel functions Y.sub.1 to Y.sub.M to each bit of k bits according to codes that are determined for cases of assumption that 0 is transmitted and 1 is transmitted and logarithm calculation means for calculating logarithm of output from the addition means for obtaining soft information.