# US 2003/0225808 A1 · Method and system for implementing SLICE instructions

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0225808 A1
- Document ID: US20030225808A1
- Status: Published application
- Kind: A1
- Application number: 10/350,286
- Filed: 2003-01-24
- Published: 2003-12-04
- Earliest claimed: 2002-01-24
- Assignees: Broadcom Corporation
- Inventors: Gregory H. Efland; Haixiang Liang; Yuanjie Chen
- Web page: https://patentgrep.com/patent/US20030225808A1

## CPC

- H04L 7/0012: {by comparing receiver clock with transmitter clock}
- G06F 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- H03M 13/2732: {Convolutional interleaver; Interleavers using shift-registers or delay lines like, e.g. Ramsey type interleaver}
- H03M 13/6533: {ITU 992.X [ADSL]}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 7/0029: {interpolation of received data signal}
- H04L 27/2647: {Arrangements specific to the receiver only (equalisation H04L27/01)}
- H04L 45/00: Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W40/00)
- H04L 49/90: Buffering arrangements
- H04M 11/062: {using different frequency bands for speech and other data}
- H04L 25/03159: {operating in the frequency domain (H04L25/03165, H04L25/03178 take precedence)}
- H04L 2012/5681: {Buffer or queue management}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)

## Abstract

Provided is a system and method for a modem including one or more processing paths. Also included is a number of interconnected modules sequentially arrayed along the one or more paths. Each module is configured to (i) process signals passed along the paths in accordance with the sequence and (ii) implement predetermined functions to perform the processing. Further, each of the modules has a particular degree of functional programmability and the degrees of functional programmability monotonically vary in accordance with the sequence.

## Claims

### Claim 1

A method for implementing a SLICE operation in a programmable digital signal processor (DSP) as a primitive instruction in one or more data paths of at least one of (i) a single instruction single data scheme and (ii) a single instruction multiple data scheme.

### Claim 2 (depends on 1)

The method of claim 1, wherein the SLICE instruction is executed in three or less input cycles.

### Claim 3 (depends on 1)

The method of claim 1, wherein the SLICE operation includes an input symbol slicing stage and a quantization stage.

### Claim 4 (depends on 3)

The method of claim 3, wherein the input symbol slicing stage occurs during a first input cycle and the quantization stage occurs during a second input cycle.

### Claim 5 (depends on 4)

The method of claim 4, wherein the SLICE operation is configured to associate input symbol data with a particular point of a constellation grid, the constellation grid being stored in a memory of the DSP

### Claim 6

A computer readable medium carrying one or more sequences of one or more instructions for execution by one or more processors to perform a method for implementing a SLICE operation in a programmable digital signal processor (DSP) as a primitive instruction in one or more data paths of a single instruction multiple data scheme.

### Claim 7

A digital signal processor (DSP) including a number of single instruction multiple data (SIMD) path logic units, each logic unit including (i) a multiplier having two or more input ports, one of the input ports being configured to receive input symbol data, the multiplier being configured to produce a multiplier output, (ii) an adder configured to receive the output product and produce an adder output therefrom, and (iii) a scalar configured to scale the adder output, the DSP comprising:
a constants generator coupled to another one of the number of multiplier input ports and being configured to produce a fixed format signal based upon the input symbol data, the multiplier output being representative of a product of the received input symbol data and the fixed format signal;
wherein the adder is configured to (i) receive boundary constraints representative of a first component of predetermined symbol standards and (ii) compare the multiplier output with the boundary constraints, the adder output being representative of the comparison; and
a quantizer configured to (i) receive the adder output and (ii) associate the received adder output with a second component of the predetermined symbol standard, the quantizer producing a quantized output.

### Claim 8 (depends on 7)

The DSP of claim 7, wherein the DSP includes a number of data paths, each of the logic units being respectively arrayed along one of the paths.

### Claim 9 (depends on 7)

The DSP of claim 7, wherein the constants generator produces the fixed format signal in accordance with the expression 2{circumflex over ( )}(k-b), where (k) is a predetermined constant, and where (b) is indicative of fractional bits associated with the symbol data.

### Claim 10 (depends on 9)

The DSP of claim 9, wherein the symbol standards are associated with a constellation grid; and
wherein the constellation grid is formed of an infinite grid and a finite grid.

### Claim 11 (depends on 10)

The DSP of claim 10, wherein the first component is the finite grid.

### Claim 12 (depends on 11)

The DSP of claim 11, wherein the bit stream includes least significant bits (LSBs) and the quantizer sets the LSBs to zero.

### Claim 13 (depends on 12)

The DSP of claim 12, wherein the quantizer includes a logic array.

### Claim 14 (depends on 13)

The DSP of claim 13, wherein the quantizer includes a first logic gate having first and second input ports and a first output port, one of the first and second input ports being configured to receive the output sum and the other of the first and second input ports being configured to receive a control logic signal; and
a second logic gate having third and fourth input ports and a second output port, one of the third and fourth input ports being coupled to the first input port and the other of the third and fourth input ports being coupled to the second input port, the second output port being coupled to the first output port.

### Claim 15 (depends on 14)

The DSP of claim 14, wherein the first logic gate is an OR gate; and
wherein the second logic gate is an AND gate.

### Claim 16 (depends on 15)

The DSP of claim 15, wherein the second component is a nearest point within the infinite grid.

### Claim 17 (depends on 16)

The DPS of claim 16, further comprising an accumulator configured to (i) receive condition data representative of a location of the input symbol data and (ii) update the quantized output based upon the received condition data.

### Claim 18

A method of slicing a receive data symbol in a digital signal processor including a number of single instruction multiple data path logic units, each logic unit including (i) a multiplier having two or more input ports, one of the input ports being configured to receive input symbol data, the multiplier being configured to produce a multiplier output, and (ii) an adder configured to receive the output product and produce an adder output therefrom, the method comprising:
producing a fixed format signal based upon the input symbol data, the fixed format signal being multiplied by the input symbol data to produce the multiplier output;
comparing the boundary constraints with the multiplier output, a result of the comparing being representative of the adder output; and
associating with a second component of the predetermined symbol standard.

### Claim 19 (depends on 18)

The method of claim 18, wherein the fixed signal format is produced in accordance with the expression 2{circumflex over ( )}(k-b), where (k) is a predetermined constant, and where (b) is indicative of fractional bits associated with the symbol data.

### Claim 20 (depends on 18)

The method of claim 18, wherein the fixed format signal is formed of a bit stream having a fixed binary point.

### Claim 21 (depends on 18)

The method of claim 18, wherein the input signal includes a phase component and a magnitude component.

### Claim 22 (depends on 18)

The method of claim 18, wherein the symbol standards are associated with a constellation grid.

### Claim 23 (depends on 22)

The method of claim 22, wherein the constellation grid is formed of an infinite grid and a finite grid.

### Claim 24 (depends on 23)

The method of claim 23, wherein the first component is the finite grid.
