Abstract: A method, a codebook, and a Base Station (BS) for precoding are provided. The precoding method includes: obtaining a total uplink power of a User Equipment (UE); if the total uplink power is greater than ¾ of a rated total transmit power of antennas, selecting a codeword from a first codebook with imbalanced power between layers; otherwise, selecting a codeword from the first codebook and a second codebook with balanced power between layers, so as for precoding data to be transmitted according to the selected codeword. Thus, a loss of an antenna performance at a high signal-to-noise ratio is reduced, and the loss of the power amplification of the antenna is reduced if the transmit power of the antenna is restricted.

Abstract: In variable rate data transmission, a data transmission method or the like is provided which enables adjustment for achieving desired erroneous rate detection. A transmitting side places a calculated error detecting code after the transmission data in each frame, generates frame data in which an R-bit series before the final bit position of the error detecting code is rearranged in inverse order, and transmits. A receiving side assumes the transmission data and error detecting code by assuming the final bit position of the frame data in each frame, conducting the assumption presuming that the rearrangement in inverse order has occurred on the transmitting side. Among the assumed final bit positions, the position determined to be errorless as a result of the error detection based on the assumed transmission data and error detecting code is determined as the final bit position. R can be greater or less than the number of bits of the error detecting code.

Abstract: A MAP decoder, or a turbo decoder having constituted MAP decoders, is configured with bi-directional sliding windows. A sliding window architecture is applied to the forward state metric (FSM) calculation of an encoded data block having a trellis with N time-steps. The data block is divided into smaller sub-blocks and a forward recursion of two or more of the sub-blocks are performed in parallel to obtain FSMs. Each sub-block overlaps with a previous sub-block by k time-steps, where k is an integer value greater than zero. This provides a good approximation of the FSMs at time-step k+t of the sub-block. The FSMs associated with the first k time steps of each sub-block, other than the first sub-block, are discarded. A reverse recursion of each sub-block is also performed to obtain reverse state metrics (RSM) for the sub-block. Likelihood ratios are then calculated based on the FSMs and RSMs.

Abstract: A method of encoding, transmitting and decoding data over a wireless medium, including, selecting a number of bits N representing a symbol, creating a set of at least 2 to the power of N equal sized codewords with a larger number of bits than N, representing the 2 to the power of N possible combinations of N bit symbols, receiving a stream of data, replacing every N bit symbol from the stream of data with its representative codeword from the created set, transmitting the codewords using a faster transmission bit rate such that the transmission time allocated for each codeword is substantially the same as the time duration required to transmit the original bits it replaced.

Abstract: A decoding method comprising the following steps is provided. The mth lookup index for a new lookup table is obtained according to the number of leading 1's in the bit stream. The nth base Huffman code in a simplified Huffman table is obtained according to the mth lookup index. The (n+1) most significant bits (MSB) are obtained from the bit stream according to the nth base Huffman code. A difference is generated according to the (n+1) MSBs in the bit stream and the nth base Huffman code. Whether the difference is less than 0 is checked. If yes, a symbol index is generated according to the difference and the nth base symbol index, and a symbol is obtained according to the symbol index. If no, n is decreased or increased by 1 according to the method being used, and the data in the simplified Huffman table is compared continually.

Abstract: A system and method for communicating information using Layer 1 from a powered device to power source equipment via Ethernet. In one embodiment, Layer 1 information such as power management, classification, temperature, and disconnect information is transmitted from a powered device to power source equipment using an AC signal that has a cycle defining a first time period during which the AC signal is turned on and a second time period during which the AC signal is turned off. A type of information being sent by the powered device can be determined based on characteristic on/off times of the AC signal cycle.

Abstract: A pulse modulation method divides code comprising 4N-bit data into 2-bit units of data. For each pulse signal having a fixed pulse width tw, a code modulated signal is generated by pausing between pulse pause intervals Tr. An adjusted time width of between ½ and 1 times the fixed pulse width tw is taken to be ?t. One of time widths 0, ?t, 2?t, and 3?t is added to a fixed pause period tm of time intervals according to a corresponding value of the 2-bit data. If the sum total time TD of the code modulated signal is an interval of at least [(2tw+2tm+3?t)N+?t], each pulse pause interval Tr is substituted by a pulse pause interval Tr corresponding to the inverted 2-bit data. An inversion flag signal expresses that inversion information is added to the code modulated signal.

