In order to have a complete algorithm here:
Given a character string as an input parameter
1.Validate that the character string contains only the numbers 1-9 or the letters A-F.
2.Calculate the binary value by iterating over each character,
and concatenating the corresponding binary value:
binary hexadecimal
0000 0
0001 1
0010 2
0011 3
0100 4
0101 5
0110 6
0111 7
1000 8
1001 9
1010 a
1011 b
1100 c
1101 d
1110 e
1111 f
For example, 1234 would be:
0001 0010 0011 0100
3.Using that value, set the bits of a memory location.
4.Address it as a raw datatype
5.Return it as the function return value
The resulting raw datatype will have the hex representation equivalent to the original string.
Given the input '1234' the function would return the raw datatype which would be displayed as the hex value x'1234'. Binary data is typically represented in HEX to make it easier to read and reference.
(This builds on Mark J. Bobak's answer, so I want to give credit to him, but I also wanted to post a complete procedure.)