Abstract: Data rates of simultaneous radio transmissions of data are matched for services over a connection between a base station and a subscriber station by determining a service-specific rate matching factor for one of the services based on a steady-state rate matching factor and a dynamic rate matching factor. The dynamic connection-oriented rate matching factor is based on the steady-state matching factor. The dynamic-connection oriented rate matching factor matches a sum of a volume of data for the services over the connection to a volume of data available in a next frame of data. In addition, the data is compressed or expanded for the one of the services based on the corresponding service-specific rate matching factor.

Abstract: Data rates of simultaneous radio transmissions of data are matched for services over a connection between a base station and a subscriber station by determining a service-specific rate matching factor for one of the services based on a steady-state rate matching factor and a dynamic rate matching factor. The dynamic connection-oriented rate matching factor is based on the steady-state matching factor. The dynamic-connection oriented rate matching factor matches a sum of a volume of data for the services over the connection to a volume of data available in a next frame of data. In addition, the data is compressed or expanded for the one of the services based on the corresponding service-specific rate matching factor.

Abstract: A method for matching a data rate of simultaneous radio transmissions of data for services over a connection between a base station and a subscriber station. The method includes determining a service-specific rate matching factor for one of the services based on a steady-state rate matching factor and a dynamic rate matching factor. The dynamic connection-oriented rate matching factor is based on the steady-state matching factor. The dynamic-connection oriented rate matching factor matches a sum of a volume of data for the services over the connection to a volume of data available in a next frame of data. The method also includes compressing or expanding the data for the one of the services based on the corresponding service-specific rate matching factor.

Abstract: To transmit data packets between a transmitter and a receiver, the data packets are transmitted in coded from as coding units. The received data packets are stored in coded or uncoded form in the receiver inside a memory. The receiver notifies the transmitter of the capacity utilization of the memory.

Abstract: Described herein is a method of providing synchronization between a plurality of base stations (300) in a telecommunications system which comprises providing a random access channel in each cell (320). A local base station (300) uses the random access channel in the local cell to transmit a synchronization signal to neighboring base stations. For each base station, the time differences between received synchronization signals from neighboring base stations and the local synchronization signal are calculated. Each set of time differences is either used to autonomously synchronize the local base station or is centralized in a radio network controller and a set of corrections distributed from the RNC to the base stations.

Abstract: For a communication system (e.g. UMTS with CDMA radio interface), the invention draws a distinction between services with high and low data rate dynamics and uses a matched type of signaling for the transport formats currently being used. The data rate of the data for a service can fluctuate greatly and/or rapidly over time (high dynamics), or may fluctuate only a little and/or slowly (low dynamics). The data for the services are transmitted via a common physical channel, with in-band signaling being used for signaling the transport format for the services with high data rate dynamics, and with signaling in a separate channel being used for the services with low data rate dynamics.

Abstract: According to the invention, signalling of the used common channels is carried out implicitly via the data rate. Several combinations of channels (spread codes) are only permitted as an alternative for particular data rates of the individual services. Transmission capacity is saved since it is not necessary to reserve individual bits inside the TFCI parameter uniquely for the allocation of said common channels to different connections. The invention is especially useful in the downlink of the FDD modus of UMTS mobile radio systems.

Abstract: According to the invention, transmissions of the second radio station are received in the first radio station in which the operating instruction for transmission power of the second radio station is determined. The operating instruction is transmitted during a following transmission of the first radio station to the second radio station, whereupon the latter takes into account the operating instruction for power regulation during one of its following transmissions. Contrary to prior art, no time invariable or fixed step size is used. An operating instruction is used instead which is related to a variable step size in transmission power regulation. The variable step size is subscriber-dependent and time-dependent regulated by the radio stations.

Abstract: A data communications apparatus, which communicates data frames, includes a converter, which converts a data frame into a data block for transmission. The data block has a size which is different than a size of the data frame. The converter includes a puncturer for puncturing or repeating bits or symbols at positions within the data frame that are determined in accordance with a selection strategy. The selection strategy uses a digital differential analyzer-type algorithm.

Abstract: According to the invention, a service-specific static rate adaptation factor that controls a service-specific quality of service is determined in a manner already known per se. A dynamic rate-oriented rate adaptation factor is determined for a link, whereby said factor adapts the hypothetical volume of data to a volume of data that is available in the next frame while taking into account the adaptation of the service-specific data rate that is yet to be performed. It is possible to pass through several optimization loops if said data volume is not rigidly predetermined as a result of a sufficient number of transmission channels and spread factors. A service-specific rate adaptation factor is determined by combining the static rate adaptation factor and the dynamic link-related rate adaptation factor, whereupon one single and therefore one-step adaptation of the data rate is carried out.

Abstract: To transmit data packets between a transmitter and a receiver, the data packets are transmitted in coded from as coding units. The received data packets are stored in coded or uncoded form in the receiver inside a memory. The receiver notifies the transmitter of the capacity utilization of the memory.

Abstract: During the determination of the timing advance (TA), the data is transmitted from the first station (MS) without the timing advance in the form of short radio blocks (B1). After determining the timing advance (TA), the data (D), while taking the timing advance into account, is transmitted from the first station (MS) in the form of long radio blocks (B2) which are longer than the short radio blocks (B1). Both the short radio blocks (B1) as well as the long radio blocks (B2) are transmitted from the first station (MS) in the same channel allocated to the connection.

Abstract: A method of operating a high speed, error-free data transmission system in a noisy medium includes compressing data determined to be compressible, forward error correcting the data and interleaving the data in a bit matrix memory to enhance the forward error correction. Digital information packets are formulated including a header bearing a packet number, the total packet byte count, any packet number resend request, the data byte count of the actual data and a CRC. The digital information packet is loaded onto a transmitter carousel having a fixed number of sectors. The receiver receives the data, requests resend of any packet (by number) that is defective, error corrects if necessary and sequentially loads the packet onto a receiver carousel. Packets or sequential packet groups are removed from the carousel, selectively decompressed and the data words extracted and sent to the output.

Abstract: A flat input keyboard for data processing machines or the like has the following successive layers, starting from the side facing away from the operation side: a supporting layer (10), an electric switching system (12, 16, 20) with electric contact spots that correspond to a keyboard pattern, a buffer layer (24) and a flexible elastic covering layer (26) provided on the operation side facing away from the electric switching system with a keyboard pattern (28). The supporting layer, the electric switching system, the buffer layer and the covering layer are interconnected at least along their circumference.