Patents by Inventor Nils Graef

Nils Graef 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).

  • Publication number: 20080140310
    Abstract: Various systems and methods for preparing directional instructions are disclosed herein. For example, a method for preparing directional instructions is discussed that includes receiving two route end points and identifying a route between the two end points. The route between the two end points may include, for example, at least one road and a distance. In addition, at least one landmark is identified along the route. A textual output is assembled that includes the name of the road, the distance and a description of the landmark.
    Type: Application
    Filed: December 11, 2006
    Publication date: June 12, 2008
    Inventor: Nils Graef
  • Publication number: 20080077829
    Abstract: Various systems and methods for generating error indications are disclosed herein. In some cases, the error indication is used as an erasure pointer in a memory access system. As one particular example, a system for generating an erasure pointer is disclosed that includes accumulating a number of error values into an overall error value, and comparing the overall error value to an error threshold. When the overall error value exceeds the error threshold, an erasure pointer is generated. In one particular case, the error values are derived from a look up table using thermometer codes generated by an analog to digital converter. In other cases, the error values are derived from comparing a soft output with a reliability threshold.
    Type: Application
    Filed: September 27, 2006
    Publication date: March 27, 2008
    Inventors: Nils Graef, Erich F. Haratsch
  • Publication number: 20080077675
    Abstract: Various systems and methods for electronic message generation are disclosed herein. For example, one method is disclosed that includes receiving a portion of an electronic message that in some way identifies a recipient of the electronic message. The electronic message may be, but is not limited to, an email message or a text message. The method further includes accessing a recipient database that includes information associated with the recipient along with one or more other recipients. From the recipient database a recipient message portion associated with the identified recipient is retrieved, and the portion of the electronic message is augmented with the recipient message portion associated with the recipient.
    Type: Application
    Filed: September 25, 2006
    Publication date: March 27, 2008
    Inventor: Nils Graef
  • Publication number: 20070237171
    Abstract: Various systems and methods for low power multi-rate data paths are disclosed. As one example, a semiconductor device that includes a multi-rate data path is discussed. The multi-rate data path includes at least two register circuits with an output of one of the register circuits electrically coupled to an input of the other register circuit via a combinational logic block. In addition, the semiconductor device includes a control circuit that is operable to modify the rate at which the multi-rate data path operates by selectably bypassing at least one of the register circuits.
    Type: Application
    Filed: March 29, 2006
    Publication date: October 11, 2007
    Applicant: Agere Systems Inc.
    Inventor: Nils Graef
  • Publication number: 20070174643
    Abstract: Various systems and methods for power reduction are disclosed herein. As one example, a method for power reduction in a semiconductor device is disclosed. The method includes providing a semiconductor device that includes a bus. The bus includes a group of signals and a control signal associated with the group of signals. In one particular case, the group of signals is a data bus and the control signal is a low frequency signal implementing some particular control specific to the bus. In the method, the control signal doubles as a polarity control that indicates a polarity state of the group of signals while actively indicating the status of the particular control.
    Type: Application
    Filed: January 26, 2006
    Publication date: July 26, 2007
    Applicant: Agere Systems Inc.
    Inventor: Nils Graef
  • Publication number: 20070079225
    Abstract: Methods and apparatus are provided for determining survivor paths in a Viterbi detector, using a trace-ahead algorithm. A trellis memory is maintained having a depth L that stores L trellis stages, each of the L stages having a plurality, N, of trellis states; and a status memory is maintained for each of the N states of the trellis, wherein each entry in the status memory identifies a least recent trellis state stored in the trellis memory of a survivor path that begins at a given state on a side of the trellis associated with most recent states. A bit sequence of one or more of the survivor paths in the trellis is determined in an order that the bits are received by examining least and most recent trellis stages of the trellis and the status memory. One or fork memories maintain an indicator of whether a given fork is active; a list of active forks; a trellis position of active forks in the trellis; and a fork type of one or more forks in the trellis.
    Type: Application
    Filed: September 30, 2005
    Publication date: April 5, 2007
    Inventor: Nils Graef
  • Publication number: 20070076824
    Abstract: Methods and apparatus are provided for storing survivor paths in a Viterbi detector. The invention maintains at least one register and at least one pointer for each state. Each register stores a bit sequence associated with a Viterbi state and each pointer points to one of the registers. One or more predefined rules based on a trellis structure are employed to exchange one or more of the pointers. A survivor path memory is also disclosed for a Viterbi detector. The survivor path memory comprises a plurality of columns, each associated with a different time step, and an input processor. Each column comprises a flip flop for storing one bit or portion of a bit sequence associated with a Viterbi state; and a multiplexer for each state controlled by a case signal indicating a time step, the multiplexer selecting a state from a previous time step, wherein an output of the multiplexer of a given state is connected to at least one data input of a flip flop of the given state.
    Type: Application
    Filed: September 30, 2005
    Publication date: April 5, 2007
    Inventor: Nils Graef
  • Publication number: 20070076825
    Abstract: Methods and apparatus are provided for storing survivor paths in a Viterbi detector. At least one register and at least one pointer are maintained for each state. Each register stores a bit sequence associated with a Viterbi state and each pointer points to one of the registers. A trellis transition type is determined, for example, based on a decision from an add/compare/select unit. One or more predefined rules based on a trellis structure and the trellis transition type are employed to exchange one or more of the pointers and to update one or more of the at least one registers. A survivor path memory is also disclosed for a Viterbi detector. The survivor path memory comprises a plurality of columns, each associated with a different time step, and an input processor.
    Type: Application
    Filed: September 30, 2005
    Publication date: April 5, 2007
    Inventor: Nils Graef
  • Publication number: 20060209994
    Abstract: A method for detecting a symbol encoded in one or more received signals, wherein the detected symbol corresponds to a combination of values of n components, n>1, comprises (a) for each of a plurality of different combinations of values of the n components, generating a set of two or more sub-metric values based on the one or more received signals. Each sub-metric is a function of one or more of the n components, and at least one sub-metric is a function of fewer than all n components. The method further comprises (b) detecting the symbol based on the sets of sub-metric values. In another embodiment, an apparatus for detecting a symbol encoded in one or more received signals, wherein the detected symbol corresponds to a combination of values of n components, n>1, comprises (a) means for generating a set of two or more sub-metric values based on the one or more received signals for each of a plurality of different combinations of values of the n components.
    Type: Application
    Filed: March 16, 2005
    Publication date: September 21, 2006
    Inventors: Nils Graef, Joachim Hammerschmidt
  • Publication number: 20060209977
    Abstract: A method for generating soft bit values for a multi-bit symbol encoded in one or more received signals comprises (a) for a plurality of different combinations of multiple bit values, iteratively generating, for each combination, a metric value based on the one or more received signals. The method further comprises (b) for each iteration, maintaining (i) a global extremum register containing a global extremum of the metric values; (ii) a bit occupancy for the global extremum register; and (iii) a plurality of bit bk registers, one for each bit bk in the symbol. Each bit bk register contains an extremum of the metric values corresponding to combinations of multiple bit values whose bit bk value is opposite the bit bk value of the bit occupancy for the global extremum register. The method further comprises (c) generating, for each bit bk in the symbol, a soft bit value based on a difference between the value in the global extremum register and the value in the corresponding bit bk register.
    Type: Application
    Filed: March 16, 2005
    Publication date: September 21, 2006
    Inventors: Nils Graef, Joachim Hammerschmidt
  • Publication number: 20060195772
    Abstract: Methods and apparatus are provided for measuring the performance of a read channel. A number of detection techniques, such as SOVA and maximum-a-posteriori (MAP) detectors, produce a bit decision and a corresponding reliability value associated with the bit decision. The reliability value associated with the bit decision may be expressed, for example, in the form of log likelihood ratios (LLRs). The reliability value can be monitored and used as a performance measure. The present invention provides a channel performance measure that generally correlates directly to the BER but can be collected in less time.
    Type: Application
    Filed: February 28, 2005
    Publication date: August 31, 2006
    Inventors: Nils Graef, Zachary Keirn
  • Publication number: 20060104390
    Abstract: A wireless receiver detects signals generated with a multiple-input, multiple-output (MIMO) transmitter. The receiver applies maximum-likelihood detection (MLD) for soft-output signal detection, where an MLD exhaustive search across all candidate vectors is performed recursively by computing and accumulating the differences between, for example, the Euclidean metrics of consecutive candidate tests. Difference terms used for the accumulation are also calculated recursively. An ordering of candidates, such as by a triangular-waveform shaped ordering, is employed such that only one candidate variable is changed between any two consecutive candidate evaluations, leading to a reduced set of computations.
    Type: Application
    Filed: November 17, 2004
    Publication date: May 18, 2006
    Inventors: Nils Graef, Joachim Hammerschmidt