334 results about "Base code" patented technology

Coding techniques for a (e.g., OFDM) communication system capable of transmitting data on a number of "transmission channels" at different information bit rates based on the channels' achieved SNR. A base code is used in combination with common or variable puncturing to achieve different coding rates required by the transmission channels. The data (i.e., information bits) for a data transmission is encoded with the base code, and the coded bits for each channel (or group of channels with the similar transmission capabilities) are punctured to achieve the required coding rate. The coded bits may be interleaved (e.g., to combat fading and remove correlation between coded bits in each modulation symbol) prior to puncturing. The unpunctured coded bits are grouped into non-binary symbols and mapped to modulation symbols (e.g., using Gray mapping). The modulation symbol may be "pre-conditioned" and prior to transmission.

A system and method for creating a graphical program, wherein the graphical program is operable to invoke execution of textual code. The user selects a code node for inclusion in the graphical program, wherein the code node is displayed on the screen. The user then selects or enters textual code that is comprised in or displayed in the code node. The textual code may be code from a text-based language, such as Perl, Mathematica, or Java, etc., or may be a script from a scripting language. The user may manually enter the textual code into the code node, or import the textual code from a file. The textual code comprised in the code node is user viewable and editable. During execution of the graphical program, the code node is operable to invoke execution of the textual code comprised in the code node. The textual code is preferably executed by an instance of a server program. During execution of the graphical program, the graphical programming system provides the textual code to the server program, as well as any input data received by the code node. The server program then executes the textual code, using any input data received by the code node, and produces an output which is provided back to the graphical program. The present invention thus enables a user of a graphical programming system to more easily incorporate, view, edit and debug textual based code from within the graphical programming system.

A system, method and database development tool are disclosed for automatically generating parameters for use in executing a stored code object in a data base, by parsing source code derived from existing data base code which represents the stored code object, wherein the parameters may represent complex data types.

A multi-carrier spread spectrum device using cyclic shift orthogonal keying includes: a modulation unit for receiving a first part of data bits and transforming the first part of data bits to a modulation symbol d_i by modulation; a cyclic-shift unit for receiving a base code c₍₀₎ and a second part of data bits, and performing a cyclic-shift to the base code c₍₀₎ in accordance with the second part of data bits to generate a CSOK symbol c_{(m<sub2>i</sub2>)}; and a multiplier for multiplying the modulation symbol d_i by the CSOK symbol c_{(m<sub2>i</sub2>)} to generate a spread spectrum signal c_i.

A method and mechanism for using threads in a computing system. A multithreaded computing system is configured to execute a first thread and a second thread. Responsive to the first thread detecting a launch point for a function, the first thread is configured to provide an indication to the second thread that the second thread may begin execution of a given function. The launch point of the function precedes an actual call point of the function in an execution sequence. The second thread is configured to initiate execution of the function in response to the indication. The function includes one or more inputs and the second thread uses anticipated values for each of the one or more inputs. When the first thread reaches a call point for the function, the first thread is configured to use a results of the second thread's execution, in response to determining the anticipated values used by the second thread were correct.

Spatial concealment of errors in an intra picture comprised of a stream of macroblocks is achieved by predicting the missing data in a macroblock based on an intra prediction mode specified in neighboring block. In practice, when macroblocks within a stream are coded by a block based coding technique, such as coding technique specified in the H.264 ISO/ITU standard, a macroblock can be predicted for coding purpose based on neighboring intra prediction modes specified by the coding technique.

Systems, apparatuses and methods whereby a base coded video signal is provided to a decoder having a set of post-processing stages. The base coded video signal can be decoded to produce a base decoded video signal. Post-processing of the base decoded video signal can be used to produce an enhanced quality video output signal. Application of a post-processing stage can be implemented according to the capabilities of the decoder and/or the instantaneous operating parameters of the decoder and/or characteristics of a display. A control signal, communicated over a dedicated channel separate from the base coded video signal, can be used initiate and/or aid implementation of a post-processing stage. The control signal can also provide information to assist/manage the decoding of the base coded video signal. The use of additional post-processing stages increases the complexity of an overall decoding process while improving the quality of a resulting reproduced video sequence.

A communication system provides for data collection and route discovery for a network of distributed nodes. A base code having a data collection function occasionally sends agent packets to selected nodes of the network (620), and these nodes in turn route the agent packets to other nodes. A route suitability level is maintained for each node that reflects the suitability of that node for routing packets to the base node (5 10). At least some data packets contain reporting criteria for particular nodes (620). When a condition exists at a node that meets the reporting criteria, a selected packet is updated with reporting data, and routed toward the based node via a neighbor node based on the route suitability level of the neighbor node (550,552,555).

The invention relates to a multidimensional constellation mapping based coding and modulating method, demodulating and decoding method and system. The coding and modulating method comprises the following steps of: carrying out channel coding and bit interleaving on input information bits to obtain coded interleaved bits; carrying out K-dimensional pulse amplitude modulated constellation mapping on the coded and interleaved bits to obtain a constellation mapping symbol of a K-dimensional real-number vector, wherein K is a positive integer; carrying out constellation rotation on the constellation mapping symbol to obtain a multidimensional rotated constellation mapping symbol of the K-dimensional real-number vector; and carrying out dimension conversion and general real-number interleaving on the multidimensional rotated constellation mapping symbol to obtain a coded and modulated symbol, and outputting the coded and modulated symbol. The method and system in the invention can ensure that the performances of a coding and modulating system and a corresponding demodulating and decoding system approach the channel capacity at medium and low frequency spectrum efficiency under the AWGN (Added White Gaussian Noise) and fading channel conditions and meanwhile, the throughput of the system is taken into consideration.

