Abstract:
A wireless telecommunication device conducts base station pages at large intervals, such as 30 seconds, rather than the more conventional 0.5 to 4 seconds. The network processes calls placed to that telecommunication device in accordance with an SMS (Short Messaging Service) type protocol rather than a conventional voice call protocol. Particularly, the network sends an SMS to the telephone indicating that a third party is calling (hereinafter termed a “pre-call SMS”). The pre-call SMS indicates the telephone number of the third party. The user of the telephone may call the third party back. In accordance with this protocol, the need to page at very short intervals so as to permit a telephone call to be established in “real-time” is eliminated. Therefore, the paging interval can be increased substantially, thereby substantially prolonging battery charge lifetime of the telephone. In accordance with another aspect of the invention, when a cellular telephone sends a pre-call SMS, it temporarily decreases its paging interval to a more conventional interval such as 0.5 seconds for a predetermined period of time (e.g., 1-5 minutes) after placing a call so that, if the called party returns the call, the calling party will receive the return call in real-time and be able to answer the incoming call and establish a voice call.
Abstract:
A wireless telecommunication device conducts base station pages at large intervals, such as 30 seconds, rather than the more conventional 0.5 to 4 seconds. The network processes calls placed to that telecommunication device in accordance with an SMS (Short Messaging Service) type protocol rather than a conventional voice call protocol. Particularly, the network sends an SMS to the telephone indicating that a third party is calling (hereinafter termed a “pre-call SMS”). The pre-call SMS indicates the telephone number of the third party. The user of the telephone may call the third party back. In accordance with this protocol, the need to page at very short intervals so as to permit a telephone call to be established in “real-time” is eliminated. Therefore, the paging interval can be increased substantially, thereby substantially prolonging battery charge lifetime of the telephone. In accordance with another aspect of the invention, when a cellular telephone sends a pre-call SMS, it temporarily decreases its paging interval to a more conventional interval such as 0.5 seconds for a predetermined period of time (e.g., 1-5 minutes) after placing a call so that, if the called party returns the call, the calling party will receive the return call in real-time and be able to answer the incoming call and establish a voice call.
Abstract:
A telecommunication device is equipped with circuitry that can detect phenomena indicative or predictive of motion of the telecommunications device, such as GPS circuitry. When the circuitry determines that the telecommunication device is stationary, it controls the device to perform neighboring cell polling at relatively large intervals or not at all. However, when the circuitry determines that the telecommunication device is moving, it controls the device to poll neighboring cells more frequently.
Abstract:
An iterative decoder limits the range of extrinsic information used for iterative decoding of an encoded frame of data. The iterative decoder includes two or more separate decoders for decoding a received encoded frame of data. Each decoder employs extrinsic information generated from the soft data generated by another decoder decoding the encoded frame of data. The extrinsic information includes an approximate measure of the probability that a particular transmitted bit received by the iterative decoder is a logic 0 or logic 1. The extrinsic information for the bit originates with one decoder and is used by another decoder as external information about that bit. Implementations of the iterative decoder use saturation values to define the boundaries of the range. The saturation values are selected such that either no or relatively small degradation in BER occurs, and the saturation values also define the width of the binary representation of the extrinsic information.
Abstract:
A set of orthogonal sequences (e.g., Hadamard sequences) is decomposed into a set of basis vectors and sets of coefficients, where each set of coefficients represents a particular “vector combination” of the basis vectors that forms one of the orthogonal sequences. Such decomposition of orthogonal sequences into basis vectors and sets of coefficients may allow for a reduction in memory space and/or processing required to generate one or more of the orthogonal sequences during real-time operations of a communications system, such as an IS-95 CDMA system, that employs the orthogonal sequences. In one embodiment, a Hadamard sequence generator includes a controller, a memory, and a combiner. The set of basis vectors are stored in the memory, and each of the Hadamard sequences has a corresponding set of coefficients from which the Hadamard sequence can be derived as a vector combination of the basis vectors. These coefficients are either also stored in memory, or known to the controller based on a relationship between the coefficients and the row number of the Hadamard sequence in a corresponding Walsh-Hadamard matrix. To generate a particular sequence, the controller determines the corresponding set of coefficients and causes the basis vectors to be provided to the combiner. Based on the set of coefficients, the combiner combines the elements of specific basis vectors using modulo-2 addition to generate the desired Hadamard sequence.
Abstract:
A system employs a modified Jakes' fading model to generate a fading signal having substantially equivalent autocorrelation values for in-phase (I) and quadrature-phase (Q) components. A Walsh transform may be applied to generate multiple, uncorrelated I and Q components, for multiple fading signals. A complex Rayleigh fading signal according to the modified complex Jakes fading model is provided by a generator having M pairs of I and Q paths. Each pair of I and Q paths includes a corresponding complex carrier generator 201 (M an integer and 1≦n≦M) generating a complex carrier signal with frequency, &ohgr;n, where &ohgr;n is cos ((4n−3&pgr;)/4M). Each of the I paths has a circuit that separates the real component of the corresponding carrier signal to provide a real carrier signal cos (&ohgr;nt). Similarly, each of the Q paths has a circuit that separates the imaginary component of the corresponding complex carrier signal to provide an imaginary carrier signal sin (&ohgr;nt). The M output signals of the circuits for the I-paths may be summed in a corresponding adder to provide in-phase component rI(t) of the fading signal r(t). Similarly, the M output signals of the circuits for the Q-paths may be summed in a corresponding adder to provide the quadrature component rQ(t) of the fading signal r(t).
Abstract:
A circuit performs threshold normalization of accumulated transition probabilities for a given state of a state transition trellis in a maximum likelihood detector. Threshold normalization may be accomplished by comparison and setting of a single bit in stored transition probabilities. Threshold value comparison may be accomplished by comparing the bth bit of the stored transition probabilities if the threshold value is 2b. When all transition probabilities exceed the threshold value at a stage of the trellis, the transition probabilities are scaled, such as by subtracting the threshold value. Scaling may be implemented by setting the compared bth bits to zero before storage. In general, since accumulated transition probabilities are monotonically increasing for transition probabilities of paths through the trellis in both forward and reverse directions, the present invention may be employed for both threshold normalization of both the forward (&agr;) and reverse (&bgr;) transition probabilities.
Abstract:
A method and apparatus are disclosed for determining the data rate of a received signal in a communication system utilizing code division multiple access (CDMA) techniques. The well-known Viterbi decoding-based rate detection approach is combined with the conventional repetition pattern-based rate detection approach. The hybrid approach possesses the advantages of both prior approaches, without their disadvantages. The computationally efficient repetition pattern-based data rate detection approach, while not as reliable as the Viterbi decoder-based data rate detection approach, provides reliable data rate detection most of the time. The repetition-pattern data rate detection approach is used as long as a predefined reliability metric is satisfied, and only uses the more computationally intensive Viterbi decoder-based data rate detection approach when detection reliability may be compromised. Under the hybrid rate detection scheme, a decision variable based on repetition patterns is initially formed and a decision is made on the data rate if the decision variable is in a reliable region. Otherwise, the Viterbi decoding-based rate detection scheme is employed.
Abstract:
An iterative decoder decodes a frame of encoded data that includes error detection information, and terminates the iterative decoding based on a comparison of the decoded frame with the error detection information. The iterative decoder may have a maximum number of specified iterations, but may terminate the number of iterations early under specified conditions. The encoded data includes error detection information for parity check calculation. Error detection information may be in accordance with an error detection code, such as a cyclic redundancy check (CRC) code. After each iteration of decoding, a parity check is calculated for the decoded frame. Early termination of decoding may occur prior to an intermediate iteration threshold M of iterations when the parity check value of the decoded frame is equivalent to the parity check value calculated from the error detection information. Early termination of decoding after M iterations may also occur when a difference in decoding error between frames is either i) below a minimum error distance threshold or ii) no longer monotonically decreasing.
Abstract:
A method of extracting an information bearing signal .omega.(n) from a base-band signal in the form of an inverse function with a digital signal processor. The processor includes memory and utilizes a minimum number of instructions stored in the memory. The base-band waveform comprises a plurality of complex-valued samples having respective I and Q components. The method includes the steps of receiving a first sample at an instant n having respective I(n) and Q(n) components and defining an interval for evaluating potential values for the I(n) and Q(n) components. Next, a step of transforming said I(n) and Q(n) components is performed to have respective threshold values residing in the predefined interval. Then, a step of estimating the transformed components with a series of non-inverted polynomial functions is carried out over the predefined interval. The method proceeds by extracting the information-bearing signal with the digital signal processor according to the instructions to evaluate the series of non-inverted polynomial functions.