An air seeder includes a combination tank propulsion vehicle with mounted product tanks, and metering devices dispensing product from each product tank. A furrow opener implement is towed by the vehicle and an engine rotates the vehicle wheels and two or more implement wheels. A pneumatic distribution system conveys dispensed products to the furrow openers. The external guidance system sends location signals indicating a location of the implement frame to the operator. Steering, metering, and distribution signals are sent by both the external guidance system and an operator with a remote operator control, and operator signals override signals from the external guidance system.

In much of the agricultural industry, because weed control is now primarily done using herbicides rather than tillage, tillage of the soil has become greatly reduced, and it is currently very common to conduct "no-till" agricultural operations with no tillage at all. The furrow openers on modern seeding implements cut narrow furrows in the soil surface and agricultural products such as seed, fertilizer, and chemicals are deposited in the furrows. In an air seeder the furrow openers are evenly spaced across the width of an implement frame and the products are conveyed by a pneumatic conveyor system from product tanks to the furrows made by the furrow openers as a tractor tows the air seeder along the field.
The product tanks can either be mounted on the implement frame or on a separate tank cart towed either behind the implement frame or forward of the implement frame. While it is known to mount narrower width implement frames directly to a tractor or to a tank cart, more typically the implement frame is mounted on wheels and connected to a towing vehicle by a drawpin such that the towing vehicle and implement frame pivot with respect to each other about a vertical pivot axis. Where the air seeder includes a tank cart towed forward of the implement frame, known as a "tow between cart", the tank cart is connected at the front end thereof to the tractor by a drawpin and the implement frame is connected to the rear end of the tank cart by another drawpin. Where the air seeder includes a tank cart towed behind the implement frame, the implement frame is connected at the front end thereof to the tractor by a drawpin and the tank cart is connected to the rear end of the implement frame by another drawpin. The tow between cart severely reduces the visibility of the furrow openers and the ability of the operator to detect and correct plugging and like operational problems, and so the tow behind cart has become more popular.
As modern farms grow in size, air seeder manufacturers make wider air seeders with larger product tanks to cover more field area per hour and reduce the necessity to stop and refill the product tanks Thus present day air seeders can be very wide, up to 90 feet or more, and the product tanks can carry 1000 bushels or more of agricultural products, and the tank carts thus weigh 100,000 pounds or more when full, and even empty these carts weigh 30,000 to 40,000 pounds.
Tractors used to pull such large air seeders typically have 500 to 600 or more horsepower (HP). Tractors are generally ballasted to weigh about 100 pounds per horsepower to have sufficient traction to transfer the horsepower to the ground, and these large tractors thus weigh 50,000 to 60,000 pounds. Thus, a large air seeder train can weigh over 150,000 pounds, and this weight passing over the field surface can cause soil compaction, especially in some soil types, and reduce productivity in the soil over which the wheels of the train pass.
HORSCH Maschinen GmbH of Sitzenhof, Germany manufactures a self-propelled air seeder with an operator's station at a front end of a vehicle and a plurality of product tanks mounted on the same vehicle behind the operator's station, essentially combining the tractor and product tank cart of the conventional air seeder and reducing the weight. A furrow opener implement comprising an implement frame supported on wheels is connected to the rear end of the vehicle, and product is carried from the product tanks to the furrow openers by an air stream. Like the tow between cart, the large tanks directly behind the operator's station block virtually any view of the furrow openers, except those on the extreme right and left outer ends of the implement frame.
Lemken Co. of Alpen Germany have manufactured a similar self-propelled air seeder with a mounted implement frame carrying furrow openers and ground working tools. Because the furrow opener implement is mounted directly to the propulsion vehicle, the width of this machine is limited compared to the 80-90 foot wide implements desired in modern farming on large acreages.
External guidance systems include receivers mounted on the vehicle to receive location information from global positioning systems (GPS), ground based signal towers, lasers, and the like and are now commonly used to automatically steer tractors pulling air seeders and like agricultural implements to follow a desired path. After the boundaries of a field have been defined by a headland pass, the guidance system will keep track of where the seeding implement is located and provide guidance to accurately cover the field, one swath or pass at a time until the field has been fully covered. At the outset, tractors and self-propelled equipment such as field sprayers equipped with these "auto-steer" systems required human intervention to control starting and stopping the application of the agricultural products at the correct time, and to make the headland turns. The newest auto-steer systems can now control the application of agricultural products and make the headland turns without human intervention. Also, when irregular shaped areas within a field are encountered, GPS based systems have now been developed to identify overlap areas and prevent double application of the farm materials.
Such modern guidance systems can determine the location of the furrow openers to within two inches or less, and the aim is to guide the furrow openers in each pass so that a consistent spacing, typically about 10-12 inches, is achieved between the end furrow opener on one implement pass and the end furrow opener on the next adjacent pass.
Location sensors can be used to accurately determine the location of the furrow openers on the implement frame however since guidance is provided by the tractor at the front end of the train, significant deviations can occur, especially where a series of vertical pivotal connections is present between the furrow opener implement and the tractor. A heavy product cart at the rear of the chain of implements can also pull the furrow opener implement off course on sloping terrain.
In air seeders where all the product tanks are mounted on the implement frame, there is no tank cart and so there is only a single vertical pivot axis and the guidance is more accurate. With the larger product tanks desired for wide air seeders however, it is not practical to mount all product tanks on the implement frame, so larger air seeders typically require a tank cart.
The growing sophistication of external guidance systems has also led to the development of unmanned tractors, such as manufactured by Autonomous Tractor Corporation of Fargo, N.D. These tractors have diesel-electric drive and are guided by a laser based external guidance system, and include a remote control that allows control by a remote operator. A large fuel tank allows for 36 hours of operation, and a ballast tank allows the weight of the tractor to be increased or decreased as conditions might warrant by adding or removing water.
Conventionally, farmers would typically own a number of tractors of different sizes to pull the varied implements used in their operations. A large high powered tractor was used to pull the widest heavy implements that were used for tillage and seeding, and often as well to power large combines at harvest time. Smaller tractors might be used for spraying, to operate a loader, or for mowing and like lighter jobs.
Since the advent of no-till seeding, tillage is no longer carried out by many farmers. Combines of the type that are pulled behind large tractors are also no longer much in use. The result is that on many farms the largest tractor is used only for pulling the air seeder at seeding time, and sits idle for the rest of the year.

