Fresh Breeze Respect

The Fresh Breeze Respect is a family of German paramotors that was designed and produced by Fresh Breeze of Wedemark for powered paragliding. Now out of production, when it was available the aircraft was supplied complete and ready-to-fly.[1]

Respect
Role Paramotor
National origin Germany
Manufacturer Fresh Breeze
Introduction mid-2000s
Status Production completed
Unit cost
€3,624 (Respect 122, 2004)

Design and development

The Respect was designed to comply with the US FAR 103 Ultralight Vehicles rules as well as European regulations. It features a paraglider-style wing, single-place accommodation and a single 17 hp (13 kW) Solo 210 or 28 hp (21 kW) Hirth F33 engine, depending on the model in pusher configuration with a reduction drive and a 122 cm (48 in) diameter two-bladed composite propeller. The fuel tank capacity is 10 litres (2.2 imp gal; 2.6 US gal). The aircraft propeller cage can be folded into four parts and the aircraft rigged with low or high hang points.[1]

As is the case with all paramotors, take-off and landing is accomplished by foot. Inflight steering is accomplished via handles that actuate the canopy brakes, creating roll and yaw.[1]

Variants
Respect 122
Model with a 17 hp (13 kW) Solo 210 engine with a 2.57:1 ratio reduction drive and a 122 cm (48 in) diameter two-bladed composite propeller. Empty weight is 26 kg (57 lb).[1]
Respect Monster
Model with a 28 hp (21 kW) Hirth F33 engine with a 2.65:1 ratio reduction drive and a 122 cm (48 in) diameter two-bladed composite propeller. Empty weight is 28 kg (62 lb).[1]

Specifications (Respect Monster)

Data from Bertrand[1]

General characteristics

  • Crew: one
  • Empty weight: 28 kg (62 lb)
  • Fuel capacity: 10 litres (2.2 imp gal; 2.6 US gal)
  • Powerplant: 1 × Hirth F33 single cylinder, two-stroke, air-cooled aircraft engine, with a 2.57:1 reduction drive, 21 kW (28 hp)
  • Propellers: 2-bladed composite, fixed pitch, 1.22 m (4 ft 0 in) diameter
gollark: ```python#!/bin/env python3chars = [chr(n) for n in range(126)]firstchar = chars[0]lastchar = chars[len(chars) - 1]def increment_char(character): return chr(ord(character) + 1)def old_increment_string(string_to_increment): reversed_string = list(reversed(string_to_increment)) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed(reversed_string)))def increment_string(to_increment): reversed_string = list(to_increment) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed_string))def string_generator(): length = 0 while 1: length += 1 string = chars[0] * length while True: try: string = increment_string(string) except IndexError: # Incrementing has gone out of the char array, move onto next length break yield string```
gollark: Except it enumerates all possible ASCII strings instead.
gollark: I made that!
gollark: no.
gollark: Check out my cool project!http://localhost:3030

References
  1. Bertrand, Noel; Rene Coulon; et al: World Directory of Leisure Aviation 2003-04, page 68. Pagefast Ltd, Lancaster UK, 2003. ISSN 1368-485X
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.