Abstract: The invention describes a method and device for designing a set of codewords, which have good properties for use in communication systems. These codeword sets are useful because they provide advantages to a communication system that uses them in that they result in lower error rates in the receiver. The method for designing the codes is to take a good set of codes with perfect periodic autocorrelation and manipulate it so as to transform it into a better code-set, for example a code-set with higher mean Golay merit factor, lower spectral peak to average ratio and lower mean cross correlation.

Abstract: Presented herein are systems, methods, and devices for transmitting data comprising by comparing a new message with a buffered message representative of a previous message, recording an integer number of differences between the new message and the buffered message, generating a diff-word representative of the integer number of differences between the new message and the buffered message, appending the diff-word to the new message, and sending the new message with the diff-word to a receiver. The diff-word is used by the receiver to determine whether a received new message has the expected number of differences, and to determine whether to accept the new message.

Abstract: A receiver of a communication system includes means for receiving repetition-coded data. The receiver also includes means for generating symbol information from the received repetition-coded data. The receiver also includes means for storing symbol information over a predetermined period and means for making tentative symbol decisions by combining the stored symbol information.

Abstract: A noise filter, used for a digital signal, configuring an [N?1]-stage filter by connecting the N-number of flip flops in series comprises a selection unit for outputting a filter output signal by selecting one of signals filtered by one to (N?1) stages based on a selection signals; and a wave form check unit for making the selection unit change a selection thereby by changing a value of the selection signal based on a pulse width on the filter output signal which is output from the selection unit.

Abstract: A system and method for transferring data between a transmitter and a receiver over a single conductor is disclosed. During a data transfer operation of bit of information, the voltage level on the conductor is changed from a first voltage level to a second voltage level and maintained at the second voltage level for a predetermined duration of time. The predetermined duration of time is determined by the logical state of the data bit being transmitted. Upon expiration of the predetermined duration of time the voltage level on the conductor is driven back to substantially the first voltage level.

Abstract: At a base station apparatus, known pilot signals for use in channel estimation are transmitted, and in addition thereto MCS pilot signals that are used to perform adaptive modulations respectively corresponding to a plurality of modulation schemes are multiplexed and output. A mobile station apparatus dispreads the respective MCS signals out of the multiplex signal, compares these to known symbols patterns, and sends the MCS pilot signals that show a matching relationship to the base station apparatus as a mobile station reception result. Upon receiving the mobile station reception result from the mobile station apparatus, the base station apparatus selects the modulation scheme of the optimum modulation level for the downlink signals. This configuration makes it possible to switch the modulation schemes in an accurate and simple way.

Abstract: Details of media encoding and decoding devices which support generic homing sequences, and methods for operating such devices are disclosed. The use of generic homing sequences may permit an embodiment of the disclosed invention to support real-time, bit-exact testing of existing and future media encoding and decoding devices. An embodiment of the present invention may permit the initialization of encoding and decoding algorithms to a known state, enabling bit-exact testing of a large group of devices using these algorithms, including those whose specifications do not support such functionality. This capability may permit the full-speed, bit-exact, testing, of both locally and remotely situated media encoders and decoders.

Abstract: A system for receiving data on a communication channel. The system examines the state of a bit that was previously received on the channel. If the state of the previously received bit was high, the system looks for a falling edge while receiving a subsequent bit on the channel. Otherwise, the system looks for a rising edge while receiving the subsequent bit on the channel. While looking for a rising edge or looking for a falling edge, the system samples a signal on the channel at discrete time steps within a symbol interval, wherein the symbol interval is a time period during which the signal can change states. The specific discrete time step at which the signal changes state is associated with a specific decoded output symbol. Note that the signal can also convey information by not changing states.

Abstract: Transceiver circuitry for use in a multiple-input, multiple-output (MIMO), orthogonal frequency-division multiplexing (OFDM), communications environment, is disclosed. Error correction coding according to a fixed-block size code, such as low density parity check (LDPC) coding, is implemented. The codeword length, and codeword arrangement, are selected by determining a minimum number of OFDM symbol periods required for a payload size, and the number of available information bits in those symbol periods. A rule-based approach, for example in a table, is used to select the codeword length, and the number of codewords required. Shortening is then applied to the code, followed by determining whether puncturing or repeating of bits is necessary to efficiently use the available OFDM symbols.

