SLR 13 - coding sound and music Flashcards

1
Q

How does digital to analogue conversion work?

A
  • you use a digital to analogue converter
    the device reads a bit pattern representing an analogue signal
  • it outputs an alternating, analogue electrical current
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What’s the difference between analogue and digital data?

A

analogue is continuous (smooth curves) whereas whereas digital is discrete (sharp edges and vertical drops)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What can analogue sound waves do?

A

can take ay values and can change as frequently as required

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What can digital sound waves do?

A

must always take one of a specified range of values and can only change value at specified intervals

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How does analogue to digital conversion work?

A
  • sensors (temp sensors and microphone) output an analogue signal
  • Computers use ADCs convert them
  • the device samples the analogue signal at regular intervals
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is frequency?

A
  • given in Hertz
  • it determines the number samples taken per second
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does a larger number of frequencies mean?

A

Better reproduction of an analogue signal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How do computers represent sound?

A

as a sequence of samples, each taking a discrete digital value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is sampling rate and what is it measured in?

A

the number of samples per second (hertz)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is sample resolution?

A

the number of bits allocated to each sample

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A higher sample resolution means…

A

greater audio quality and increased file size

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is Nyquist’s theorem?

A

the sampling rate of a digital audio file must be at least twice the frequency of the sound so that the sound may be accurately represented

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does MIDI stand for?

A

Musical Instrument Digital Interface

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is MIDI used with?

A

electronic musical instruments which can be connected to computers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What does MIDI store instead of sound samples?

A

a series of event messages, each representing an event in a piece of music

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What information could event messages contain?

A
  • the duration of a note
  • the instrument with which the note is played
  • the volume of the note
  • if a note should be sustained
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Ads of MIDI?

A
  • allows for easy manipulation of music without a loss of quality
  • the duration of notes can be changed and they can be transposed
  • MIDI have smaller file sizes and lossless (no info lost)
17
Q

Disads of MIDI?

A

MIDI can’t be used for storing speech and sometimes results in a less realistic sound

18
Q

What are the two types of compression?

A

lossy and lossless

19
Q

What is lossy compression?

A

some information is lost to reduce the file size
could be by reducing the resolution or lowering sample resolution in an audio file

20
Q

What is lossless compression?

A

there is no loss of information when using lossless compression
reduces file size without reducing quality

21
Q

What are two types of lossless compression?

A
  • run length encoding
  • dictionary-based methods
22
Q

What is RLE (run length encoding)

A

reduces the size of the file by removing repeated information and replacing it with one occurrence of the repeated info followed by the number of times it is to be repeated

23
Q

What is dictionary based lossless compression?

A

a dictionary containing repeated data is appended to a file

24
Q

How does dictionary based lossless compression effect file size?

A
  • should result in a significant reduction to file size
  • but the dictionary used to compress the data has to be present in the file, which will increase the file size
25
Q

What is encryption?

A

the process of scrambling data so that it cannot be understood if intercepted to keep it secure during transmission

26
Q

What is unencrypted information known as ?

A

plaintext

27
Q

What is encrypted information known as ?

A

ciphertext

28
Q

What is a cipher?

A

A type of encryption method

29
Q

How would you decrypt ciphertext?

A
  • the encryption method
  • the key
30
Q

How do Caesar ciphers encrypt information?

A
  • by replacing characters
  • one character is always replaced by the same character
31
Q

What are the two types of cipher?

A
  • shift cipher
  • substitution cipher
32
Q

How do shift ciphers work?

A

All the letters in the alphabet are shifted by the same amount

33
Q

How do substitution ciphers work?

A

the letters are randomly replaced

34
Q

Cons of a Caesar cipher:

A
  • Caesar ciphers are easily cracked
  • once you discover one character the shift cipher can be completely cracked and a key found
35
Q

What is a vernam cipher?

A

An example of a one-time pad cipher - each key should only ever be used once

36
Q

What are two requirements of the Vernam Cipher?

A
  • random
    -at least as long as the plaintext that is to be encrypted
37
Q

How does a Vernam cipher work?

A
  1. aligning the characters o the plaintext and then the key
    2.Converting each character to binary (using an information coding system)
  2. Apply a logical OR when
    Converting the rest back to a character
38
Q

When do Vernam ciphers offer perfect security?

A
  1. the encryption key is qual to or longer than the plain text message
  2. the key is truly random
  3. the key is used only once and then destroyed
39
Q

What makes a scheme computationally secure?

A

if it cannot be cracked in a reasonable time