Autonomus air seeder apparatus with remote operator override


A rigid panel has projecting from the planar face thereof an elongate, transparent housing open at opposite ends and having an elongate slot in the underside thereof. Mounted in the housing is an elongate, transparent, flexible retainer comprising a strip of flexible, transparent acetate material which is generally U-shaped in cross section, and which has a portion thereof urged resiliently and removably against the face of the panel. The upper edge of a document may be inserted through the slot in the housing and between the panel face and the overlying portion of the retainer strip which retains the document removably and permits all information thereon to be observed through the transparent housing and retainer strip. In a second embodiment the acetate material is wound helically to produce a generally cylindrically-shaped, tubular retainer which is compressed radially to a generally oval cross sectional configuration and is inserted removably into the housing through one end thereof and is allowed to expand radially. A portion of the outer surface of the retainer is urged resiliently against the face of the panel to provide the means for retaining the upper edge of a document in the housing.

This invention relates to a device for releasably holding documents, and more particularly to a transparent hanger bar device for releasably holding one end to a document in such manner that any information or data printed on the portion of the document which is secured beneath the hanger can be observed and is completely legible.
Heretofore a variety of different devices have been employed for releasably securing one end of a document in a device so that the remainder of the document hangs downwardly from the device and can be observed. One of the disadvantages of prior such devices, however, is that the upper end of the document which is retained in the device is completely blocked from view, so that any printed information on that end of the document cannot be observed while the document is retained in the device. One such device, for example, utilizes a housing having rotatably mounted therein in a plurality of rollers, which are mounted to rotate adjacent the face of the housing about a common axis. One end of a document may then be inserted through a slot in the housing and beneath the peripheral surfaces of the rollers, and in such manner that such end of the document is releasably secured beneath the rollers and an adjacent wall of the housing. Unfortunately, it has been customary in the past to employ solid, opaque or non-transparent rollers, which overlie the end of the document which is secured in the device, and which therefore prevent anyone from observing any information printed on the face of that portion of the document that is positioned beneath the rollers.
Further than this, prior art devices of the type described have been rather expensive to manufacture, and difficult to assemble. Moreover, most such prior art devices have been rather heavy making it difficult to secure the device to the surface of a stationary or movable support.
It is an object of this invention, therefore, to provide a novel, transparent document supporting device which enables one to observe any printed information located on the face of that portion of a document, or a series thereof, which is releasably secured to the device.
A further object of this invention, therefore, is to provide a light-weight document supporting device which is made entirely from transparent materials, so that any information printed on the surface of that portion of the document which is secured to the device, can be observed and read at all times while the document is retained in the device.
Other objects of the invention will be apparent hereinafter from the specification and from the recital of the appended claims, particularly when read in conjunction with the accompanying drawings.


A circuit is supplied at the tap from a feeder which monitors certain signals coming from the single dwelling interdiction unit (SDI unit), and if the signals are interrupted, removes service from the premises. In order for service to be reinstituted to the subscriber DC power from the SDI unit must be received at the tap and the tap address must be communicated from memory in the SDI unit (where it had been previously stored upon installation by an installer) to the tap microprocessor. In accordance with an alternative embodiment in order for the service denial switch to remain closed, supplying signals to the SDI unit then to the home, the following must occur. Direct current power must be supplied from the SDI unit to the tap and data must be supplied from the SDI unit, in the form of pulses going from the normal powering level of, for example 12 volts, to 0 volts momentarily on a continual basis and not just at initialization as in the first embodiment. This data communicates a "keep alive" message to the tap, and may be changed from time to time. In accordance with another embodiment, AC power may be supplied by the SDI unit to the tap instead of DC power.

1. Field of the Invention
The present invention relates to a tamper resistant apparatus for a CATV system which apparatus is connected between a trunk and an interdiction system or other program denial means such as negative traps which are located at a subscriber's home, whereby attempts to tamper with transmission of premium programs (in the clear) to the program denial means on the subscriber's home are detected and program denial is effected.
2. Background Description
FIG. 1 illustrates the problem with conventional interdiction systems or other program denial means, wherein signals are sent unscrambled (in the clear) along a trunk or feeder cable 10 to a pole mounted tap 12, down a drop cable 14 until they reach the program denial means 16, which may be located on the side of a home 18 for convenience and ease of access for the cable installer. The program denial means 16 is powered by cable 20 and grounded by cable 22 and supplies a scrambled signal along cable 24 to a subscriber's dwelling. However, when this is done, the signals come to the home 18 before being scrambled, resulting in additional opportunities for the subscriber to steal signals. For example, should the subscriber install a tap (available at popular electronics stores and home centers) before the program denial means 16, he or she will receive all signals regardless of whether he or she has purchased them.
In a simple situation such as the illustration of FIG. 1, the installation could be audited periodically to ascertain that the subscriber has not tapped in ahead of the interdiction device. However, in the more general cases, plants may be growing over the drop cable, rendering visual inspection difficult. In many areas today, the cable would be installed underground, rendering auditing impossible.
In order to accommodate a reasonable degree of security in such situations, it is desirable to have available some sort of security which will detect intervention by an unauthorized person, and will deny any signals under such conditions.
One system for detecting tampering in a CATV system is disclosed in U.S. Pat. No. 4,443,815. In this system a wired program distribution tamper detection circuit useful in CATV is connected in the subscriber drop cable between the trunk and a subscriber's TV set and cuts off the program signal in the event the cable is momentarily disconnected as would occur during tampering. The circuit detects an abnormal impedance, in its general form, or the interruption of a DC path through the cable, in its preferred embodiment, and inhibits the application of the signal upon such detection. A complaint by the subscriber thus effects an announcement of the tampering. Subsequently, a serviceman must be sent to the subscriber's home, and is able to reestablish service by the mere push of a button which is hidden within the connector housing.
In the tamper detection circuit disclosed in the above patent, a serviceman is required to be sent to a subscriber's home which can be costly and inconvenient. In addition, the tamper resistant circuit is not addressable from the headend.