Abstract: Bit-Edge Zero Forcing Equalizer. A novel solution is presented by which a BE-ZFE (Bit-Edge Zero Forcing Equalizer) is employed to drive an error term within a data signal to an essentially zero value. This new BE-ZFE looks at values of data that occur at the bit edges of a data signal and drives the associated error term to zero. The new BE-ZFE is appropriately implemented within communication systems that are phase (or jitter) noise limited. Some examples of such communication systems include high-speed serial links one type of which serviced using a SERDES (Serializer/De-serializer) where data that is originally in a parallel format is serialized into a serial data stream and then subsequently de-serialized back into a parallel data stream.

Abstract: A type dependency modulation method with type control is integrated with type control code words in traditional type dependency modulation. It increases the effect of DC component control in the overall encoding procedure. In this method, a specific type-control code word is inserted at certain intervals in the encoding procedure, increasing the selectable code words in subsequent encoding procedures, thereby improving the DC component control ability.

Abstract: A codec circuit having a programmable digital bandpass filter is disclosed. According to one aspect, a bandpass filter matches the filter characteristics of the codec circuit to a transmitted pulse code modulation (PCM) signal. The codec circuit includes at least one programmable digital high-pass filter connected in series to at least one programmable digital low-pass filter. The setting filter characteristics for the programmable digital high-pass and low pass filters are each set by means of a signal identification device for identifying a PCM signal transmitted through the codec circuit. The filters are set as a function of the transmitted PCM signal in order to vary a bandpass filter characteristic for the programmable digital bandpass filter.

Abstract: Each burst of an OFDM signal which is transmitted, for example, on the basis of the IEEE 802.11a/g WLAN Standard contains a preamble with a sequence of ten short training signals. The DC offset is derived from the mean value of the signal over a measurement section of the training signal sequence, with a first subsection of the measurement section in time being weighted with a rising weighting function, and a last subsection of the measurement section in time being weighted with a falling weighting function. A central subsection, which is not weighted, may be located between the two. The signal is accumulated in this way over the measurement section, and the result is divided by the sum of the weights of the subsections. Using this procedure, the averaging process has better filter characteristics than the noise contribution from the actual signal.

Abstract: The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of: (a) Adaptive Sampled NetFlow (ANF), and adjusted weight (AANF) of a flow (f) is calculated as follows: AANF(f)=i(f)/p?; i(f) being the number of packets counted for a flow f, and p? being the sampling rate at end of a measurement period; or (b) Adaptive Sample-and-Hold (ASH), and adjusted weight (AASH) of a flow (f) is calculated as follows: AASH(f)=i(f)+(1?p?)/p?; i(f) being the number of packets counted for a flow f, and p? being the sampling rate at end of a measurement period.

Abstract: The invention relates to a system and a method of digital communication between synchronized submarine devices, system including means of sending a signal in modulated bit form, at least one sender (100) and at least one receiver (200), characterized in that said at least one sender (100) sends a signal enabling both any data to be transmitted to said at least one receiver (200) and a propagation time between said at least one sender (100) and said at least one receiver (200) to be measured.

Abstract: A correlator despreads a P/N long code constructed from two or more constituent codes A, B, C having N, M and L elements respectively. In a third stage, L filter taps decorrelate elements of the third constituent code from the input received signal, leaving elements of code AB. The outputs of the third stage delay line are summed and input into a second stage delay line having M filter taps to decorrelate the elements of the second constituent code from the input to the second stage, leaving elements of code A. The outputs of the second stage delay line are summed and input to a first stage delay line having N filter taps. The output of the first stage delay line is summed and input into a shift register. An energy peak in the shift register indicates the phase of the P/N elements in the register is proper.

Abstract: The invention provides signal coding, wherein the signal is source coded to obtain a coded data stream, and source significance information (SSI) is included into the coded data stream, the source significance information (SSI) indicating desired protection rates of respective parts of the coded data stream. In this way, a channel encoder may obtain the source significance information (SSI) from the coded data stream, which is advantageous in presence of intermediate network layers. Preferably, the coded data stream comprises respective packets, the being included in respective headers associated with the respective packets, a given header indicating desired protection rates for respective parts (pin) of the associated packet. In order to provide easy detection of the source significance information (SSI), a first header (SSI1) is placed at a beginning of the coded data stream. Alternatively, the header (SSI1) is provided with an identifier.

Abstract: A channel coding method of variable length information using block code is disclosed. A method for channel-coding information bits using a code generation matrix including 20 rows and A columns corresponding to length of the information bits includes, channel-coding the information bits having “A” length using basis sequences having 20-bit length corresponding to columns of the code generation matrix. If “A” is 10, individual basis sequences of the code generation matrix correspond to column-directional sequences of a specific matrix composed of 20 rows and 10 columns. The specific matrix is made from 20 rows of the (32,10) code matrix used for TFCI coding were selected.