Provided is a method for performing hierarchical B picture-based coding on a video sequence using the structure of adaptively divided group of pictures (GOP). The method includes the steps of, for each predefined 2^N frame-sized group of pictures (GOP) of the video sequence, (a) encoding the 2^N frame-sized GOP of the video sequence based on each of the different GOP sizes from the maximum size, 2^N, to the minimum size, 2^M (M is an integer between 1 and N) and obtaining different values between frames reconstructed after the encoding is performed and frames after the hierarchical B-picture prediction is performed, based on each of the different GOP sizes; (b) selecting at least one sub-GOP based on the difference values obtained by encoding the 2^N frame-sized GOP of the video sequence based on each of the different GOP sizes; and (c) generating a bitstream by encoding the 2^N-frame-sized GOP based on the at least one selected sub-GOP. Thereby, the hierarchical B picture-based video coding is performed by adaptively dividing the GOP size based on performance and thereby obtains high coding efficiency.

A method, apparatus and product for use in generating a remainder based code generates a plurality of preliminary remainder based codes in response to specified data, and synthesizing a remainder based code for the specified data, in response to the plurality of preliminary remainder based codes. In one embodiment, the plurality of preliminary remainder based codes includes at least two preliminary remainder based codes each generated in response to a respective portion of the specified data. In another embodiment, at least two preliminary remainder based codes are generated at least partially concurrently with one another.

The present invention demonstrates how network-coding can be applied to a deterministic broadcast approach, resulting in significant reductions in the number of transmissions in the network. We propose two algorithms, that rely only on local two-hop topology information and make extensive use of opportunistic listening to reduce the number of transmissions: 1) a simple XOR-based coding algorithm and 2) a Reed-Solomon based coding algorithm that determines the optimal coding gain achievable for a coding algorithm that relies only on local information.

A system and method of estimating impact of software updates includes obtaining usage measures for an instance of a software application, analyzing the software update of the software application by comparing base code for the software application to updated code for the software application, identifying one or more lines of interest from the base code based on the comparing, and aggregating the usage measures for the instance associated with the lines of interest to determine an impact factor. The base code corresponds to source code for the instance. The updated code corresponds to source code for the software application after the software update is applied to the base code. In some examples, the system and method further include normalizing the impact factor based on a length of time used to collect the usage measures, a number of lines of code in the base code, and a number of lines of code in the updated code.

The present invention provides an interface device between a prototype system and an HLA emulating system, wherein the interface device is composed of a collocation tool generating module, an XML collocation file analyzing module, an HLA system service accessing module, a prototype system service accessing module, a system service switching module, an emulation storing module and an upper code assistant generating module. The XML collocation file analyzing module, the HLA system service accessing module, the prototype system service accessing module, the system service switching module and the emulation storing module are arranged in the interface device. The collocation tool generating module and the upper code assistant generating module are arranged outside the interface device. The interface device aims at different prototype systems and automatically generates a basic code frame of interface device, customizes the action and capability of interface device with the collocation tool for realizing the accurate access from the prototype system to the HLA emulating system, and fully uses the advantages of HLA emulating mechanism for realizing the seamless access from the prototype system to the HLA system.

The invention relates to an amount recognition system for code scanning payment cash register of merchants, and an implementation method of the amount recognition system. The amount recognition system is characterized in that: original cash register software of merchants does not need to be modified, and code scanning payment cash register software is additionally installed to achieve support for code scanning payment; when the code scanning payment cash register software is installed for the first time, a screenshot region in the cash register software is set by using a button (1) marked with ''selecting amount appearing region'', the code scanning payment cash register software automatically performs screenshot on a settlement amount region of the cash register software according to a preset range when carrying out code scanning payment settlement each time, an opencv computer vision library is used for performing preprocessing on a picture to generate a binary image and save it, then a specific amount is recognized and amount input is automatically achieved through OCR (optical character recognition) according to a language package which is specially trained and corrected.

An encoder uses output symbol subsymbols to effect or control a tradeoff of computational effort and overhead efficiency to, for example, greatly reduce computational effort for the cost of a small amount of overhead efficiency. An encoder reads an ordered plurality of input symbols, comprising an input file or input stream, and produces output subsymbol. The ordered plurality of input symbols are each selected from an input alphabet, and the generated output subsymbols comprise selections among an output subsymbol alphabet. An output subsymbol is generated using a function evaluator applied to subsymbols of the input symbols. The encoder may be called one or more times, each time producing an output subsymbol. Output subsymbols can then be assembled into output symbols and transmitted to their destination. The functions used to generate the output subsymbols from the input subsymbols can be XOR's of some of the input subsymbols and these functions are obtained from a linear code defined over an extension field of GF(2) by transforming each entry in a generator or parity-check matrix of this code into an appropriate binary matrix using a regular representation of the extension field over GF(2). In a decoder, output subsymbols received by the recipient are obtained from output symbols transmitted from one sender that generated those output symbols based on an encoding of an input sequence (file, stream, etc.).