Tamper resistant apparatus for a CATV system


A motion sensing apparatus generally comprising a housing unit operable to be attached to an object at an attachment position, an accelerometer operable to provide a signal corresponding to an acceleration measurement; and a processing system. The processing system is operable to acquire the signal corresponding to the acceleration measurement and analyze the acquired acceleration measurement to identify the attachment position of the housing unit.

1. Field
Embodiments of the present invention relate to methods and apparatuses for determining the attachment position of a motion sensing apparatus. More particularly, various embodiments of the invention provide methods and apparatuses operable to determine the attachment position of a motion sensing apparatus using acceleration measurements sensed by the motion sensing apparatus.
2. Description of the Related Art
Motion sensing apparatuses are often used to sense the motion of an object, animal, or person. For example, sensed and calculated motion parameters, such as acceleration, average velocity, stride distance, total distance, gait efficiency, and the like, may be utilized in the training and evaluation of athletes and animals, the rehabilitation of the injured and disabled, and in various recreational activities.
Motion sensing apparatuses must often be attached to specific location, such as a user's shoe, arm, or wrist, to correctly sense and calculate motion parameters. Thus, if a motion sensing apparatus is attached to an incorrect location, it may function incorrectly. Further, differently configured motion sensing apparatuses must be employed for different attachment positions, thereby preventing users from using the same motion sensing apparatus in more than one attachment configuration.

This patent is subject to a terminal disclaimer.

Method and apparatus for determining the attachment position of a motion sensing apparatus


To limit use of content, when a source receives a request for transmitting content from a sink, the source performs an authentication process. When the authentication is successful, the source transmits to the sink key information necessary for decrypting the encryption applied to the content. The sink can receive the content by receiving the key information and by decrypting the encryption applied to the content by using the key information.

The present invention relates to an information processing apparatus and method. More particularly, the present invention relates to an information processing apparatus and method in which use of content can be limited.
In recent years, network systems typified by the Internet have become popular. As a result, it is now possible for users to transmit or receive information via the Internet.
A user who wants to view or listen to authored material such as movies or music can pay to receive the authored material.
However, there is a risk that in addition to the owner, other people, who have not paid to receive authored material such as movies or music, may fraudulently view or listen to the authored material through a network such as the Internet.
Also, if illegal viewing or listening through a network continues unrestrained, the content creation and distribution business will suffer.

Information processing apparatus and method


Techniques described herein register an endpoint device, such as a utility meter, with multiple headend systems. A system described herein includes a utility meter, which measures consumption of a resource, and a Network Management System (NMS) headend system, which manages a network. The utility meter joins the network and obtains an Internet Protocol (IP) address of the NMS headend system. The utility meter transmits a network registration request to the NMS headend system using the IP address of the NMS headend system and receives, from the NMS headend system, network-related settings of the network. The utility meter obtains an IP address of a second headend system configured to provide a service over the network. Further, the utility meter receives, from the second headend system, configuration settings for using the service of the second headend system and, as such, configures the radio with the network-related settings and the configuration settings.

An endpoint is a device that operates at the end, or edge, of a network. For instance, consumer devices such as smartphones and personal computers are typically endpoints, as such a device is connected to a network and operated by a user, rather than merely acting as a gateway. A utility meter can also act as an endpoint that measures the consumption of a resource, and the endpoint can then communicate data describing such measurements to other devices in a network.
Conventionally, while acting as an endpoint, a utility meter is connected to a central system by way of a network. The central system acts as a headend system that manages services provided to the node. For instance, such services include network management, distribution automation, outage management, and metering services (i.e., services related to the measurement and reporting of resource consumption). The utility meter and the headend system communicate with each other to ensure that the utility meter behaves as indicated based on parameters associated with each service; for instance, the command center instructs the utility meter as to how and under what circumstances to report consumption, power outages, or other information.

Registering an endpoint with multiple headend systems


The present disclosure pertains to a user equipment for a mobile telecommunications system includes circuitry including a receiver and a transmitter and which is configured to communicate with a new radio base station and a LTE base station. The circuitry is further configured to indicate a coexistence indication to the new radio base station or to the LTE base station; and receive a power control instruction for controlling power output of the transmitter.

