Browse Prior Art Database

# An Apparatus for Efficient Data Extraction from Bit-Stream

IP.com Disclosure Number: IPCOM000019843D
Publication Date: 2003-Oct-01
Document File: 5 page(s) / 150K

## Publishing Venue

The IP.com Prior Art Database

## Abstract

Disclosed is a method that extracts data required points and locations from digital signal constellations. Benefits include improved efficiency and an easier implementation.

This text was extracted from a Microsoft Word document.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 66% of the total text.

# An Apparatus for Efficient Data Extraction from Bit-Stream

Disclosed is a method that extracts data required points and locations from digital signal constellations. Benefits include improved efficiency and an easier implementation.

## Background

Currently, a counter keeps track of the position, and is initialized to zero at the beginning. Every bit of the data is checked for the valid data; when valid data is detected, its weight or position is extracted.

## General Description

The disclosed method has been incorporated extensively in modem implementations ( V.xx), and in similar computations, such as digital image and video processing and wireless computation. In V.90 (PCM), the constellation is one-dimensional and each signal point corresponds to a particular signal strength. In V.90 there are a total of 128 signal points classified into 8 groups each consisting of 16 bits. Each bit corresponds to one constellation point.

Figure 1 shows the flow of the disclosed method. Figures 2a through 2d compare cycle counts between the disclosed method and the current state of the art. Figures 3a through 3d compares the order of complexity between the disclosed method and the current state of the art. Table 1 outlines the steps of the disclosed method:

 Steps Description Hand calculation 1 S = { A1, A2, …Am }, Consider two data blocks say A1 = [b1b2 b3 , . . . , bl ] l= 1, 2, 3 ,… N where N is a natural number bi= 0 or 1 i = 0 to l A2 = [b1b2 b3 , . . . , bl], A1 = [0000100000000000] A2 = [0000000000001000] 2 Perform Logical OR operation on those blocks Bß A1 OR A2 Bß [0000100000000000] OR [0000000000001000] B[0000100000001000] 3 Determine the length of l from from B and compute the sum of bits from LSB C ß b1 +b2+ b3+ , . . . , bl bÎ B , 2l C ß 1+0+0+0 We assumed k=4 C = 1 4 If there is Carry or C=1 then we have to check the locations in A1 A2 , extract the position else go to s...