Abstract: A channel coding method of variable length information using block code is disclosed. A method for channel-coding information bits using a code generation matrix including 32 rows and A columns corresponding to length of the information bits includes, channel-coding the information bits having “A” length using basis sequences having 32-bit length corresponding to columns of the code generation matrix, and outputting the channel-coded result as an output sequence. If “A” is higher than 10, the code generation matrix is generated when (A?10) additional basis sequences were added as column-directional sequences to a first or second matrix. The first matrix is a TFCI code generation matrix composed of 32 rows and 10 columns used for TFCI coding. The second matrix is made when at least one of an inter-row location or an inter-column location of the first matrix was changed. The additional basis sequences satisfy a value 10 of a minimum Hamming distance.

Abstract: A modulation apparatus and method employs first and second conversion means for translating input data into an alternate form for recording. The first conversion means converts a portion of input data matching a first data pattern into a first code pattern in accordance with a first table which maintains an even/odd-characteristic and a second conversion means converts a portion of input data matching a second data pattern into a second code pattern in accordance with a second table which does not maintain an even/odd-characteristic.

Abstract: Data having a basic data length of m bits is modulated to a variable-length code having a basic code length of n bits. A sync signal is added to the data after a minimum bit-run in the data. The sync signal exhibits two or more patterns, each pattern breaking a maximum bit-run and having six channel bits for identifying each sync signal. The two or more patterns are distinguished from one another, with a detection distance of at least two therebetween.

Abstract: A composite code is made for example by exclusive-OR'ing each real element of a first constituent code A with each element of a second constituent code B to obtain a basic composite code. To suppress autocorrelation, differing numbers of doping code elements are inserted between code segments made from combining each element of code A with an element of code B. A matched filter first stage removes from its input the A code and any doping code added to it, summing the elements of code A. A matched filter second stage removes from its input the B code and any doping code added at the second level. The summed elements of code B are the input to the first stage. Optionally, the summed elements of the doping code at any level may be delayed and summed with the elements of the A code in the first stage.

Abstract: The present invention relates to method and apparatus of converting a series of data words into modulated signals. This method divides a data word, which a sync signal is to be added in front or rear of when it is written in a recording medium, into two or more word segments, generates for each word segment a number of intermediate sequences by combining mutually different digital words with that word segment, scrambles these intermediate sequences to form alternative sequences, translates each alternative sequence into a (d,k) constrained sequence, checks how many undesired sub-sequences are contained in each (d,k) constrained sequence, and selects one (d,k) constrained sequence for recording on an optical or magneto-optical recording medium among the (d,k) constrained sequences not having the undesired sub-sequence. Applying this method to a modulating device, DSV control can be conducted by much simpler hardware.

Abstract: Nuclear spectroscopy systems have improved over the course of time especially with the advent of digital pulse processing. One disadvantage of digital processing, however, is that it has eliminated the older, universally compatible interface standard of analog signals. Digital component interfaces are often defined by computer software, protected by copyright and unique to a single manufacturer. Consequently, all components of an entire spectroscopy system must be from a single manufacturer. This not only dictates system wide component replacement, but also impedes optimization that would otherwise occur were component compatibility the rule rather than the exception. The present innovation describes a method and apparatus to relieve the present incompatibility between digital components of a nuclear spectroscopy system that are supplied by more than one manufacturer.

Abstract: Various embodiments are described to provide for the transmission and reception of data in an improved manner. Data transmission is improved by including in a transmitter a null generator (110) to generate an output data symbol sequence that exhibits nulls in the frequency domain at particular frequencies that an input data symbol sequence does not. A pilot inserter (120) then adds a pilot symbol sequence to this output data symbol sequence to create a combined symbol sequence. Since the pilot symbol sequence exhibits pilot signals corresponding to the nulls of the output data symbol sequence in the frequency domain, the combined symbol sequence exhibits pilots that are orthogonal to the data in the frequency domain.

Abstract: The present invention relates to a method for transmitting data via a physical channel in a communication system, the channel being used by at least one first communication device and one second communication device and transmitting data with a defined bit rate. According to the present invention, the data to be transmitted (TD) is composed of load data (LD) and identification data (ID) for identifying the second communication device, the load data (LD) and identification data (ID) are coded separately from one another, the respective coding (C_LD, C_ID) takes place in such a way that an identical bit rate is achieved after the coding operation for the load data (LD) and the identification data (ID) and the rate is matched to the bit rate that has been defined for the physical channel by a rate matching mode, which defines which bits are punctured or repeated in a data stream. The rate matching model for load data (LD) and identification data (ID) is identical.