Several generations of mobile telecommunications systems are known, e.g. the third generation ("3G"), which is based on the International Mobile Telecommunications-2000 (IMT-2000) specifications, the fourth generation ("4G"), which provides capabilities as defined in the International Mobile Telecommunications-Advanced Standard (IMT-Advanced Standard), and the current fifth generation ("5G"), which is under development and which might be put into practice in the year 2020.
A candidate for providing the requirements of 5G is the so-called Long Term Evolution ("LTE"), which is a wireless communications technology allowing high-speed data communications for mobile phones and data terminals and which is already used for 4G mobile telecommunications systems. Other candidates for meeting the 5G requirements are termed New Radio (NR) Access Technology Systems (NR). An NR can be based on LTE technology, just as LTE was based on previous generations of mobile communications technology.
LTE is based on the GSM/EDGE ("Global System for Mobile Communications"/"Enhanced Data rates for GSM Evolution" also called EGPRS) of the second generation ("2G") and UMTS/HSPA ("Universal Mobile Telecommunications System"/"High Speed Packet Access") of the third generation ("3G") network technologies.
LTE is standardized under the control of 3GPP ("3rd Generation Partnership Project") and there exists a successor LTE-A (LTE Advanced) allowing higher data rates than the basic LTE and which is also standardized under the control of 3GPP.
For the future, 3GPP plans to further develop LTE-A such that it will be able to fulfill the technical requirements of 5G.
As the 5G system will be based on LTE or LTE-A, respectively, it is assumed that specific requirements of the 5G technologies will, basically, be dealt with by features and methods which are already defined in the LTE and LTE-A standard documentation.
As discussed, in 3GPP a work Item (WI) on New Radio Access Technology (NR) has been agreed. The new Radio Access Technology (RAT) is expected to operate in a large range of frequencies, from hundreds of MHz to 100 GHz and it is expected to cover a broad range of use cases. Use cases, which are considered, are, for example:                Enhanced Mobile Broadband (eMBB)        Massive Machine Type Communications (mMTC)        Ultra Reliable & Low Latency Communications (URLLC)
At least for initial deployment, NR and LTE are expected to coexist.
Although there exist signaling techniques for LTE, it is generally desirable to improve coexisting situations between NR and LTE.


A hydraulic mechanical transmission includes a first hydraulic unit having a first shaft and a second hydraulic unit having a second shaft. The second hydraulic unit is connected in hydraulic fluid communication with the first hydraulic unit by high and low pressure lines. A valve having a variable orifice is positioned along the high and low pressure lines, and at least one of the first and second hydraulic units has a variable displacement. A mechanical torque transfer arrangement transfers torque between the first shaft of the first hydraulic unit and a rotatable component of the second hydraulic unit. In use, one of the first and second hydraulic units operates as a hydraulic pump and the other of the first and second hydraulic units operates as a hydraulic motor.

Hydraulic mechanical transmissions (HMT), also referred to as hydro-mechanical transmissions, can be used to supply or transfer mechanical power. More conventional examples of hydraulic mechanical transmissions implement the use of planetary gear sets. However, such hydraulic mechanical transmissions are typically large in size and expensive to build, which generally limits their use to large horsepower machines.

Hydraulic mechanical transmission with torque boost


Disclosed is a communication system in which it is possible to detect a TFI (Transport Format Indicator) even if a TFCI (Transport Format Combination Indicator) cannot be decoded correctly. The system includes a transmitting apparatus which, when a transmission is made, encodes transmit data of each transport channel (TrCH) at a prescribed transmission time interval (TTI), partitions the encoded data at a frame period to obtain frame data of a prescribed bit length, multiplexes and transmits the frame data of each TrCH and transmits TFCI information that specifies the frame data length of each TrCH. The system includes a receiving apparatus for comparing, on a per-TrCH basis, the TFIs of a plurality of frames within a transmission time interval (TTI) conforming to the TrCH and, if TFIs differ, deciding the transport format (TFI) in this transmission time interval (TTI) by majority decision, etc.

