All The Claims

1. An apparatus for outputting an input data block comprising a plurality of bits as an output data block with at least one puncturing or with at least one repetition of at least one bit, where the input data block contains a plurality of input data words having a respective plurality of bits, and the output data block contains output data words associated with the input data words the apparatus comprising:
an association unit for associating the bits in an input data word (11; 31) with the bits in the associated output data word on the basis of an alterable puncturing or repetition pattern the association unit being a hardware circuit which is designed to execute both puncturing and repetitive coding, and the association unit having a plurality of association elements which each have a logic input and a logic output for associating a bit in an input data word with one or no bit in the associated output data word;
a control unit for producing the puncturing or repetition pattern on the basis of prescribed puncturing or repetition information; and
a first address generation unit for producing first addresses for the logic outputs of the association elements for respective association with a bit in the output data word on the basis of the puncturing pattern and for producing first addresses for the logic inputs (pi(w)) of the association elements for respective association with a bit in the input data word on the basis of the repetition pattern.
2. The apparatus as claimed in claim 1, further comprising:
a second address generation unit for producing second addresses for the logic inputs of the association elements for continuous association with a respective bit in the input data word when the apparatus is operated as a puncturing apparatus, and for producing second addresses for the logic outputs of the association elements for continuous association with a respective bit in the output data word when the apparatus is operated as a repetition apparatus.
3. The apparatus as claimed in claim 1, further comprising:
an input memory for buffer-storing at least one input data word, the input memory comprising a plurality of registers which are respectively designed to store a bit, and
an output memory for buffer-storing at least one output data word the output memory comprising a plurality of registers which are respectively designed to store a bit.
4. The apparatus as claimed in claim 3, further comprising:
a first rewriteable memory connected upstream of the input memory for storing input data blocks, and
a second rewriteable memory connected downstream of the output memory for storing output data blocks.
5. The apparatus as claimed in claim 2, further comprising
a plurality of control units.
6. The apparatus as claimed in claim 2,
wherein the control unit, the first address generation unit and the second address generation unit are each designed as hardware.
7. The apparatus as claimed in claim 5, wherein
the control units produce a puncturing or repetition pattern based on the UMTS standard 3GPP TS 25.212.
8. A method for operating an apparatus for outputting an input data block comprising a plurality of bits as an output data block with at least one puncturing or with at least one repetition of at least one bit, where the input data block contains a plurality of input data words having a respective plurality of bits, and the output data block contains output data words associated with the input data words, the apparatus having an association unit for associating the bits in an input data word with the bits in the associated output data word on the basis of an alterable puncturing or repetition pattern (incw(k)), the association unit being a hardware circuit which is designed to execute both puncturing and repetitive coding, and the association unit having a plurality of association elements (MUXw) which each have a logic input and a logic output for associating a bit in an input data word with one or no bit in the associated output data word, the apparatus having a control unit for producing the puncturing or repetition pattern (incw(k)) on the basis of prescribed puncturing or repetition information, and the apparatus having a first address generation unit for producing first addresses (pdw(k)) for the logic outputs (po(w)) of the association elements (MUXw) for respective association with a bit in the output data word on the basis of the puncturing pattern (incw(k)) and for producing first addresses (pdw(k)-for the logic inputs (pi(w)) of the association elements (MUXw) for respective association with a bit in the input data word on the basis of the repetition pattern (incw(k)), where
the apparatus has Wmax association elements MUXw (w=0, 1, . . . , Wmax-1), and
the input data word has Lmax bits, the method comprising:
operating the apparatus in cycles k (k=0, 1, 2, . . . );
producing Wmax control signals (incw(k)) in each cycle k using the control and the first address generation unit;
producing a first address pdw(k) for each association element MUXw using the first address generation unit;
wherein a first initialization address pdini(k) is used to initialize the cycle k, the first addresses pdw(k) being calculated on the basis of the following recursive rules:
pd0(k)=pdini(k) \u2003\u2003(1)

pdw(k)=(pdw-1(k)+incw-1(k)) mod Lmax \u2003\u2003(2)

pdini(k+1)=(pdWmax-1(k)+incWmax-1(k)) mod Lmax \u2003\u2003(3)

pdini(0)=0 \u2003\u2003(4)

where incw(k)=0 indicates that the bit applied to the input of the association element MUXw needs to be punctured or repeated, and incw(k)=1 indicates that the bit applied to the input of the association element MUXw does not need to be punctured and does not need to be repeated, and where puncturing the bit applied to the input of the association element MUXw involves the logic output (po(w)) of the association element MUXw being disabled.
9. The method as claimed in claim 8, wherein the second address generation unit produces a second address psw(k) in each cycle k for each association element MUXw;
wherein a second initialization address psini(k) is used to initialize the cycle k; and
wherein the second addresses psw(k) are calculated on the basis of the following recursive rules:
ps0(k)=psini(k) \u2003\u2003(5)

psw(k)=(psw-1(k)+1) mod Lmax \u2003\u2003(6)

psini(k+1)=(psWmax-1(k)+1) mod Lmax \u2003\u2003(7)

psini(0)=0 \u2003\u2003(8).
10. The apparatus as claimed in claim 1, further comprising an input memory for buffer-storing at least one input data word, the input memory comprising a plurality of registers which are respectively designed to store a bit.
11. The apparatus as claimed in claim 10, further comprising a first rewriteable memory connected upstream of the input memory for storing input data blocks.
12. The apparatus as claimed in claim 1, further comprising an output memory for buffer-storing at least one output data word, the output memory comprising a plurality of registers which are respectively designed to store a bit.
13. The apparatus as claimed in claim 12, further comprising a second rewriteable memory connected downstream of the output memory for storing output data blocks.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A quality-of-service method for data storage, the method comprising:
prioritizing a plurality of requests for each of a plurality of workloads;
selectively forwarding the requests to a queue according to said prioritizing for maintaining the queue at a target queue depth, wherein completed requests are removed from the queue; and
adjusting the target queue depth in response to a latency statistic for the requests wherein the latency statistic is computed based on a measured difference between an arrival time and a completion time of a plurality of the requests.
2. The method according to claim 1, wherein said prioritizing comprises computing a target deadline for a request.
3. The method according to claim 2, further comprising forwarding any request having a past due target deadline to the queue.
4. The method according to claim 3, wherein said forwarding any request having a past due target deadline is performed even when a queue depth attained exceeds the target queue depth.
5. The method according to claim 2, further comprising monitoring an arrival time of the request.
6. The method according to claim 5, wherein the workload of the request has a target latency and wherein said computing the target deadline for the request comprises combining the target latency of the workload with the arrival time of the request.
7. The method according to claim 6, further comprising monitoring requests of the workload during a time interval for determining a rate of requests for the workload.
8. The method according to claim 7, further comprising adjusting the target latency based on the request rate.
9. The method according to claim 1, wherein the requests are read and write requests directed to a storage device and wherein the queue comprises a device queue included in the storage device.
10. The method according to claim 9, further comprising assigning the requests of each workload to a corresponding input queue prior to said forwarding to the device queue.
11. The method according to claim 9, wherein the device queue has an attained queue depth as of result of said selectively forwarding and further comprising increasing the target queue depth value when the attained queue depth is limited by the target queue depth.
12. The method according to claim 11, wherein said increasing the target queue depth increases the target queue depth by a predetermined multiplier.
13. The method according to claim 1, wherein the computed latency statistic is for a workload having a target latency and wherein said adjusting the target queue depth comprises reducing the target queue depth when the target latency for the workload is less than the computed latency statistic.
14. The method according to claim 13, wherein the target queue depth is reduced proportionally based on comparative values of the target latency and the computed latency statistic.
15. The method according to claim 1, wherein the computed latency statistic is for a workload having a target latency and wherein each workload has a target latency and a computed latency statistic and wherein said adjusting the target queue depth value comprises increasing the target queue depth when each target latency is greater than each computed latency statistic.
16. The method according to claim 1, wherein the latency statistic is computed for each of the plurality of workloads.
17. The method according to claim 16, wherein said adjusting is performed to maintain the computed latency for each workload within the allowable latency statistic for the workload.
18. The method according to claim 17, wherein the target latency statistic is specified by a function such that the target latency for each workload changes depending upon changing characteristics of the workload.
19. A quality-of-service method for data storage comprising:
receiving a function that specifies an allowable latency statistic for each of a plurality of workloads, the allowable latency statistic specified by the function for each workload changing depending upon changing characteristics of the workload, each workload including a plurality of requests; and
scheduling and forwarding the requests to a data storage device for substantially maintaining a monitored latency statistic within the allowable latency statistic for each workload, wherein said forwarding is performed for maintaining a target queue depth at the data storage device.
20. The method according to claim 19, wherein said scheduling comprises prioritizing the requests according to a target deadline for each request.
21. The method according to claim 19, further comprising reducing the target queue depth when the allowable latency statistic for the workload is less than the monitored latency statistic.
22. The method according to claim 19, further comprising increasing the target queue depth when each allowable latency statistic is greater than each monitored latency statistic.
23. A quality-of-service apparatus for a storage system comprising:
a plurality of input queues for receiving requests from a plurality of workloads, wherein each workload is assigned to a corresponding one of the input queues and wherein requests in each input queue are prioritized;
a monitor for measuring a performance statistic for requests of each workload;
a scheduler for selectively forwarding the requests from the input queues to a storage device queue, wherein the scheduler selects a highest priority one of the requests for forwarding to the storage device queue according to a target depth of the storage device queue; and
a controller for adjusting the target depth of the storage device queue according to the performance statistic for the requests of each workload.
24. The apparatus according to claim 23, wherein the requests in each queue are prioritized according to a target deadline assigned to each request.
25. The apparatus according to claim 24, wherein the target deadline for each request is determined from a time of arrival of the request and a target latency for the workload of the request.
26. The apparatus according to claim 24, wherein the monitor monitors a rate of requests for each workload for adjusting the target latency for each workload.
27. The apparatus according to claim 23, wherein the performance statistic for requests of each workload comprises a latency statistic.
28. The apparatus according to claim 27, wherein the controller reduces the target depth when the target latency for each workload is less than the latency statistic for any workload.
29. The apparatus according to claim 28, wherein the target depth is reduced proportionally based on comparative values of the target latency and the latency statistic for the workloads.
30. The apparatus according to claim 27, wherein the controller increases the target depth when each target latency for each workload is greater than the corresponding latency statistic.
31. The apparatus according to claim 27, wherein the device queue has an attained queue depth and wherein the controller increases the target queue depth value when the attained queue depth is limited by the target depth.
32. The apparatus according to claim 31, wherein the target depth is increased by a predetermined multiplier.
33. The apparatus according to claim 31, wherein each workload has one or more corresponding data stores and further comprising a capacity planner for assigning the stores to storage locations.
34. The apparatus according to claim 27, wherein the controller adjusts the target depth of the storage device queue according to the following:
E
=
min
k

\u2062
latencyTarget
\u2061

(

W
k

)
L
\u2061

(

W
k

)
Q
new

=
\u2062
E
*

Q
old
if
\u2062
\u2062
E

<
1

,
(

1
+
\u025b

)

\u2062
\u2062

Q
old
else
\u2062
\u2062
if
\u2062
\u2062

Q
max
\u2265

Q
old
,
Q
old
otherwise
.
wherein Qnew is the adjusted target depth for the storage device queue, Qold is a prior target depth for the storage device queue, Qmax is a maximum depth the device queue attained in a prior predetermined period, L(Wk) is the latency statistic for a workload Wk, and \u03b5 is a predetermined multiplier.
35. The apparatus according to claim 23, wherein the performance statistic is a latency statistic computed for each of the plurality of workloads.
36. The apparatus according to claim 35, wherein the controller adjusts the target depth of the storage device queue to maintain the computed latency for each workload within the allowable latency statistic for the workload.
37. The apparatus according to claim 36, wherein the target latency statistic is specified by a function such that the target latency for each workload changes depending upon changing characteristics of the workload.
38. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps including prioritizing a plurality of requests for each of a plurality of storage system workloads, queuing the requests according to said prioritizing for maintaining a target queue depth, and adjusting the target queue depth in response to a latency statistic for the requests of each workload wherein the latency statistic is computed based on a measured difference between an arrival time and a completion time of the requests of each workload.
39. The program storage device according to claim 38, wherein said prioritizing is performed according to a target deadline assigned to each request determined from a time of arrival of the request and a target latency for the workload of the request.
40. The program storage device according to claim 39, wherein said method steps further include adjusting the target latency for each workload according to a rate of requests for each workload.

1. A machine-implemented method, comprising:
generating position data describing real-time positions of each of one or more billiard balls moving on a playing surface of a billiard table; and
displaying on the playing surface imagery that dynamically responds to the position data as the one or more billiard balls move on the playing surface.
2. The method of claim 1, wherein the generating comprises optically tracking the real-time positions of the one or more billiard balls on the playing surface during the displaying.
3. The method of claim 2, wherein the generating comprises capturing images comprising the playing surface, and detecting respective billiard ball regions corresponding to respective ones of the one or more billiard balls in the captured images.
4. The method of claim 3, wherein the detecting comprises generating respective gradient maps based on the captured images, and determining the respective billiard ball regions based on the gradient maps.
5. The method of claim 4, wherein the determining comprises blurring the gradient maps, thresholding the blurred gradient maps, and determining the respective billiard ball regions based on the blurred gradient maps.
6. The method of claim 5, wherein the determining comprises identifying blobs in the blurred gradient maps based on a connected components analysis of the blurred gradient maps, and classifying each of the blobs as blobs as either a billiard ball region or a non-billiard-ball region based on an evaluation of the blob.
7. The method of claim 3, wherein the generating comprises:
labeling each of the detected billiard ball regions in a first one of the captured images with a respective unique label; and
matching the labeled billiard ball regions to billiard ball regions in a second one of the captured images that was captured after the first captured image was captured.
8. The method of claim 1, further comprising determining real-time velocities of each of one or more billiard balls on the playing surface.
9. The method of claim 8, wherein the displaying comprises displaying imagery that depends on the determined real-time velocities of the one or more billiard balls.
10. The method of claim 8, further comprising predicting a respective future trajectory of each of one or more billiard balls on the playing surface based on the current respective position and the current respective velocity of the billiard ball, and the displaying comprises displaying imagery on the playing surface based on the respective future trajectory of each of one or more billiard balls on the playing surface.
11. The method of claim 1, further comprising detecting a cue stick, and wherein the displaying comprises changing one or more parameters influencing visual appearance of the displayed imagery on the playing surface in response to detection of the cue stick over the playing surface.
12. The method of claim 1, further comprising detecting one or more positions of a cue stick, and wherein the displaying comprises displaying imagery based on the one or more detected positions of the cue stick.
13. The method of claim 1, further comprising capturing images comprising the playing surface and determining whether a static arrangement of multiple of the billiard balls detected in one or more of the captured images matches a prescribed pattern.
14. The method of claim 13, wherein the ascertaining comprises determining whether the static arrangement of the billiard balls matches a prescribed pattern of racked balls, and wherein the displaying comprises displaying imagery on the billiard table in response to a determination that the static arrangement matches the prescribed pattern of racked balls.
15. The method of claim 1, further comprising capturing images comprising the playing surface and detecting a billiard ball rack in one or more of the captured images; and wherein the displaying comprises displaying imagery on the billiard table in response to a detection of the billiard ball rack.
16. The method of claim 1, further comprising capturing images comprising the playing surface, and automatically ascertaining a type of a billiards game being played on the billiard table based on an evaluation of one or more of the captured images.
17. The method of claim 16, further comprising detecting occurrence of an event relating to the ascertained type of billiards game based on analysis of one or more of the captured images; and wherein the displaying comprises selecting event-specific imagery associated with the detected event, and displaying the selected event-specific imagery on the billiard table in response to the detection of the event.
18. The method of claim 17, wherein the detecting comprises detecting an occurrence of a rule violation event corresponding to a failure of comply with a rule of the ascertained type of billiards game based on the analysis of one or more of the captured images; and wherein the displaying comprises selecting event-specific imagery associated with the detected rule violation event, and displaying the selected event-specific imagery on the billiard table in response to the detection of the event.
19. The method of claim 1, further comprising capturing images comprising the playing surface and detecting occurrence of an event relating to a start of a billiards game; and wherein the displaying comprises displaying on the billiard table imagery associated with a start of a billiards game.
20. The method of claim 1, further comprising capturing images comprising the playing surface, tracking a score of a billiards game being played based on analysis of the captured images, and displaying the tracked score of the billiards game on the billiard table.
21. The method of claim 1, further comprising determining whether one of the billiard balls has fallen into a pocket of the billiard table; and wherein, in response to a determination that the billiard ball has fallen in the pocket, the displaying comprises selecting event-specific imagery associated with an event of a billiard ball falling into a pocket and displaying the selected event-specific imagery on the billiard table.
22. The method of claim 21, wherein the determining comprises determining whether a cue ball has fallen into a pocket of the billiard table, and the displaying comprises displaying on the billiard table event-specific imagery associated with a scratch event.
23. The method of claim 22, wherein, in response to a determination that the cue ball has fallen into the pocket, the displaying comprises displaying on the billiard table event-specific imagery prompting removal of the cue ball from the pocket.
24. The method of claim 22, wherein, in response to a determination that the cue ball has fallen into the pocket, the displaying comprises displaying on the billiard table event-specific imagery demarcating a region on the playing surface where the cue ball should be placed.
25. The method of claim 21, further comprising capturing images comprising the playing surface; and wherein the determining comprises determining whether one of the billiard balls has fallen into a pocket of the billiard table based on an analysis of the captured images.
26. The method of claim 21, further comprising,
in each pocket of the billiard table, sensing a presence of a billiard ball and generating an associated signal indicating the presence of a billiard ball in response to a sensed presence of a billiard ball in the pocket; and
wherein the determining comprises determining whether one of the billiard balls has fallen into a pocket of the billiard table based on an analysis of the signal associated with the pocket.
27. The method of claim 1, further comprising determining whether one of the billiard balls has fallen into a pocket of the billiard table, and producing an audible sound in response to a determination that the billiard ball has fallen in the pocket.
28. The method of claim 1, wherein the displaying comprises, based on the position data, displaying one or more visible dynamic artifacts trailing at least one of the billiard balls moving on the playing surface.
29. The method of claim 1, wherein the displaying comprises, based on the position data, displaying on the playing surface imagery showing a scene and local disturbances to local regions of the scene near one or more of the billiard balls moving on the playing surface.
30. The method of claim 1, wherein the displaying comprises, based on the position data, displaying on the playing surface imagery showing a scene that is visible only in regions that are revealed near positions of one or more of the billiard balls on the playing surface.
31. The method of claim 1, wherein the displaying comprises, based on the position data, displaying one or more visible artifacts connecting respective pairs of billiard balls.
32. The method of claim 1, wherein the displaying comprises, based on the position data, displaying on the playing surface a visualization of a virtual billiards shot from a current state of a billiards game being played on the billiard table.
33. The method of claim 1, further comprising detecting a collision between two or more billiard balls based on the position data; and wherein the displaying comprises displaying imagery in response to detection of the collision.
34. The method of claim 1, further comprising determining when a billiard ball contacts a bumper of the billiard table; and wherein the displaying comprises displaying a visible special effect in association with the bumper in response to a determination that a billiard ball has contacted the bumper.
35. The method of claim 1, wherein the displaying comprises, based on the position data, displaying a respective illumination around each of at least one of the one or more billiard balls on the playing surface.
36. The method of claim 1, further comprising producing an audible sound based on the position data.
37. The method of claim 36, further comprising detecting a collision between two or more billiard balls based on the position data, and the producing comprises producing an audible sound in response to detection of the collision.
38. The method of claim 36, further comprising determining when a billiard ball contacts a bumper of the billiard table based on the position data, and the producing comprises producing an audible sound in response to a determination that the billiard ball has contacted the bumper.
39. The method of claim 1, further comprising:
based on the position data, detecting an end-of-game event associated with a completion of the billiard game being played on the billiard table; and
in response to the detection of the end-of-game event, displaying on the playing surface imagery relating to one or more advertisements.
40. The method of claim 1, further comprising:
based on the position data, detecting an end-of-shot event associated with an end of a shot taken on the billiard table; and
in response to the detection of the end-of-shot event, displaying on the playing surface imagery relating to one or more advertisements.
41. The method of claim 1, further comprising:
establishing a respective identity of each of one or more of the billiard balls;
detecting an event involving the one or more of the billiard balls whose identities have been established; and
in response to the detection of the events, producing near the billiard table a perceptible effect that depends on the established identity of each of the one or more billiard balls involved in the event.
42. The method of claim 41, wherein the detecting comprises detecting a start-of-game event based on the established identities of the one or more billiard balls, and in response to a detection of the start-of-game event the producing comprises producing an event-specific perceptible effect associated with a start of a billiards game.
43. The method of claim 41, wherein the detecting comprises detecting a scoring event based on the established identities of the one or more billiard balls, and in response to a detection of the scoring event the producing comprises producing an event-specific perceptible effect associated with a score of a billiards game.
44. The method of claim 41, wherein the detecting comprises detecting a billiard game rules violation event based on the established identities of the one or more billiard balls, and in response to a detection of the rules violation event the producing comprises producing an event-specific perceptible effect associated with a billiards game rules violation.
45. The method of claim 41, wherein the detecting comprises detecting an end-of-game event based on the established identities of the one or more billiard balls, and in response to a detection of the end-of-game event the producing comprises producing an event-specific perceptible effect associated with an end of a billiards game.
46. The method of claim 1, further comprising recording a video of a billiard ball shot being taken in a billiards game that is being played on the billiards table; and wherein the displaying comprises displaying on the playing surface imagery showing a replay of the billiard ball shot based on the recorded video.
47. The method of claim 1, further comprising recording a video of a billiards game that is being played on the billiards table; and wherein the displaying comprises based on the recorded video displaying on the playing surface imagery showing a replay of a sequence of billiard ball shots that were taken during the billiards game.
48. Apparatus, comprising:
a computer-readable medium storing computer-readable instructions; and
a data processor coupled to the computer-readable medium, operable to execute the instructions, and based at least in part on the execution of the instructions operable to perform operations comprising
generating position data describing real-time positions of each of one or more billiard balls moving on a playing surface of a billiard table, and
displaying on the playing surface imagery that dynamically responds to the position data as the one or more billiard balls move on the playing surface.
49. At least one computer-readable medium having computer-readable program code embodied therein, the computer-readable program code adapted to be executed by a computer to implement a method comprising:
generating position data describing real-time positions of each of one or more billiard balls moving on a playing surface of a billiard table; and
displaying on the playing surface imagery that dynamically responds to the position data as the one or more billiard balls move on the playing surface.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. Orthesis for reducing extension andor bending deficits of a first extremity relative to a second extremity which is hinged to the first extremity, with
a first rail (1) which can be attached to the first extremity,
a second rail (2) which can be attached to the second extremity,
a rail hinge (3) which hinges the first rail (1) and the second rail (2) to one another,
a spring force mechanism which acts between the first rail (1) and the second rail (2) in order to swivel the first rail (1) relative to the second rail (2),
a flexion stop (26) which can be locked relative to the second rail (2) for limiting the swivelling range in the flexion direction,
an extension stop (27) which can be locked relative to the second rail (2) for limiting the swivelling range in the extension direction, characterized in that
the flexion stop (26) is located on a flexion stop carrier disk (28) which can be turned around the swivelling axis (10) of the rail hinge (3),
the extension stop (27) is located on the extension stop carrier disk (29) which can be turned around the swivelling axis (10) of the rail hinge (3),
the flexion stop carrier disk (28) and extension stop carrier disk (29) are dynamically connected to a releasable locking means in order to block or enable the rotation of the flexion stop carrier disk (28) and extension stop carrier disk (29) around the swivelling axis (10),
there is a stop driver means (51) which is coupled torsionally strong to the first rail (1), which can turn together with it around the swivelling axis (10), and with which with the locking means released the flexion stop (26) can be moved by swivelling the first rail (1) as far as the desired limit of the flexion range and the extension stop (27) can be moved by swivelling the first rail (1) as far as the desired limit of the extension swivelling range, and
by locking the locking means the flexion stop (26) can be locked at the limit of the flexion swivelling range and the extension stop (27) can be locked at the limit of the extension swivelling range.
2. Orthesis as claimed in claim 1, wherein the stop driver means (51) which is coupled torsionally strong to the first rail (1) is also made as a swivelling range limitation means which at the limit of the flexion swivelling range strikes the flexion stop (26) and at the limit of the extension swivelling range strikes the extension stop (27).
3. Orthesis as claimed in claim 1 or 2, wherein the stop driver means (51) consists of at least one stop driver disk (52, 53) with a lengthwise slot (54, 55) which is routed in an arc shape around the swivelling axis (10) and into which the flexion stop (26) and extension stop (27) project.
4. Orthesis as claimed in one of the preceding claims, wherein there is a return spring (61) which engages the flexion stop carrier disk (28) and the extension stop carrier disk (29) in order to return the flexion stop (26) and extension stop (27) to their initial location when the locking means has been released.
5. Orthesis as claimed in one of the preceding claims, wherein the locking means consists of a clamping means which is held on the second rail (2), which extends over the flexion stop carrier disk (28) and the extension stop carrier disk (29), and which can be moved by a common clamp actuating means between the clamp position and the release position.
6. Orthesis as claimed in one of the preceding claims, wherein the clamp means feasibly consists of two clamping rings (30, 31) which extend over the flexion stop carrier disk (28) and the extension stop carrier disk (29) on their outer peripheral surface with narrow play and in the clamped position prevent rotation of the flexion stop carrier disk (28) and the extension stop carrier disk (29).