Abstract: This ID proposes synchronization patterns for RLL codes with a (repeated) minimum transition run (RMTR) constraint, where the synchronization pattern comprises a synchronization pattern-body that contains a characteristic bit-pattern that represents a violation of the RMTR constraint. Using a violation of the RMTR constraint allows for short synchronization patterns.

Abstract: A device including a variable length coding unit that includes an input unit connected to a stream switching unit, and an output unit connected to the stream switching unit. The input unit to encode at least two input streams simultaneously. The output unit to transmit output streams to an output interface connected to the output unit.

Abstract: A modulation method for symbols in a frame of a compact disc includes the steps of receiving a plurality of data words, modulating each data word into a code word of a corresponding data symbol, and providing a plurality of combinations of potential merge bits to be inserted between successive symbols of the frame. At least one combination of candidate merge bits is generated according to the plurality of combinations of potential merge bits, a data symbol immediately preceding the location of the candidate merge bits, and a data symbol immediately succeeding the location of the candidate merge bits. The combination of candidate merge bits which minimizes (optimizes) the absolute cumulative DSV is selected when a subsequent group of possible combinations of candidate merge bits is detected or after a predetermined delay, and the selected combination of candidate merge bits is inserted between the two successive data symbols.

Abstract: Several code detectors in parallel simultaneously examine varying overlapping segments of a data stream containing variable length codes, referred to as a data window. The data window segments directly address memory structures within each of the code detectors without any previous logic stages. Each code detector is responsible for a range of code lengths, and ignores data window bits that are not relevant to its code length range. Each code detector outputs a possible result to a layer of logic that selects the possible result of the single code detector which contains result data corresponding to a variable length code in the data window.

Abstract: A method of encoding, transmitting and decoding data over a wireless medium, including, selecting a number of bits N representing a symbol, creating a set of at least 2 to the power of N equal sized codewords with a larger number of bits than N, representing the 2 to the power of N possible combinations of N bit symbols, receiving a stream of data, replacing every N bit symbol from the stream of data with its representative codeword from the created set, transmitting the codewords using a faster transmission bit rate such that the transmission time allocated for each codeword is substantially the same as the time duration required to transmit the original bits it replaced.

Abstract: A soft demodulation method and apparatus including calculating partial sums for a unit of each predetermined number of bits of a codeword received from a channel; calculating a value of each entry of the decoding table by referring to the partial sums; and detecting a maximum among values of all entries of the decoding table and calculating a log-likelihood ratio (LLR) using the detected maximum. Accordingly, it is possible to reduce the amount of computation required to perform a soft demodulation process using run-length limited (RLL) codes and to simplify the soft demodulation process.

Abstract: A modulation method for a first data string having a plurality of symbols is disclosed. The method includes: appending a data string to the first data string to form a second data string; and converting the second data string to a code word sequence by converting each of the symbols in the first data string to a code word according to predetermined modulation rules and a symbol set selected from the second data string. Each code word has a first fixed number of bits, each symbol has a second fixed number of bits, and each symbol set has a fixed number of symbols.

Abstract: With audio data reduction on the basis of ISO/IEC standard 11172-3, a frame length varying by 8 bits is used at a sampling frequency of 44.1 kHz in order to arrive, on average, at a particular fixed data rate. The lengthening of a data frame is signalled by a padding bit in the header of the frames. The invention dispenses with evaluation of the padding bit. Instead, the mean frame length L is calculated, L is rounded down to the next integer, for the subsequent frame it is first established whether the expected sync word for this frame appears, and, if this is so, this frame is decoded without taking into account the padding bit, but if the expected sync word for this frame does not appear, the decoding of the frame is started one 8-bit later without taking into account the padding bit.

Abstract: A method of data transmission according to one embodiment of the invention includes encoding a set of data values to produce a corresponding series of ordered n-tuples. The method also includes transmitting, according to the series of ordered n-tuples, a plurality of bursts over a plurality n of frequency bands. Specifically, for each of the plurality of bursts, a frequency band occupied by the burst is indicated by the order within its n-tuple of an element corresponding to the burst. A bandwidth of at least one of the plurality of bursts is at least two percent of the center frequency of the burst. Information is encoded into a polarity of at least one of the plurality of bursts.