This invention relates to a transceiver apparatus and transceiving method in a W-CDMA system. More particularly, the invention relates to a transceiver apparatus and transceiving method in a W-CDMA system for demultiplexing and decoding transmit data on a plurality of multiplexed transport channels (TrCH) using a transport format (TFI: Transport Format Indicator).
FIG. 18 is a block diagram illustrating the structure of a mobile station according to the prior art. When data is transmitted, data sent from input/output units 1a to 1n is input to a data selector 2 via internal voice codecs and video codecs, etc. The input/output units 1a to 1n are a voice input/output device and an image input/output device, etc., of a cellular telephone. In accordance with a command from a processor 3, the data selector 2 selectively inputs the transmit data, which enters via the voice or video codecs of the input/output units 1a to 1n, to transmit buffers 51 to 54 having encoding time lengths of 10, 20, 40 and 80 ms, respectively. For example, since voice code is transmitted using three transport channels (TrCH), the voice code output from voice codecs is divided into three portions and these three portions are input to the transmit buffers of the corresponding transport channels (TrCH). That is, a voice codec expresses a voice signal by {circle around (1)} an LSP parameter expressing the human vocal tract, {circle around (2)} a pitch-period component expressing the periodicity of voice, {circle around (3)} a noise component included in voice, {circle around (4)} gain of the pitch-period component and {circle around (5)} gain of the noise component, extracts each of these elements from input voice, quantizes these elements and outputs the quantized data as voice code. The LSP parameter, pitch-period component and pitch gain are important and hence are assigned to a first transport channel. The noise component and noise gain may contain a small amount of error without critical consequences and therefore are assigned to second and third transport channels.
The transmit buffers 51 to 54 write the transmit data continuously to buffer memories (not shown) every 10 ms and read out the transmit data at a stroke in burst fashion every 10 ms, 20 ms, 40 ms, 80 ms and input the read data to encoding processors 61 to 64, which constitute the succeeding stage.
The encoding processors 61 to 64 encode the transmit data of the respective lengths 10, 20, 40 and 80 ms in accordance with convolutional encoding or turbo encoding and input the encoded data to a multiplexer 7. More specifically, the encoding processor 61 outputs encoded data E10 having a duration of 10 ms, the encoding processor 62 outputs encoded data E20 having a duration of 20 ms, the encoding processor 63 outputs encoded data E40 having a duration of 40 ms, and the encoding processor 64 outputs encoded data E80 having a duration of 80 ms. For example, as shown in FIG. 19, the encoder 61 outputs encoded data 10 ms-1 every 10 ms, the encoder 62 outputs the first half 20 ms-1 and second half 20 ms-2 of the encoded data #20 in order every 10 ms, the encoder 63 outputs one-quarter portions 40 ms-1, 40 ms-2, 40 ms-3, 40 ms-4 of the encoded data E40 in order every 10 ms, and the encoder 64 outputs one-eighth portions 80 ms-1, 80 ms-2, 80 ms-3, 80 ms-4, 80 ms-5, 80 ms-6, 80 ms-7, 80 ms-8, of the encoded data E80 in order every 10 ms.
The multiplexer 7 multiplexes the encoded data that enters from the encoding processors 61–64 every 10 ms, creates one frame's worth of multiplexed data and transmits the multiplexed encoded data as in-phase component data. FIG. 19 is a diagram useful in describing the multiplexing method. In the initial tenth millisecond, encoded data {10 ms-1, 20 ms-1, 40 ms-1, 80 ms-1} is multiplexed and transmitted as a first frame. Subsequently, in 20th to 80th milliseconds, the following multiplexed data is created and transmitted as second to eighth frames:                multiplexed data: {10 ms-1, 20 ms-2, 40 ms-2, 80 ms-2} . . . second frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-3, 80 ms-3} . . . third frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-4, 80 ms-4} . . . fourth frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-1, 80 ms-5} . . . fifth frame        multiplexed data: {10 ms-1, 20 ms-2, 40 ms-2, 80 ms-6} . . . sixth frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-3, 80 ms-7} . . . seventh frame        multiplexed data: {10 ms-1, 20 ms-2, 40 ms-4, 80 ms-8} . . . eighth frameThat is, for a service whose length of encoding time is 10 ms, the data is transmitted frame by frame; for a service whose length of encoding time is 20 ms, the data is transmitted over two frames; for a service whose length of encoding time is 40 ms, the data is transmitted over four frames; and for a service whose length of encoding time is 80 ms, the data is transmitted over eight frames.
A control signal generator 8 outputs control data such as a pilot PILO and TFCI as quadrature-component data at a fixed symbol speed. A QPSK spreader 9 subjects the input in-phase component (I-channel component) and quadrature component (Q-channel component) to spread-spectrum modulation using a predetermined spreading code, effects a digital-to-analog conversion and inputs the analog signal to a QPSK quadrature modulator 10. The latter subjects the I-channel signal and Q-channel signal to QPSK quadrature modulation, and a radio transmitter 11 frequency-converts (IF→RF) the baseband signal from the quadrature modulator 10 to a high-frequency signal, performs high-frequency amplification and transmits the amplified signal from an antenna ANTT.
FIG. 20 is a diagram useful in describing the frame format of an upstream signal from a mobile station to a base station. One frame has a length of 10 ms and is composed of 15 slots S0 to S14. User data is mapped to the I channel of QPSK modulation and control data is mapped to the Q channel of QPSK modulation. The number n of bits in each slot in the I channel for user data varies in dependence upon symbol speed. Each slot in the Q channel for control data is composed of ten bits and the symbol speed is a constant 15 kbps. The user data is formed by multiplexing the data of one or more transport channels, and the control data is composed of a TPC (Transmission Power Control) bit, TFCI (Transport Format Combination Indicator), PILOT and FBI.
FIG. 21 is a diagram useful in describing the frame format and slot arrangement of a downstream signal from a base station to a mobile station. One frame has a length of 10 ms and is composed of 15 slots S0 to S14. Each slot contains a mixture of user data Data 1, Data 2 and control data TPC, TFCI, PILOT. The data in each slot is distributed in turns to the I channel and Q channel of QPSK quadrature modulation one bit at a time, after which spread-spectrum modulation and quadrature modulation are applied, frequency conversion is carried out and the resultant signal is transmitted to the mobile station.
During reception, a radio receiver 13 subjects a high-frequency signal received from an antenna ANTR to a frequency conversion (RF→IF conversion) to obtain a baseband signal, subjects the baseband signal to quadrature detection to generate in-phase component (I component) data and quadrature component (Q component) data, applies an analog-to-digital conversion and inputs the digital data to a despreading demodulator 14. The latter applies despread processing to the I- and Q-component signals using a code identical with that of the spreading code, demodulates (synchronously detects) the transmitted encoded data and inputs the data to a demultiplexer 15. As shown in FIG. 22, the following encoded data that has been multiplexed is input to the demultiplexer 15:                multiplexed data: {10 ms-1, 20 ms-2, 40 ms-1, 80 ms-2} . . . first frame        multiplexed data: {10 ms-1, 20 ms-2, 40 ms-1, 80 ms-2} . . . second frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-3, 80 ms-3} . . . third frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-4, 80 ms-4} . . . fourth frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-1, 80 ms-5} . . . fifth frame        multiplexed data: {10 ms-1, 20 ms-2, 40 ms-2, 80 ms-6} . . . sixth frame        multiplexed data: {10 ms-1, 20 ms-1, 40 ms-3, 80 ms-7} . . . seventh frame        multiplexed data: {10 ms-1, 20 ms-2, 40 ms-4, 80 ms-8} . . . eighth frame
The demultiplexer 15 inputs the initial 10-ms encoded data 10 ms-1 of each frame to a first decoding processor 161, inputs second 20-ms encoded data 20 ms-1, 20 ms-2 to a second decoding processor 162, inputs third 40-ms encoded data 40 ms-1, 40 ms-2, 40 ms-3, 40 ms-4 to a third decoding processor 163, and inputs fourth 80-ms encoded data 80 ms-1, 80 ms-2, 80 ms-3, 80 ms-4, 80 ms-5, 80 ms-6, 80 ms-7, 80 ms-8 to a fourth decoding processor 164. That is, data of the service for which the length of encoding time is 10 ms is received frame by frame, data of the service for which the length of encoding time is 20 ms is received over two frames, data of the service for which the length of encoding time is 40 ms is received over four frames and data of the service for which the length of encoding time is 80 ms is received over eight frames.
The first decoding processor 161, which applies error correction processing to the encoded data of length 10 ms and decodes the original transmit data, decodes the encoded data 10 ms-1 and inputs the decoded data to a succeeding receive buffer 171 every 10 ms. The second decoding processor 162, which applies error correction processing to the encoded data of length 20 ms and decodes the original transmit data, decodes the encoded data 20 ms-1, 20 ms-2 and inputs the decoded data to a succeeding receive buffer 172 every 20 ms. The third decoding processor 163, which applies error correction processing to the encoded data of length 40 ms and decodes the original transmit data, decodes the encoded data 40 ms-1 to 40 ms-4 and inputs the decoded data to a succeeding receive buffer 173 every 40 ms. The fourth decoding processor 164, which applies error correction processing to the encoded data of length 80 ms and decodes the original transmit data, decodes the encoded data 80 ms-1 to 80 ms-8 and inputs the decoded data to a succeeding receive buffer 174 every 80 ms.
The receive buffers 171, 172, 173 and 174 write the decoded data to buffer memories in a single burst every 10 ms, 20 ms, 40 ms and 80 ms, read the decoded data out of the buffer memories continuously every 10 ms and input the data to the data selector 2. In accordance with a command from the processor CPU 3, the data selector 2 selectively inputs the decoded data, which enters from each of the receive buffers 171 to 174, to the input/output units 1a to 1n. Thus, one feature of a W-CDMA system which can be mentioned is that a plurality of different services can be utilized simultaneously.
The above is a description of the overall operation of the mobile station. Multiplexing and demultiplexing will be described in greater detail below. The data transceive time intervals of the W-CDMA system are stipulated as being 10, 20, 40 and 80 ms. Such a time interval is referred to as a TTI (Transmission Time Interval) and the transceive timing is as shown in FIG. 23 on a per-TTI basis.
The channel codec transmitter (encoding processor) 6i (i=1 to 4) in this W-CDMA system accepts data transmitted from a higher layer, executes encoding processing on a per-transport-channel (TrCH) basis, multiplexes the encoded data, maps the multiplexed data to a physical channel and transmits the data. Conversely, the channel codec receiver (decoding processor) 16i (i=1 to 4) demultiplexes the data, which has been multiplexed onto the physical channel, on a per-transport-channel (TrCH) basis, executes decoding processing and delivers the results to the higher layer.
When communication starts, conditions necessary for encoding processing, such as the encoding scheme (convolutional encoding, turbo encoding, etc.), TTI and transceive format, are specified for each transport channel (TrCH) by the processor CPU 3. The transmit data is encoded in accordance with the conditions specified. If transmit data is encoded on each transport channel (TrCH), the data is multiplexed frame by frame, mapped to the physical channel and transmitted. The physical-channel data is transmitted in units of 0 ms since one frame has a duration of 10 ms. Accordingly, data having a TTI of 20 ms or greater is divided evenly into frame units of 10 ms and the data is then transmitted upon being mapped to the physical channel taking the time TTI. FIG. 24 illustrates an example in which two transport channels TrCH#1, TrCH#2 of TTIs 20 ms and 40 ms, respectively, are multiplexed and transmitted (TrCH#1=TTI 20 ms, TrCH#2=TTI 40 ms). In FIG. 24, TrCH#1-1 and TrCH#1-2 of first and second frames are the initial 20 ms of data of TrCH#1, and TrCH#1-3 and TrCH#1-4 of third and fourth frames are the next 20 ms of data of TrCH#1.
When the encoded data of each transport channel (TrCH) is multiplexed, mapped to a physical channel and transmitted, a parameter indicating how the encoded data of each transport channel TrCH has been multiplexed is created in such a manner that demultiplexing can be performed correctly on the receiving side, and this parameter is transmitted upon being attached to the physical-channel data. This parameter is referred to as a TFCI (Transmission Format Combination Indicator). The TFCI is uniquely decided by a combination of transport formats which specify the bit length per frame of data transmitted by each transport channel (TrCH).
Transport formats are numbered and each is denoted by TFI (Transport Format Indicator). An example of a TFI table is shown in FIG. 25. In the TFI table of FIG. 25, there are four types of transport formats of the transport channel TrCH#1. These are formats, for which the TFIs are 0, 1, 2 and 3, that transmit 336×0 bits, 336×1 bits, 336×2 bits and 336×3 bits per frame, respectively. Further, there are two types of transport formats of the transport channel TrCH#2. These are formats, for which the TFIs are 0 and 1, that transmit 148×0 bits and 148×1 bits per frame, respectively. If the transport channels are only of the two types TrCH#1 and TrCH#2, then the combinations of TFIs of TrCH#1 and TrCH#2 will be a total of eight and TFCIs shown in the table (TFCI table) of FIG. 26 will be assigned to these combinations.
The transport format TFIs that can be taken on by each transport channel (TrCH) are reported from the processor CPU. In FIG. 24, therefore, if 20-ms data of 336 bits×2 and 20-ms data of 336 bits×1 is transmitted from the TrCH#1 successively and 40-ms data of 148 bits×1 is transmitted from the TrCH#2, the multiplexed data (four frame's worth) mapped to a physical channel becomes the combinations of TFIs shown in FIG. 27, and the TFCIs at this time are shown in the column on the right-hand side.
If the format TFIs of each item of TrCH data mapped to the physical channel are known, as mentioned above, then it will be possible to calculate, from the TFCI table of FIG. 26, the TFCIs that indicate the combinations of TFIs. If TFCIs have been calculated, then a TFCI code word (32-bit data) is created by executing encoding processing similar to that of the user data. The TFCI code word is transmitted together with the physical-channel data.
The receiving side first decodes the TFCI code word and obtains the TFCI. The receiving side refers to the TFCI table on the basis of the TFCI obtained, detects the transport format (TFI) of each TrCH, then examines the mapping status (data length per frame) of each TrCH on the physical channel on the basis of the TFI table, demultiplexes the data on a per-TrCH basis and executes decoding processing.
The TFCI code word is obtained by converting a TFCI value to a code word constituting one row of a Hadamard matrix, by way of example. Processing for decoding the TFCI is executed by subjecting the received code to a Hadamard transform.
Processing for decoding a TFCI code word using a Hadamard transform will be illustrated below. An orthogonal code necessary to understand a Hadamard transform will be described first. When any two code words are orthogonal in Euclidean space, the two code words are referred to as orthogonal code. That is, it is said that code words u=(u1, u2, . . . , un−1, un), v=(v1, v2, . . . , vn−1, vn) are quadrature code if they satisfy the relationship indicated by the following equation:(u,v)=u1v1+u2v2+un−1vn−1unvn=0If 0s and 1s of a code word are replaced by +1 and −1, respectively, the result is referred to particularly as an analog orthogonal code. A square matrix of degree n in which code words are arrayed in each row in such a manner that the code words of any two rows will have an orthogonal relationship is referred to as a Hadamard matrix. In other words, a Hadamard matrix is a matrix in which each of the elements is +1 or −1 and any two different rows are orthogonal. An operation in which a vector of n dimensions is multiplied by this matrix is referred to as a Hadamard transform. Equation (1) below is an example of an 8-dimensional Hadamard matrix.
                    H        =                  [                                                                      +                  1                                                                              +                  1                                                                              +                  1                                                                              +                  1                                                                              +                  1                                                                              +                  1                                                                              +                  1                                                                              +                  1                                                                                +                  1                                                                              -                  1                                                                              +                  1                                                                              -                  1                                                                              +                  1                                                                              -                  1                                                                              +                  1                                                                              -                  1                                                                                +                  1                                                                              +                  1                                                                              -                  1                                                                              -                  1                                                                              +                  1                                                                              +                  1                                                                              -                  1                                                                              -                  1                                                                                +                  1                                                                              -                  1                                                                              -                  1                                                                              +                  1                                                                              +                  1                                                                              -                  1                                                                              -                  1                                                                              +                  1                                                                                +                  1                                                                              +                  1                                                                              +                  1                                                                              +                  1                                                                              -                  1                                                                              -                  1                                                                              -                  1                                                                              -                  1                                                                                +                  1                                                                              -                  1                                                                              +                  1                                                                              -                  1                                                                              -                  1                                                                              +                  1                                                                              -                  1                                                                              +                  1                                                                                +                  1                                                                              +                  1                                                                              -                  1                                                                              -                  1                                                                              -                  1                                                                              -                  1                                                                              +                  1                                                                              +                  1                                                                                +                  1                                                                              -                  1                                                                              -                  1                                                                              +                  1                                                                              -                  1                                                                              +                  1                                                                              +                  1                                                                              -                  1                                                              ]                                    (        1        )
