Patents by Inventor Kelly B. Cameron
Kelly B. Cameron has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8254407Abstract: A method for asymmetrical MIMO wireless communication begins by determining a number of transmission antennas for the asymmetrical MIMO wireless communication. The method continues by determining a number of reception antennas for the asymmetrical MIMO wireless communication. The method continues by, when the number of transmission antennas exceeds the number of reception antennas, using spatial time block coding for the asymmetrical MIMO wireless communication. The method continues by, when the number of transmission antennas does not exceed the number of reception antennas, using spatial multiplexing for the asymmetrical MIMO wireless communication.Type: GrantFiled: May 20, 2010Date of Patent: August 28, 2012Assignee: Broadcom CorporationInventors: Christopher J. Hansen, James A. Trachewsky, Nambirajan Seshadri, Kelly B. Cameron, Hau Thien Tran, Ba-Zhong Shen
-
Patent number: 7848466Abstract: A method for synchronizing receivers that receive turbo encoded signals to a received signal. Turbo encoding may enable signals to be decoded at a much lower signal to noise ratio than previously practical. A traditional method of synchronizing a receiver to an incoming signal is to use a slicer to determine a received symbol and then to compare the determined symbol to the incoming waveform, in order to adjust the phase of the slicer with respect to the incoming signal. At signal low levels, at which turbo encoded signals may be decoded, this slicing method may be prone to errors that may disrupt the synchronization of the receiver to the incoming signal. By replacing the slicer by a Viterbi decoder with zero traceback (i.e., one which does not consider future values of the signal only past values) a prediction as to what the incoming signal is can be made.Type: GrantFiled: January 23, 2009Date of Patent: December 7, 2010Assignee: Broadcom CorporationInventors: Steven T. Jaffe, Kelly B. Cameron, Christopher R. Jones
-
Patent number: 7715503Abstract: A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed.Type: GrantFiled: August 3, 2009Date of Patent: May 11, 2010Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Hau Thien Tran, Ba-Zhong Shen, Christopher R. Jones
-
Patent number: 7630461Abstract: A method for decoding a word received at a current time instant into a symbol of a trellis code. The trellis code corresponds to a trellis diagram having N states associated with the current time instant. Each of the N states corresponds to at least one incoming branch. Each of the incoming branches is associated with a symbol of the trellis code. The branch metrics are computed for the incoming branches such that a branch metric represents a distance between the received word and a symbol associated with the corresponding branch. The branch metric is represented by fewer bits than a squared Euclidian metric representation of the distance. For each of the N states, a node metric is computed based on corresponding branch metrics and one of the incoming branches associated with the state is selected. One of the N states is selected as an optimal state based on the node metrics. The symbol associated with the selected incoming branch corresponding to the optimal state is the decoded word.Type: GrantFiled: June 10, 2005Date of Patent: December 8, 2009Assignee: Broadcom CorporationInventor: Kelly B. Cameron
-
Publication number: 20090285320Abstract: A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed.Type: ApplicationFiled: August 3, 2009Publication date: November 19, 2009Applicant: BROADCOM CORPORATIONInventors: Kelly B. Cameron, Hau Thien Tran, Ba-Zhong Shen, Christopher R. Jones
-
Patent number: 7570700Abstract: A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo?N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed.Type: GrantFiled: July 22, 2004Date of Patent: August 4, 2009Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Hau Thien Tran, Ba-Zhong Shen, Christopher R. Jones
-
Publication number: 20090122925Abstract: A method for synchronizing receivers that receive turbo encoded signals to a received signal. Turbo encoding may enable signals to be decoded at a much lower signal to noise ratio than previously practical. A traditional method of synchronizing a receiver to an incoming signal is to use a slicer to determine a received symbol and then to compare the determined symbol to the incoming waveform, in order to adjust the phase of the slicer with respect to the incoming signal. At signal low levels, at which turbo encoded signals may be decoded, this slicing method may be prone to errors that may disrupt the synchronization of the receiver to the incoming signal. By replacing the slicer by a Viterbi decoder with zero traceback (i.e., one which does not consider future values of the signal only past values) a prediction as to what the incoming signal is can be made.Type: ApplicationFiled: January 23, 2009Publication date: May 14, 2009Applicant: BROADCOM CORPORATIONInventors: Steven T. Jaffe, Kelly B. Cameron, Christopher R. Jones
-
Patent number: 7499507Abstract: A method for synchronizing receivers that receive turbo encoded signals to a received signal. Turbo encoding may enable signals to be decoded at a much lower signal to noise ratio than previously practical. A traditional method of synchronizing a receiver to an incoming signal is to use a slicer to determine a received symbol and then to compare the determined symbol to the incoming waveform, in order to adjust the phase of the slicer with respect to the incoming signal. At signal low levels, at which turbo encoded signals may be decoded, this slicing method may be prone to errors that may disrupt the synchronization of the receiver to the incoming signal. By replacing the slicer by a Viterbi decoder with zero traceback (i.e. one which does not consider future values of the signal only past values) a prediction as to what the incoming signal is can be made.Type: GrantFiled: December 4, 2000Date of Patent: March 3, 2009Assignee: Broadcom CorporationInventors: Steven T. Jaffe, Kelly B. Cameron, Christopher R. Jones
-
Patent number: 7460608Abstract: A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed.Type: GrantFiled: July 22, 2004Date of Patent: December 2, 2008Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Hau Thien Tran, Ba-Zhong Shen, Christopher R. Jones
-
Patent number: 7440521Abstract: In a normalization process, overflow occurring in limited size registers, holding the alpha or beta values in a map decoder, may be overcome by subtracting a constant value from all of the alpha or beta values when they reach a limit. Because subtracting a constant value may slow down the computation, detection of a constant value may occur on one decoding cycle and normalization on the succeeding decoding cycle. A multiplexor type circuit can be used to direct either zeros, in the normalization case, or a most significant bit(s), in computations without normalization, into the register holding the alpha or beta values. To minimize the impact on the computation by the normalization process, the multiplexor circuit can be set by the previous decoder cycle so that the computation does not have to wait for the multiplexor to be set to normalization or normal computation.Type: GrantFiled: September 12, 2001Date of Patent: October 21, 2008Assignee: Broadcom CorporationInventors: Hau Thien Tran, Kelly B. Cameron
-
Patent number: 7421034Abstract: A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Soloman encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed.Type: GrantFiled: May 11, 2004Date of Patent: September 2, 2008Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Ba-Zhong Shen, Hau Thien Tran, Christopher R. Jones, Thomas Ashford Hughes, Jr.
-
Patent number: 7421044Abstract: Quasi error free method and system are presented for encoding and decoding information using turbo codes as an inner code in conjunction with an algebraic outer code linked by an interleaver. This combination of outer algebraic code and turbo inner code linked by an interleaver, which has a guaranteed minimum Depth between symbols output from the interleaver, can produce a quasi error free performance in systems utilizing Turbo-Codes without an increase in bandwidth.Type: GrantFiled: September 5, 2001Date of Patent: September 2, 2008Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Christopher R. Jones
-
Patent number: 7420481Abstract: A communications system, having a combination Reed-Solomon encoder and a Turbo-Code encoder Data frame configuration which may be changed to accommodate embedded submarkers of known value are embedded in with the data order to aid synchronization in the receiver system, by providing strings of known symbols. The string of known symbols may be the same as the symbols within a training header that appears at the beginning of a data frame. Frame parameters may be tailored to individual users and may be controlled by information pertaining to receivers, such as bit error rate, of the receiver. Additional headers may be interspersed within the data in order to assist in receiver synchronization. Frames of data may be acquired quickly by a receiver by having a string of symbols representing the phase offset between successive header symbols in the header training sequence in order to determine the carrier offset.Type: GrantFiled: April 28, 2005Date of Patent: September 2, 2008Assignee: Broadcom CorporationInventors: Steven T. Jaffe, Kelly B. Cameron
-
Patent number: 7242726Abstract: A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Soloman encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed.Type: GrantFiled: June 8, 2001Date of Patent: July 10, 2007Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Ba-Zhong Shen, Hau Thien Tran, Christopher R. Jones, Thomas Ashford Hughes, Jr.
-
Patent number: 7158589Abstract: A method and apparatus for parallel decoding of turbo encoded data. The method includes multiple Soft In Soft Out (SISO) modules arranged in parallel such that each module supplies an input to one SISO and takes an input from another SISO data encoded for multiple parallel SISOs is received by a receiver and decoded in the abovementioned parallel configuration.Type: GrantFiled: September 12, 2001Date of Patent: January 2, 2007Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Hau Thien Tran, Ba-Zhong Shen, Christopher R. Jones
-
Patent number: 7035342Abstract: A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed.Type: GrantFiled: September 12, 2001Date of Patent: April 25, 2006Assignee: Broadcom CorporationInventors: Kelly B. Cameron, Hau Thien Tran, Ba-Zhong Shen, Christopher R. Jones
-
Patent number: 7023934Abstract: Method and apparatus for Min star calculations in a Map decoder. Min star calculations are performed by a circuit that includes a first circuit that performs an Min(A,B) operation simultaneously with a circuit that calculates a ?log(1+e?|A?B|) value. The sign bit of the A?B calculation is used to select whether A or B is a minimum. The A?B calculation is also used to select either ?log(1+e?|A?B|) or ?log(1+e?|B?A|) as the correct calculation. In order to hasten the selection of either ?log(1+e?|A?B|) or ?log(1+e?|B?A|) as the correct calculation the apparatus does not wait for the A?B calculation to complete. Any bit of the A?B calculation between the third bit and final (sign bit) can be used for the selection. If an incorrect value is selected a log saturation circuit may correct the value.Type: GrantFiled: September 12, 2001Date of Patent: April 4, 2006Assignee: Broadcom CorporationInventors: Hau Thien Tran, Kelly B. Cameron, Thomas A. Hughes
-
Patent number: 7012975Abstract: Method and apparatus for performing calculations for forward (alpha) and reverse (beta) metrics in a map decoder. The method includes using a min star (min*) operation to receive the metrics and a priori values as well as forming min star structures from individual min star operations. Two separate outputs from the min star operation may be maintained separately throughout all calculations and combined only when a final value is required. In addition input to the min star operators that are available prior to a particular decoder iteration may be combined separately to allow an increase in speed within decoding iterations. The same principals apply to the more popular max star operation.Type: GrantFiled: September 12, 2001Date of Patent: March 14, 2006Assignee: Broadcom CorporationInventors: Hau Thien Tran, Kelly B. Cameron, Ba-Zhong Shen, Christopher R. Jones
-
Patent number: 6985093Abstract: A communications system, having a combination Reed-Solomon encoder and a Turbo-Code encoder Data frame configuration which may be changed to accommodate embedded submarkers of known value. The submarkers are embedded in with the data order to aid synchronization in the receiver system, by providing strings of known symbols. The string of known symbols may be the same as the symbols within a training header that appears at the beginning of a data frame. Frame parameters may be tailored to individual users and may be controlled by information pertaining to receivers, such as bit error rate of the receiver. Additional headers may be interspersed within the data in order to assist in receiver synchronization. Frames of data may be acquired quickly by a receiver by having a string of symbols representing the phase offset between successive header symbols in the header training sequence in order to determine the carrier offset.Type: GrantFiled: October 28, 2004Date of Patent: January 10, 2006Assignee: Broadcom CorporationInventors: Steven T. Jaffe, Kelly B. Cameron
-
Patent number: 6982659Abstract: Method and apparatus for determining the stopping point of an iterative decoding process. In one embodiment the estimated values of an iteration of an iterative decoder are provided to a signature circuit. If the signature does not differ from the previous signature developed from a prior iteration, or the signature developed from an iteration prior to the previous iteration, the decoding stops. The variance may also be tested and compared to a threshold as a criteria to stop the iterative decoding.Type: GrantFiled: January 2, 2004Date of Patent: January 3, 2006Assignee: Broadcom CorporationInventors: Ba-Zhong Shen, Kelly B. Cameron, Steven T. Jaffe