Abstract: Details of media encoding and decoding devices which support generic homing sequences, and methods for operating such devices are disclosed. The use of generic homing sequences may permit an embodiment of the disclosed invention to support real-time, bit-exact testing of existing and future media encoding and decoding devices. An embodiment of the present invention may permit the initialization of encoding and decoding algorithms to a known state, enabling bit-exact testing of a large group of devices using these algorithms, including those whose specifications do not support such functionality. This capability may permit the full-speed, bit-exact, testing, of both locally and remotely situated media encoders and decoders.

Abstract: The invention relates to a transmission method for transmitting data symbols to or from users of an ultra bandwidth telecommunication system, each user (u) of said system being associated with a specific time hopping pattern consisting of a plurality (Ns, Nb) of integers (cju), the signal transmitted to or from a user consisting of sequences of the same plurality of frames, each integer of said pattern being associated with a corresponding frame and each frame containing a pulse time-shifted from the beginning thereof by an amount (cjuTc) determined by said associated integer, the pulses of one sequence being further position modulated by one or a plurality (nb) of data symbols to be transmitted to or from said user. According to the transmission method of the invention, the time at which a sequence of a user is transmitted is obtained from a pseudo-random sequence specific to said user. The invention equally relates to the corresponding transmitter.

Abstract: A digital sync signal added in a modulator to a train of codes having a digital sum value, and detected in a demodulator. The digital sync signal has a pattern that breaks a maximum run and a pattern that preserves a minimum run and a maximum run. The digital sync signal has a bit that is selectively determined to be a “0” or a “1” for controlling the digital sum value of the train of codes. The minimum run is repeated no more than a predetermined number of times irrespective of whether the digital sync signal includes the minimum run.

Abstract: Several code detectors in parallel simultaneously examine varying overlapping segments of a data stream containing variable length codes, referred to as a data window. The data window segments directly address memory structures within each of the code detectors without any previous logic stages. Each code detector is responsible for a range of code lengths, and ignores data window bits that are not relevant to its code length range. Each code detector outputs a possible result to a layer of logic that selects the possible result of the single code detector which contains result data corresponding to a variable length code in the data window.

Abstract: A SYNC bit inserting section 14 adds a sync signal to a train of codes, after adding a minimum run, said sync signal having a pattern that breaks a maximum run. It is thereby possible to provide a reliable sync signal pattern.

Abstract: The present invention pertains to a modulation apparatus and method in which the modulation apparatus is realized with a simple circuit structure and is easily applicable to other systems. A pattern conversion unit 32 converts data having a basic data length of 2 bits supplied from a DSV control bit determination and insertion unit 31 into a variable-length code having a basic code length of 3 bits in accordance with a conversion table. A minimum-run-length limitation code detection unit 33 detects, from a data sequence containing a DSV control bit, the position of minimum runs consecutive from a channel bit string converted by the pattern conversion unit 32. A consecutive-minimum-run replacement unit 34 replaces a predetermined portion of the channel bit string supplied from the pattern conversion unit 32 for a predetermined pattern based on the position information supplied from the minimum-run-length limitation code detection unit 33, and limits the minimum run length to a predetermined number or less.

Abstract: A sequence of input information items is space-saving-encoded into variable-length code bit groups. Each information item is mapped on an associated code bit group of a set of bit groups, wherein the bit groups have particular lengths that are non-uniform in the set. The code bit groups are chained into a chaining configuration of bit groups while allowing progressive delimiting of successive bit groups. For regressive delimiting of successive bit groups, each bit group as divided into an idiosyncratic sequence of subgroups. In each sequence, the subgroups are assigned to a respective sub-chainings. The sub-chainings are configured into respective sub-chaining configurations, while maintaining pointer information regarding each respective sub-chaining configuration to preserve mutual synchronization among the various sub-chaining configurations regarding the associated in formation items.

Abstract: A transmitting method of digital data whereby information data can be reproduced at a high precision. In order to retain digital data in sectors comprising a plurality of sync frames and sequentially transmit, the sync frame is comprised of the sync signal and the run length limited code which satisfies the limitations of the minimum run length and the maximum run length, and the sync signal includes the sync pattern constituted by a bit pattern of a run length that is longer than the maximum run length by only 3T and addition bit patterns which are arranged before and after the bit pattern and each of which has a urn length that is longer than the minimum run length. The sync signal includes a specific code which indicates a position in the sector and which enables the DC control to be performed.