Equation (2) below is an example of a Hadamard transform.
                              H          ·          u                =                                            [                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                ]                                                  (                                                                                u                      1                                                                                u                      2                                                                                ·                                                                                u                      8                                                                                )                                =                                                 [                                                                                u                      1                                                                                +                                              u                        2                                                                                +                                              u                        3                                                                                +                                              u                        4                                                                                +                                              u                        5                                                                                +                                              u                        6                                                                                +                                              u                        7                                                                                +                                              u                        8                                                                                u                      1                                                                                -                                              u                        2                                                                                +                                              u                        3                                                                                -                                              u                        4                                                                                +                                              u                        5                                                                                -                                              u                        6                                                                                +                                              u                        7                                                                                -                                              u                        8                                                                                u                      1                                                                                +                                              u                        2                                                                                -                                              u                        3                                                                                -                                              u                        4                                                                                +                                              u                        5                                                                                +                                              u                        6                                                                                -                                              u                        7                                                                                -                                              u                        8                                                                                u                      1                                                                                -                                              u                        2                                                                                -                                              u                        3                                                                                +                                              u                        4                                                                                +                                              u                        5                                                                                -                                              u                        6                                                                                -                                              u                        7                                                                                +                                              u                        8                                                                                u                      1                                                                                +                                              u                        2                                                                                +                                              u                        3                                                                                +                                              u                        4                                                                                -                                              u                        5                                                                                -                                              u                        6                                                                                -                                              u                        7                                                                                -                                              u                        8                                                                                u                      1                                                                                -                                              u                        2                                                                                +                                              u                        3                                                                                -                                              u                        4                                                                                -                                              u                        5                                                                                +                                              u                        6                                                                                -                                              u                        7                                                                                +                                              u                        8                                                                                u                      1                                                                                +                                              u                        2                                                                                -                                              u                        3                                                                                -                                              u                        4                                                                                -                                              u                        5                                                                                -                                              u                        6                                                                                +                                              u                        7                                                                                +                                              u                        8                                                                                u                      1                                                                                -                                              u                        2                                                                                -                                              u                        3                                                                                +                                              u                        4                                                                                -                                              u                        5                                                                                +                                              u                        6                                                                                +                                              u                        7                                                                                -                                              u                        8                                                                                ]                                                          (        2        )
The way in which a Hadamard matrix is used in encoded is as described below. Here 000˜111 of transmit data is transformed to code words of first to eighth rows of the Hadamard matrix of Equation (1). Specifically, the data is transformed as follows:                Transmit data 000→(0,0,0,0,0,0,0,0) . . . first row of Hadamard matrix        Transmit data 001→(0,1,0,1,0,1,0,1) . . . second row of Hadamard matrix        Transmit data 010→(0,0,1,1,0,0,1,1) . . . third row of Hadamard matrix        Transmit data 011→(0,1,1,0,0,1,1,0) . . . fourth row of Hadamard matrix        Transmit data 100→(0,0,0,0,1,1,1,1) . . . fifth row of Hadamard matrix        Transmit data 101→(0,1,0,1,1,0,1,0) . . . sixth row of Hadamard matrix        Transmit data 110→(0,0,1,1,1,1,0,0) . . . seventh row of Hadamard matrix        Transmit data 111→(0,1,1,0,1,0,0,1) . . . eighth row of Hadamard matrix
At the time of reception, it is necessary to discriminate transmitted orthogonal code words from received code. The operation performed is the Hadamard transform. For example, assume that R=(0,0,0,0,0,0,0,0) has been received. The following is obtained by the Hadamard transform:
                              H          ·          R                =                                            [                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                ]                                                  (                                                                                R                      1                                                                                R                      2                                                                                ·                                                                                R                      8                                                                                )                                =                      (                                                            8                                                                              0                                                                              0                                                                              0                                                                              0                                                                              0                                                                              0                                                                              0                                                      )                                              (        3        )            Here it is determined that the code word corresponding to 8, which is the largest result of the Hadamard transform (absolute value) from among the candidates of the first to eighth rows, i.e., the code word (0,0,0,0,0,0,0,0) of the first row of the Hadamard matrix, has been sent, and the corresponding data 000 is output. It should be noted that the value of each candidate is likelihood, which indicates the degree of certainty.
The foregoing is an ideal case in which there is no transmission error. However, the transmit data can be reconstructed by the Hadamard transform even in a case where (0,0,0,0,0,0,0,0) has been received as R=(0,0,0,0,0,0,0,1), for example, owing to transmission error. Specifically, the following is obtained by the Hadamard transform:
                              H          ·          R                =                                            [                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                -                      1                                                                                +                      1                                                                                -                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                ]                                                  (                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                +                      1                                                                                -                      1                                                                                )                                =                      (                                                                                +                    6                                                                                +                    2                                                                                +                    2                                                                                -                    2                                                                                +                    2                                                                                -                    2                                                                                -                    2                                                                                +                    2                                                                        )                                              (        4        )            Since the largest absolute value (likelihood) among the candidates of the first to eighth rows is +6 of the first row, it is judged that the code word (0,0,0,0,0,0,0,0) of the first row of the Hadamard matrix has been sent, and the corresponding data 000 is output. Thus, each value of the candidate matrix following the Hadamard transform indicates the degree of certainty (likelihood). Equation (4) involves a great deal of computation. For this reason, a computation method shown in FIG. 28 has been proposed to perform the computations more efficiently. In FIG. 28, the solid lines indicate −, the dashed lines indicated + and the circles indicate adders. In accordance with this method of computation, 3×8=24 computations suffice (computations where the arrow marks cross), whereas 8×8=64 computations would be required conventionally. Computation is thus made more efficient.
The fact that a plurality of services can be sent and received upon being multiplexed can be mentioned as a feature of a W-CDMA system. Multiplexing of services is implemented by multiplex processing of transport channels (TrCHs) in the physical channel layer. In order to execute decoding processing, therefore, it is necessary to demultiplex the data of each TrCH. To achieve this, it is necessary to discriminate which transport channel (TrCH) of data has been multiplexed on a physical channel and at what ratio. Such TrCH multiplexing information can be obtained from the TFCI data (TFCI code word) received together with the user data.
When a received TFCI code word is decoded by an orthogonal transform such as the Hadamard transform, a TFCI indicating the state of TrCH multiplexing of the received user data can be detected. The transport format (TFI) of each TrCH that has been multiplexed onto the physical channel can be detected from the TFCI using the TFCI table. From this the data length used in the process of decoding each TrCH can be calculated using the TFI table.
The encoding processing applied to a TFCI is weaker than the turbo/convolutional processing applied to user data, and the probability that decoding will be erroneous is higher in comparison with user data. That is, there are instances where a correct TFCI cannot be decoded owing to transmission error or the like. If decoding of a TFCI is erroneous, correct TrCH multiplexing information will not be obtained. As a consequence, the user data cannot be demultiplexed correctly for every transport channel (TrCH), with the result that correct decoding can no longer be performed.
Thus, processing for detecting an erroneous TFCI and applying a correction is necessary. In the prior art, however, processing which corrects for an error in TFCI is not particularly executed and user data can not always be decoded correctly.

Transceiver apparatus and transceiving method in communication system